Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs

This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theory. This means that the algorithms are not derived by manipulating the entries of transform matrices, but by a stepwise decompositio...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on signal processing Ročník 56; číslo 4; s. 1502 - 1521
Hlavní autori: Puschel, M., Moura, J.M.F.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY IEEE 01.04.2008
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algebra
Application specific processors
Applied sciences
Chinese remainder theorem
discrete cosine transform (DCT)
Discrete cosine transforms
discrete Fourier transform (DFT)
Discrete Fourier transforms
discrete sine transform (DST)
Discrete transforms
Exact sciences and technology
fast Fourier transform (FFT)
Fast Fourier transforms
Filters
Fourier transforms
Information, signal and communications theory
Miscellaneous
polynomial algebra
Polynomials
representation theory
Signal processing
Signal processing algorithms
Telecommunications and information theory
Fast Fourier transformation
Chinese remainder theorem
Signal theory
Discrete Fourier transformation
discrete Fourier transform (DFT)
fast Fourier transform (FFT)
Discrete sine transform
discrete cosine transform (DCT)
discrete sine transform (DST)
Linear transformation
Signal processing
representation theory
Chinese
Fast algorithm
Discrete cosine transforms
polynomial algebra
ISSN:1053-587X, 1941-0476
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theory. This means that the algorithms are not derived by manipulating the entries of transform matrices, but by a stepwise decomposition of the associated signal models, or polynomial algebras. This decomposition is based on two generic methods or algebraic principles that generalize the well-known Cooley-Tukey fast Fourier transform (FFT) and make the algorithms' derivations concise and transparent. Application to the 16 discrete cosine and sine transforms yields a large class of fast general radix algorithms, many of which have not been found before.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2007.907919