For a decimation-in-time FFT algorithm, which of the following is true?
A. Both input and output are in order
B. Both input and output are shuffled
C. Input is shuffled and output is in order
D. Input is in order and output is shuffled
Answer:A
For a decimation-in-time FFT algorithm, which of the following is true?
A. Both input and output are in order B. Both input and output are shuffled C. Input is shuffled and output is in order D. Input is in order and output is shuffled
Explanation: In decimation-in-time FFT algorithm, the input is taken in bit reversal order and the output is obtained in the order.