Radix-2 decimation-in-frequency algorithm for the computation of the real-valued FFT

IEEE Transactions on Signal Processing

Volumn 47, Issue 4, 1999, Pages 1181-1184

  Sekhar, B Raja ^a   Prabhu, K M M ^b  

^a School of Operations Research and Industrial Engineering   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL SIGNAL PROCESSING; REDUNDANCY;

ARITHMETIC COMPLEXITY; DECIMATION IN FREQUENCY; LINEAR PHASE SEQUENCE;

FAST FOURIER TRANSFORMS;

EID: 0033115642     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.752621     Document Type: Article

References (5)

1. H. V. Sorensen, D. L. Jones, M. T. Heideman, and C. S. Burrus, "Real-valued fast Fourier transform algorithms," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, pp. 849-863, June 1987.
2. _, "On computing discrete Hartley transform," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, pp. 1231-1238, Oct. 1985.
3. P. R. Uniyal, "Transforming real-valued sequences: Fast Fourier versus fast Hartley transform algorithms," IEEE Trans. Signal Processing, vol. 42, pp. 3249-3254, Nov. 1994.
4. V. Nagesha, "On computing the discrete Fourier transform of linear phase sequence," IEEE Trans. Acoust., Speech, Signal Processing, vol. 39, pp. 225-226, Jan. 1991.
5. O. K. Ersoy, "A comparative review of real and complex Fourier related transforms," Proc. IEEE, vol. 82, pp. 429-447, Mar. 1994.