Architecture-oriented regular algorithms for discrete sine andcosine transforms

Authors:
J. Astola;D. Akopian
Affiliations:
Signal Process. Lab., Tampere Univ. of Technol.;-
Venue:
IEEE Transactions on Signal Processing
Year:
1999

Citing 0
Cited 8

Discrete cosine and sine transforms: regular algorithms and pipeline architectures

Signal Processing
Stride Permutation Networks for Array Processors

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

Signal Processing
Formal datapath representation and manipulation for implementing DSP transforms

Proceedings of the 45th annual Design Automation Conference
Permuting streaming data using RAMs

Journal of the ACM (JACM)
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

We propose fast algorithms for a class of trigonometric transforms. These algorithms have a unified structure and simple data exchange similar to the constant geometry Pease (1968) algorithm derived from the Cooley-Tukey (1965) FFT. We can easily extend many of the parallel FFT approaches for these algorithms. The idea of the method is to localize the nonregularities peculiar to fast algorithms for other trigonometric transforms into the nodes of the Cooley-Tukey FFT type computational graph. Only the basic operation in the nodes of the computational graph will be different for different transforms. Thus, a simple programmable processor element for executing the node functions can be the basis for parallel constructs