(Solved) : Basic Radix 2 Fft Algorithms Based Decimation Time Indicated Text Figures 1 2 Eight Flow Q29605543 . . . .

a. The basic radix-2 FFT algorithms based ondecimation-in-time are indicated in the text, Figures 1 and2. For each of these eight flow-graphs indicatewhether or not each of the following properties is true or not withnecessary justifications.

Represents an in-place computation

Input is in normal order

Output is in normal order

Coefficients should be stored in bit-reversed order

Accessing of the data is identical for everyarray.                                                      (10 Marks)

b. If x(n)=[1,2,3,2] calculate FFT usingDIT-FFT and DIF-FFT flow graph.                             (15Marks)

Figure 1

Figure 2

x(O) -1 X (2)