Author(s)

Mohamed Nasr Haggag¹, Mohamed El-Sharkawy², Gamal Fahmy³, Maher Rizkalla¹

¹German University at Cairo New Cairo City, Cairo, Egypt.
²Egypt Japan University of Science and Technology Borg Al Arab, Alexandria, Egypt;.
³Electrical Engineering Dept., Assiut University, Egypt.

In this paper, efficient one-dimensional (1-D) fast integer transform algorithms of the DCT matrix for the H.265 stan-dard is proposed. Based on the symmetric property of the integer transform matrix and the matrix operations, which denote the row/column permutations and the matrix decompositions, along with using the dyadic symmetry modification on the standard matrix, the efficient fast 1-D integer transform algorithms are developed. Therefore, the computational complexities of the proposed fast integer transform are smaller than those of the direct method. In addition to computational complexity reduction one of the proposed algorithms provides transformation quality improvement, while the other provides more computational complexity reduction while maintaining almost the same transformation quality. With lower complexity and better transformation quality, the first proposed fast algorithm is suitable to accelerate the quality-demanding video coding computations. On the other hand, with the significant lower complexity, the second proposed fast algorithm is suitable to accelerate the video coding computations.

Fast Algorithm, HDTV, H.265, ICT, Order-16 Transform, Video Coding

Haggag, M. , El-Sharkawy, M. , Fahmy, G. and Rizkalla, M. (2010) Efficient Fast Multiplication Free Integer Transformation for the 1-D DCT of the H.265 Standard. Journal of Software Engineering and Applications, 3, 784-795. doi: 10.4236/jsea.2010.38091.