A Fast Recursive Algorithm and Architecture for Pruned Bit-reversal Interleavers
Journal of Signal Processing Systems
| Hi-index | 35.68 |
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 necessary