Conference paper
An efficient algorithm for computing two-dimensional discrete cosine transforms
1991., IEEE International Sympoisum on Circuits and Systems, pp.396-399
IEEE
IEEE International Sympoisum on Circuits and Systems (11/06/1991–14/06/1991)
1991
Abstract
A fast algorithm for computing the two-dimensional discrete cosine transform (2-D DCT) is proposed. In this algorithm the 2-D DCT is converted into a form of 2-D DFT (discrete Fourier transform) which is called the odd DFT. The odd DFT can be calculated by a DFT followed by post-multiplications. The DFT part of the odd DFT is calculated by the fast discrete Radon transform. The complexity of the proposed algorithm is comparable to that of the polynomial transform approach. This new algorithm produces a regular structure which makes it attractive for VLSI implementation. Furthermore, the computation can be performed in parallel
Details
- Title
- An efficient algorithm for computing two-dimensional discrete cosine transforms
- Authors/Creators
- N. Ta (Author/Creator) - The University of Western AustraliaY. Attikiouzel (Author/Creator) - The University of Western AustraliaG. Crebbin (Author/Creator) - The University of Western Australia
- Publication Details
- 1991., IEEE International Sympoisum on Circuits and Systems, pp.396-399
- Conference
- IEEE International Sympoisum on Circuits and Systems (11/06/1991–14/06/1991)
- Publisher
- IEEE
- Identifiers
- 991005544601407891
- Copyright
- © 1991 IEEE
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Conference paper
Metrics
143 File views/ downloads
121 Record Views