If x(n) is a finite duration sequence of length L, then the discrete Fourier transform X(k) of x(n) is given as:
If X(k) discrete Fourier transform of x(n), then the inverse discrete Fourier transform of X(k) is:
1 Crore+ students have signed up on EduRev. Have you? Download the App |
A finite duration sequence of length L is given as x(n) =1 for 0≤n≤L-1=0 otherwise , then what is the N point DFT of this sequence for N=L?
Which of the following is true regarding the number of computations requires to compute an N-point DFT?
What is the DFT of the four point sequence x(n)={0,1,2,3}?
If X(k) is the N point DFT of a sequence whose Fourier series coefficients is given by ck, then which of the following is true?
What is the DFT of the four point sequence x(n)={0,1,2,3}?
32 videos|76 docs|63 tests
|
32 videos|76 docs|63 tests
|