18-03-2014, 03:49 PM
EC 2302 - Digital Signal Processing Important Questions
1. Compute the DFT of x(n) = , 0≤ n≤ 5.
2. Prove the following properties of DFT when X (K) is the DFT of an N-point sequence h(n) .
a) X (K) is real and even when x(n) is real and even.
b) X(K) is imaginary and odd when x(n) is real and odd.
3. Determine the IDFT of X(K) =
4. Perform the linear convolution of finite duration sequences h(n) and
x (n) = by overlap – add method
5. Compute the N-point DFT of x(n) =
6. Compute the 8-point DFT of the sequence
x(n) = using radix-2 DIT algorithm.
7. Compute an IDFT of the following sequence
X(K) = using DIF algorithm.
UNIT II
1. Design a chebyshev low pass filter with the specifications = 1db ripple in the pass band 0≤ ω ≤ 0.2π , = 15 db ripple in the stop band 0.3π ≤ ω ≤ π using Bilinear transformation
2. Using bilinear transformation design a digital band pass Butterworth filter with the following specifications
Sampling frequency of 8 KHz
=2 db in the pass band 800Hz f 1000 Hz
= 20 db in the stop band 0 f 400 Hz and 2000Hz f ∞
3. Design a chebyshev low pass filter with the specifications