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 Structural Two Dimensional Discrete Cosine Transform Algorithms
Jar-Ferr YANG Chih-Peng FAN
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1998/06/25
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Digital Signal Processing
discrete cosine transform, fast structural algorithm, digital signal processing,
Full Text: PDF(436.4KB)
>>Buy this Article
The matrix decomposition of transformation associated with the Kronecker product not only provides a thoughtful structure in hardware realization but also bestows a skillful tool for complexity evaluation. Hence, there are several fast algorithms developed to achieve efficient computation of two-dimensional (2-D) discrete cosine transform (DCT) with matrix decomposition techniques. However, we found that their derivations associated with their computation structures were not shown formally. In this paper, we propose formal derivations to remedy their deficiencies to achieve more structural 2-D DCT and inverse DCT (IDCT) algorithms. Furthermore, we also show that the remedied algorithms are with less computational complexity and more regular structure for realization.