A. The basic radix-2 FFT algorithms based ondecimation-in-time are indicated in the text, Figures 5 and6. 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.
B. If x(n)=[1,2,3,2] calculate FFT using theflow graph given in Figure 5.
figure 5

Figure 6
Show transcribed
PayPal Gateway not configured
PayPal Gateway not configured