DocumentCode :
1190849
Title :
A fast FFT bit-reversal algorithm
Author :
Sundararajan, D. ; Ahmad, M. Omair ; Swamy, M.N.S.
Author_Institution :
Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
Volume :
41
Issue :
10
fYear :
1994
fDate :
10/1/1994 12:00:00 AM
Firstpage :
701
Lastpage :
703
Abstract :
The necessity for an efficient bit-reversal routine in the implementation of fast discrete Fourier transform algorithms is well known. In this paper, we propose a bit-reversal algorithm that reduces the computational effort to an extent that it becomes negligible compared with the data swapping operation for which the bit-reversal is required
Keywords :
computational complexity; fast Fourier transforms; data swapping operation; efficient bit-reversal routine; fast FFT bit-reversal algorithm; fast discrete Fourier transform algorithms; Circuits; Councils; Digital signal processing; Discrete Fourier transforms; Signal processing;
fLanguage :
English
Journal_Title :
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1057-7130
Type :
jour
DOI :
10.1109/82.329741
Filename :
329741
Link To Document :
بازگشت