1 Crore+ students have signed up on EduRev. Have you? Download the App 
FFT algorithm is designed to perform complex operations.
If x1(n) and x2(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N1, then what is the value of x2(n)?
If X(k) is the DFT of x(n) which is defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N1, then what is the DFT of x1(n)?
If X(k) is the DFT of x(n) which is defined as x(n)=x_{1}(n)+jx_{2}(n), 0≤ n≤ N1, then what is the DFT of x_{1}(n)?
If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k), k=0,1,2…N1?
If g(n) is a real valued sequence of 2N points and x1(n)=g(2n) and x2(n)=g(2n+1), then what is the value of G(k), k=N,N1,…2N1?
Decimationin frequency FFT algorithm is used to compute H(k).
How many complex multiplications are need to be performed for each FFT algorithm?
How many complex additions are required to be performed in linear filtering of a sequence using FFT algorithm?
How many complex multiplication are required per output data point?
29 videos76 docs63 tests

Test: DFT Algorithm Computation  1 Test  10 ques 
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 
29 videos76 docs63 tests

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