Abstract:
|
This correspondence 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 Transactions on Acoustics, Speech, Signal Processing,1991, vol.39, #10, p.2365-7) technique, the computing time is comparable to that of the fastest algorithms |