Algebraic signal processing theory: Cooley-Tukey type algorithms for DCTs and DSTs

IEEE Transactions on Signal Processing

Volumn 56, Issue 4, 2008, Pages 1502-1521

  Puschel D ^a   Moura, José M F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Chinese remainder theorem; Discrete cosine transform (DCT); Discrete Fourier transform (DFT); Discrete sine transform (DST); Fast Fourier transform (FFT); Polynomial algebra; Representation theory

Indexed keywords

ALGORITHMS; DISCRETE FOURIER TRANSFORMS; MATRIX ALGEBRA; POLYNOMIALS;

CHINESE REMAINDER THEOREM; DISCRETE SINE TRANSFORM; REPRESENTATION THEORY;

DISCRETE COSINE TRANSFORMS;

EID: 41849146783     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2007.907919     Document Type: Article

References (56)

1. M. Frigo and S. G. Johnson, "FFTW: An adaptive software architecture for the FFT," in Proc. Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), 1998, vol. 3, pp. 1381-1384.
2. M. Frigo and S. G. Johnson, "The design and implementation of FFTW3," Proc. IEEE (Special Issue on Program Generation, Optimization, and Adaptation), vol. 93, no. 2, pp. 216-231, Feb, 2005.
3. M. Püschel, J. M. F. Moura, J. Johnson, D. Padua, M. Veloso, B. W. Singer, J. Xiong, F. Franchetti, A. Gačić, Y. Voronenko, K. Chen, R. W. Johnson, and N. Rizzolo, "SPIRAL: Code generation for DSP transforms," Proc. IEEE (Special Issue on Program Generation, Optimization, and Adaptation), vol. 93, no. 2, pp. 232-275, Feb. 2005.
4. F. Franchetti and M. Püschel, "A SIMD vectorizing compiler for digital signal processing algorithms," in Proc. Int. Parallel Distributed Processing Symp. (IPDPS), 2002, pp. 20-26.
5. F. Franchetti, Y. Voronenko, and M. Püschel, "FFT program generation for shared memory: SMP and multicore," in Proc. Supercomputing (SC) New York, 2006, ACM.
6. M. Püschel and J. M. F. Moura, "Algebraic signal processing theory: Foundation and 1-D time," IEEE Trans. Signal Process., accepted for publication.
7. M. Püschel and J. M. F. Moura, "Algebraic signal processing theory: 1-D space," in IEEE Trans. Signal Process., accepted for publication.
8. M. Püschel and J. M. F. Moura, "Algebraic signal processing theory," in [Online]. Available: http://arxiv.org/abs/cs.IT/0612077
9. M. Püschel and J. M. F. Moura, "The algebraic approach to the discrete cosine and sine transforms and their fast algorithms," SIAM J. Comput., vol. 32, no. 5, pp. 1280-1316, 2003.
10. M. Püschel, "Cooley-Tukey FFT like algorithms for the DCT," in Proc. Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), 2003, vol. 2, pp. 501-504.
11. Y. Voronenko and M. Püschel, "Algebraic derivation of general radix Cooley-Tukey algorithms for the real discrete Fourier transform," in Proc. Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), 2006, vol. 3, pp. 876-879.
12. M. Püschel and M. Rötteler, "Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice," Applicable Algebra in Engineering, Communication and Computing (Special Issue in the Memory of Thomas Beth), to be published.
13. M. Püschel and M. Rötteler, "Algebraic signal processing theory: 2-D hexagonal spatial lattice," IEEE Trans. Image Process., vol. 16, no. 6, pp. 1506-1521, 2007.
14. W. H. Chen, C. H. Smith, and S. C. Fralick, "A fast computational algorithm for the discrete cosine transform," IEEE Trans. Commun. vol. COM-25, no. 9, pp. 1004-1009, Sep. 1977.
15. P. P. N. Yang and M. J. Narasimha, "Prime factor decomposition of the discrete cosine transform," in Proc. Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), 1985, pp. 772-775.
16. [i#n algorithms suitable for VLSI implementations," in Proc. Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), 1987, pp. 1805-1808.
17. M. Püschel and J. M. F. Moura, "Algebraic signal processing theory: Cooley-Tukey type algorithms for DCTs and DSTs," [Online]. Available: http://arxiv.org/abs/cs.IT/0702025
18. L. Auslander, E. Feig, and S. Winograd, "Abelian semi-simple algebras and algorithms for the discrete Fourier transform," Adv. Appl. Math. vol. 5, pp. 31-55, 1984.
19. P. J. Nicholson, "Algebraic theory of finite Fourier transforms," J. Comput. Syst. Sci., vol. 5, no. 5, pp. 524-547, 1971.
20. T. Beth, Verfahren der Schnellen Fouriertransformation Transl.: Methods for the Fast Fourier Transform. Wiesbaden, Germany: Teubner, 1984.
21. S. Winograd, "On the multiplicative complexity of the discrete Fourier transform," Adv. Math., vol. 32, pp. 83-117, 1979.
22. L. Auslander, E. Feig, and S. Winograd, "The multiplicative complexity of the discrete Fourier transform," Adv. Appl. Math., vol. 5, pp. 87-109, 1984.
23. H. W. Johnson and C. S. Burrus, "On the structure of efficient DFT algorithms," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-33, no. 1, pp. 248-254, Feb. 1985.
24. [i#n DFT," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-34, no. 1, pp. 91-95, Feb. 1986.
25. H. J. Nussbaumer, Fast Fourier Transformation and Convolution Algorithms, 2nd ed. New York: Springer, 1982.
26. R. Tolimieri, M. An, and C. Lu, Algorithms for Discrete Fourier Transforms and Convolution, 2nd ed. New York: Springer, 1997.
27. G. Steidl and M. Tasche, "A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transforms," Math. Comput. vol. 56, no. 193, pp. 281-296, 1991.
28. G. Steidl, "Fast radix-p discrete cosine transform," Applicable Alg. Eng., Commun. Comput., vol. 3, no. 1, pp. 39-46, 1992.
29. Z. Wang and B. R. Hunt, "The discrete W transform," Appl. Math. Comput., vol. 16, pp. 19-48, 1985.
30. V. Britanak and K. R. Rao, "The fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation," Signal Process., vol. 79, pp. 135-150, 1999.
31. C. Van Loan, Computational Framework of the Fast Fourier Transform Philadelphia, PA: SIAM, 1992.
32. D. Rockmore, "Fast Fourier analysis for Abelian group extensions," Adv. Appl. Math., vol. 11, pp. 164-204, 1990.
33. D. Maslen and D. Rockmore, "Generalized FFTs - a survey of some recent results," in Proc. IMACS Workshop Groups Computation, 1995, vol. 28, pp. 182-238.
34. S. Egner and M. Püschel, "Automatic generation of fast discrete signal transforms," IEEE Trans. Signal Process., vol. 49, no. 9, pp. 1992-2002, Sep. 2001.
35. M. Püschel, "Decomposing monomial representations of solvable groups," J. Symb. Comput., vol. 34, no. 6, pp. 561-596, 2002.
36. M. Püschel and M. Rötteler, "Cooley-Tukey FFT like fast algorithms for the discrete triangle transform," in Proc. 11th IEEE DSP Workshop, 2004, pp. 158-162.
37. M. Püschel and M. Rötteler, "The discrete triangle transform," in Proc. Int. Conf. Acoustics, Speech, Signal Processing (ICASSP), 2004, vol. 3, pp. 45-48.
38. H. Kitajima, "A symmetric cosine transform," IEEE Trans. Comput. vol. C-29, no. 4, pp. 317-323, Apr. 1980.
39. P. Yip and K. R. Rao, "A fast computational algorithm for the discrete sine transform," IEEE Trans. Commun., vol. COM-28, no. 2, pp. 304-307, Feb. 1980.
40. Z. Wang, "Fast algorithms for the discrete W transform and for the discrete Fourier transform," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-32, no. 4, pp. 803-816, Aug. 1984.
41. P. Yip and K. R. Rao, "Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms," Circuits, Syst., Signal Process., vol. 3, no. 4, pp. 387-408, 1984.
42. P. Yip and K. R. Rao, "The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms," Circuits, Syst., Signal Process., vol. 7, no. 1, pp. 3-19, 1988.
43. S. C. Chan and K. L. Ho, "Direct methods for computing discrete sinusoidal transforms," in Proc. Inst. Elect. Eng., 1990, vol. 137, no. 6, pp. 433-442.
44. M. O. Rayes, V. Trevisan, and P. S. Wang, "Factorization of Chebyshev polynomials," Kent State University. Kent, OH, 1998, Tech. Rep. ICM-199802-0001.
45. G. Szegö, Orthogonal Polynomials, 4th ed. Providence, RI: Amer. Math. Soc. Colloq. Publ., 1992.
46. M. T. Heideman, "Computation of an odd-length DCT from a real-valued DFT of the same length," IEEE Trans. Signal Process., vol. 40, no. 1, pp. 54-61, Jan. 1992.
47. Z. Wang, "Pruning the fast discrete cosine transform," IEEE Trans. Commun., vol. 39, no. 5, pp. 640-643, May 1991.
48. X. Shao and S. Johnson, "Type-II/II DCT/DST algorithms with reduced number of arithmetic operations," submitted for publication.
49. Y. Morikawa, H. Hamada, and N. Yamane, "A fast algorithm for the cosine transform based on successive order reduction of the Chebyshev polynomial," Electron. Commun. Jpn., Pt. 1, vol. 69, no. 3, pp. 173-180, 1986.
50. H. S. Hou, "A fast recursive algorithm for computing the discrete cosine transform," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-35, no. 10, pp. 1455-1461, Oct. 1987.
51. Y. H. Chan and W. C. Siu, "Mixed-radix discrete cosine transform," IEEE Trans. Signal Process., vol. 41, no. 11, pp. 3157-3161, Nov. 1993.
52. G. Bi and L. W. Yu, "DCT algorithms for composite sequence lengths," IEEE Trans. Signal Process., vol. 46, no. 3, pp. 554-562, Mar. 1998.
53. Z. Wang, "Fast discrete sine transform algorithms," Signal Process. vol. 19, pp. 91-102, 1990.
54. B. G. Lee, "A new algorithm to compute the discrete cosine transform," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-32, no. 6, pp. 1243-1245, Dec. 1984.
55. T. S. Chihara, An Introduction to Orthogonal Polynomials. New York: Gordon and Breach, 1978.
56. T. J. Rivlin, The Chebyshev Polynomials. New York: Wiley Interscience, 1974.