Assignment 4

1. Prove the properties of twiddle factor?

2. Prove circular convolution and time reversal property?
3. Prove circular symmetry and linearity property?
4. Compare DFT and DTFT?
5. Compute DFT of the following sequences?
i) x1(n) = {0,1,2,3} for N=4
ii) x2(n) = {1,1,1,1} for N=8
iii) x3(n)= δ(n)
iv)x4(n) = an for 0<=n<=N-1

6. Find the circular convolution for the following?

i) x(n)={1,1,1,1} & h(n)={1,0,1}
ii) x1(n)={1,5,1,5} & x2(n)={1,0,1,0}
7. Find the linear convolution for the following?
iii) x(n)={1,1,1,1} & h(n)={1,0,1}
iv)x1(n)={1,5,1,5} & x2(n)={1,0,1,0}

8. Compare the result of Q No. 6 & 7 and obtain the same result from both type of
convolution.
9. The first five points of the 8-point DFT of a real valued sequence are {1, 2, 0, 0,
3}. Determine the remaining three points of the DFT.
10. What do you mean by FFT? Differentiate between DIT and DIF FFT
algorithm. State and prove the symmetry and periodicity properties of complex
exponential sequence .Explain how these properties are used in FFT algorithms.
11. Compare the computational complexity of FFT and DFT? Also explain the in-
place computation?
12. (i) Compute DFT using FFT algorithm for x{n}={1,2,3,4}
(ii) If y{n}=x{-n} then, without performing FFT, find Y{k}.