This correspondence presents a very short, simple, easy to understand
bit-reversal algorithm for radix-2 fast Fourier transform (PPT), which
is, furthermore, easily extendable to radix-M. In addition, when impl
emented together with Yong's technique, the computing time is comparab
le to that of the fastest algorithms.