Constant geometry algorithm for discrete cosine transform

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on signal processing 2000-06, Vol.48 (6), p.1840-1843
Hauptverfasser: Takala, J., Akopian, D., Astola, J., Saarinen, J.
Format: Artikel
Sprache:eng
Schlagworte:
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-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1053-587X
1941-0476
DOI:10.1109/78.845951