Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

Signal Processing

Volumn 88, Issue 6, 2008, Pages 1553-1564

  Shao, Xuancheng ^a   Johnson, Steven G ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Arithmetic complexity; Discrete cosine transform; Fast Fourier transform

Indexed keywords

ALGORITHMS; FAST FOURIER TRANSFORMS;

ARITHMETIC COMPLEXITY; DISCRETE SINE TRANSFORM (DST); RESCALING;

DISCRETE COSINE TRANSFORMS;

EID: 39749108683     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sigpro.2008.01.004     Document Type: Article

References (53)

1. Johnson S.G., and Frigo M. A modified split-radix FFT with fewer arithmetic operations. IEEE Trans. Signal Process. 55 1 (2007) 111-119
2. Kamar I., and Elcherif Y. Conjugate pair fast Fourier transform. Electron. Lett. 25 5 (1989) 324-325
3. Gopinath R.A. Comment: conjugate pair fast Fourier transform. Electron. Lett. 25 16 (1989) 1084
4. Qian H.-S., and Zhao Z.-J. Comment: conjugate pair fast Fourier transform. Electron. Lett. 26 8 (1990) 541-542
5. Krot A.M., and Minervina H.B. Comment: conjugate pair fast Fourier transform. Electron. Lett. 28 12 (1992) 1143-1144
6. Vetterli M., and Nussbaumer H.J. Simple FFT and DCT algorithms with reduced number of operations. Signal Processing 6 4 (1984) 267-278
7. Duhamel P. Implementation of "split-radix" FFT algorithms for complex, real, and real-symmetric data. IEEE Trans. Acoust. Speech Signal Process. 34 2 (1986) 285-295
8. Duhamel P., and Vetterli M. Fast Fourier transforms: a tutorial review and a state of the art. Signal Processing 19 (April 1990) 259-299
9. R. Vuduc, J. Demmel, Code generators for automatic tuning of numerical kernels: experiences with FFTW, in: Proceedings of the Semantics, Application, and Implementation of Code Generators Workshop, Montreal, September 2000.
10. Frigo M., and Johnson S.G. The design and implementation of FFTW3. Proc. IEEE 93 2 (2005) 216-231
11. Wang Z. A fast algorithm for the discrete sine transform implemented by the fast cosine transform. IEEE Trans. Acoust. Speech Signal Process. 30 5 (1982) 814-815
12. Chan S.C., and Ho K.L. Direct methods for computing discrete sinusoidal transforms. IEE Proc. F 137 6 (1990) 433-442
13. Lee P., and Huang F.-Y. Restructured recursive DCT and DST algorithms. IEEE Trans. Signal Process. 42 7 (1994) 1600-1609
14. Yavne R. An economical method for calculating the discrete Fourier transform. Proceedings of the AFIPS Fall Joint Computer Conference vol. 33 (1968) 115-125
15. Duhamel P., and Hollmann H. Split-radix FFT algorithm. Electron. Lett. 20 1 (1984) 14-16
16. Martens J.B. Recursive cyclotomic factorization-a new algorithm for calculating the discrete Fourier transform. IEEE Trans. Acoust. Speech Signal Process. 32 4 (1984) 750-761
17. k. Computing 80 1 (2007) 23-45
18. Lee B.G. A new algorithm to compute the discrete cosine transform. IEEE Trans. Acoust. Speech Signal Process. 32 6 (1984) 1243-1245
19. Wang Z. On computing the discrete Fourier and cosine transforms. IEEE Trans. Acoust. Speech Signal Process. 33 4 (1985) 1341-1344
20. Suehiro N., and Hatori M. Fast algorithms for the DFT and other sinusoidal transforms. IEEE Trans. Acoust. Speech Signal Process. 34 3 (1986) 642-644
21. Hou H.S. A fast algorithm for computing the discrete cosine transform. IEEE Trans. Acoust. Speech Signal Process. 35 10 (1987) 1455-1461
22. Arguello F., and Zapata E.L. Fast cosine transform based on the successive doubling method. Electronic Lett. 26 19 (1990) 1616-1618
23. Kok C.W. Fast algorithm for computing discrete cosine transform. IEEE Trans. Signal Process. 45 3 (1997) 757-760
24. Takala J., Akopian D., Astola J., and Saarinen J. Constant geometry algorithm for discrete cosine transform. IEEE Trans. Signal Process. 48 6 (2000) 1840-1843
25. Püschel M., and Moura J.M.F. The algebraic approach to the discrete cosine and sine transforms and their fast algorithms. SIAM J.Comput. 32 5 (2003) 1280-1316
26. M. Püschel, Cooley-Tukey FFT like algorithms for the DCT, in: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 2, Hong Kong, April 2003, pp. 501-504.
27. Ahmed N., Natarajan T., and Rao K.R. Discrete cosine transform. IEEE Trans. Comput. 23 1 (1974) 90-93
28. Haralick R.M. A storage efficient way to implement the discrete cosine transform. IEEE Trans. Comput. 25 (1976) 764-765
29. Chen W.-H., Smith C.H., and Fralick S.C. A fast computational algorithm for the discrete cosine transform. IEEE Trans. Comm. 25 9 (1977) 1004-1009
30. Narasimha M.J., and Peterson A.M. On the computation of the discrete cosine transform. IEEE Trans. Comm. 26 6 (1978) 934-936
31. Tseng B.D., and Miller W.C. On computing the discrete cosine transform. IEEE Trans. Comput. 27 10 (1978) 966-968
32. Yaroslavskii L.P. Shifted discrete Fourier transforms. Problems of Inform. Transmission 15 4 (1979) 324-327
33. Makhoul J. A fast cosine transform in one and two dimensions. IEEE Trans. Acoust. Speech Signal Process. 28 1 (1980) 27-34
34. Malvar H.S. Fast computation of the discrete cosine transform and the discrete Hartley transform. IEEE Trans. Acoust. Speech Signal Process. 35 10 (1987) 1484-1485
35. Li W. A new algorithm to compute the DCT and its inverse. IEEE Trans. Signal Process. 39 6 (1991) 1305-1313
36. Steidl G., and Tasche M. A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transforms. Math. Comput. 56 193 (1991) 281-296
37. Feig E., and Winograd S. On the multiplicative complexity of discrete cosine transforms. IEEE Trans. Inform. Theory 38 4 (1992) 1387-1391
38. Astola J., and Akopian D. Architecture-oriented regular algorithms for discrete sine and cosine transforms. IEEE Trans. Signal Process. 47 4 (1999) 1109-1124
39. Guo Z., Shi B., and Wang N. Two new algorithms based on product system for discrete cosine transform. Signal Processing 81 (2001) 1899-1908
40. Plonka G., and Tasche M. Fast and numerically stable algorithms for discrete cosine transforms. Linear Algebra Appl. 394 (2005) 309-345
41. Frigo M. A fast Fourier transform compiler. Proceedings of the ACM SIGPLAN'99 Conference on Programming Language Design and Implementation (PLDI) vol. 34 (May 1999), Atlanta, GA, New York, ACM 169-180
42. Arai Y., Agui T., and Nakajima M. A fast DCT-SQ scheme for images. Trans. IEICE 71 11 (1988) 1095-1097
43. Pennebaker W.B., and Mitchell J.L. JPEG Still Image Data Compression Standard (1993), Van Nostrand Reinhold, New York
44. Swarztrauber P.N. Vectorizing the FFTs. In: Rodrigue G. (Ed). Parallel Computations (1982) 51-83
45. Press W.H., Flannery B.P., Teukolsky S.A., and Vetterling W.T. Numerical Recipes in C: The Art of Scientific Computing. second ed. (1992), Cambridge University Press, New York, NY
46. van Loan C. Computational Frameworks for the Fast Fourier Transform (1992), SIAM, Philadelphia, PA
47. Rao K.R., and Yip P. Cosine Transform: Algorithms Advantages Applications (1990), Academic Press, Boston, MA
48. Sorensen H.V., Jones D.L., Heideman M.T., and Burrus C.S. Real-valued fast Fourier transform algorithms. IEEE Trans. Acoust. Speech Signal Process. 35 6 (1987) 849-863
49. Gentleman W.M., and Sande G. Fast Fourier transforms-for fun and profit. Proc. AFIPS 29 (1966) 563-578
50. Schatzman J.C. Accuracy of the discrete Fourier transform and the fast Fourier transform. SIAM J. Sci. Comput. 17 5 (1996) 1150-1166
51. Tasche M., and Zeuner H. Handbook of Analytic-Computational Methods in Applied Mathematics (2000), CRC Press, Boca Raton, FL 357-406 (Chapter 8)
52. Crochiere R.E., and Oppenheim A.V. Analysis of linear digital networks. Proc. IEEE 63 4 (1975) 581-595
53. X. Shao, S.G. Johnson, Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations, Signal Processing (2008), in press. doi: 10.1016/j.sigpro.2007.11.024.