A Low Complexity Multiplierless Transform Coding for HEVC

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.

[1]  Zhigang Cao,et al.  New cost-effective VLSI implementation of a 2-D discrete cosine transform and its inverse , 2004, IEEE Transactions on Circuits and Systems for Video Technology.

[2]  King Ngi Ngan,et al.  2-D Order-16 Integer Transforms for HD Video Coding , 2009, IEEE Transactions on Circuits and Systems for Video Technology.

[3]  Wen-Hsiung Chen,et al.  A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..

[4]  N. Chabini,et al.  Low power and fast DCT architecture using multiplier-less method , 2011, 2011 Faible Tension Faible Consommation (FTFC).

[5]  Ankur Saxena,et al.  Mode dependent DCT/DST for intra prediction in block-based image/video coding , 2011, 2011 18th IEEE International Conference on Image Processing.

[6]  M. Grellert,et al.  Low cost and high throughput multiplierless design of a 16 point 1-D DCT of the new HEVC video coding standard , 2012, 2012 VIII Southern Conference on Programmable Logic.