Reduce FFT memory reference for low power applications

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

Volumn 3, Issue , 2002, Pages 3204-3207

  Tang, Yiyan ^a   Jiang, Yingtao ^b   Wang, Yuke ^a  

^a The University of Texas at Dallas   (United States)

^b University of Nevada Las Vegas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER HARDWARE; DATA FLOW ANALYSIS; ELECTRIC POWER SUPPLIES TO APPARATUS; FAST FOURIER TRANSFORMS; GRAPH THEORY; RANDOM ACCESS STORAGE;

BREADTH-FIRST TREE TRAVERSAL ALGORITHM; MATRIX TRANSFORMATION TECHNIQUE; REDUNDANT MEMORY ACCESS;

DIGITAL SIGNAL PROCESSING;

EID: 0036293670     PISSN: 15206149     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICASSP.2002.5745331     Document Type: Article

References (12)

1. A raidx-eight fast-fourier transform subroutine for real-valued series
2. An algorithm for the machine calculation of complex Fourier series
3. Split radix FFT algorithm
4. A prime factor FFT algorithm using high-speed convolution
5. An algorithm for computing the mixed radix fast fourier transform
6. An extended split-radix FFT algorithm
7. A recursive fast fourier transform algorithm
8. On computing the discrete fourier transform