Concept drill
FFT
GATE Electronics & Communication · Digital Signal Processing - FFT · 2010-2019
2
PYQs
50%
keyed
0
elite explanations
2
years appeared
Study anchor
Source-book anchor pending for this concept.
Practice action
Start latest PYQPYQs in this concept
All concepts →2019 Q28
Consider a six-point decimation-in-time Fast Fourier Transform (FFT) algorithm, for which the signal-flow graph corresponding to X[1] is shown in the figure. Let $W_6 = \exp\left(-...
medium
2010 PYQ
For an N-point FFT algorithm with N = $${2^m}$$ which one of the following statements is TRUE?
mediumanswer key