DocumentCode
765443
Title
New FFT bit-reversal algorithm
Author
Rius, Juan M. ; Porrata-Dòria, R. De
Author_Institution
Dept. de Teoria del Senyal i Comunicacions, Univ. Politecnica de Catalunya, Barcelona, Spain
Volume
43
Issue
4
fYear
1995
fDate
4/1/1995 12:00:00 AM
Firstpage
991
Lastpage
994
Abstract
Presents a very short, simple, easy to understand bit-reversal algorithm for radix-2 fast Fourier transform (FFT), which is, furthermore, easily extendable to radix-M. In addition, when implemented together with Yong´s (see IEEE Trans. Acoust., Speech, Signal Processing, vol.39, no.1O, p.2365-7, 1991) technique, the computing time is comparable to that of the fastest algorithms
Keywords
computational complexity; digital arithmetic; fast Fourier transforms; signal processing; FFT bit-reversal algorithm; computing time; radix-2 fast Fourier transform; radix-M; Assembly; Counting circuits; Fast Fourier transforms; Microwave antennas; Radar antennas; Reduced instruction set computing; Signal processing algorithms;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.376852
Filename
376852
Link To Document