Discussion :: Exam Questions Paper
-
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 stage is N/m
|
|
C.
In-place computation requires storage of only 2N node data
|
|
D.
Computation of a butterfly requires only one complex multiplication
|
Whatsapp
Facebook
Answer : Option D
Explanation :
No answer description available for this question.
Be The First To Comment