Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for Real DFTs
Voronenko, Y.
Puschel, M.
Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA;
This paper appears in: Signal Processing, IEEE Transactions on
Publication Date: Jan. 2009
Volume: 57,
Issue: 1
On page(s): 205-222
ISSN: 1053-587X
INSPEC Accession Number: 10370410
Digital Object Identifier: 10.1109/TSP.2008.2006152
First Published: 2008-09-19
Current Version Published: 2009-01-06
Abstract
In this paper, we systematically derive a large class of fast general-radix algorithms for various types of real discrete Fourier transforms (real DFTs) including the discrete Hartley transform (DHT) based on the algebraic signal processing theory. This means that instead of manipulating the transform definition, we derive algorithms by manipulating the polynomial algebras underlying the transforms using one general method. The same method yields the well-known Cooley-Tukey fast Fourier transform (FFT) as well as general radix discrete cosine and sine transform algorithms. The algebraic approach makes the derivation concise, unifies and classifies many existing algorithms, yields new variants, enables structural optimization, and naturally produces a human-readable structural algorithm representation based on the Kronecker product formalism. We show, for the first time, that the general-radix Cooley-Tukey and the lesser known Bruun algorithms are instances of the same generic algorithm. Further, we show that this generic algorithm can be instantiated for all four types of the real DFT and the DHT.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
