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

[1]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[2]  Marshall C. Pease,et al.  An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.

[3]  Peter J. Nicholson,et al.  Algebraic Theory of Finite Fourier Transforms , 1971, Journal of computer and system sciences (Print).

[4]  Richard M. Karp.  Complexity of Computation , 1974 .

[5]  Shmuel Winograd.  On computing the Discrete Fourier Transform. , 1976 .

[6]  Wen-Hsiung Chen,et al.  A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..

[7]  H. Nussbaumer,et al.  Fast computation of discrete Fourier transforms using polynomial transforms , 1979 .

[8]  Hideo Kitajima.  A Symmetric Cosine Transform , 1980, IEEE Transactions on Computers.

[9]  K. R. Rao,et al.  A Fast Computational Algorithm for the Discrete Sine Transform , 1980, IEEE Trans. Commun..

[10]  H. Nussbaumer.  New polynomial transform algorithms for multidimensional DFT's and convolutions , 1981 .

[11]  P. Yip,et al.  Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms , 1984 .

[12]  Zhongde Wang.  Fast algorithms for the discrete W transform and for the discrete Fourier transform , 1984 .

[13]  M. Vetterli,et al.  Simple FFT and DCT algorithms with reduced number of operations , 1984 .

[14]  S. Winograd,et al.  Abelian semi-simple algebras and algorithms for the Discrete Fourier Transform , 1984 .

[15]  B. Lee.  A new algorithm to compute the discrete cosine Transform , 1984 .

[16]  C. Sidney Burrus,et al.  On the structure of efficient DFT algorithms , 1985, IEEE Trans. Acoust. Speech Signal Process..

[17]  P. Yang,et al.  Prime factor decomposition of the discrete cosine transform and its hardware realization , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[18]  Hsieh Hou,et al.  A Fast Recursive Algorithm For Computing The Discrete Cosine Transform , 1986, Optics & Photonics.

[19]  C. Sidney Burrus,et al.  On the number of multiplications necessary to compute a length-2nDFT , 1986, IEEE Trans. Acoust. Speech Signal Process..

[20]  Y. Morikawa,et al.  A fast algorithm for the cosine transform based on successive order reduction of the chebyshev polynomial , 1986 .

[21]  Hsieh S. Hou.  A fast recursive algorithm for computing the discrete cosine transform , 1987, IEEE Trans. Acoust. Speech Signal Process..

[22]  M. Heideman.  Multiplicative Complexity of Discrete Fourier Transform , 1988 .

[23]  P. Yip,et al.  The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms , 1988 .

[24]  R. Tolimieri,et al.  Algorithms for Discrete Fourier Transform and Convolution , 1989 .

[25]  Zhongde Wang.  Fast discrete sine transform algorithms , 1990 .

[26]  R. W. Johnson,et al.  A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures , 1990 .

[27]  D. Rockmore.  Fast Fourier analysis for abelian group extensions , 1990 .

[28]  S. C. Chan,et al.  Direct methods for computing discrete sinusoidal transforms , 1990 .

[29]  G. Steidl,et al.  A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transforms , 1991 .

[30]  Weiping Li,et al.  A new algorithm to compute the DCT and its inverse , 1991, IEEE Trans. Signal Process..

[31]  Zhongde Wang,et al.  Pruning the fast discrete cosine transform , 1991, IEEE Trans. Commun..

[32]  Ephraim Feig,et al.  Fast algorithms for the discrete cosine transform , 1992, IEEE Trans. Signal Process..

[33]  Michael T. Heideman,et al.  Computation of an odd-length DCT from a real-valued DFT of the same length , 1992, IEEE Trans. Signal Process..

[34]  Michael B. Monagan.  The Maple Computer Algebra System , 1993, Comput. Sci. J. Moldova.

[35]  Wan-Chi Siu,et al.  Mixed-radix discrete cosine transform , 1993, IEEE Trans. Signal Process..

[36]  Maurice F. Aburdene,et al.  Unification of Legendre, Laguerre, Hermite, and binomial discrete transforms using Pascal's matrix , 1994, Multidimens. Syst. Signal Process..

[37]  D. Rockmore,et al.  Generalized FFT's- A survey of some recent results , 1996, Groups and Computation.

[38]  Jaakko Astola,et al.  Architecture-oriented regular algorithms for discrete sine and cosine transforms , 1996, Electronic Imaging.

[39]  Alexander Shen,et al.  Algorithms and Programming , 1996 .

[40]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[41]  Guoan Bi,et al.  DCT algorithms for composite sequence lengths , 1998, IEEE Trans. Signal Process..

[42]  Paul S. Wang,et al.  Factorization of Chebyshev Polynomials , 1998 .

[43]  Steven G. Johnson,et al.  FFTW: an adaptive software architecture for the FFT , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[44]  Vladimir Britanak,et al.  The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation , 1999, Signal Process..

[45]  David Akopian,et al.  Constant geometry algorithm for discrete cosine transform , 2000, IEEE Trans. Signal Process..

[46]  Markus Püschel,et al.  Automatic generation of fast discrete signal transforms , 2001, IEEE Trans. Signal Process..

[47]  Markus Püschel,et al.  Decomposing Monomial Representations of Solvable Groups , 2002, J. Symb. Comput..

[48]  Franz Franchetti,et al.  A SIMD vectorizing compiler for digital signal processing algorithms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[49]  José M. F. Moura,et al.  The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms , 2003, SIAM J. Comput..

[50]  Markus Püschel,et al.  Cooley-Tukey FFT like algorithms for the DCT , 2003, ICASSP.

[51]  M. Anshelevich,et al.  Introduction to orthogonal polynomials , 2003 .

[52]  M. Puschel.  Cooley-Tukey FFT like algorithms for the DCT , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[53]  M. Puschel,et al.  The discrete triangle transform , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[54]  Franz Franchetti,et al.  SPIRAL: Code Generation for DSP Transforms , 2005, Proceedings of the IEEE.

[55]  Gabriele Steidl,et al.  Fast radix-p discrete cosine transform , 1992, Applicable Algebra in Engineering, Communication and Computing.

[56]  Steven G. Johnson,et al.  A modified split-radix FFT with reduced arithmetic complexity , 2005 .

[57]  Martin Rötteler,et al.  Fourier transform for the spatial quincunx lattice , 2005, ICIP.

[58]  Franz Franchetti,et al.  Formal loop merging for signal transforms , 2005, PLDI '05.

[59]  J. Dicapua.  Chebyshev Polynomials , 2019, Fibonacci and Lucas Numbers With Applications.

[60]  Martin Rötteler,et al.  Fourier transform for the directed quincunx lattice , 2005, ICASSP.

[61]  Rene F. Swarttouw,et al.  Orthogonal polynomials , 2020, NIST Handbook of Mathematical Functions.

[62]  Steven G. Johnson,et al.  The Design and Implementation of FFTW3 , 2005, Proceedings of the IEEE.

[63]  Markus Püschel,et al.  Algebraic Derivation of General Radix Cooley-Tukey Algorithms for the Real Discrete Fourier Transform , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[64]  M. Puschel,et al.  FFT Program Generation for Shared Memory: SMP and Multicore , 2006, ACM/IEEE SC 2006 Conference (SC'06).

[65]  José M. F. Moura,et al.  Algebraic Signal Processing Theory , 2006, ArXiv.

[66]  Martin Rötteler,et al.  Algebraic Signal Processing Theory: 2-D Spatial Hexagonal Lattice , 2007, IEEE Trans. Image Process..

[67]  Markus Püschel,et al.  Algebraic Signal Processing Theory: Foundation and 1-D Time , 2008, IEEE Transactions on Signal Processing.

[68]  Martin Rötteler,et al.  Algebraic signal processing theory: Cooley–Tukey type algorithms on the 2-D hexagonal spatial lattice , 2008, Applicable Algebra in Engineering, Communication and Computing.

[69]  José M. F. Moura,et al.  Algebraic Signal Processing Theory: 1-D Space , 2008, IEEE Transactions on Signal Processing.

[70]  Steven G. Johnson,et al.  Type-II/III DCT/DST algorithms with reduced number of arithmetic operations , 2007, Signal Process..

[71]  P. Yip,et al.  THE DECIMATION-IN-FREQUENCY ALGORITHMS FOR A FAMILY OF DISCRETE SINE AND COSINE TRANSFORMS* , .