A hardware-oriented concurrent TZ search algorithm for High-Efficiency Video Coding

• Published in: EURASIP journal on advances in signal processing Vol. 2017; no. 1; pp. 1 - 17
• Main Authors: Doan, Nghia, Kim, Tae Sung, Rhee, Chae Eun, Lee, Hyuk-Jae
• Format: Journal Article
• Language: English
• Published: Cham Springer International Publishing 22.11.2017; Springer; Springer Nature B.V; SpringerOpen
• Subjects: Advanced motion vector prediction (AMVP); Algorithms; Coding; Coding standards; Complexity; Computation; Engineering; Hardware; High-Efficiency Video Coding (HEVC); Image coding; Integer motion estimation (IME); Motion simulation; Partitions; Quantum Information Technology; Search algorithms; Signal,Image and Speech Processing; Spintronics; TZ search algorithm; Video compression; TZ search algorithm; Integer motion estimation (IME); Advanced motion vector prediction (AMVP); High-Efficiency Video Coding (HEVC)
• ISSN: 1687-6180; 1687-6172; 1687-6180
• DOI: 10.1186/s13634-017-0513-9

High-Efficiency Video Coding (HEVC) is the latest video coding standard, in which the compression performance is double that of its predecessor, the H.264/AVC standard, while the video quality remains unchanged. In HEVC, the test zone (TZ) search algorithm is widely used for integer motion estimation because it effectively searches the good-quality motion vector with a relatively small amount of computation. However, the complex computation structure of the TZ search algorithm makes it difficult to implement it in the hardware. This paper proposes a new integer motion estimation algorithm which is designed for hardware execution by modifying the conventional TZ search to allow parallel motion estimations of all prediction unit (PU) partitions. The algorithm consists of the three phases of zonal, raster, and refinement searches. At the beginning of each phase, the algorithm obtains the search points required by the original TZ search for all PU partitions in a coding unit (CU). Then, all redundant search points are removed prior to the estimation of the motion costs, and the best search points are then selected for all PUs. Compared to the conventional TZ search algorithm, experimental results show that the proposed algorithm significantly decreases the Bjøntegaard Delta bitrate (BD-BR) by 0.84%, and it also reduces the computational complexity by 54.54%.