Digital Signal Processing (BEC-303)
(Tutorial sheet-I)
1. Illustrate Twiddle factor and its two properties.
2. (i)Find the response of an FIR filter with impulse response h(n)= {1, 2, 4} to the
input sequence x(n) = {1, 2}. {Linear convolution and Circular convolution}
(ii)Find the linear convolution using padding of zero. {(N2 – 1) and (N1 – 1) zeros are
added at the end of h(n) and x(n) respectively. Therefore, h(n) = {1, 2, 4, 0} and x(n) = {1,
2, 0, 0}.} Answer {1,4,8,8)
3. Compute circular convolution x1 (n)∗x2 (n) if x1 (n) = ẟ (n)+ ẟ (n – 1) – ẟ (n – 2) – ẟ (n –
3) and x2 (n)= ẟ (n) – ẟ (n – 2)+ ẟ (n – 4), Given N=5.
4. Compute (a) linear and (b) circular periodic convolutions of the two sequences
x1 (n) ={1, 1, 2, 2} and x2 (n)= {1, 2, 3, 4}.
5. Explain Circular Convolution (Periodic Convolution).
6. Explain Inverse DFT and determine the inverse DFT of X(k)= {1, 2, 3, 4}.
7. Find the 4-point DFT of the sequence x(n)=cos nπ/4.
Answer: X(k)={ 1, 1 – j 1.414, 1, 1 1 j 1.414}
8. Derive the DFT of the sample data sequence x(n)={1, 1, 2, 2, 3, 3}
Answer: X(K)={5/2,-1/2-j1/2,-1/2,-1/2+j1/2}
9. Draw the Digital Signal Processing block diagram. Explain its component.
10. Explain DFT properties: Periodicity, Linearity, and Symmetry.
11. Distinguish between Butterworth and Chebyshev (Type-I) filter.
12. Explain Butterworth filter.
13. Explain Chebyshev filter.
14. Prove that the multiplication of DFTs of two sequences is equivalent to the circular
convolution of the two sequences in time domain.
15. Define Discrete Fourier Transform (DFT) and Inverse Discrete Fourier Transform (IDFT).
Further, find the four-point DFT of the sequence x(𝑛) = {1,5,4,−4}.
16. List the advantages of FFT over DFT and draw the butterfly structure for radix-2 DIF FFT
algorithm for 8−point DFT calculation.
