Multiple choice

For an N-point FFT algorithm with N = 2m which one of the following statements is 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 mth stage is N/m.

  3. In-place computation requires storage of only 2N node data.

  4. Computation of a butterfly requires only one complex multiplication.

Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation