Functional Pearl: Perfect trees and bit−reversal permutations
A famous algorithm is the Fast Fourier Transform, or FFT. An efficient iterative version of the FFT algorithm performs as a first step a bit-reversal permutation of the input list. The bit-reversal permutation swaps elements whose indices have binary representations that are the reverse of each othe...
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Journal article |
| منشور في: |
2000
|