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.
[1]
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.
[2]
Wai-Kuen Cham.
Development of integer cosine transforms by the principle of dyadic symmetry
,
1989
.
[3]
W.-K..
Development of integer cosine transforms by the principle of dyadic symmetry
,
2004
.
[4]
Chih-Peng Fan,et al.
Efficient Low-Cost Sharing Design of Fast 1-D Inverse Integer Transform Algorithms for H.264/AVC and VC-1
,
2008,
IEEE Signal Processing Letters.
[5]
Chih-Peng Fan,et al.
Efficient Fast 1-D 8$\,\times\,$8 Inverse Integer Transform for VC-1 Application
,
2009,
IEEE Transactions on Circuits and Systems for Video Technology.
[6]
Hari Kalva,et al.
The VC-1 and H.264 Video Compression Standards for Broadband Video Services
,
2008
.