One- and two-dimensional constant geometry fast cosine transformalgorithms and architectures

Authors:
J. Kwak;J. You
Affiliations:
Broadcasting Technol. Dept., Electron. & Telecommun. Res. Inst., Daejeon;-
Venue:
IEEE Transactions on Signal Processing
Year:
1999

Citing 0
Cited 4

Concurrent Error Detection in Fast Unitary Transform Algorithms

DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Discrete cosine and sine transforms: regular algorithms and pipeline architectures

Signal Processing
Stride Permutation Networks for Array Processors

Journal of VLSI Signal Processing Systems
A fast algorithm for the computation of 2-D forward and inverse MDCT

Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

This paper presents general radix one- and two-dimensional (1-D and 2-D) constant geometry fast cosine transform algorithms and architectures suitable for VLSI, owing to their regular structures. A constant geometry algorithm is obtained by shuffling the rows and columns of each decomposed DCT matrix that corresponds to a butterfly stage. The 1-D algorithm is derived, and then, it is extended to the 2-D case. Based on the derived algorithms, the architectures with a flexible degree of parallelism are discussed