The algebraic approach to the discrete cosine and sine transforms and their fast algorithms

SIAM Journal on Computing

Volumn 32, Issue 5, 2003, Pages 1280-1316

  Püschel, Markus ^a   Moura, José M F ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Algebra representation; Chebyshev polynomial; Discrete cosine transform (DCT); Discrete Fourier transform (DFT); Discrete sine transform (DST); Discrete trigonometric transform (DTT); Fast algorithm; FFT; Group representation; Polynomial transform; Symmetry

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DIGITAL SIGNAL PROCESSING; DISCRETE FOURIER TRANSFORMS; FAST FOURIER TRANSFORMS; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING; VECTORS;

ALGEBRA REPRESENTATION; CHEBYSHEV POLYNOMIAL; DISCRETE COSINE TRANSFORMS; DISCRETE SINE TRANSFORMS; DISCRETE TRIGONOMETRIC TRANSFORM; FAST ALGORITHMS; GROUP REPRESENTATION; POLYNOMIAL TRANSFORM; SYMMETRY;

COSINE TRANSFORMS;

EID: 0141473171     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970139272X     Document Type: Article

References (57)

1. N. Ahmed, T. Natarajan, and K. R. Rao, Discrete cosine transform, IEEE Trans. Computers, C-23 (1974), pp. 90-93.
2. L. Auslander, E. Feig, and S. Winograd, Abelian semi-simple algebras and algorithms for the discrete Fourier transform, Adv. in Appl. Math., 5 (1984), pp. 31-55.
3. T. Beth, Verfahren der Schnellen Fouriertransformation, Teubner, Stuttgart, 1984.
4. T. Beth, On the computational complexity of the general discrete Fourier transform, Theoret. Comput. Sci., 51 (1987), pp. 331-339.
5. P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic Complexity Theory, Springer, Berlin, 1997.
6. S. Chan and K. Ho, Direct methods for computing discrete sinusoidal transforms, Radar Signal Process. IEE Proc. F, 137 (1990), pp. 433-442.
7. W.-H. Chen, C. Smith, and S. Fralick, A fast computational algorithm for the discrete cosine transform, IEEE Trans. Comm., COM-25 (1977), pp. 1004-1009.
8. T. S. Chihara, An Introduction to Orthogonal Polynomials, Gordon and Breach, New York, 1978.
9. M. Clausen, Beiträge zum Entwurf schneller Spektraltransformationen, Habilitationsschrift, Universität Karlsruhe, Karlsruhe, Germany, 1988.
10. M. Clausen and U. Baum, Fast Fourier Transforms, BI Wissenschafts-Verlag, 1993.
11. J. W. Cooley and J. W. Tukey, An algorithm for the machine calculation of complex Fourier series, Math. Comp., 19 (1965), pp. 297-301.
12. W. C. Curtis and I. Reiner, Representation Theory of Finite Groups, Interscience, New York, 1962.
13. P. Diaconis and D. Rockmore, Efficient computation of the Fourier transform on finite groups, J. Amer. Math. Soc., 3 (1990), pp. 297-332.
14. J. R. Driscoll, D. M. Healy, Jr., and D. N. Rockmore, Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs, SIAM J. Comput., 26 (1997), pp. 1066-1099.
15. S. Egner, Zur Algorithmischen Zerlegungstheorie Linearer Transformationen mit Symmetrie, Ph.D. thesis, Universität Karlsruhe, Informatik, Karlsruhe, Germany, 1997.
16. S. Egner, J. Johnson, D. Padua, M. Püschel, and J. Xiong, Automatic derivation and implementation of signal processing algorithms, ACM SIGSAM Bulletin Communications in Computer Algebra, 35 (2001), pp. 1-19.
17. S. Egner and M. Püschel, AREP-Constructive Representation Theory and Fast Signal Transforms, GAP software share package, 1998; available online at http://www.ece.cmu.edu/~smart/arep/arep.html.
18. S. Egner and M. Püschel, Automatic generation of fast discrete signal transforms, IEEE Trans. Signal Process., 49 (2001), pp. 1992-2002.
19. S. Egner and M. Püschel, Symmetry-based matrix factorization, J. Symbolic Comput., to appear.
20. E. Feig, A fast scaled-DCT algorithm, Proc. SPIE, 1244 (1990), pp. 2-13.
21. E. Feig and S. Winograd, Fast algorithms for the discrete cosine transform, IEEE Trans. Signal Process., 40 (1992), pp. 2174-2193.
22. The GAP Team, GAP-Groups, Algorithms, and Programming, University of St. Andrews, Scotland, 1997; available online at http://www-gap.dcs.st-and.ac.uk/~gap/.
23. M. Heideman, D. Johnson, and C. Burrus, Gauss and the history of the fast Fourier transform, Archive for History of Exact Sciences, 34 (1985), pp. 265-277.
24. H. Hou, A fast recursive algorithm for computing the discrete cosine transform, IEEE Trans. Acoustics, Speech, and Signal Processing, ASSP-35 (1987), pp. 1455-1461.
25. N. Jacobson, Basic Algebra II, W. H. Freeman, San Francisco, 1980.
26. T. Kailath and V. Olshevsky, Displacement structure approach to discrete trigonometric transform based preconditioners of G. Strang and T. Chan type, Calcolo, 33 (1996), pp. 191-208.
27. H. Kitajima, A symmetric cosine transform, IEEE Trans. Computers, C-29 (1980), pp. 317-323.
28. B. Lee, A new algorithm to compute the discrete cosine transform, IEEE Trans. Acoustics, Speech, and Signal Processing, ASSP-32 (1984), pp. 1243-1245.
29. D. Maslen and D. Rockmore, Generalized FFTs-A survey of some recent results, in Proceedings of the DIMACS Workshop on Groups and Computation, Rutgers University, 1995, vol. 28, pp. 182-238.
30. J. C. Mason, Chebyshev polynomials of the second, third and fourth kind in approximation, indefinite integration, and integral transforms, J. Comput. Appl. Math., 49 (1993), pp. 169-178.
31. T. Minkwitz, Algorithmensynthese für lineare Systeme mit Symmetrie, Ph.D. thesis, Universität Karlsruhe, Informatik, Karlsruhe, Germany, 1993.
32. T. Minkwitz, Algorithms Explained by Symmetry, Lecture Notes in Comput. Sci. 900, 1995, pp. 157-167.
33. J. M. F. Moura and M. G. S. Bruno, DCT/DST and Gauss-Markov fields: Conditions for equivalence, IEEE Trans. Signal Process., 46 (1998), pp. 2571-2574.
34. D. Potts and G. Steidl, Optimal trigonometric preconditioners for nonsymmetric Toeplitz system, Linear Algebra Appl., 281 (1998), pp. 265-292.
35. D. Potts, G. Steidl, and M. Tasche, Fast algorithms for discrete polynomial transforms, Math. Comp., 67 (1998), pp. 1577-1590.
36. M. Püschel, Konstruktive Darstellungstheorie und Algorithmengenerierung, Ph.D. thesis, Universität Karlsruhe, Informatik, 1998; also available in English as Technical report Drexel-MCS-1999-1, Drexel University, Philadelphia, 1999.
37. M. Püschel, Decomposing monomial representations of solvable groups, J. Symbolic Comput., 34 (2002), pp. 561-596.
38. M. Püschel and J. M. F. Moura, The discrete trigonometric transforms and their fast algorithms: An algebraic symmetry approach, in Proceedings of the 10th IEEE DSP Workshop, Pine Mountain, GA, 2002.
39. C. M. Rader, Discrete Fourier transforms when the number of data samples is prime, Proc. IEEE, 56 (1998), pp. 1107-1108.
40. K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications, Academic Press, Boston, 1990.
41. M. O. Rayes, V. Trevisan, and P. S. Wang, Factorization of Chbeyshev Polynomials, Technical report ICM-199802-0001, Kent State University, Kent, OH, 1998.
42. T. J. Rivlin, The Chebyshev Polynomials, Wiley Interscience, New York, 1974.
43. D. Rockmore, Efficient computation of Fourier inversion for finite groups, Assoc. Comp. Mach., 41 (1994), pp. 31-66.
44. D. Rockmore, Some applications of generalized FFT's, in Proceedings of DIMACS Workshop in Groups and Computation, vol. 28, 1995, pp. 329-370.
45. V. Sánchez, P. García, A. M. Peinado, J. C. Segura, and A. J. Rubio, Diagonalizing properties of the discrete cosine transforms, IEEE Trans. on Signal Process., 43 (1995), pp. 2631-2641.
46. G. Steidl and M. Tasche, A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transforms, Math. Comp., 56 (1991), pp. 281-296.
47. G. Strang, The discrete cosine transform, SIAM Rev., 41 (1999), pp. 135-147.
48. G. Szegö, Orthogonal Polynomials, 3rd ed., Amer. Math. Soc. Colloq. Publ. 23, AMS, Providence, RI, 1967.
49. R. Tolimieri, M. An, and C. Lu, Algorithms for Discrete Fourier Transforms and Convolution, 2nd ed., Springer, New York, 1997.
50. M. Vetterli and H. Nussbaumer, Simple FFT and DCT algorithms with reduced number of operations, Signal Process., 6 (1984), pp. 267-278.
51. Z. Wang, Reconsideration of "A fast computational algorithm for the discrete cosine transform," IEEE Trans. Comm., COM-31 (1983), pp. 121-123.
52. Z. Wang, Fast algorithms for the discrete W transform and for the discrete Fourier transform, IEEE Trans. Acoustics, Speech, and Signal Processing, ASSP-32 (1984), pp. 803-816.
53. Z. Wang and B. Hunt, The discrete W transform, Appl. Math. Comput., 16 (1985), pp. 19-48.
54. S. Winograd, Arithmetic Complexity of Computations, CBMS-NSF Regional Conf. Ser. in Appl. Math. 33, SIAM, Philadelphia, 1980.
55. P. Yip and K. Rao, A fast computational algorithm for the discrete sine transform, IEEE Trans. Comm., COM-28 (180), pp. 304-307.
56. P. Yip and K. Rao, Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms, Circuits Systems Signal Process., 3 (1984), pp. 387-408.
57. P. Yip and K. Rao, The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms, Circuits Systems Signal Process., 7 (1988), pp. 3-19.