Constant geometry algorithm for discrete cosine transform

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...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on signal processing Vol. 48; no. 6; pp. 1840 - 1843
Main Authors Takala, J., Akopian, D., Astola, J., Saarinen, J.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.06.2000
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Architecture
Arithmetic
Computational geometry
Computer architecture
Costs
Discrete cosine transform
Discrete cosine transforms
Discrete transforms
Flow graphs
Laboratories
Lower bounds
Multiplication
Signal processing
Signal processing algorithms
Topology
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/78.845951