Bit reversal in FFT from matrix viewpoint
- 1 June 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 39 (6) , 1415-1418
- https://doi.org/10.1109/78.136547
Abstract
The computation of a minimum and sufficient set of addresses, along with corresponding bit-reversed addresses, is necessary to do unscrambling in conventional FFT (fast Fourier transform) procedures. A matrix-based interpretation of this problem is presented, and typical software and hardware solutions are described. An overall relationship between the two sets of primary and secondary indices is shown, obviating any additional relationship at individual pairwise level. Although the algorithms have been discussed on radix-2 basis, they can be modified for a radix if necessaryKeywords
This publication has 4 references indexed in Scilit:
- An improved digit-reversal permutation algorithm for the fast Fourier and Hartley transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- On computing the split-radix FFTIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- The fast Hartley transformProceedings of the IEEE, 1984
- Fast Fourier Transform and Convolution AlgorithmsPublished by Springer Nature ,1982