A novel approach based on recursive indexing for FFT data reordering

Considering the problem that the well-known bit-reversal algorithm is only fit for radix-2 Fast Fourier Transform (FFT) data reordering, a novel approach based on recursive indexing is proposed for radix-r FFT data reordering. The proposed scheme discards a look-up table required by bit-reversal algorithm. The corresponding hardware structure only costs a RAM whose depth is equal to the size of FFT, and saves a same order of extra additions involved in a quite recent scheme based on vector calculation.