1 Crore+ students have signed up on EduRev. Have you? Download the App 
If we split the N point data sequence into two N/2 point data sequences f_{1}(n) and f_{2}(n) corresponding to the even numbered and odd numbered samples of x(n), then such an FFT algorithm is known as decimationintime algorithm.
If we split the N point data sequence into two N/2 point data sequences f_{1}(n) and f_{2}(n) corresponding to the even numbered and odd numbered samples of x(n) and F_{1}(k) and F_{2}(k) are the N/2 point DFTs of f_{1}(k) and f_{2}(k) respectively, then what is the N/2 point DFT X(k) of x(n)?
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 radix2 FFT is:
The total number of complex additions required to compute N point DFT by radix2 FFT is:
The following butterfly diagram is used in the computation of:
For a decimationintime FFT algorithm, which of the following is true?
The following butterfly diagram is used in the computation of:
For a decimationintime FFT algorithm, which of the following is true?
32 videos76 docs63 tests

InPlace Computation Doc  1 pages 
Computer Aided Design  Fast Fourier Transform Doc  1 pages 
Test: DFT Computation Filtering Approach Test  10 ques 
Test: Quantization Effects Test  15 ques 
32 videos76 docs63 tests

InPlace Computation Doc  1 pages 
Computer Aided Design  Fast Fourier Transform Doc  1 pages 
Test: DFT Computation Filtering Approach Test  10 ques 
Test: Quantization Effects Test  15 ques 