O'Reilly logo

Signals and Systems by Smarajit Ghosh

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

11.13 BIT REVERSAL

Let us consider the signal flow graph of eight-point DIT FFT algorithm shown in Fig. 11.12 where the sequence of input data is shuffled as x(0), x(4), x(2), x(6), x(1), x(5), x(3), x(7). The DFT sequence X(k) at the output is in proper order i.e., x(0), x(1)…, x(7). Table 11.4 shows the shuffling of the input sequence has a well defined format.

 

Table 11.4 Computational complexity of DIT FFT algorithm compared to direction method

image

 

Table 11.5 Shuffling of the input sequence

image

 

From Table 11.4, x(1) ∫ x(001) is to be placed ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required