Constant geometry algorithm for discrete cosine transform

Authors:
J. Takala;D. Akopian;J. Astola;J. Saarinen
Affiliations:
Digital & Comput. Syst. Lab., Tampere Univ. of Technol.;-;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2000

Citing 0
Cited 8

Discrete cosine and sine transforms: regular algorithms and pipeline architectures

Signal Processing
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations

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

Signal Processing
Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

Signal Processing
Mapping of Discrete Cosine Transforms onto Distributed Hardware Architectures

Journal of Signal Processing Systems
Operand access in regular topology discrete trigonometric transforms

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Computer Generation of Hardware for Linear Digital Signal Processing Transforms

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Improvement of the Discrete Cosine Transform calculation by means of a recursive method

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	35.68

Visualization

Abstract

Modification to the architecture-oriented fast algorithm for discrete cosine transform of type II from Astola and Akopian (see ibid., vol.47, no.4, p.1109-24, April 1999) is presented, which results in a constant geometry algorithm with simplified parameterized node structure. Although the proposed algorithm does not reach the theoretical lower bound for the number of multiplications, the algorithm possesses the regular structure of the Cooley-Tukey FFT algorithms. Therefore, the FFT implementation principles can also be applied to the discrete cosine transform