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...

Descrición completa

Detalles Bibliográficos
Autor Principal: Hinze, R
Formato: Journal article
Publicado: 2000