Fast generalized discrete Fourier transforms: A unified approach to the discrete sinusoidal transforms computation

Signal Processing

Volumn 79, Issue 2, 1999, Pages 135-150

  Britanak, Vladimir ^a   Rao, K R ^b  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

^b The University of Texas at Arlington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSINE TRANSFORMS; FOURIER TRANSFORMS; GRAPH THEORY; MATRIX ALGEBRA;

DISCRETE COSINE TRANSFORMS (DCT); DISCRETE SINE TRANSFORMS (DST); GENERALIZED DISCRETE FOURIER TRANSFORMS (GDFT); GENERALIZED DISCRETE HARTLEY TRANSFORMS (GDHT);

DIGITAL SIGNAL PROCESSING;

EID: 0033353815     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-1684(99)00088-2     Document Type: Article

References (35)

1. Bi G., Chen Y. Fast generalized DFT and DHT algorithms. Signal Processing. 65:March 1998;383-390.
2. Bongiovanni G., Corsini P., Frosini G. One-dimensional and two-dimensional generalized discrete Fourier transform. IEEE Trans. Acoust. Speech Signal Process. ASSP-24:February 1976;97-99.
3. Bonnerot G., Bellanger M. Odd-time odd-frequency discrete Fourier transform for symmetric real-valued series. Proc. IEEE. 64:March 1976;392-393.
4. Bracewell R.N. Discrete Hartley transform. Journal of Opt. Soc. Amer. 73:December 1983;1832-1835.
5. R.N. Bracewell, The Hartley Transform, Oxford University Press, New York, 1986.
6. Britanak V. A unified discrete cosine and discrete sine transform computation. Signal Processing. 43:May 1995;333-339.
7. Britanak V. A unified approach to the fast computation of discrete sinusoidal transforms I: DCT and DST transforms. Computers and Artificial Intelligence. 17:December 1998;583-607.
8. Britanak V. A unified approach to the fast computation of discrete sinusoidal transforms II: DFT and DWT transforms. Computers and Artificial Intelligence. 18:February 1999;19-36.
9. Corsini P., Frosini G. Properties of the multidimensional generalized discrete Fourier transform. IEEE Trans. Computers. C-28:November 1979;819-830.
10. Duhamel P., Hollmann H. Split-radix FFT algorithm. Electronics Letters. 20:January 1984;14-16.
11. Duhamel P. Implementation of split-radix FFT algorithms for complex, real and real-symmetric data. IEEE Trans. Acoust. Speech Signal Process. ASSP-34:April 1986;285-295.
12. D.F. Elliott, K.R. Rao, Fast Transforms: Algorithms, Analyses, Applications, Academic Press, New York, 1982.
13. Ersoy O.K. A comparative review of real and complex Fourier-related transforms. Proc. IEEE. 82:March 1994;429-447.
14. O.K. Ersoy, N.C. Hu, A unified approach to the fast computation of all discrete trigonometric transforms, in: Proc. IEEE ICASSP, Dallas, TX, April 1987, pp. 1843-1846.
15. R. Gluth, Regular FFT-related transform kernels for DCT/DST-based polyphase filter banks, in: Proc. IEEE ICASSP, Toronto, 1991, pp. 2205-2208.
16. Hu N.C., Chang H.I., Ersoy O.K. Generalized discrete Hartley transforms. IEEE Trans. Signal Process. 40:December 1992;2931-2940.
17. Martens J.B. Discrete Fourier transform algorithms for real-valued sequences. IEEE Trans. Acoust. Speech Signal Process. ASSP-32:April 1984;390-396.
18. Martucci S.A. Symmetric convolution and the discrete sine and cosine transforms. IEEE Trans. Signal Process. 42:May 1994;1038-1051.
19. Martucci S.A. Digital filtering of images using the discrete sine or cosine transform. Optical Engineering. 35:January 1996;119-127.
20. Murthy N.R., Swamy M.N.S. On the algorithms for the computation of even discrete cosine transform-2 (EDCT-2) of real sequences. IEEE Trans. Circuits and Systems. 37:May 1990;625-627.
21. Murthy N.R., Swamy M.N.S. On the on-line computation of DCT-IV and DST-IV transforms. IEEE Trans. Signal Process. 43:May 1995;1249-1251.
22. H.J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms, Springer, Berlin, 1981.
23. Pei S.-C., Luo T.-L. Split-radix generalized fast Fourier transform. Signal Processing. 54:1996;137-151.
24. K.R. Rao, P. Yip, Discrete Cosine Transform: Algorithms, Advantages and Applications, Academic Press, Boston, 1990.
25. K.R. Rao, J.J. Hwang, Techniques and Standards for Digital Image, Video and Audio Coding, Prentice-Hall, Upper Saddle River, NJ, 1996.
26. R.O. Rowlands, The odd discrete Fourier transform, in: Proc. IEEE ICASSP, Philadelphia, PA, April 1976, pp. 130-133.
27. Vernet J.L. Real signals fast Fourier transform: Storage capacity and step number reduction by means of an odd discrete Fourier transform. Proc. IEEE. 59:October 1971;1531-1532.
28. M. Vetterli, Fast 2D-discrete cosine transform, in: Proc. IEEE ICASSP, Tampa, FL, March 1985, pp. 1538-1541.
29. Vetterli N., Nussbaumer H.J. Simple FFT and DCT algorithms with reduced number of operations. Signal Processing. 6:August 1984;267-278.
30. Wang Z. Fast algorithms for the discrete W transform and for the discrete Fourier transform. IEEE Trans. Acoust. Speech Signal Process. ASSP-32:August 1984;803-816.
31. Wang Z. On computing the discrete Fourier and cosine transforms. IEEE Trans. Acoust. Speech Signal Process. ASSP-33:October 1985;1341-1344.
32. Wang Z. Comments on generalized discrete Hartley transforms. IEEE Trans. Signal Process. 43:July 1995;1711-1712.
33. Wang Z., Hunt B.R. The discrete W transform. Applied Math. and Comput. 16:1985;19-48.
34. Wang Z., Jullien G.A., Miller W.C. The generalized discrete. W transform and its application to interpolation Signal Processing. 36:1994;99-109.
35. Zou F., Gallagher R.R. A New transform with symmetrical coding performance for Markov(1) signals. IEEE Trans. Signal Process. 43:September 1995;2195-2198.