For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Fast Algorithm Designs for Low-Complexity 44 Discrete Cosine Transform
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/11/01
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Digital Signal Processing
discrete cosine transform, fast algorithm, digital signal processing,
Full Text: PDF(336.5KB)
>>Buy this Article
In the letter, the fast one-dimensional (1-D) and two-dimensional (2-D) algorithms for realizing low-complexity 44 discrete cosine transform (DCT) for H.264 applications are developed. Through applying matrix utilizations with Kronecker product and direct sum, the efficient fast 2-D 44 DCT algorithm can be developed from the proposed fast 1-D 44 DCT algorithm by matrix decompositions. The fast 1-D and 2-D low-complexity 44 DCT algorithms requires fewer multiplications and additions than other fast DCT algorithms. Owing to regular modularity, the proposed fast algorithms can achieve real-time H.264 video signal processing with VLSI implementation.