Project Enquiry form

Get Done Your Projects Easily

Tuesday, 25 March 2014

ADVANCED DIGITAL SIGNAL PROCESSING 16 MARK QUESTIONS


   

16 MARKS:
UNIT I: DISCRETE RANDOM SIGNAL PROCESSING
(16 marks)
  1. i)Derive the power spectral density of the random process.                (10)
ii) Determine the power spectrum of a WSS process having autocorrelation sequence rv(k)=(1/2)(A2coskω).                                    (6)
  1. Explain Spectral factorization. What is regular process? State the properties of regular process.                                             (16)
  2. Explain filtering random processes.                            (16)
  3. i) Obtain the filter to generate a random process with a power spectrum of Px(ejω)= from white noise.                            (8)
ii) Explain Wide Sense Stationary process and its properties.                (8)
  1. i) Explain Autocorrelation and Autocovariance matrices. Also explain its properties.(12)
ii) State and prove Wiener-Khintchine relation.                        (4)
  1. i) Calculate the mean and variance of the autocorrelation process. Also explain the cross correlation.                                            (4)
ii) Find the autocorrelation sequence corresponding to the following power spectral densities
    a) Px(Z)=   
    b) Px(ejω)=                                (12)
  1. i) Explain in detail about parameter estimation: Bias and Consistency.        (6)
ii) Find the output of a first order LTI system, when it is excited by a white noise with and if the variance of the white noise is equal to 1.        (10)
  1. (i) State and prove Parseval’s theorem.                             (6)
(ii) A discrete sequence is given by x(n)={0.3,0.1,0.15,0.23,0.29,0.28}.
Compute a) Mean, b) Variance, c) Autocorrelation.                    (10)
  1. i) Compute the autocorrelation for the given signal x(n)=(0.8)nu(n).            (8)
ii) Obtain the mean and autocorrelation of the real valued harmonic process         where A and are constants and φ is a random variable uniformly distributed over the interval –π to π.                            (8)
  1. i) The power spectral density of a wide sense stationary process x(n) is Px(ejω)=.Find the whitening filter H(Z) that produces unit variance white noise when the input is x(n).                                    (10)
ii) Compute the PSD of the given signal x(n)={1,3}.                     (6)


        UNIT II: SPECTRUM ESTIMATION   
(16 marks)
  1. Explain how the Periodogram is used to estimate the power spectrum?    (16)
  2. Describe the performance measures of Periodogram based spectrum estimation technique.                                        (16)
  3. The bias and variance of the Modified Periodogram is better than that of the ordinary Periodogram- Justify this statement analytically.            (16)
  4. i) Explain power spectrum estimation using Barlett’s method.            (8)
ii) In the Welch method, calculate the variance of Welch power spectrum estimate with the Bartlett window if there is 50% overlap between successive sequences.                                        (8)
  1. Derive the equation for power spectral density using Blackman-Tukey
method.                                        (16)
  1. Compare the performance of periodogram, Bartlett, Welch and Blackman-Tukey methods of spectrum estimation.                            (16)
  2. Derive the expression for spectral estimation based on Auto Regressive
model.                                         (16)
  1. Discuss MA and ARMA model based power spectrum estimations.        (16)
  2. Elucidate the Levinson Durbin algorithm of solving the normal equations.    (16)
  3. Explain how the power spectral estimate is calculated using parametric method of AR model.                                        (16)
  4. Explain the power spectrum estimation using model based techniques.    (16)
UNIT III: LINEAR ESTIMATION AND PREDICTION   
(16 marks)
  1. Explain the steps in the design of FIR wiener filter that produces the minimum mean square estimate of the process.                            (16)
  2. Briefly explain forward linear prediction and backward linear prediction.        (16)
  3. Derive the expression of Discrete Kalman filter.                    (16)
  4. Design a three step predictor for a random process having an autocorrelation sequence of the form rx(k)= δ(k)+(0.9) ׀k׀cos(πk/4). Determine the estimate of x(n+3) and also MMSE for the same. Compare the MMSE of multistep predictor with single step predictor.                                             (16)
  5. Explain in detail about Causal and Noncausal IIR filter.                (16)
  6. Discuss in detail how Levinson’s Durbin algorithm is used to solve the normal equations.                                        (16)
  7. An AR(2) process has the autocorrelation sequence of rd(k)=αIkI with 0<α<1. Suppose d(n) is observed in the presence of uncorrelated white noise v(n), that has a variance of σv2.δ(k) and x(n)=d(n)+v(n). Design a second order FIR wiener filter to reduce the noise in x(n) with w(z)=w(0)+w(1)Z-1.Assume α=0.8.              (16)
  8. If the values of rx(k) for lags k-0 to 4 are rx(k)=[1.0, 0, 0.1, -0.2, -0.9]T .Solve the Wiener Holf equations and find the optimum three step predictor.        (16)
  9. Describe how the kalman filter is used to estimate an unknown constant.    (16)
  10. An AR(1) process has the autocorrelation sequence of rd(k)=αIkI with 0<α<1. Suppose d(n) is observed in the presence of uncorrelated white noise v(n), that has a variance of σv2.δ(k) and x(n)=d(n)+v(n). Design a first order FIR wiener filter to reduce the noise in x(n) with w(z)=w(0)+w(1)Z-1.Assume α=0.8.            (16)

          UNIT IV: ADAPTIVE FILTERS   
(16 marks)

  1. Explain steepest decent adaptive filter.                        (16)
  2. Describe LMS algorithm for determining FIR adaptive filter coefficients and obtain its condition for convergence.                                (16)
  3. Briefly explain Adaptive Channel Equalization and Adaptive Echo Cancellation.(16)
  4. Explain in detail about exponentially weighted RLS.                (16)
  5. Give complete discussion on how LMS algorithm is converging with necessary derivation of equation.                                (16)
  6. Derive the design equations for FIR adaptive wiener filter that would minimize the exponentially weighted least mean square error.                (16)
  7. i) Describe sliding window RLS and derive its update equation.        (8)
ii) Explain how an Adaptive filter can be used as a noise canceller with a block diagram.                                         (8)
  1. Write a detailed note on any two applications of adaptive filters with neat
diagram.                                         (16)
  1. i) State the difficulty in the design and implementation of LMS adaptive filter and describe how this problem is overcome with normalized LMS algorithm.    (8)
ii) Derive the weight vector update equation for the LMS algorithm.        (8)
  1. Explain adaptive linear prediction using LMS algorithm.            (16)
UNIT V: MULTIRATE DIGITAL SIGNAL PROCESSING
    (16 marks)

  1. Explain the mathematical description of change of sampling rate.        (16)
  2. Define decimation and interpolation. Derive the equation of decimation and interpolation factor.                                    (16)
  3. Discuss sampling rate conversion by a rational factor I/D.            (16)
  4. Explain in detail the filter bank implementation of wavelet transforms.    (16)
  5. Discuss how signal compression can be achieved using sub-band coding?    (16)
  6. Discuss sampling rate conversion with time variant structures.        (16)
  7. Briefly explain the polyphase structures for decimation and interpolation filters.(16)    
  8. Describe the multistage implementation of multirate system.            (16)
  9. Define wavelet transform. Describe filter bank implementation of wavelet expansion of signals. Discuss one application of wavelet transform.        (16)
  10. Explain the application of multirate processing in sub band coding.        (16)
  11. Describe the implementation of sampling rate conversion using direct form FIR structures.                                        (16)


Monday, 4 November 2013

Modern Digital Communication Techniques - Question Bank UNIT 1 Coherent and Non Coherent Communication

Unit I
Part - A

1. Draw the block diagram of a waveform communication model.
2. Differentiate coherent and non-coherent receivers.
3. Define Rayleigh channel.
4. What is meant by Rician channel?
5. What is the minimum distance decoding for an optimum waveform receiver?
6. Define MFMSK.
7. Write the expression for bit error rate for coherent binary FSK.
8. What is the error probability of MSK?
9. Define Optimum M-FSK receiver.
10. Define Sub-optimum M-FSK receiver.
11. Define Matched filter.
12. Draw the structure of the M-ary waveform receiver.
13. Define Error probability.
14. How the Orthogonal signals are characterized?
15. Define Transorthogonal signals.

Part – B

1.Discuss in detail about the Optimum receivers in WGN.
2.Discuss about the different types of IQ modulation.
3.Explain: MFSK receivers.
4.Explain: i) Rayleigh channel.
ii) Rician channel.
5. Explain in detail about DPSK coherent receivers.
6. Explain in detail about M-PSK coherent receivers.
7. Explain in detail about M-DPSK coherent receivers.
8. What is a matched filter? Discuss the properties of it.
9. Discuss about the IQ demodulation.
10. i) Discuss the effect of imperfection of bit and carrier synchronization of IQ modulation for
complex signal.
ii) Define MFMSK.

Monday, 7 October 2013

UNIT 1 Coherent and Non Coherent Communication


UNIT 1 Coherent and non coherent communication Answers

Part A
1. Differentiate Coherent and Non Coherent Receivers
Ans : inCoherent detection requires carrier phase recovery at the receiver and hence, circuits to perform phase estimation . Sources of carrier-phase mismatch at the receiver: inPropagationtalking causes carrier-phase offset in the received signal. inThe oscillators at the receiver which generate the carrier signal, are not usually phased locked to the transmitted carrier. 
coherent detection: Huge need for a reference in phase with the received carrier
inLess complexity compared to incoherent detection at the price of higher error rate.

Coherent ( synchronous ) detection: in coherent detection , the local carrier generated at the receiver in phase locked with the carrier at transmitter
Non coherent ( envelope ) detection : this type of detection does not need receiver carrier to be phase locked with transmitter carrier

2. Define Rayleigh Channel 
ans :
  • Rayleigh channel is a communications channel having a fading envelope in the form of the Rayleigh Probability Density Function.

    Rayleigh fading models assume that the magnitude of a signal that has passed through such a transmission medium (also called a communications channel) will vary randomly, or fade, according to a Rayleigh distribution — the radial component of the sum of two uncorrelated Gaussian random variables.

    3. Minimum distance for decoding for an optimum waveform reciever
    ans : 
    4.Define Optimum M- FSK Receiver
    The tones are symmetrically spaced around the carrier fc which can be easily modeled by  
     r(t) = sqr root ( 2P) cos (2 *pi *fc + 2 * pi ( K/T ) t + θ )  n (t)   
    . the optimum reciever is M - array non coherent receiver where various signals are the corresponding sinusoids 

    5 . Define Sub Optimum M-FSK Receiver 


Sunday, 6 October 2013

UNIT II SPECTRAL ESTIMATION

2 marks

1. Define spectrum estimation.

2. What are the applications of spectral estimation?

3. State nonparametric methods and mention its various methods.

4. Define periodogram.

5. Illustrate the filter bank interpretation of the periodogram.

Part B

1. Explain how the Periodogram is used for spectrum estimation and Describe the performance of the

Periodogram. (12)

2. Describe Barlett’s method and Welch method of spectrum estimation. (12)

UNIT I DISCRETE RANDOM SIGNAL PROCESSING answers

1. Define discrete random process.

ans: A discrete time random process is a collection or ensemble of discrete time signals . A discrete time random process is a mapping from sample space  Ω in to the set of discrete time signals x(n) .

2. When a random process is called as wide-sense stationary?

ans : A random process x(n) said to be  wide sense stationary if the following conditions are satisfied
  * The mean of the process is a constant Mx(n) = Mx
  * The auto correlation rxx(k,l) depends only on the difference K-l 
 * The variance of the process is finite , Cx(0) < ∞

3. State Wiener – Khintchine relation.
ans :  
It states that the autocorrelation function of a wide-sense-stationary random process has a spectral decomposition given by the power spectrum of that process
Let X(n) be a real signal then   rxx(l) <-> Sxx(ω)
4. State spectral factorization theorem.
ans: 


5. Write down the properties of regular process.
ans : *any regular process may be realized as the output of a casual and stable filter that is driven by white noise having variance σ^2      * the inverse filter 1/H(z) is a whitening filter  , that is if x(n) is filtered with 1/H(z) then the output is a white noise with variance σ^2 
 *since ν(n) and X(n) are related by in-veritable  transformation ,either process may derived from the other ,therefore both contains same information
6. When a wide-sense stationary process is said to be white noise?
ans:

7. Write autocorrelation and autocovariance matrices.
ans :
The autocorrelation matrix is used in various digital signal processing algorithms. It consists of elements of the discrete autocorrelation function, R_{xx}(j) arranged in the following manner:

\mathbf{R}_x = E[\mathbf{xx}^H] = \begin{bmatrix}
R_{xx}(0) & R^*_{xx}(1) & R^*_{xx}(2) & \cdots & R^*_{xx}(N-1) \\
R_{xx}(1) & R_{xx}(0) & R^*_{xx}(1) & \cdots & R^*_{xx}(N-2) \\
R_{xx}(2) & R_{xx}(1) & R_{xx}(0) & \cdots & R^*_{xx}(N-3) \\
\vdots    & \vdots    & \vdots    & \ddots & \vdots \\
R_{xx}(N-1) & R_{xx}(N-2) & R_{xx}(N-3) & \cdots & R_{xx}(0) \\
\end{bmatrix}
 
autocovariance is the expected value of the ith entry in the vector X. In other words, we have

\Sigma
= \begin{bmatrix}
 \mathrm{E}[(X_1 - \mu_1)(X_1 - \mu_1)] & \mathrm{E}[(X_1 - \mu_1)(X_2 - \mu_2)] & \cdots & \mathrm{E}[(X_1 - \mu_1)(X_n - \mu_n)] \\ \\
 \mathrm{E}[(X_2 - \mu_2)(X_1 - \mu_1)] & \mathrm{E}[(X_2 - \mu_2)(X_2 - \mu_2)] & \cdots & \mathrm{E}[(X_2 - \mu_2)(X_n - \mu_n)] \\ \\
 \vdots & \vdots & \ddots & \vdots \\ \\
 \mathrm{E}[(X_n - \mu_n)(X_1 - \mu_1)] & \mathrm{E}[(X_n - \mu_n)(X_2 - \mu_2)] & \cdots & \mathrm{E}[(X_n - \mu_n)(X_n - \mu_n)]
\end{bmatrix}.

8. Write the properties of autocorrelation matrix.
 Property 1 : Autocorrelation matrix of a wss process 
is clearly a Hermitian matrix and a Toeplitz matrix
Property 2. Autocorrelation matrix of a wss process is non negetive definite Rx > 0
Property 3 : The eigen values λk of Autocorrelation matrix of a wss process are real valued and non negetive

9. What are Ensemble averages? 

10 . For given two random processes, x(n) and y(n), define cross-covariance and cross-correlation.
ans : 

UNIT I DISCRETE RANDOM SIGNAL PROCESSING

PART A

1. Define discrete random process.

2. When a random process is called as wide-sense stationary?

3. State Wiener – Khintchine relation.

4. State spectral factorization theorem.

5. Write down the properties of regular process.

6. When a wide-sense stationary process is said to be white noise?

7. Write autocorrelation and autocovariance matrices.

8. Write the properties of autocorrelation matrix.

9. What are Ensemble averages?

10. For given two random processes, x(n) and y(n), define cross-covariance and cross-correlation.

11. When two random processes are said to be orthogonal?

12. Write the properties of Wide Sense Stationary.

13. Write the power spectrum of a WSS process filtered with linear shift-invariant filter.

14. What is a regular process?

15. Write Autocorrelation of a Sum of Processes.




PART B


1. Derive the power spectral density of the process. (10)

2. State and prove Parseval’s theorem. (8)

3. Explain Autocorrelation and Autocovariance matrices.Also explain its properties.(10)

4. Explain in detail about parameter estimation: Bias and Consistency. (10)

5. Explain Spectral factorization. What is regular process? State the properties of regular

process. (12)

6. Explain filtering random processes. (12)