MAS160: Signals, Systems & Information for Media Technology. Problem Set 5. DUE: November 3, (a) Plot of u[n] (b) Plot of x[n]=(0.

Similar documents
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

Signals & Systems Chapter3

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ECE4270 Fundamentals of DSP. Lecture 2 Discrete-Time Signals and Systems & Difference Equations. Overview of Lecture 2. More Discrete-Time Systems

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time

Linear time invariant systems

Time-Domain Representations of LTI Systems

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Frequency Response of FIR Filters

Ch3 Discrete Time Fourier Transform

Solution of Linear Constant-Coefficient Difference Equations

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.

FIR Filter Design: Part II

Computing the output response of LTI Systems.

COMM 602: Digital Signal Processing

ECE 308 Discrete-Time Signals and Systems

x[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Introduction to Signals and Systems, Part V: Lecture Summary

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Exam. Notes: A single A4 sheet of paper (double sided; hand-written or computer typed)

ELEG3503 Introduction to Digital Signal Processing

Chapter 7: The z-transform. Chih-Wei Liu

Solutions - Homework # 1

Lecture 2 Linear and Time Invariant Systems

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

ADVANCED DIGITAL SIGNAL PROCESSING

Finite-length Discrete Transforms. Chapter 5, Sections

EE Midterm Test 1 - Solutions

4.3 Growth Rates of Solutions to Recurrences

1 Generating functions for balls in boxes

MAXIMALLY FLAT FIR FILTERS

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Fall 2011, EE123 Digital Signal Processing

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.

Exponential Moving Average Pieter P

Definition of z-transform.

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

Solutions of Chapter 5 Part 1/2

Question1 Multiple choices (circle the most appropriate one):

Math 312 Lecture Notes One Dimensional Maps

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations

DIGITAL SIGNAL PROCESSING LECTURE 3

Chapter 4. Fourier Series

6.003: Signals and Systems. Feedback, Poles, and Fundamental Modes

The Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)

Chapter 2 Systems and Signals

6.003 Homework #3 Solutions

EE422G Homework #13 (12 points)

Generalizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations

Written exam Digital Signal Processing for BMT (8E070). Tuesday November 1, 2011, 09:00 12:00.

EEO 401 Digital Signal Processing Prof. Mark Fowler

1. Do the following sequences converge or diverge? If convergent, give the limit. Explicitly show your reasoning. 2n + 1 n ( 1) n+1.

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3

FIR Filter Design: Part I

MATH 304: MIDTERM EXAM SOLUTIONS

Worksheet on Generating Functions

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

Algorithms and Data Structures 2014 Exercises and Solutions Week 13

Polynomial Functions and Their Graphs

The Discrete Fourier Transform

EE123 Digital Signal Processing

Chapter 8. DFT : The Discrete Fourier Transform

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

MAT 271 Project: Partial Fractions for certain rational functions

Math 113 Exam 3 Practice

( ) (( ) ) ANSWERS TO EXERCISES IN APPENDIX B. Section B.1 VECTORS AND SETS. Exercise B.1-1: Convex sets. are convex, , hence. and. (a) Let.

Properties and Tests of Zeros of Polynomial Functions

Zeros of Polynomials

Digital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved

Mechatronics. Time Response & Frequency Response 2 nd -Order Dynamic System 2-Pole, Low-Pass, Active Filter

=> PARALLEL INTERCONNECTION. Basic Properties LTI Systems. The Commutative Property. Convolution. The Commutative Property. The Distributive Property

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

The z-transform can be used to obtain compact transform-domain representations of signals and systems. It

Principle Of Superposition

TEACHER CERTIFICATION STUDY GUIDE

Math 113, Calculus II Winter 2007 Final Exam Solutions

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

FFTs in Graphics and Vision. The Fast Fourier Transform

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

x x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0,

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

Bertrand s Postulate

Summary: CORRELATION & LINEAR REGRESSION. GC. Students are advised to refer to lecture notes for the GC operations to obtain scatter diagram.

Sigma notation. 2.1 Introduction

Math 110 Assignment #6 Due: Monday, February 10

HOMEWORK #10 SOLUTIONS

REVIEW 1, MATH n=1 is convergent. (b) Determine whether a n is convergent.

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation

Transcription:

MAS6: Sigals, Systems & Iformatio for Media Techology Problem Set 5 DUE: November 3, 3 Istructors: V. Michael Bove, Jr. ad Rosalid Picard T.A. Jim McBride Problem : Uit-step ad ruig average (DSP First 5.5) SOLUTION : (a) (b).5 (a) Plot of u[].5 -.5-4 -3 - - 3 4 5 6.5 (b) Plot of x[]=(.5) u[].5 -.5-4 -3 - - 3 4 5 6 Figure : Uit Step ad Expoetial Decay (c) y[] = 4 3 (.5) k u[ k] k= -5-4 -3 - - 3 4 5 6 7 8 9 3 7 5 5 5 5 5 5 5 y[] 4 8 6 3 64 8 56 5 4 48 5 496 PS 5-

(d) y[] = L k=max{, L} a k = amax{, L} a L( a) The max operator simply meas that we take the argumet of largest value. So i this case, it is either or L, whichever is larger (which will deped o the values of ad L). Problem : Covolutio For each of the followig sets of sigals, compute their covolutio () graphically by had, () with MATLAB (you may use the cov fuctio), ad (3) by expressig the sigals i terms of δ[] ad computig the covolutio sum. I matlab, plot your results with stem, but be sure to fix the -axis appropriately (use stem(,y) where is a vector of the appropriate rage). (a) (b) For each of the followig of sigals, compute their covolutio with x[] = cos(π( 6 )) usig matlab (you may use the cov fuctio). Use stem to plot your result over the rage [:99], assumig the siusoid exists for all time. Compare each covolutio with x[]. (c) h[] = δ[] δ[ ] (d) h[] = δ[] δ[ ] PS 5-

SOLUTION : For the graphically by had portios of this problem, I iteded for you to break dow the x[] ito separate scaled ad shifted impulses, covolve them separately, ad the sum the results. Some people iterpreted this to mea to solve the covolutio by had i tabular form (which really amouts to the same thig), which I also accepted. (a) The graphical solutio is demostrated i the figure below. Obviously, the matlab solutio is idetical to the fial summatio. - δ[] - - - 3 4 - δ[-] - - - 3 4 - δ[] * h[] - - - 3 4 - δ[-] * h[] - - - 3 4 - δ[-] - - - 3 4 x[] = δ[] δ[-] δ[-] - δ[-] * h[] - - - 3 4 - - - - - 3 4 - - - 3 4 Figure : Poitwise Covolutio for (a) y[] = δ[]*h[] δ[-]*h[] δ[-]*h[] Here is the solutio expressed i tabular form, this time breakig dow h[] ito separate scaled ad shifted impulses: PS 5-3

- - 3 4 x[] h[] - h[]x[ ] h[]x[ ] - - - x[] h[] - - Below is the covolutio sum performed by expressig the sigals i terms of δ[]: x[] = δ[x] δ[ ] δ[ ] h[] = δ[x] δ[ ] y[] = x[k]h[ k] = x[]h[] = ()() = y[] = y[] = y[3] = k= x[k]h[ k] = x[]h[] x[]h[] = ()( ) ()() = k= x[k]h[ k] = x[]h[] x[]h[] x[]h[] = ()() ()( ) ()() = k= x[k]h[3 k] = x[]h[3] x[]h[] x[]h[] = ()() ()() ()( ) = k= y[] = δ[] δ[ ] δ[ ] δ[ 3] (b) Agai, the graphical solutio is demostrated i the figure below. The solutio expressed i tabular form: - - 3 4 5 x[] h[] - h[]x[ ] h[]x[ ] - - - - h[]x[ ] x[] h[] PS 5-4

δ[] - - - - 3 4 5 δ[] - - - - 3 4 5 δ[-] - - - - 3 4 5 δ[-] - - - - 3 4 5 x[] = δ[] δ[] δ[-] δ[-] - - - - 3 4 5 δ[] * h[] - - - - 3 4 5 δ[] * h[] - - - - 3 4 5 δ[-] * h[] - - - - 3 4 5 δ[-] * h[] - - - - 3 4 5 y[] = δ[]*h[] δ[]*h[] δ[-]*h[] δ[-]*h[] - - - - 3 4 5 Figure 3: Poitwise Covolutio for (b) The covolutio sum is achieved mathematically as follows: x[] = δ[ ] δ[] δ[ ] δ[ ] h[] = δ[] δ[ ] δ[ ] y[ ] = x[k]h[ k] = x[ ]h[] = ()() = y[] = y[] = k= k= k= x[k]h[ k] = x[ ]h[] x[]h[] = ()( ) ()() = x[k]h[ k] = x[ ]h[] x[]h[] x[]h[] = ()() ()( ) ()() = y[] = x[]h[] x[]h[] x[]h[] = ()() ()( ) ()() = y[3] = x[]h[] x[]h[] = ()() ()( ) = y[4] = x[]h[] = ()() = y[] = δ[ ] δ[ ] δ[ ] δ[ 4] PS 5-5

(c) x[] * (.5δ[].5δ[-]).5 -.5-3 4 5 6 7 8 9 (d) x[] * (δ[] - δ[-]).5 -.5-3 4 5 6 7 8 9 Figure 4: (c) A Low Pass Filter (d) A High Pass Filter (c) (d) The filter i part (c) is a averagig (low-pass) filter. Sice x[] is of fairly low frequecy, the sigal does t chage much. I part (d), the filter is a differece (geerally high-pass) filter, which does affect the amplitude substatially. Problem 3: Time-domai respose of FIR filters (DSP First 5.6) (a) From the give plot, we get: b b b b 3 b 4 3 7 3 9 5 (b) But sice y[] = M b k x[ k] k= = 3x[] 3x[ ] 3x[ ] x[] = We see that x[] = x[ ]. Therefore: {, for eve, for odd y[] = 6x[] 3x[ ] { 3, for eve = 6, for odd PS 5-6

Problem 4: LTI Systems Cosider the itercoectio of LTI systems as show below. h[] x[] h[] h3[] h4[] - y[] (a) Express the overall impulse respose, h[], i terms of h [], h [], h 3 [] ad h 4 []. (b) Determie h[] whe SOLUTION : h [] = {, 4, } h [] = h 3 [] = ( )u[] h 4 [] = δ[ ] (a) The combied impulse respose of a cascade of two LTI systems is simply the covolutio of the two impulse resposes. The impulse respose of a additio (or subtractio) of two LTI systems is simply the sum (or differece) of the two impulse resposes. Thus, for the overall system impulse respose, we obtai: h[] = h [] {h [] (h 3 [] h 4 [])} PS 5-7

(b) Proceedig i steps, we get: h 3 [] h 4 [] = (( )u[]) δ[ ] = δ[k ]( k )u[ k] (oly ozero whe k = ) k= = ( )u[ ] h 5 [] h [] (h 3 [] h 4 []) = ( )u[] ( )u[ ], > =, =, > h[] = h [] h 5 [] = h 5[] 4 h 5[] h 5[], <, = = 5 4, =, = 5, > Problem 5: Block Diagrams (DSP First 5.9) SOLUTION : x[] Uit x[-] Uit x[-] Uit x[-3] Uit x[-4] 3 4 y[] x[] 4 3 Uit Uit Uit Uit y[] Figure 5: System Diagram i Direct Form (above) ad Trasposed Direct Form (below) PS 5-8

Problem 6: MAS.5 Additioal Problem It is possible to determie the impulse respose for a LTI system usig a system of equatios, give eough iformatio about the system. For example, if we kow that the system is FIR ad has o delay ad that y[] = if x[] = δ[], the y[] = ax[] y[] = ax[] = a a = Usig systems of equatios, compute the impulse respose give the followig system descriptios ad iput-output pairs (a) FIR ad sigle delay, x[] = δ[], y[] =, y[] = (b) FIR ad double delay, x[] = δ[], y[] = 3, y[] = 4, y[] = 3/ (c) FIR ad double delay, x[] = 4δ[] δ[ ], y[] =, y[] =, y[] = (d) Calculate y[3] for each of the precedig systems. SOLUTION : (a) Sice the iput x[] is a impulse, we could simply get the impulse respose h[] by ispectio. But just to show the math we ll do this oe the log way: y[] = ax[] bx[ ] y[] = ax[] bx[ ] = a() b() a = y[] = x[] bx[] = () b() b = y[] = x[] x[ ] h[] = δ[] δ[ ] (b) This oe also has a impulse iput, so this time we ca simply obtai the impulse respose by ispectio: h[] = 3δ[] 4δ[ ] 3 δ[ ] PS 5-9

(c) Sice the iput is ot just a impulse, we actually have to perform a decovolutio usig a system of equatios to get our aswer. x[] = 4δ[] δ[ ] 4, = =, =, otherwise y[] = ax[] bx[ ] cx[ ] y[] = ax[] bx[ ] cx[ ] = a(4) b() c() a = y[] = ax[] bx[] cx[ ] = () b(4) c() b = 3 8 y[] = ax[] bx[] cx[] = () 3 () c(4) 8 c = 3 y[] = x[] 3 x[ ] x[ ] 8 3 h[] = δ[] 3 δ[ ] δ[ ] 8 3 (d) Usig the coefficiets above, it is simple to calculate y[3]: y[3] = x[3] x[] = () () = y[3] = 3x[3] 4x[] 3 x[] = 3() 4() 3 () = y[3] = x[3] 3 x[] 8 3 x[] = () 3 () () = 8 3 3 (a) (b) (c) PS 5-