Efficient input reordering for the DCT based on a real-valued decimation-in-time FFT

IEEE Signal Processing Letters

Volumn 3, Issue 8, 1996, Pages 242-244

  Storn, Rainer ^a,b  

^a INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^b SIEMENS AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); FAST FOURIER TRANSFORMS;

DISCRETE COSINE TRANSFORMS; DISCRETE FOURIER TRANSFORMS; INPUT REORDERING;

DIGITAL SIGNAL PROCESSING;

EID: 0030213974     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/97.511807     Document Type: Article

References (6)

1. V. Britanah, "On the discrete cosine transform computation," Signal Processing, vol. 40, pp. 183-194, 1994.
2. P. Z. Lee and F. X. Huang, "Restructured recursive DCT and DST algorithms," IEEE Trans. Signal Processing, vol. 42, no. 7, pp. 1600-1609, July 1994.
3. Z. Wang, "On computing the discrete Fourier and cosine transforms," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, no. 4, pp. 1341-1344, Oct. 1985.
4. J. Makhoul, "A fast cosine transform in one and two dimensions," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-28, no. 1, pp. 27-34, Feb. 1980.
5. H. Sorensen et al., "Real-valued fast Fourier transform algorithms," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, no. 6, pp. 849-863, June 1987.
6. S. K. Mitra and J. F. Kaiser, Handbook for Digital Signal Processing. New York: Wiley, 1993.