Computer Engineering 4TL4: Digital Signal Processing (Fall 2003) Solutions to Final Exam

Similar documents
Computer Engineering 4TL4: Digital Signal Processing

Lecture 7: z-transform Properties, Sampling and Nyquist Sampling Theorem

Simple FIR Digital Filters. Simple FIR Digital Filters. Simple Digital Filters. Simple FIR Digital Filters. Simple FIR Digital Filters

EECS 120 Signals & Systems University of California, Berkeley: Fall 2005 Gastpar November 16, Solutions to Exam 2

Stability Condition in Terms of the Pole Locations

Chapter 7: IIR Filter Design Techniques

Digital Signal Processing

FINITE WORD LENGTH EFFECTS IN DSP

Chapter Review of of Random Processes

Signals & Systems - Chapter 6

COMM 602: Digital Signal Processing. Lecture 8. Digital Filter Design

Digital Signal Processing

Digital Signal Processing IIR Filter Design via Bilinear Transform

Responses of Digital Filters Chapter Intended Learning Outcomes:

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis

Chap 2. Discrete-Time Signals and Systems

ECGR4124 Digital Signal Processing Exam 2 Spring 2017

( ) ( ) Volumetric Properties of Pure Fluids, part 4. The generic cubic equation of state:

Review of Fundamentals of Digital Signal Processing

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

Discrete-Time Signals and Systems. Frequency Domain Analysis of LTI Systems. The Frequency Response Function. The Frequency Response Function

Acoustic Waves in a Duct

EE538 Final Exam Fall 2007 Mon, Dec 10, 8-10 am RHPH 127 Dec. 10, Cover Sheet

Lecture 16: Filter Design: Impulse Invariance and Bilinear Transform

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

Review of Fundamentals of Digital Signal Processing

EE482: Digital Signal Processing Applications

EE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet

# FIR. [ ] = b k. # [ ]x[ n " k] [ ] = h k. x[ n] = Ae j" e j# ˆ n Complex exponential input. [ ]Ae j" e j ˆ. ˆ )Ae j# e j ˆ. y n. y n.

Optimum Ordering and Pole-Zero Pairing of the Cascade Form IIR. Digital Filter

Design of IIR filters

! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals

Discrete-Time David Johns and Ken Martin University of Toronto

NAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.

23.1 Tuning controllers, in the large view Quoting from Section 16.7:

INF3440/INF4440. Design of digital filters

UNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

EE 521: Instrumentation and Measurements

Digital Signal Processing Lecture 8 - Filter Design - IIR

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

An Iir-Filter Example: A Butterworth Filter

Digital Signal Processing. Midterm 1 Solution

A Spatiotemporal Approach to Passive Sound Source Localization

Remark 4.1 Unlike Lyapunov theorems, LaSalle s theorem does not require the function V ( x ) to be positive definite.

Digital Signal Processing:

Filter Analysis and Design

Geometry of Transformations of Random Variables

Digital Signal Processing. Homework 2 Solution. Due Monday 4 October Following the method on page 38, the difference equation

EECE 301 Signals & Systems Prof. Mark Fowler

Linear Convolution Using FFT

Supplementary Materials

DISCRETE-TIME SIGNAL PROCESSING

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

ECGR4124 Digital Signal Processing Final Spring 2009

ELEG 305: Digital Signal Processing

Transform Analysis of Linear Time-Invariant Systems

Study on the leak test technology of spacecraft using ultrasonic

A Numerical Method For Constructing Geo-Location Isograms

ECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.

The simulation analysis of the bridge rectifier continuous operation in AC circuit

22.54 Neutron Interactions and Applications (Spring 2004) Chapter 6 (2/24/04) Energy Transfer Kernel F(E E')

Analysis of discretization in the direct simulation Monte Carlo

Fourier Series Representation of

ELEN 4810 Midterm Exam

Multimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2

Lecture 7 Discrete Systems

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

ECE 410 DIGITAL SIGNAL PROCESSING D. Munson University of Illinois Chapter 12

DIGITAL SIGNAL PROCESSING. Chapter 6 IIR Filter Design

ECE538 Final Exam Fall 2017 Digital Signal Processing I 14 December Cover Sheet

SIGNALS AND SIGNAL PROCESSING

Analysis of Finite Wordlength Effects

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

1 1.27z z 2. 1 z H 2

LATTICE BOLTZMANN METHOD FOR MICRO CHANNEL AND MICRO ORIFICE FLOWS TAIHO YEOM. Bachelor of Science in Mechanical Engineering.

IT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A

Filter Design Problem

Exercises in Digital Signal Processing

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).

VALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year

Homework Set 4. gas B open end

! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular

ECE503: Digital Signal Processing Lecture 5

Multirate Digital Signal Processing

Filter structures ELEC-E5410

Continuous and Discrete Time Signals and Systems

Optimum Ordering and Pole-Zero Pairing. Optimum Ordering and Pole-Zero Pairing Consider the scaled cascade structure shown below

Chapter 5 Frequency Domain Analysis of Systems

LINEAR-PHASE FIR FILTERS DESIGN

s(t) impulse response contaminated by a random noise T data block length (s) t time (s) estimator f(t) generic function

Digital Signal Processing

Integration of the Finite Toda Lattice with Complex-Valued Initial Data

ESE 531: Digital Signal Processing

max min z i i=1 x j k s.t. j=1 x j j:i T j

UTC. Engineering 329. Proportional Controller Design. Speed System. John Beverly. Green Team. John Beverly Keith Skiles John Barker.

Discrete-time Signals and Systems in

Transcription:

Computer Engineering TL: Digital Signal Proessing (Fall 3) Solutions to Final Exam The step response ynof a ausal, stable LTI system is: n [ ] = [ yn ] un, [ ] where un [ ] is the unit step funtion a Find the -domain transfer funtion H( ) of this system b Find the impulse response hn [ ] of this system Find the linear onstant oeffiient differene (LCCD) equation that desribes this system a Taking the -transform of yn [ ] gives: Y =, > The -transform X ( ) of the input unit step funtion is: X =, > The transfer funtion H( ) is then: Y = =, X > b The impulse response of this system is found by omputing the inverse -transform of H( ) : = = n n [ ] [ ] [ ] hn= un un The LCCD equation that desribes this system is: Y ( ) = = X ( ) Y ( ) Y ( ) X ( ) X ( ) yn [ ] yn [ ] xn [ ] xn [ ] = = >

Consider the ausal stable LTI system with the transfer funtion: = ( )( + + ) Draw the blok diagram for this system implemented in parallel form with st -order subsystems To obtain the parallel form, we ompute the partial fration expansion of H( ) : = = ( )( + + ) + + The blok diagram is then: 3 A ausal LTI system has the transfer funtion: = ( + )( 9 ) + 8 a Find transfer funtions for a minimum-phase system and an all-pass system Hap ( ) suh that: = ap b Sketh the pole-ero plots of, and, learly show their ROCs by shading them on the pole-ero plots H( ) H ( ) ap

a The system is nonminimum-phase beause of the pair of eros at =±3 To form the minimum-phase system, these eros must be refleted to their (onjugate) reiproal loations at H ( ) = =± 3, giving: ( + 9 ) + 8, > 9 H( ) Hap( ) H( ) ap =± In order for to equal, the all-pass system must have the pair of nonminimum-phase eros at 3 from and a pair of poles at the reiproal loations =± 3, giving: H ( ) 9 =, > ap 9 H( ) H ( ) b The pole-ero plots of, and, with their ROCs, are given below ap 3 Imaginary Part Imaginary Part Imaginary Part H() ROC -plane 3 3 Real Part H () ROC -plane 3 3 Real Part H ap () ROC -plane 3 3 Real Part

The spetrogram of a speeh signal is shown below a Is this a narrowband spetrogram or a wideband spetrogram? Explain your reasoning b This signal is a single word, either shop or posh From the spetrogram, whih of these two words does it appear to be? Explain your reasoning 8 Frequeny (kh) 3 Time (s) a This is a wideband spetrogram beause the temporal resolution is good and the frequeny resolution is poor, suh that vertial striations are seen in the voied segment of speeh and the harmonis are unresolved (ie, no horiontal striations are observed) b The word is shop, whih is evident in the spetrogram beause of the long noise-like spetrum at the beginning, produed by the unvoied friative sh Two alternative methods of digital IIR filter design make use of the: i impulse invariane transformation and ii bilinear transformation Explain: a whih of these two methods is appliable to a wider range of filter frequeny response types (ie, lowpass, highpass, bandpass, bandstop, multiband) and why, and b whih of these two methods is simpler and why a The bilinear transform is appliable to a wider range of filter frequeny responses beause it maps the entire analog frequeny axis into the digital frequeny range ( π, π), suh that frequeny aliasing is avoided The impulse invariane method does not warp the frequeny axis, so aliasing is produed exept in ases of stritly bandlimited frequeny responses b The impulse invariane method is somewhat simpler beause it just requires sampling and saling the impulse response of the desired analog filter However, there is no simple mapping of the s-domain transfer funtion to the -domain In onstrast, the bilinear transform requires prewarping of the desired digital filter properties before design of the analog filter, appliation of the bilinear transformation and simplifiation of the -domain transfer funtion, but there is a diret mapping of the s-domain transfer funtion to the -domain

Four values of a stationary random proess x[n] have been observed, giving the disrete-time sequene v[n] = {38,, 7, 8} a Use the autoorrelation-based method of spetral estimation to estimate the PSD of x[n], using a triangular orrelation window w [m] = {,, } b Does x[n] appear to be lowpass, bandpass or highpass? a First we ompute the estimate of autoorrelation funtion of the random proess Note that we will be applying a orrelation window with nonero values only at lags of m =, and, so we only need to evaluate the autoorrelation estimator at those lags: [ ] [ ] [ ] m = v m v m [ ] [ ] [] [ ] = 38 + 38 + 7 + 8 7 + 8 = 9 = 38 38 + + 7 7 + 8 8 = 88 = = 9 ˆ φ [ m] = [ m] = [ m] Q Applying the triangular orrelation window gives: ˆ φ 9δ 88δ 9δ δ δ = 3 + + 7 + 3 [ m] w [ m] = { [ m+ ] + [ m] + [ m ]} { [ m+ ] + [ m] + δ[ m ]} { δ[ m ] δ[ m] δ[ m ]} Taking the Fourier transform of the windowed autoorrelation estimate gives the PSD estimator: ( ω) = ˆ φ [ ] [ ] S m w m e m= m= jωm { 3δ[ m ] 7δ [ m] 3δ [ m ] } jω = 3e + 7+ 3e = 7+ 7os ω = + + + jω e jωm b From the final expression for S ( ω ) we would estimate that x[ n ] is a lowpass signal

7 Let h [ ] lp n denote the impulse response of an ideal lowpass filter with unity passband gain and utoff frequeny filter [ ] ω = π The figure below shows an ideal LTI frequeny-seletive j h [ ] H e ω lp n hn that inorporates as a subsystem Sketh, the magnitude frequeny response of hn, [ ] indiating expliitly the band-edge frequenies in terms of and speify whether the system is a lowpass, highpass, bandpass, bandstop or multiband filter ω () n () n x[n] h lp [n] y[n] h[n] x n bandlimited to ( π, π), shown by the blue line in panel A of the figure below Multipliation of x[ n ] by the sequene ( ) n in the time domain orresponds to a frequeny shift of π radians in the frequeny domain, from Property 3 of Table, where ω = π in this ase This frequeny shift turns the lowpass signal x[ n] into a highpass signal, shown in panel B After lowpass filtering (shown by the red dashed line in panel B), the signal (shown in panel C) is again frequeny shifted by π radians to give the blue line in panel D The net filtering effet of these operations is a highpass filter with utoff frequeny ω = π ω = π π = 3π, as illustrated by the magenta line in panel D Consider a lowpass disrete-time signal [ ] A Magnitude D Magnitude or Gain 3π π π π π 3π ω (radians) ω ' = 3π/ 3π π π π π 3π ω (radians) Frequeny shift Frequeny shift B Gain Magnitude or C Magnitude ω = π/ 3π π π π π 3π ω (radians) Filter 3π π π π π 3π ω (radians)

8 Consider the finite sequene xn [ ] = {, 7, 9,,, 8} The DFT of this sequene X [ k ] has been alulated for k and lossy ompression has been applied to the sequene of DFT oeffiients X [ k ] by ignoring (ie, setting to ero) the oeffiients for k =, 3 and, to obtain the sequene of ompressed DFT oeffiients: [ ] = { 7, 39,,,, + 39} X k j j a Compute the reonstruted sequene [ n] by taking the inverse DFT of X [ k] b Calulate the root mean squared (RMS) error between [ n] and [ ] RMS error as a perentage of the RMS of x[ n ] a The inverse DFT of X [ k] is: jπ kn = [ ] [ ] xn k = [ ] = [ ] [] = [ ] [ ] = [ ] k = k = k = X ke X k e = { 7 + j39 + + j39} = 77 jπ k X k e jπ jπ { 7 ( j39) e ( j ) e } jπ jπ = { 7 + ( j39) e + ( + j39) e } = 9 jπ k X k e = + jπ k3 = X k e [ 3] [ ] k = [ ] = [ ] k = [ ] = [ ] + + 39 = 7 x n Express this jπ3 jπ = { 7 ( 7 + j837) e + ( + j39) e } = jπ k X k e jπ jπ = { 7 ( 7 + j837) e + ( + j39) e } = 983 jπ k X k e k = jπ jπ = { 7 + ( j39) e + ( + j39) e } =, giving the sequene xn= [ ] { 77, 9, 7,, 983, }

b The RMS error is: {( [ ] [ ]) } RMSE = E x n x n The RMS of x[ n ] is: RMS= ( 77) + ( 7 9) + ( 9 7) = + ( + ) + ( + 983) + ( 8 + ) = 38 E {( x[ n] ) } { } = + 7 + 9 + + + 8 = 7, giving a perentage RMS error of: RMSE 38 = 8% RMS 7