If we split the N point data sequence into two N/2 point data sequences f1(n) and f2(n) corresponding to the even numbered and odd numbered samples of x(n), then such an FFT algorithm is known as decimation-in-time algorithm.
If we split the N point data sequence into two N/2 point data sequences f1(n) and f2(n) corresponding to the even numbered and odd numbered samples of x(n) and F1(k) and F2(k) are the N/2 point DFTs of f1(k) and f2(k) respectively, then what is the N/2 point DFT X(k) of x(n)?
1 Crore+ students have signed up on EduRev. Have you? Download the App |
If X(k) is the N/2 point DFT of the sequence x(n), then what is the value of X(k+N/2)?
How many complex multiplications are required to compute X(k)?
The total number of complex multiplications required to compute N point DFT by radix-2 FFT is:
The total number of complex additions required to compute N point DFT by radix-2 FFT is:
The following butterfly diagram is used in the computation of:
For a decimation-in-time FFT algorithm, which of the following is true?
The following butterfly diagram is used in the computation of:
For a decimation-in-time FFT algorithm, which of the following is true?