IndiaBIX

Electronics and Communication Engineering - Exam Questions Papers - Discussion

Discussion Forum : Exam Questions Papers - Exam Paper 15 (Q.No. 24)
Exam Questions Papers
24.
For an N-point FFT algorithm with N = 2m which one of the following statements is TRUE?
It is not possible to construct a signal flow graph with both input and output in normal order
The number of butterflies in the mth stage is N/m
In-place computation requires storage of only 2N node data
Computation of a butterfly requires only one complex multiplication
Answer: Option
Explanation:
No answer description is available. Let's discuss.
Discussion:
Be the first person to comment on this question !
Post your comments here:

Your comments will be displayed after verification.

Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers