Discrete Time Signal Processing
Quick practice
Question 1 of 5
For the N-point FFT algorithm with N = 2m, which one of the following statements is TRUE?
A
Computation of butterfly requires only one complex multiplication.
B
In place of computation it requires storage of only 2N node data.
C
The number of butterfly structure in mth state is N/m
D
It is not possible to construct a signal flow graph with input and output in normal order.
Concepts
Get unlimited practice with GATE & ESE - EE, EC subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go