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

Similar documents
Discrete-Time System Properties. Discrete-Time System Properties. Terminology: Implication. Terminology: Equivalence. Reference: Section 2.

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

ECE 308 Discrete-Time Signals and Systems

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

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

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

ADVANCED DIGITAL SIGNAL PROCESSING

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

Solution of Linear Constant-Coefficient Difference Equations

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

DIGITAL SIGNAL PROCESSING LECTURE 3

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

Chapter 2 Systems and Signals

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

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

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

Time-Domain Representations of LTI Systems

Linear time invariant systems

Question1 Multiple choices (circle the most appropriate one):

Frequency Response of FIR Filters

Introduction to Digital Signal Processing

Review of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk

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

Introduction to Signals and Systems, Part V: Lecture Summary

Lecture 2 Linear and Time Invariant Systems

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

Ch3 Discrete Time Fourier Transform

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

M2.The Z-Transform and its Properties

ELEG3503 Introduction to Digital Signal Processing

Computing the output response of LTI Systems.

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

Discrete-time signals and systems See Oppenheim and Schafer, Second Edition pages 8 93, or First Edition pages 8 79.

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

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

EEO 401 Digital Signal Processing Prof. Mark Fowler

EE123 Digital Signal Processing

2D DSP Basics: 2D Systems

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

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

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

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

EE123 Digital Signal Processing

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

Classification of DT signals

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

6.003 Homework #3 Solutions

COMM 602: Digital Signal Processing

Signals & Systems Chapter3

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

Chapter 7 z-transform

Digital Signal Processing, Fall 2006

EE422G Homework #13 (12 points)

Digital Signal Processing, Fall 2010

Solution of EECS 315 Final Examination F09

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,

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

EECE 301 Signals & Systems

Solutions of Chapter 5 Part 1/2

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

Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2004 Lecture 2 Linear Systems. Topics

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

Chapter 4. Fourier Series

Finite-length Discrete Transforms. Chapter 5, Sections

Exponential Moving Average Pieter P

FIR Filter Design: Part II

Math 113 Exam 3 Practice

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

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

Chapter 3. 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

Applications of Distributed Arithmetic to Digital Signal Processing: A Tutorial Review

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

Regression with an Evaporating Logarithmic Trend

Infinite Sequences and Series

Chapter 6 Infinite Series

Chapter 4 : Laplace Transform

Chapter 8. DFT : The Discrete Fourier Transform

Section 11.8: Power Series

Digital Signal Processing

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

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

UNIT-I. 2. A real valued sequence x(n) is anti symmetric if a) X(n)=x(-n) b) X(n)=-x(-n) c) A) and b) d) None Ans: b)

MAT1026 Calculus II Basic Convergence Tests for Series

Pipelined and Parallel Recursive and Adaptive Filters

AND SYSTEMS 2.0 INTRODUCTION

6.3 Testing Series With Positive Terms

Principle Of Superposition

DIGITAL FILTER ORDER REDUCTION

CSI 2101 Discrete Structures Winter Homework Assignment #4 (100 points, weight 5%) Due: Thursday, April 5, at 1:00pm (in lecture)

Lainiotis filter implementation. via Chandrasekhar type algorithm

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Math 2784 (or 2794W) University of Connecticut

Describing Function: An Approximate Analysis Method

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

2C09 Design for seismic and climate changes

EE Midterm Test 1 - Solutions

Orthogonal Gaussian Filters for Signal Processing

Polynomials with Rational Roots that Differ by a Non-zero Constant. Generalities

Transcription:

Discrete-ime Sigals ad Systems Discrete-ime Sigals ad Systems Dr. Deepa Kudur Uiversity of oroto Referece: Sectios. -.5 of Joh G. Proakis ad Dimitris G. Maolakis, Digital Sigal Processig: Priciples, Algorithms, ad Applicatios, 4th editio, 007. Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6 Elemetary Discrete-ime Sigals Sigal Symmetry. uit sample sequece (a.k.a. Kroecker delta fuctio): δ() = {, for = 0 0, for 0 Eve sigal: x( ) =. uit step sigal:. uit ramp sigal: Note: u() = u r () = {, for 0 0, for < 0 {, for 0 0, for < 0 Odd sigal: x( ) = 0-6 -5-4 - - -7 4 5 6 7-6 -5-4 - 0 - -7 4 5 6 7-6 -5-4 - 0 - -7 4 5 6 7 δ() = u() u( ) = u r ( ) u r () u r ( ) u() = u r ( ) u r () Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 4 / 6

Sigal Symmetry Sigal Symmetry Eve sigal compoet: Odd sigal compoet: x e () = [ x( )] x o () = [ x( )] -6-5 -4 0.5 - - -0.5-0 4 5 6 7 8-6 -5-4 (x(-))/ 0.5 - - -0.5 - eve part 0 4 5 6 7 8 Note: = x e () x o () -6-5 -4 x(-) 0.5 - - -0.5 0 4 5 6 7 8-6 -5-4 (-x(-))/ 0.5 - - odd part 0 4 5 6 7 8-0.5 - - Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 5 / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 6 / 6 Simple Maipulatio of Discrete-ime Sigals Simple Maipulatio of Discrete-ime Sigals I Fid x( ). rasformatio of idepedet variable: time shift: k, k Z Questio: what if k Z? time scale: α, α Z Questio: what if α Z? Additioal, multiplicatio ad scalig: amplitude scalig: y() = A, < < sum: y() = x () x (), < < product: y() = x ()x (), < < - - - - 0 4 5 6 7 8 9 0 5 0 - - Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 7 / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 8 / 6

Simple Maipulatio of Discrete-ime Sigals II Simple Maipulatio of Discrete-ime Sigals I Fid x( ). - - - - - 0 4 5 6 7 8 9-0 - 5 0 - - - x( ) < < 0 if is a iteger; udefied otherwise - udefied 0 x() = 5 udefied 4 x(4) = udefied 4 7 x(7) = 7 5 udefied 6 0 x(0) = 7 udefied 8 x() = 9 9 udefied 0 6 x(6) = 5 udefied 9 x(9) = > > 9 0 if is a iteger; udefied otherwise Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 9 / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 0 / 6 Simple Maipulatio of Discrete-ime Sigals Graph of x( ). - - 0 - - 0 4 5 6 7 8 9 4 his sigal is udefied for values of that are ot eve itegers ad zero for eve itegers ot show o this sketch. - - Iput-Output Descriptio of Dst-ime Systems iput/ excitatio Discrete-time sigal Discrete-time System y() Discrete-time sigal output/ respose Iput-output descriptio (exact structure of system is ukow or igored): y() = [] black box represetatio: y() Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6

Classificatio of Discrete-ime Systems ime-ivariat vs. ime-variat Systems Why is this so importat? mathematical techiques developed to aalyze systems are ofte cotiget upo the geeral characteristics of the systems beig cosidered for a system to possess a give property, the property must hold for every possible iput to the system to disprove a property, eed a sigle couter-example to prove a property, eed to prove for the geeral case ime-ivariat system: iput-output characteristics do ot chage with time a system is time-ivarariat iff y() = x( k) y( k) for every iput ad every time shift k. Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 4 / 6 ime-ivariat vs. ime-variat Systems Liear vs. Noliear Systems Examples: time-ivariat or ot? y() = A y() = y() = x ( ) y() = x( ) y() = x( ) y() = y() = e As: Y, N, Y, N, Y, Y, Y Liear system: obeys superpositio priciple a system is liear iff [a x () a x ()] = a [x ()] a [x ()] for ay arbitrary iput sequeces x () ad x (), ad ay arbitrary costats a ad a Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 5 / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 6 / 6

Liear vs. Noliear Systems Causal vs. Nocausal Systems Examples: liear or ot? y() = A y() = y() = x ( ) y() = x( ) y() = x( ) y() = y() = e As: Y, Y, N, Y, Y, N, N Causal system: output of system at ay time depeds oly o preset ad past iputs a system is causal iff for all y() = F [, x( ), x( ),...] Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 7 / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 8 / 6 Causal vs. Nocausal Systems Stable vs. Ustable Systems Examples: causal or ot? y() = A y() = y() = x ( ) y() = x( ) y() = x( ) y() = y() = e As: Y, Y, Y, N, N, N, Y Bouded Iput-Bouded output (BIBO) Stable: every bouded iput produces a bouded output a system is BIBO stable iff for all. M x < = y() M y < Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 9 / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 0 / 6

Stable vs. Ustable Systems he Covolutio Sum Examples: stable or ot? y() = A y() = y() = x ( ) y() = x( ) y() = x( ) y() = y() = e As: Y, N, Y, Y, Y, N, Y Recall: = x(k)δ( k) Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6 he Covolutio Sum Let the respose of a liear time-ivariat (LI) system to the uit sample iput δ() be h(). he Covolutio Sum δ() δ( k) α δ( k) x(k) δ( k) x(k)δ( k) h() h( k) α h( k) x(k) h( k) x(k)h( k) y() herefore, y() = x(k)h( k) = h() for ay LI system. Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 4 / 6

Properties of Covolutio Properties of Covolutio Associative ad Commutative Laws: h() = h() [ h ()] h () = [h () h ()] Distributive Law: [h () h ()] = h () h () h () h () h () h () h () * h () = h () * h () h () h () y() y() h () h () y() Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 5 / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 6 / 6 Causality ad Covolutio For a causal system, y() oly depeds o preset ad past iputs values. herefore, for a causal system, we have: Fiite-Impulse Repose vs. Ifiite Impulse Respose Fiite impulse respose (FIR): y() = = = h(k)x( k) h(k)x( k) h(k)x( k) h(k)x( k) y() = Ifiite impulse respose (IIR): y() = M h(k)x( k) h(k)x( k) where h() = 0 for < 0 to esure causality. How would oe realize these systems? wo classes: recursive ad orecursive. Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 7 / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 8 / 6

Ifiite Impulse Respose System Realizatio Ifiite Impulse Respose System Realizatio here is a practical ad computatioally efficiet meas of implemetig a family of IIR systems that makes use of...... differece equatios. Cosider a accumulator: y() = x(k) = 0,,,... Memory requiremets grow with icreasig! Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 9 / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 0 / 6 Ifiite Impulse Respose System Realizatio Liear Costat-Coefficiet Differece Equatios y() = = x(k) x(k) = y( ) y() = y( ) recursive implemetatio Example for a liear costat-coefficiet differece equatio (LCCDE): y() = y( ) Iitial coditios: at rest for < 0; i.e., y( ) = 0 Geeral expressio for Nth-order LCCDE: N a k y( k) = M b k x( k) a 0 Iitial coditios: y( ), y( ), y( ),..., y( N) Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6 Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6

Direct Form I vs. Direct Form II Realizatios Direct Form I IIR Filter Implemetatio y() = N a k y( k) k= M b k x( k) is equivalet to the cascade of the followig systems: v() }{{} output y() }{{} output M = b k x( k) }{{} k= iput N = k= a k y( k) v() }{{} iput orecursive recursive LI All-zero system LI All-pole system Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems / 6 Requires: M N multiplicatios, M N additios, M N memory locatios Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 4 / 6 Direct Form II IIR Filter Implemetatio Direct Form II IIR Filter Implemetatio Adder: Costat multiplier: Sigal multiplier: Uit delay: Uit advace: LI All-pole system LI All-zero system Requires: M N multiplicatios, M N additios, M N memory locatios Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 5 / 6 For N>M Requires: M N multiplicatios, M N additios, max(m, N) memory locatios Dr. Deepa Kudur (Uiversity of oroto) Discrete-ime Sigals ad Systems 6 / 6