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
I got this question during an interview for a job.
Asked question is from Efficient Computation of DFT FFT Algorithms in division DFT Efficient Computation – Fast Fourier Transform Algorithms of Digital Signal Processing