1 Crore+ students have signed up on EduRev. Have you? Download the App 
Which of the following is true regarding the number of computations required to compute an Npoint DFT?
Which of the following is true regarding the number of computations required to compute DFT at any one value of ‘k’?
The computation of XR(k) for a complex valued x(n) of N points requires:
Divideandconquer approach is based on the decomposition of an Npoint DFT into successively smaller DFTs. This basic approach leads to FFT algorithms.
If the arrangement is of the form in which the first row consists of the first M elements of x(n), the second row consists of the next M elements of x(n), and so on, then which of the following mapping represents the above arrangement?
If N=LM, then what is the value of W_{N}^{mqL}?
How many complex multiplications are performed in computing the Npoint DFT of a sequence using divideandconquer method if N=LM?
How many complex additions are performed in computing the Npoint DFT of a sequence using divideandconquer method if N=LM?
Which is the correct order of the following steps to be done in one of the algorithm of divide and conquer method?
1) Store the signal column wise
2) Compute the Mpoint DFT of each row
3) Multiply the resulting array by the phase factors WNlq.
4) Compute the Lpoint DFT of each column.
5) Read the result array row wise.
32 videos76 docs63 tests

Test: DFT Algorithm Computation  2 Test  10 ques 
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

Test: DFT Algorithm Computation  2 Test  10 ques 
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 