in Others edited by
2 views
0 votes
0 votes

GATE ECE 2010 | Question-16

For an $\mathrm{N}$-point $\mathrm{FFT}$ algorithm with $\mathrm{N}=2^{\text {m}}$, which one of the following statements is $\text{TRUE}?$

  1. It is not possible to construct a signal flow graph with both input and output in normal order
  2. The number of butterflies in the $\mathrm{m}^{\text {th}}$ stage is $\mathrm{N} / \mathrm{m}$
  3. In-place computation requires storage of only $2 \mathrm{N}$ node data
  4. Computation of a butterfly requires only one complex multiplication
in Others edited by
by
32.7k points
2 views

Please log in or register to answer this question.

Welcome to GO Electronics, where you can ask questions and receive answers from other members of the community.