Prediction complexity-based HEVC parallel processing for asymmetric multicores

Citations

WEB OF SCIENCE

6
Citations

SCOPUS

8

초록

This paper proposes a novel Tile allocation method considering the computational ability of asymmetric multicores as well as the computational complexity of each Tile. This paper measures the computational ability of asymmetric multicores in advance, and measures the computational complexity of each Tile by using the amount of HEVC prediction unit (PU) partitioning. The implemented system counts and sorts the amount of PU partitions of each Tile, and also allocates Tiles to asymmetric big.LITTLE cores according to their expected computational complexity. When experiments were conducted, the amount of PU partitioning and the computational complexity (decoding time) showed a close correlation, and average performance gains of decoding time with the proposed adaptive allocation were around 36 % with 12 Tiles, 28 % with 18 Tiles, and 31 % with 24 Tiles, respectively.

키워드

HEVC; Parallel processing; Asymmetric multicores; Prediction Complexity; VIDEO CODING HEVC; EFFICIENCY
제목
Prediction complexity-based HEVC parallel processing for asymmetric multicores
저자
Roh, Hyun-Joon; Han, Sung Won; Ryu, Eun-Seok
DOI
10.1007/s11042-017-4413-7
발행일
2017-12
유형
Article
저널명
Multimedia Systems
권
76
호
23
페이지
25271 ~ 25284