Scribd
Upload
141 views1 page

QP - ADSP Test 1 2020-21

This document is an assessment test for an Advanced Digital Signal Processing course. It contains 3 parts - Part A has 6 multiple choice questions worth 2 marks each, Part B has 2 questions worth 16 marks each requiring longer answers, and Part C has 1 question worth 8 marks. The test covers topics like the discrete-time Fourier transform, discrete Fourier transform, FFT algorithm, power spectrum estimation methods, modeling of random signals and processes, and ARMA modeling using Yule-Walker equations.

Uploaded by

Sadagopan Raja
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
141 views1 page

QP - ADSP Test 1 2020-21

This document is an assessment test for an Advanced Digital Signal Processing course. It contains 3 parts - Part A has 6 multiple choice questions worth 2 marks each, Part B has 2 questions worth 16 marks each requiring longer answers, and Part C has 1 question worth 8 marks. The test covers topics like the discrete-time Fourier transform, discrete Fourier transform, FFT algorithm, power spectrum estimation methods, modeling of random signals and processes, and ARMA modeling using Yule-Walker equations.

Uploaded by

Sadagopan Raja
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

DEPARTMENT OF INSTRUMENTATION ENGINEERING

M.I.T., ANNA UNIVERSITY, CHROMEPET, CHENNAI 600 044


ASSESSMENT TEST – 1

Subject: IN5103 Advanced Digital Signal Processing Date: 15.2.2021


Degree: M.E (IE) Max Marks: 50
Sem : 1/4 Duration: 1½ hrs
Part – A
Answer all questions (5 x 2 marks)

1. Find the DTFT of x(n)= (1/4)nu(n-2) using time shifting property.


2. Determine the DFT of x(n) = {0,1,-1} using direct DFT computation.
3. Compare the number of complex multiplications in Direct DFT computation and Radix-2 DIT-
FFT algorithm while computing 16-point DFT. Give reasons for your answer.
4. The autocorrelation sequence of a random process is given as rx(k) = 0.252k. Determine the
autocorrelation sequence for the range -3 < k < 3
5. State with justifications, the reasons for the high complexity involved in solving Y-W equations.
6. State the desirable properties of an estimator.

Part – B
Answer all questions (2x16marks)

6a (i) Evaluate the DFT of x(n) = {1,1,1,1,0,1,1,1} (8)


(ii) Using Fourier Transform property, determine the frequency response of the LTI system
defined by the difference equation y(n) + 0.5y(n-1) = x(n). (8)

Or
6b (i) Determine the IDFT using FFT algorithm, given: (8)
X(k) = {20, -5.828-j2.414, 0, -0.172-j0.414, 0, -0.712+j0.414, 0, -5.828+j2.414}

(ii) Determine x(n) if X(ejω) = j(4 + 2cosω + 3cos2 ω)sin(ω/2)ejω/2 (8)

7a Explain the three methods of signal modeling. Hence, derive the expressions for the
three parametric methods of power spectrum estimation. (16)

Or
7b Given two random variables X and Y that are jointly WSS. Autocovariance, Cross-
covariance, Autocorrelation and Crosscorrelation for the processes. (16)

Part – C
Answer all questions (1x8 marks)

8 Determine the ARMA(1,1) model for a real-valued random process x(n) having
autocorrelation values: rx(0) = 26, rx(1) = 7, rx(2) = 7/2 using Y-W equations. (8)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy