DocumentCode
2945479
Title
Modified Efficient Fast Multiplication-Free Integer Transformation for the 2-D DCT H.265 Standard
Author
Haggag, Mohamed N. ; El-Sharkawy, Mohamed ; Fahmy, Gamal
Author_Institution
German Univ. in Cairo, Cairo, Egypt
fYear
2011
fDate
29-31 March 2011
Firstpage
455
Lastpage
455
Abstract
In this paper, efficient one-dimensional (1-D) fast integer transform algorithms of the DCT matrix for the H.265 standard are 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.
Keywords
computational complexity; discrete cosine transforms; matrix decomposition; video coding; 2D DCT H.265 standard; computational complexity; dyadic symmetry modification; integer transform matrix; matrix decomposition; multiplication-free integer transformation; one-dimensional fast integer transform algorithm; Algorithm design and analysis; Computational complexity; Matrix decomposition; PSNR; Symmetric matrices; Transforms; H.265; two dimensional DCT;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference (DCC), 2011
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
978-1-61284-279-0
Type
conf
DOI
10.1109/DCC.2011.59
Filename
5749512
Link To Document