News for hackers. Stuff that matters.
Re:Reversing Bits in C by RodgerTheGreat on Tuesday July 30, 2013 @04:45PM (#6129911)
A common approach for performing a Fast Fourier Transform involves reversing the bits in time-domain samples.
Re:Reversing Bits in C by stephencanon on Tuesday July 30, 2013 @05:13PM (#6130095)
Expanding 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.
Re:Reversing Bits in C by ajb on Tuesday July 30, 2013 @04:55PM (#6129971)
Reversing the bits in the index to the samples :-)