Академический Документы
Профессиональный Документы
Культура Документы
Prove the following properties of DFT when X (K) is the DFT of an Npoint 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) =
5. Compute the N-point DFT of
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 f 1000 Hz f = 20 db in the stop band 0 400 Hz and 2000Hz
= 1 db ripple in the pass band 0 0.2 = 15 db ripple in the stop band 0.3
Using Bilinear Transformation 4. For the given specifications design a digital high-pass filter using BLT
i) ii) iii)
iii)
UNIT III 1. An a FIR filter is given by the difference equation y(n) = 2 x(n) + x(n-1) + x(n-2) + x(n-3) .
Using Hamming window with N= 7. Draw the frequency response. 3. For the desired response
( Determine H( window
1. Find the steady state variance of the noise in the output due to
quantization of input for the first order filter y(n) = ay(n-1) + x(n) 2. Study the limit cycle behavior of the following system and find the dead band of the filter. y(n)= 0.65 y(n-2) +0.52 y(n-1) +x(n) 3. Derive the quantization Noise power from a digital system
(Z) . (Z) =
(Z) Where
= 0.5 and