4 ms·
A common approach for performing a Fast Fourier Transform involves reversing the bits in time-domain samples.
by RodgerTheGreat 13y ago
A common approach for performing a Fast Fourier Transform involves reversing the bits in time-domain samples.
- ajb 13y agoReversing the bits in the index to the samples :-)
- stephencanon 13y agoExpanding slightly, there’s a permutation that needs to happen in order to efficiently perform a DFT in-place (and the same approach is often used even when the transform is out-of-place). For power of two sizes (one of the most common cases), that permutation is precisely the same as a bit reversal of the indices.