Chapter: Digital Signal Processing : Frequency Transformations
Bit Reversal
For 8 point DIT DFT input data sequence is written as x(0), x(4), x(2), x(6), x(1), x(5), x(3), x(7) and the DFT sequence X(k) is in proper order as X(0), X(1), X(2), X(3), X(4), x(5), X(6), x(7). In DIF FFT it is exactly opposite. This can be obtained by bit reversal method.
BIT REVERSAL
For 8
point DIT DFT input data sequence is written as x(0), x(4), x(2), x(6), x(1),
x(5), x(3), x(7) and the DFT sequence X(k) is in proper order as X(0), X(1),
X(2), X(3), X(4), x(5), X(6), x(7). In DIF FFT it is exactly opposite. This can
be obtained by bit reversal method.
Table
shows first column of memory address in decimal and second column as binary.
Third column indicates bit reverse values. As FFT is to be implemented on
digital computer simple integer division by 2 method is used for implementing
bit reversal algorithms. Flow chart for Bit reversal algorithm is as follows
Study Material, Lecturing Notes, Assignment, Reference, Wiki description explanation, brief detail
Digital Signal Processing : Frequency Transformations : Bit Reversal |
Related Topics
Digital Signal Processing : Frequency Transformations