A low complexity multiplierless transform coding for HEVC

  • Authors:

  • Chunxiao Fan;Fu Li;Guangming Shi;Leilei Zhou;Haizhou Yang

  • Affiliations:

  • Key Laboratory of Intelligent Perception and Image Understanding (Chinese Ministry of, Education), School of Electronic Engineering, Xidian University, Shaanxi, P.R. China;Key Laboratory of Intelligent Perception and Image Understanding (Chinese Ministry of, Education), School of Electronic Engineering, Xidian University, Shaanxi, P.R. China;Key Laboratory of Intelligent Perception and Image Understanding (Chinese Ministry of, Education), School of Electronic Engineering, Xidian University, Shaanxi, P.R. China;Key Laboratory of Intelligent Perception and Image Understanding (Chinese Ministry of, Education), School of Electronic Engineering, Xidian University, Shaanxi, P.R. China;Key Laboratory of Intelligent Perception and Image Understanding (Chinese Ministry of, Education), School of Electronic Engineering, Xidian University, Shaanxi, P.R. China

  • Venue:
  • PCM'12 Proceedings of the 13th Pacific-Rim conference on Advances in Multimedia Information Processing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Transform coding with multiple blocks results in high complexity of HEVC. Butterfly combined with multipliers method provides an efficient implementation. However, the matrix multiplication is inevitable based on this method. In this paper, matrices and element decomposition are proposed to decompose the multiplication matrices into orthogonal matrices and general matrices with smaller elements. The number of different elements in these matrices can be reduced after decomposing, so that the multiplications can be reduced. Further, the decomposed elements become smaller and much closer to power of 2, which means we can use shifting and adding to achieve the multiplications conveniently. The proposed method is suitable for the hardware implementation.