Q403
For an N-point FFT algorithm with N = 2m, which one of the following statements is TRUE
A.
It is not possible to construct a signal flow graph with both input and output in normal order
B.
The number of butterflies in the mth state is N/m
C.
In-place computation requires storage of only 2N node data
D.
Computation of a butterfly requires only one complex multiplication
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board