2 views

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