z-logo
open-access-imgOpen Access
Reusable HEVC Design in 3D‐HEVC
Author(s) -
Heo Young Su,
Bang Gun,
Park Gwang Hoon
Publication year - 2016
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.16.2615.0019
Subject(s) - computer science , coding (social sciences) , codec , merge (version control) , reuse , computer engineering , computer hardware , parallel computing , statistics , mathematics , ecology , biology
This paper proposes a reusable design for the merging process used in three‐dimensional High Efficiency Video Coding (3D‐HEVC), which can significantly reduce the implementation complexity by eliminating duplicated module redundancies. The majority of inter‐prediction coding tools used in 3D‐HEVC are utilized through a merge mode, whose extended merging process is based on built‐in integration to completely wrap around the HEVC merging process. Consequently, the implementation complexity is unavoidably very high. To facilitate easy market implementation, the design of a legacy codec should be reused in an extended codec if possible. The proposed 3D‐HEVC merging process is divided into the base merging process of reusing HEVC modules and reprocessing process of refining the existing processes that have been newly introduced or modified for 3D‐HEVC. To create a reusable design, the causal and mutual dependencies between the newly added modules for 3D‐HEVC and the reused HEVC modules are eliminated, and the ineffective methods are simplified. In an application of the proposed reusable design, the duplicated reimplementation of HEVC modules, which account for 50.7 % of the 3D‐HEVC merging process, can be eliminated while maintaining the same coding efficiency. The proposed method has been adopted as a normative coding tool in the 3D‐HEVC international standard.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here