Unit 4

1. Explain bilinear transformation method of digital filter design. [R.T.U 11, R.U 05] 2. Determine the lowest order of a low pass filter with 1 dB cutoff frequency at 1KHz and minimum attenuation of 40 dB at 5KHz. [R.T.U 11] 3. Design a digital FIR filter using rectangular window where desired frequency response of a low pass filter is given by: [R.T.U 11] Hd(w) | | Where rectangular window is defined as { 4. A digital filter with 1 3dB bandwidth of 0.25 system response is H(s) is to be desined from the analog filter whose is the 3-dB bandwidth of analog filter. Use { | |

where

bilinear transformation to obtain H (z). [R.T.U 10] 5. The desired frequency response of a low pass filter is Hd(e )
jw

| | | |
jw

Determine the frequency response H(e ) for M=7 using a hamming window. [R.T.U 10] 6. Determine H(z) using impulse invariance method for analog system function given by:

H(s) =

[R.U 08]

7. State design steps of FIR filter by rectangular window technique. Give special features of rectangular window FIR filter. [R.U 07] 8. Design a FIR digital filter to approximate an ideal low pass filter with pass band gain of unity, cut-off frequency of 850 Hz and working at a sampling frequency of fs= 5000 Hz. The length of impulse response should be 5. Use rectangular window. [R.T.U 10] 9. Explain the design of FIR filters by Kaiser Window method. [R.U 08,06,03] 10. Design a digital Butterworth filter satisfying the constraints: | ( | ( )| )|

With T=1 sec. using a Bilinear transformation. [R.U 08]

Unit 5
1. Calculate the DFT of a sequence X (n) = 2 [R.T.U 11, R.U 07] 2. Find the four point DFT of the sequence x (n)= cos (n / 4). [R.T.U 11] 3. Derive and draw the flow graph of complete decimation in time decomposition of an 8-pont DFT computation. [R.T.U 11,10] 4. Derive and draw the flow graph of complete decimation in frequency decomposition of an 8pont DFT computation. [R.T.U 10] 5. Find the circular convolution of two finite duration sequences: [R.U 08] X1[n] = (1,-1, 2, 3, 1) X2[n] = (1, 2, 3) 6. Calculate circular convolution of two finite duration sequences by graphical method [R.U 07] a) X1[n] = (2, 1, 4, 5) X2[n] = (4, 1, 2, 3) b) X1[n] = (1, 2, 2, 1) X2[n] = (2, 1, 1, 2) 7. Compute N-point DFT of the signals [R.U 08,06]

a) X(n)= { b) X(n)= 8. Write short note on properties of DFT. [R.U 06,04] 9. Write short note on linear convolution using DFT. [R.U 05,02] 10. By means of DFT and IDFT, determine the circular convolution of the given sequences:
X1[n] = (1, 1, 2, 2) X2[n] = (1, 2, 3, 4) [R.T.U 09, R.U 03]

Unit 1
1. Derive an expression to calculate frequency response of a discrete time system which is compressed by a factor of M. draw the frequency response also. ). [R.T.U 2011, R.U 08,06] 2. Write short note on changing the sampling rate by non-integer values. [R.U 07] 3. Explain the general system for increasing the sampling rate by factor L. [R.T.U 2010] 4. Write short note on sampling of discrete time signals.[R.U 05,02] 5. Explain the general system for discrete-time processing of continuous time signals. Find the effective response of overall continuous time system. [R.T.U 2010]

6. In the discrete time processor of continuous time signal, input to the system is Xc(j)=0 for || 2 (1000) And the discrete time system is a quarter i.e y[n] = x2[n]. What is the largest values of T such that yc(t)=xc2(t). [R.T.U 2010, R.U 03] 7. Consider the system in fig with the following relations Xc(j)=0 for || 2 10 4 x[n]=xc[nT], y[n]= T

xc(t)

C/D

x[n ]

H[ejw]

y[n]

T a) For this system what is the maximum allowable value of t if aliasing is to be avoided. b) Determine h (n) c) In terms of x (ejw), what is the value of y[n] for [R.U 08] 8. In the system Xc(j) and H(ejw) are shown. Sketch and label the Fourier transform of yc(t) : if 1/T1= 2104 and 1/T2=104 [R.T.U 09, R.U 04]

Xc(t)

C/D

H[ejw]

D/C

yc(t)

T1
Xc(t) Xc(j) h(n)

T2
H(ejw)

-25103

25103

-/2

/2

9. The general system for sampling rate increase by L is given in the fig. How is xi (n) related to Xc (t)? Where Xc (t) is the underlying continuous signal. Derive the Fourier transform of Xc [n]. [R.T.U 11,R.U 04]

x(n)
L

xc(n)

Low pass filter gain =L Cut off = / L

xi(n)