Fast PU Skip and Split Termination Algorithm for HEVC Intra Prediction

Kyungmin Lim, Jaeho Lee, Seongwan Kim, Sangyoun Lee

Research output: Contribution to journalArticlepeer-review

76 Citations (Scopus)


High Efficiency Video Coding (HEVC) is developed for next-generation video coding, which achieves significant improvements in coding efficiency compared with H.264/Advanced Video Coding by adopting various tools including a quadtree-based block partitioning structure. However, this causes high encoding complexity for exhaustive rate-distortion (RD) cost computation of the extended prediction unit (PU) searching. In this paper, a fast PU skip and split termination algorithm is proposed. The proposed method consists of three algorithms: 1) early skip; 2) PU skip; and 3) PU split termination. The early skip algorithm allows immediate skipping of the RD cost computation for large PUs according to the neighboring PUs. Based on Bayes's rule, the PU skip algorithm allows skipping of the full RD cost computation, and the split termination algorithm terminates further PU splitting using the RD cost of rough mode decision (RMD). The decision parameter for the PU skip and the split termination is presented as the ratio of the RMD RD costs between the current PU and the spatially adjacent or upper depth PU. The simulation results show that the proposed algorithm achieves a saving of 53.52% encoding time while maintaining almost the same RD performances as the HEVC reference software.

Original languageEnglish
Article number6983560
Pages (from-to)1335-1346
Number of pages12
JournalIEEE Transactions on Circuits and Systems for Video Technology
Issue number8
Publication statusPublished - 2015 Aug 1

Bibliographical note

Publisher Copyright:
© 1991-2012 IEEE.

All Science Journal Classification (ASJC) codes

  • Media Technology
  • Electrical and Electronic Engineering


Dive into the research topics of 'Fast PU Skip and Split Termination Algorithm for HEVC Intra Prediction'. Together they form a unique fingerprint.

Cite this