Abstract
The recording effect of the fast Fourier transform is considered which requires that the elements of the data array be permuted by bit-reversing the array index. The bit-reversal algorithm given by B. Gold and C. M. Rader (1969) is referred to. Several improvements are made to this algorithm that result in improved efficiency. A closed-form expression is derived for the largest index that must be bit-reversed. A computational analysis is given, comparing the original and modified algorithms.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1407-1410 |
| Number of pages | 4 |
| Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| State | Published - 1988 |
| Externally published | Yes |
ASJC Scopus subject areas
- Software
- Signal Processing
- Electrical and Electronic Engineering