Showing posts with label Semester 7. Show all posts
Showing posts with label Semester 7. Show all posts

Saturday, August 9, 2014

DISCRETE TIME SIGNAL PROCESSING (DTSP) Semester 7 (3 Hours) May 2014

DISCRETE TIME SIGNAL PROCESSING
DISCRETE TIME SIGNAL PROCESSING (DTSP)
Semester 7
(3 Hours) May 2014
    MV-19989 
   [Total Marks : 100]
       
N.B. : (1) Question No. 1 is compulsory.  
  (2) Attempt any four questions out of remaining six questions.  
  (3) Assumptions made should be clearly stated.  
  (4) Figures to the right indicate full marks.  
       
1. (a) Obtain a digital filter transfer function H(ω) by applying Imputse invariance transformation on the analog TF.

Ha(s) = s/s2 + 3s + 2 Use fs = 1 K samples/sec.

05
  (b) Consider a filter with TF :
     H(z) = (z-1 - a) / (1 - az-1)
Identify the type of filter and justify it.
05
  (c) Find the number of complex multiplications and complex additions required to find DFT for 32 point sequence. Compare them with the number of computations required if FFT algorithm is used. 05
  (d) Consider the sequence x(n) = δ(n) + 2δ(n - 2) + δ(n -3).
Find DFT of x(n).
05
       
2. (a) A sequence is given as x(n) = {1 + 2j, 1 + 3j, 2 + 4j, 2 + 2j}
     (i) Find X(k) using DIT-FFT algorithm.
     (ii) Using the results in (i) and not otherwise find DFT of p(n) and q(n) where
             p(n) = { 1, 1, 2, 2}
             q(n) = { 2, 3, 4, 2}
06
  (b) X(K) = +36, -4 + j9.656, -4 + j 1.656, -4, -4 -j 1.656, -4 -j4, -4 -j9.656
Find x(n) using IFFT algorithm (use DIT IFFT).
10
  (c) Explain the properties of symmetricity and periodicity of phase factor. 04
       
3. (a) By means of FFT-IFFT method (DIT algo) Compute Circular convolution of
     x(n) = {2, 1, 2, 1}     h(n) = {1, 2, 3, 4}
08
  (b) An 8 point sequence x(n) = {1, 2, 3, 4, 5, 6, 7, 8}
 
(i) Find X(K) using DIF FFT algorithm
(ii) Let x1(n) = {5, 6, 7, 8, 1, 2, 3, 4} Using appropriate DFT property and answer of previous part, determine  x1(K)
(iii) Again use DFT property and find  X2(K) where  x2(n) = x(n) +  x1(n).
12
       
4. (a) Draw the Lattice filter realization for the all pole filter

     H(z) = 1/1+3/4z-1 +1/2z-2 +1/4z-3

10
  (b) Obtain DF-I, DF-II, cascade (First order sections) and parallel (First order sections) structures foe the system describe by
     y(n) = -0.1 y( n -1) +0.72 y(n - 2) + 0.7 x(n) - 0.252 x(n -1).
10
     
5. (a) Design a  FIR low pass digital filter using Hamming window for N = 7
 Hd(ejw) = e-3jω -0.75Π < ω < 0.75Π
                =0 0.75Π < | ω | < Π
10
  (b) A LPF has following specifications :-
0.8 <  | H (ω | < 1 for   0 < ω < 0.2Π
          | H(ω | < 0.2 for   0.6Π  < ω <  Π

Find filter order and analog cut off frequency if
  (i) Bilinear transformation is used for designing
  (ii) Impulse invariance is used for designing

10
       
6. (a) Explain up sampling by an integer factor with neat diagram and waveforms. 10
  (b) Explain the need of a low pass filter with a decimator and mathematically prove that ωy = ωxD. 10
       
7. Write notes on any four of the following :- 20
  (a) Frequency sampling realization of FIR filters  
  (b) Goertzel algorithm  
  (c) Set top box for digital TV reception  
  (d) Adaptive echo cancellation  
  (e) Filter banks.  

Thursday, August 7, 2014

DISCRETE TIME SIGNAL PROCESSING (DTSP) Semester 7 (3 Hours) December 2013

DISCRETE TIME SIGNAL PROCESSING
DISCRETE TIME SIGNAL PROCESSING (DTSP)
Semester 7
(3 Hours) December 2013
    LJ-13936 
   [Total Marks : 100]
       
N.B. : (1) Question No. 1 is compulsory.  
  (2) Attempt any four questions out of remaining six questions.  
  (3) Assumptions made should be clearly stated.  
       
1. (a) Transfer functions of casual and stable digital filters are given below. State whether these filters are
Minimum . Maximum / Mixed Phased filters
 
(i) H1(Z) (1-1/2z)(1-1/4z)
________________
(Z-1/3)(Z-1/5)
(ii) H2(Z) (1-1/2z)(1-1/4z)
_________________
(Z-1/3)(Z-1/5)
(iii) H3(Z) (1-1/2z)(1-1/4z)
_________________
(Z-1/3)(Z-1/5)
20
  (b) Compute DFT of the sequence X1,(n) = {1, 2, 3, 4} using property and not otherwise compute DFT of X2,(n) = {1+j, 2+2j, 4+4j, 2+2j}  
  (c) The impulse response of a system is h(n) = an u(n), a ≠ 0. Determine a and sketch pole zero plot for this system to act as :-

  (i) Stable low pass filter.
  (ii) Stable high pass filter.
 
  (d) Draw direct form structure for a filter with transfer function,
H(z) = 1 + 3z-1 +2z-3 + 4z-4
 
       
2. (a) Consider a filter with impulse response, h(n) = {0.5, 1, 0.5}. Sketch its amplitude spectrum. Find its response to the inputs

  (i) X1(n) = cos (nΠ/2)
  (ii) X2(n) = 3 + 2 δ (n) -4 cos (nΠ/2)
10
  (b) Determine circular convolution of x(n) = {1,2,1,4} and h (n) = {1,2,3,2} using time domain convolution and radix-2FFT. Also find circular correlation using time domain correlation. 10
       
3. (a) Explain overlap and add method for long filtering. Using this method find output of a system with impulse response, h(n) = {1,1,1} and input x(n) = {1, 2, 3, 3, 4, 5}. 10
  (b) Compute DFT of a sequence, x(n) = {1,2,2,2,1,0,0,0} using DIF-FFT algorithm. Sketch its magnitude spectrum. 10
       
4. (a) Draw lattice filter realization for a filter with the following transfer function.
H(z) = 1/1 + 13/24Z-1 +5/8z-2 +1/3z-3
10
  (b) Design a low pass Butter worth filter with order 4 and passband cut off frequency of 0.4Π. Sketch pole zero plot. Use Bilinear transformation. Draw direct form II structure for the designed filter. 10
     
5. (a) Design an FIR Bandpass filter with the following specifications :-
     Length : 9
     stop band cut off frequency : 0.7Π
     Use Hanning window.
10
  (b) The transfer function of a filter has two poles at z=0, two zeroes at z=-1 and a dc gain of 8. Final transfer function and impulse response.

Is this a casual or noncasual filter?
is this a linear phase filter?
If another zero is added at z =-1 find transfer function and check whether it is a linear phase filter or not.
10
       
6. (a) Transfer function of an FIR filter is given by H(z) = 1-z-N
Sketch pole zero plots for N = 4 and N = 5
Prove that it is a comb filter.
10
  (b) Write about frequency sampling realizationof FIR filters. 10
       
7. (a) Explain the process of decimation for reducing sampling rate of signal. 10
  (b) Compare various windows used for designing FIR filters. 10

DISCRETE TIME SIGNAL PROCESSING (DTSP) Semester 7 (3 Hours) May 2013

DISCRETE TIME SIGNAL PROCESSING
DISCRETE TIME SIGNAL PROCESSING (DTSP)
Semester 7
(3 Hours) May 2013
    GS-5332 
   [Total Marks : 100]
       
N.B. : (1) Question No. 1 is compulsory.  
  (2) Attempt any four questions out of remaining six questions.  
  (3) Assumptions made should be clearly stated.  
  (4) Assume any suitable data wherever required but justify the same.  
  (5) Figures to the right indicate marks.  
  (6) Illustrate the answer with sketches wherever required.  
  (7) Answer to the questions should be grouped and written together  
  (8) Use Blue/Black ball ink pen to write answers. Use of pencil should be done only to draw sketches and graphs.  
       
1. (a) Assume that a complex multiplier takes 1 micro sec to perform one multiplication and that the amount of time to compute a DFT is determined by the amount of time to perform all the multiplications.

  (i) How much time does it take to compute a 1024 point DFT directly?
  (ii) How much time is required is FFT is used?

05
  (b) Let h[n] be the unit impulse response of a Low Pass filter with a cutoff frequency ωc, What type of filter has a unit sample response g[n] = (-1)u h[n]. 05
  (c) A two pole low pass filter has the system function H(z) = b0/(1-pz-1)2 Determine the values of  b0 and P such that the frequency response H(ω) satisfies the condition
| H(0) | = 1 and | H(Π/4)2 | = 1/2
05
  (d) Consider filter with transfer function. Identify the type of filter and justify it.
 
  H(z) = Z-1 - a
__________________
     1 - az-1
05
       
2. (a) the unit sample response of a system is h(n)={3,2,1} use overlap-add method of linear filtering to determine output sequence for the repeating input sequence x[n] =
{2,0,-2,0,2,1,0,-2,-1,0}
10
  (b) For a given sequence x(n) = {2,0,0,1}, perform following operations:-
 
(i) Find out the 4 point DFT of x(n)
(ii) Plot x(n), its periodic extension XP(n) and XP(n-3)
(iii) Find out 4 point DFT of Xp(n-3)
(iv) Add phase angle in (i) with factor -[2Πrk/N] where N=4, r=3 k=0, 1, 2, 3
(v) Comment on the result you had in point (i) and (ii)
10
       
3. (a) The transfer function of discrete time casual system is given below:-
 
H(z) = 1-z-1
__________________
   1 - 0.2z-1 - 0.15z-2
(i) Find the difference equation
(ii) Draw cascade and parallel realization
(iii) Show pole-zero diagram and then find magnitude at ω = 0 and ω = Π
(iv) Calculate the impulse the laesponse of the system.
10
  (b) Obtain the lattice realization for the system :
 
  H(z) = 1 + 3z-1 + 3z-2 + z-3
__________________
     1+3/4z-1 + 1/2z-2 + 1/4z-3
10
       
4. (a) What is linear phase filter? What conditions are to be satisfied by the impulse response of an FIR system in order to have a linear phase? Plot and justify compulsory zero locations for symmetric even ant symmetric even and antisymmetric odd FIR filters. 10
  (b) Determine the zeros of be following FIR system and indicate whether the system is minimum phase, maximum phase, or mixed phase.
 
H1(z) = 6 + z-1 - Z-2
H2(z) = 1 - z-1 - 6z-2
H1(z) = 1 - 5/2z-1 - 3/2z-2
H1(z) = 1 + 5/3z-1 - 2/3z-2

Comment on the stability of the minimum and maximum phase system

10
     
5. (a) A digital low pass filter is required to meet the following specifications :-
 
Pass Band ripple : < 1dB
Pass Band edge : 4 KHz
Stop Band attenuation : > 40 dB
Stop Band edge : 8 KHz
Sampling rate : 24 KHz

Find order, cutoff frequency and pole locations for Butterworth filter using bilinear transformation

10
  (b) Design an FIR digital filter to approximate an ideal low-pass filter with passband gain of unity, cut-off frequency of 950 Hz and working at a sampling frequency of Fs = 5000 Hz. The length of the impulse response should be 5. Use a rectangular window. 10
       
6. (a) Explain the need of a low pass filter with a decimator and mathematically prove that
ωy = ωxD
10
  (b) Why is the direct form FIR structure for a multirate system inefficient? Explain with neat diagrams how this inefficency is overdone in implementing a decimator and an interpolator. 10
       
7. Write notes on any four of the following :- 20
  (a) DTMF detection using Goertzel algorithms  
  (b) Filter banks  
  (c) Comparison of FIR and IIR filters  
  (d) Split radix FFT  
  (e) Optimum Equiripple Linear phase FIR filter design.  

Wednesday, August 6, 2014

DISCRETE TIME SIGNAL PROCESSING (DTSP) Semester 7 (3 Hours) December 2012

DISCRETE TIME SIGNAL PROCESSING
DISCRETE TIME SIGNAL PROCESSING (DTSP)
Semester 7
(3 Hours) December 2012
    KR-1068 
   [Total Marks : 100]
       
N.B. : (1) Question No. 1 is compulsory.  
  (2) Attempt any four questions out of remaining six questions.  
  (3) Assumptions made should be clearly stated.  
       
1. (a) Periodic analog signal will be always remain periodic when converted into digital signal. Is it true and false? Justify your answer. 05
  (b) Frequency domain representation of a periodic discrete time signal is a periodic. It is true or false? justify your answer. 05
  (c) Obtain the pole-zero plot of casual symmetrical linear phase FIR filter with odd number of coefficients, assuming smallest length, if it is known to have zeros at
z = j, z = 1, z = -1.
05
  (d) A high pass linear phase FIR filter has a magnitude response -
    | H(ejw) | = 4 sin(aw) - 3 sin(bw)
Find values of 'a' and 'b' assuming minimum value of N. Obtain corresponding impulse response.
05
       
2. (a) Classify the following (i.c. (A), (B) and (C) ) as --
  (i) Linear phase/Non-linear phase
  (ii) FIR/IIR
  (iii) All pass/high pass/low pass/band pass
  (iv) Stable/unstable --

           (A) H(ejw) = 3e-2jw
           (B) H(Z) = z + 0.6/z - 0.8
           (C) Given following pole-zero plot.

12
  (b) Determine the zeros of the following FIR system and indicate whether the system is minimum phase, maximum phase or mixed phase.

  (i) H(z) = 6 + z-1 + z2
  (ii) H(z) = 1  z1 + 6z-2
  (iii) H(z) = 1 - 5/2z-1 - 3/2z-2
  (iv) H(z) = 1 - 5/6z-1 - 1/3z-2

08
       
3. (a) Design a casual digital high pass filter using windowing technique to meet the following specifications :-
 
Passband edge (ΩP) : 9.5 kHz
Stoband edge : 2 kHz
Stopband attenuation : > 40 dB
Sampling frequency : 25 kHz
10
  (b) Obtain the analog transfer function of a Butterworth low-pass filter with following specifications :-
 
Passband edge (ΩP) = 250 rad/sec.
Passband attenuation < 0.1 dB
Stopband edge (ΩS) = 2000 rad/sec.
Stopband attenuation < 60 dB
10
       
4. (a)   (i) If x(n) = { 1 + 2j, 3 + 4j, 5 + 6j, 7 + 8j}. Find DFT X(k) using DIFFFT.
  (ii) Using the result obtained in (i) above not otherwise, find DFT of following
       sequence :-
          X1(n) = { 1, 3, 5, 7 } and
          X1(n) = { 2, 4, 6, 8 }
10
  (b) Obtain direct from I, direct form II realization to second order filter given by --
     y(n) = 2 b cos(w0) y(n-1) - b2 y(n-2) + x(n) - b cos(w0) x(n-1)
10
     
5. (a) Using linear convolution find y(n) for the sequence -
     x(n) = { 1, 2, -1, 2, 3, -2, -3, -1, 1, 2, -1} and h(n) = {1, 2}
Compare the result by solving the problem using overlop and add method.
10
  (b) Find the response of the difference equation given by -
   y(n) = 5y(n-1) -6y(n-z) +-X(n) for x(n) = u(n).
10
       
6. (a) Explain up-sampling by an integer factor with neat diagram and waveforms. 10
  (b) Why is the direct form FIR structure for the multirate system inefficient ?
Explain with neat diagram. how this inefficiency is overcome in implementing a decimator and an interpolator.
10
       
7. Write notes on any four of the following :- 20
  (a) Frequency sampling realization of FIR filters  
  (b) Goertzel algorithm  
  (c) Set-top box for digital TV reception  
  (d) Adaptive echo-cancellation  
  (e) Comparison of FIR and IIR filters.  

Tuesday, August 5, 2014

DISCRETE TIME SIGNAL PROCESSING (DTSP) Semester 7 (3 Hours) May 2012

DISCRETE TIME SIGNAL PROCESSING
DISCRETE TIME SIGNAL PROCESSING (DTSP)
Semester 7
(3 Hours) May 2012
    GN-6380 
   [Total Marks : 100]
       
N.B. : (1) Question No. 1 is compulsory.  
  (2) Attempt any four questions out of remaining six questions.  
  (3) Assume any data wherever required but justify the same.  
       
1. (a) Show that FIR filters are linear phase filters. Define group delay and phase delay. 08
  (b) Find the response of the system given by difference equation
y(n) - 5y(n-1) + 6y(n-2) = x(n) for i) x(n) = δ(n) and ii) x(n) = U(n)
06
  (c) Draw Direct form and direct form -II realization of the system given
by
y(n)-3/4 y(n-1) + 1/8. y(n-2) =x(n) + 1/3.x(n-1)
06
       
2. (a) Derive Radix-2 Decimation in Time Fast Fourier Transform and draw its' signal flow graph 10
  (b) Design FIR digital filter by using window method for the following specifications :-
 
 H(ejw)= e-j3w -3Π/4  < ω < 3Π/4
| H(ejw) = 0 ; 3 Π/4 < |ω| <  Π

Use hamming window of length = 7
10
       
3. (a)
  If      Hd( ω) = 1       for 0 < f < 800 Hz and
|         Hd( ω) = 0       for f > 800 Hz.

Given that sampling frequency Fs = 5000Hz Design FIR filter for length M = 5 using Bartiett window.
 

10
  (b) Find 8-point FFT of x(n) = {1, 2, 2, 2, 1} using signal flow graph of Radix-2
Decimation in frequency FFT.
10
       
4. (a) Design a digital Butterworth filter satisfying the following constraints.
 
0.9 <  | H(ejw) | < 1 ; 0 < ω < Π/2
          | H(ejw) | < 0.2 ; 3 Π/4 <ω <  Π

With sampling period T = 1 sec, use Bilinear transformation method.

12
  (b) State and  device Goertzel algorithm, also state its application. 08
     
5. (a) For the analog transfer function

H(s) = 3/(s+2) (s+3)
Determine H(z) with sampling period T = 0.1 sec using

  (i) Impulse Invariant method
  (ii) Bilinear Transformation method.

10
  (b) Describe the application Goertzel algorithm in dual tone multi-frequency detection. 10
       
6. (a) With a suitable block diagram describe sub-band coding of speech signals. 10
  (b) With a neat diagram describe frequency sampling realization of FIR filters. 10
       
7. (a) Explain up-sampling by non-integer factor, with a neat diagram and waveforms 10
  (b) Explain the application of DTSP in adaptive echo cancellation. 05
  (c) Describe the concept of digital resonator. 05

DISCRETE TIME SIGNAL PROCESSING (DTSP) Semester 7 (3 Hours) December 2011

DISCRETE TIME SIGNAL PROCESSING
DISCRETE TIME SIGNAL PROCESSING (DTSP)
Semester 7
(3 Hours) December  2011
    MP-5689 
   [Total Marks : 100]
       
N.B. : (1) Question No. 1 is compulsory.  
  (2) Attempt any four questions out of remaining six questions.  
  (3) Assume any data wherever required but justify the same.  
  (4) Figures to the right indicate full marks.  
       
1. (a) Derive the Parsevel's Energy relation. State the significance of Parsevel's theorem. 05
  (b) One of zeros of a Causal Linear phase FIR filter is at 0.5 ej 10
  (c) A two pole pass filter has the system function H(z)= b0/(1-Pz-1)2 Determine the values of b0 and P. Such that the frequency response H(w) satisfies the condition
H(0) = 1 and | H(Π/4) |2 = 1/2.
05
  (d) Consider the signal x(n) = anu (n), |a| < 1 :-
     (i) Determine the spectrum.
     (ii) The signal x(n) is applied to a decimator that reduces the rate by a factor 2.
           Determine the output spectrum.
05
       
2. (a) An analog signal Xa(t) is band limited to the range 900 < F < 1100 Hz. it is used as an input to the system shown in figure. In this system, H(w) is an ideal lowpass filter with cut-off frequency Fc = 125 Hz.


  FS= 1/TS =2500                    FY.= 1/Ty=250
  (i) Determine and sketch the spectra x(n), w(n), v(n) and y(n).
  (ii) Show that it is possible to obtain y(n) by sampling Xa(t) with period T=4
        millisecond.
10
  (b) Derive and draw the FET for N = 6 = 2.3 use DITFFT method.
     x(n) = { 1  2  3  1  2  3 }
                  ↑
find x(k) using DITFFT for N = 6 = 2.3.
10
       
3. (a) Design a digital Butterworth low pass filter satisfying the following specifications using bilinear transformation. (Assume T = 15)
 
0.9 <  | H(ejw) | < 1 ; 0 < W < Π/2
          | H(ejw) | < 0.2 ; 3 Π/4 < W <  Π
10
  (b)   (i) If x(n) = { 1 +5j, 2 +6j, 3 + 7j, 4 +8j}. Find DFT X(K) using DIFFT.
  (ii) Using the results obtained in (i) not otherwise, find DFT of following sequences:
           X1(n) = { 1, 2, 3, 4} and  X2(n) = { 5, 6, 7, 8}.
08
       
4. (a) Consider the realization of system shown in figure.

 
(i) Obtain System Function. 04
(ii) Obtain Difference Equation. 02
(iii) Find the impulse response of system. 03
(iv) Draw pole-zero  plot and comment on system Stability. 03
 
  (b) Derive the Expression for impulse invariance technique for obtaining transfer function of digital filter from analog filter.
Derive the necessary equation for relationship between frequency of analog and digital filter.
08
     
5. (a) What do you mean by inplace computations in FFT algorithms? 04
  (b) Find number of Real additions and multiplications required to find DFT for 82 point. Compare them with number of computations required if FFT algorithms is used. 04
  (c) Design a digital Chebyshev filter to satisfy the following constraints :-
 
0.707 <  | H(ejw) | < 1 ; 0 < W <  0.2Π
          | H(ejw) | < 0.1 ; 0.5 < W <  Π

Use bilinear transformation and assume T = 1 second.

12
       
6. (a) Given x(n) = n + 1 and N = 8, find DFT X(K) using DIFFT algorithms. 08
  (b) Obtain direct form l, Direct form ll realization to second order filter given by --
     y(n) = 2b cos w0y(n-1) - b2y (n-2) +x(n) - b cos w0x(n-1).
08
  (c) Explain the concept of decimation by integer (M) and interpolation by integer factor (L). 04
       
7. (a) Write short note on set top box for digital TV receiver. 04
  (b) Application of Signal Processing in Radar. 04
  (c) What is linear phase filter? What condition are to be satisfied by the impulse response of an FIR system in order to have a linear phase? Define phase delay and group delay. 08
  (d) Short note on Frequency Sampling realization of FIR filters. 04

Saturday, August 2, 2014

DATA COMPRESSION AND ENCRYPTION (DCE) DECEMBER 2011 [ELECTIVE] ELECTRONICS AND TELECOMMUNICATION SEMESTER 7

DATA COMPRESSION AND ENCRYPTION (DCE) DECEMBER 2011  [ELECTIVE] ELECTRONICS AND TELECOMMUNICATION SEMESTER 7

Con. 6862-11.                    (REVISED COURSE)                                             MP-5683
                                                   (3 Hours)                                            [Total Marks : 100]

N. B. : (1) Question Number 1 is Compulsory.
           (2) Attempt any four questions out of remaining six questions.

1. (a)What is the need of compression.5
    (b)Discuss the application of JPEG 2000.5
    (c)Compare Cryptography and steganography.5
    (d)What is Secure Electronic Payment System.5

2. (a)

A source emits letter from an alphabet A= { a1, a2, a3, a4, a5) with

10
probabilities P(a1) = 0.15 , P(a2) = 0.04 , P(a3) = 0.26 , P(a4) = 0.05
and P(a5=0.05.
a) Calculate the entropy of this source
b) Find the Huffman code for this source.
c) Find the average length of the code in
d) and its redundancy.
    (b)Explain ADPCM Encoder and Decoder for audio compression10

3. (a)

Describe the features of video compression as compared to image

10
compression. Explain MPEG industry standards for video compression.
    (b)The o/p of the LZW encoder is the following sequence5


Decode the sequence.
    (c)Discuss in brief lossless audio compression5

4. (a)

Explain the working of DES with block diagram

10
    (b)Discuss and explain security attacks on the system.10

5. (a)

Explain algorithms for RSA using Chinese Remainder Theorom

10
    (b)Discuss Classical Encryption Techniques.10

6. (a)

Explain Hash and MAC algorithms used for authentication.

10
    (b)Discuss certificate based and biometric system.10

7.

Write short notes on any three :-

20
     (a) Approaches to Image Compression.
     (b) S-Box Design.
     (c) Digital signatures.
     (d) Performance and quality measures for compression.

DISCRETE TIME SIGNAL PROCESSING (DTSP) Semester 7 (3 Hours) December 2010

DISCRETE TIME SIGNAL PROCESSING
DISCRETE TIME SIGNAL PROCESSING (DTSP)
Semester 7
(3 Hours) December  2010
    GT-8904 
   [Total Marks : 100]
       
N.B. : (1) Question No. 1 is compulsory.  
  (2) Attempt any four questions out of remaining six questions.  
  (3) Assume any data wherever required but justify the same.  
  (4) Figures to the right indicate full marks.  
       
1. (a) A discrete time invariant and linear is describe by the difference equation -
 

y(n) = x(n) +2 x(n-1) +x(n-2)

Obtain (i) Impulse response
  (ii) Frequency response
  (iii) Sketch magnitude and phase response
  (iv) System response to the input (-)Π Π u(n).
10
  (b) Explain the concept of decimation by integer (M) and interpolation by integer factor (L). 10
       
2. (a) Find DFT of the sequence using DIT FFT -
     x[n] = { 1, -2, 2, 2, 1, 3, -3, 4, 5}
10
  (b) Convert the analog filter with system function --
   
  H(s) =
     s+0.1
___________
into a digital IIR filter using bilinear transformation. The
digital filter should have a resonant frequency of w=Π/4
(S + 0.1)2 + 9
10
       
3. (a) A filter is to be designed with the following desired frequency response
 
Hd (ejw) = { 0         ; - Π/4 < w <  Π/4
(ejw))   ;  Π/4 < | W | <  Π/4

Determine the filter coefficients using Hamming window.

10
  (b) Consider a casual LTI system which is defined by system function
 
  H(s) =
    1 + 1.4 Z-1
_____________________________
(1+1/2 Z-1 ) (1+1/2 Z-1 +1/4Z-2 )
10
  (c) Obtain 01-I, DF-II, cascade and parallel realization structures.  
       
4. (a) The frequency response of low pass filter is given by -
 
H (ejw) = { (ej3w)           ; - 0 < w < Π/2
0                  ;  Π/2 < | W | <  Π

Realize the above filter using frequency sampling realization technique.

10
  (b) Develop DIT FFT algorithm for N = 6 = 2.3 using split-radix method. 10
     
5. (a) The unit sample response of a system is h[n] = {3, 2, 1} use overlap-add method of linear filtering to determine output sequence for the repeating input sequence
x [n] = {2, 0, -2, 0, 2, 1, 0, -2, -1, 0}
10
  (b) Explain the subband coding of speech signal as an application of mutirate signal processing. 10
       
6. (a) Design a digital butterworth filter that satisfies the following constraint using bilinear transformation Assume T = 1 sec.
 
0.9 <  | H(ejw) | < 1 ; 0 < W < Π/2
          | H(ejw) | < 0.2 ; 3 Π/4 < W <  Π
10
  (b) Draw  pole-zero plot and sketch magnitude and phase response of finite impulse response fitter which is given by.
      h[n] = (0.5)   ; 0 < n < 7
10
       
7. Write short note on (any three)  :- 20
  (a) Multistage approached to sampling rate conversion.  
  (b) Adaptive television echo cancellation.  
  (c) Goertzel Algorithm  
  (d) Digital resonator.  

 

DISCRETE TIME SIGNAL PROCESSING (DTSP) Semester 7 (3 Hours) may 2010

DISCRETE TIME SIGNAL PROCESSING
DISCRETE TIME SIGNAL PROCESSING (DTSP)
Semester 7
(3 Hours) may 2010
    AN-2854 
   [Total Marks : 100]
       
N.B. : (1) Question No. 1 is compulsory.  
  (2) Attempt any four questions out of remaining six questions.  
  (3) Assume any data wherever required but justify the same.  
  (4) Figures to the right indicate full marks.  
       
1. (a) Sketch the pole-zero plot for the system with transfer functions
 
H(z) = Z6 - 26 if the system is stable.
Z5 - (Z - 2)
05
  (b) One of the zeros of a casual linear phase FIR filter is at 0.5 ej Π/3. Show the locations of the other zeros and hence find the transfer function and impulse response of the filter. 05
  (c) Derive the relationship between DFT and DCT. 05
  (d) Find the convolution of the following signals and system transfer function using Z-transform.
X[n] = δ[n] + δ[n - 1] and h[n] = (1/2)n u(n).
05
       
2. (a) Using DIF FFT find DFT of following dequence
      x[n] = {1, 3, - 2, 4, 1, - 2, + 3}
10
  (b) ,
(i) Using results in Q2(a) find X2(k) if
      X2[n] = x[n -2]
05
(ii) Using results in Q2(a) find X3(k) if
      X3[n] = x*[n]
05
       
3. (a) Design a digital Butterworth low pass filter satisfying the following specifications using bilinear transformation (Assume T = 1 sec)
 
0.9 <  | H(ejw) | < 1 ; 0 < W < Π/2
          | H(ejw) | < 0.2 ; 3 Π/4 < W <  Π
10
  (b) Derive and draw the FFT  for N = 6 = 2.3 using DIT FFT method. 10
       
4. (a) Determine the filter coefficients h[n] for the desired frequency response of a low pass filter.
 
Hd (ejw) = { e-j2w ; - Π/4 < w <  Π/4
0      ;  Π/4 < | W | <  Π

use Hamming window.

10
  (b) The difference equation of the system is given by :
     y[n] = 3y[ n-2] + 2y[n-1] + x[n] and

     x[n] = (1/2)n u[n] with y(-1) =y(-2) = 1

Determine :
   (i) Zero input response
   (ii) Zero state response
   (iii) Total response.
10
     
5. (a) For direct form-II realization of IIR filter, find :
 
(i) Transfer function of the filter
(ii) Difference equation
(iii) Impulse response of the filter
(iv) Step response of the filter
(v) Pole-zero plot of the filter
(vi) State whether filter is stable or not and why?

12
  (b) Convert the analog filter into digital filter by using impulse invariance transformation method.
            Ha(s) = s+0.4/(s+0.4)2 + 9
08
       
6. (a) With the help of block diagram, explain TMS 320 (5x series of processors). 10
  (b) Design a digital resonator with a peak gain of unit at 50 Hz and 3 dB bandwidth  of 6 Hz assuming a sampling frequency of 300 Hz. 10
       
7. Write short note on the following :- 20
  (a) Filtering of long data sequences  
  (b) Geortzel Algorithm  
  (c) Frequency wrapping  
  (d) Coefficient Quantization in IIR filter.  

Friday, August 1, 2014

DATA COMPRESSION AND ENCRYPTION (DCE) DECEMBER 2012 [ELECTIVE] ELECTRONICS AND TELECOMMUNICATION SEMESTER 7

DATA COMPRESSION AND ENCRYPTION (DCE) MAY 2012  [ELECTIVE] ELECTRONICS AND TELECOMMUNICATION SEMESTER 7

Con. 8490-12.                                                                                    KR-1980
                                                       (3 Hours)                                              [Total Marks : 100]

N.B. : (1) Question No. 1 is Compulsory.
          (2) Attempt any four questions out of remaining six questions.
          (3) Assume suitable data if needed.
          (4) Figures to be right indicates full marks.

1. (a)Brief explain Modelling and coding with respect to data compression.5
    (b)Explain the principle of Public Key Cryptography.5
    (c)Explain the working principle of Arithmatic Coding with suitable example.5
    (d)Expalin Chinese remainder theorem.5

2. (a)

Define the following terms :-

10
       (i) Compression Ratio
       (ii) Distrotion
       (iii) Compression Rate
       (iv) Fidelity and Quality
       (v) Self information.
    (b)Explain Diffie - Hellman key exchange algorithm with example.10

3. (a)

What is adaptive dictionary based coding. Explain any one method.

10
    (b)What is the signifiance of 'prime number' is public key cryptography ? Explain10
RSA algorithm with a suitable example.

4. (a)

Explain DPCM and ADPCM techniques used in audio compression.

10
    (b)What is Malicious Programe ? Explain different types of malicious programmes.10

5. (a)

Explain audio encoder and decoder used in MPEG.

10
    (b)Explain Digital Immune System.10

6. (a)

Design Huffman code for a source which generate letters from an alphabet.

10


    Also calculate entrophy of the source.
    (b)What is message digiest ? Explain HMAC algorithm.10

7.

Write short notes on any two :-

20
      (a) JPEG 2000
      (b) Key Distribution Centre
      (c) Fire wall Design
      (d) Difference between :-
                   (i) Lossy and Lossless compression
                   (ii) Audio Compression and Image Compression.