Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs
Puschel, M.
Moura, J.M.F.
Carnegie Mellon Univ., Pittsburgh;
This paper appears in: Signal Processing, IEEE Transactions on
Publication Date: April 2008
Volume: 56,
Issue: 4
On page(s): 1502-1521
ISSN: 1053-587X
INSPEC Accession Number: 9918754
Digital Object Identifier: 10.1109/TSP.2007.907919
Current Version Published: 2008-03-14
Abstract
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
