New FFT bit-reversal algorithm

Authors:
J.M. Rius;R. De Porrata-Doria
Affiliations:
Dept. de Teoria del Senyal i Comunicacions, Univ. Politecnica de Catalunya, Barcelona;-
Venue:
IEEE Transactions on Signal Processing
Year:
1995

Citing 0
Cited 4

An Efficient Algorithm for the Computation of the MultidimensionalDiscrete Fourier Transform

Multidimensional Systems and Signal Processing
Extendible look-up table of twiddle factors and radix-8 based fast Fourier transform

Signal Processing
An efficient radix-two algorithm to compute the 2D Fourier transform

ICECS'05 Proceedings of the 4th WSEAS international conference on Electronics, control and signal processing
A Fast Recursive Algorithm and Architecture for Pruned Bit-reversal Interleavers

Journal of Signal Processing Systems

Quantified Score

Hi-index	35.68

Visualization

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