Digital Signal Processing Lecture 3 - Discrete-Time Systems

Similar documents
Chap 2. Discrete-Time Signals and Systems

Frequency-Domain C/S of LTI Systems

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

ELEG 305: Digital Signal Processing

Chapter 7: The z-transform

ELC 4351: Digital Signal Processing

Analog vs. discrete signals

Discrete-Time Fourier Transform (DTFT)

LECTURE NOTES DIGITAL SIGNAL PROCESSING III B.TECH II SEMESTER (JNTUK R 13)

Digital Signal Processing Lecture 4

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

Lecture 3 January 23

Review of Discrete-Time System

Discrete Time Systems

VU Signal and Image Processing

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Review of Fundamentals of Digital Signal Processing

Properties of LTI Systems


Multidimensional digital signal processing

Lecture 4: FT Pairs, Random Signals and z-transform

Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is

EE 224 Signals and Systems I Review 1/10

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

EE123 Digital Signal Processing

Digital Signal Processing Lecture 5

Digital Signal Processing. Midterm 1 Solution

DIGITAL SIGNAL PROCESSING LECTURE 1

Signals & Systems Handout #4

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

Chapter 2 Time-Domain Representations of LTI Systems

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

EE123 Digital Signal Processing

ESE 531: Digital Signal Processing

EC Signals and Systems

Lecture 2 Discrete-Time LTI Systems: Introduction

Review of Fundamentals of Digital Signal Processing

EE123 Digital Signal Processing

ESE 531: Digital Signal Processing

Definition of Discrete-Time Fourier Transform (DTFT)

Transform Analysis of Linear Time-Invariant Systems

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

DSP Laboratory (EELE 4110) Lab#5 DTFS & DTFT

Lecture 7 Discrete Systems

ECE 308 Discrete-Time Signals and Systems

Examples. 2-input, 1-output discrete-time systems: 1-input, 1-output discrete-time systems:

Your solutions for time-domain waveforms should all be expressed as real-valued functions.

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

University Question Paper Solution

EE123 Digital Signal Processing

Discrete Time Fourier Transform

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

6.02 Fall 2012 Lecture #10

Discrete-time signals and systems

Digital Signal Processing Module 1 Analysis of Discrete time Linear Time - Invariant Systems

Very useful for designing and analyzing signal processing systems

Discrete-Time Signals & Systems

The Discrete-Time Fourier

Discussion Section #2, 31 Jan 2014

Discrete Time Systems

Ch 2: Linear Time-Invariant System

Introduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year

Digital Signal Processing

Lecture 19 IIR Filters

EEL3135: Homework #4

Review of Frequency Domain Fourier Series: Continuous periodic frequency components

Signals and Systems Profs. Byron Yu and Pulkit Grover Fall Midterm 2 Solutions

EE 210. Signals and Systems Solutions of homework 2

Lecture 7 - IIR Filters

Introduction to DSP Time Domain Representation of Signals and Systems

Cosc 3451 Signals and Systems. What is a system? Systems Terminology and Properties of Systems

Discrete Time Fourier Transform (DTFT)

considered to be the elements of a column vector as follows 1.2 Discrete-time signals

A system that is both linear and time-invariant is called linear time-invariant (LTI).

If every Bounded Input produces Bounded Output, system is externally stable equivalently, system is BIBO stable

Problem 1. Suppose we calculate the response of an LTI system to an input signal x(n), using the convolution sum:

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 )

Rui Wang, Assistant professor Dept. of Information and Communication Tongji University.

Universiti Malaysia Perlis EKT430: DIGITAL SIGNAL PROCESSING LAB ASSIGNMENT 3: DISCRETE TIME SYSTEM IN TIME DOMAIN

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

6.02 Fall 2012 Lecture #11

EE 521: Instrumentation and Measurements

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

The Convolution Sum for Discrete-Time LTI Systems

The Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.

Signals and Systems. Problem Set: The z-transform and DT Fourier Transform

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

Z-Transform. The Z-transform is the Discrete-Time counterpart of the Laplace Transform. Laplace : G(s) = g(t)e st dt. Z : G(z) =

Linear Convolution Using FFT

Lecture 11 FIR Filters

Stability Condition in Terms of the Pole Locations

Professor Fearing EECS120/Problem Set 2 v 1.01 Fall 2016 Due at 4 pm, Fri. Sep. 9 in HW box under stairs (1st floor Cory) Reading: O&W Ch 1, Ch2.

! z-transform. " Tie up loose ends. " Regions of convergence properties. ! Inverse z-transform. " Inspection. " Partial fraction

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

Z-Transform. x (n) Sampler

ECE 301 Division 1, Fall 2006 Instructor: Mimi Boutin Final Examination

III. Time Domain Analysis of systems

Digital Filters Ying Sun

Discrete Fourier Transform

Signals and Systems Spring 2004 Lecture #9

Transcription:

Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015

Overview 1 2 3 4 5 6 7 8

Introduction Three components of DSP Clarifications: Discrete-time vs. Digital Discrete-time signals unit sample (impulse), unit step, exponential sequences relationships periodicity of sinusoidal sequences

A general system and an LTI system y[n] = T {x[n]}

Linearity A system is linear iff T {ax x(n) 1 [n] + bx(n-n 2 [n]} 0 ) = at {x w(n) 1 [n]} + bt {x 2 [n]} Delay by n 0 System System Homogeneity or scaling or multiplicative property Additivity property x 1 (n) x 2 (n) α X β X x 1 (n) x 2 (n) + x(n) System System System y(n) y 1 (n) y 2 (n) y(n) α X β X Delay y(n-n 0 ) by n 0 + w(n) w[n] needs to be equal to y[n]

Time-invariance (or shift-invariance) For time-invariant systems, the input-output characteristics do not change over time, i.e., x[n] y[n] implies x[n n 0 ] y[n n 0 ] x(n) Delay by n 0 x(n-n 0 ) System System w(n) y(n) Delay y(n-n 0 ) by n 0 w[n] needs to be equal to y[n n 0 ] x 1 (n) x 2 (n) α x 1 (n) System System α y 1 (n) X β y 2 (n) X + w(n)

The convolution sum The unit sample uniquely characterizes the system. If δ[n] h[n], then δ[n k] h[n k]. x[n] = x[k]δ[n k] y[n] = x[k]h[n k] = x[n] h[n] Convolution sum is commutative. y[n] = r x[n r]h[r] = h[n] x[n]

Stability A system is said to be bounded-input bounded-output (BIBO) stable iff every bounded input produces a bounded output. i.e., there exist some finite numbers, B x and B y, s.t. for all n. x[n] B x <, y[n] B y < Abosolutely summable: For LTI, if x[n] <, to have y[n] <, we need to have k= h[k] <

Causality The output of a causal system at any time n depends only on present and past inputs, i.e., x[n], x[n 1], x[n 2],, but not on future inputs, i.e., x[n + 1], x[n + 2],

Static (or memoryless) vs. Dynamic (or with memory) systems For a static system, at any instant n, the output of the system only depends, at most, on the input sample at the same time: y[n] = T (x[n])

Exercises y[n] = x[2n] y[n] = x[ n] y[n] = ax[n] + b y[n] = e x[n] y[n] = x[n] cos ω 0 n, h[n] = 2 n u[ n] h[n] = 2 n u[n] h[n] = ( 1 2 )n u[n]

Linear constant-coefficient difference equation () Nth order N a k y[n k] = k=0 M b m x[n m] m=0 When N = 0, a 0 = 1, i.e., 0-th order M y[n] = b k x[n k] That is, h[n] = When N 0, a 0 = 1 k=0 { bn, n = 0, 1,, M 0, otherwise = M b k δ[n k] k=0 y[n] = M bm x[n m] N ak y[n k]

Initial conditions The homogeneous solution, y h [n] y[n] = y p [n] + y h [n] N a k y h [n k] = 0 y h [n] = k=0 N A m zm n m=1 If a system is characterized by an and is further specified to be linear, time-invariant, and causal, then the solution is unique. These auxiliary conditions are referred to as the initial-rest conditions. That is, if x[n] = 0 for n < n 0, then y[n] = 0 for n < n 0. Note that not for every set of boundary conditions that would correspond to an LTI system.

Exercises y[n] ay[n 1] = x[n] Suppose x[n] = δ[n] assume y[n] = 0, n < 0 assume y[n] = 0, n > 0

Eigenfunctions for LTI systems Complex exponentials are eigenvalues of LTI systems Let x[n] = e jωn, then y[n] = h[k]x[n k] = k= Let H(e jω ) = k h[k]e jωk, then y[n] = H(e jω )e jωn of the system: H(e jω ) = h[k]e jωk k k= h[k]e jω(n k) = e jωn k h[k of frequency : Function of continuous variable ω Periodic function of ω with period of 2π Generalization of frequency : the Fourier transform

Exercises Find the output to x[n] = A cos(ω 0 n + φ) Find the frequency to y[n] ay[n 1] = x[n] Find the output to x[n] = e jωn u[n] (suddenly applied exponential input)

Fourier-series expansion H(e jω ) is a continuous periodic function and would have a Fourier series representation H(e jω ) has a Fourier-series expansion in terms of complex exponentials The Fourier series coefficients then become the values of the unit sample H(e jω ) = n h[n]e jωn h[n] = 1 π H(e jω )e jωn dω 2π π

Fourier Transform -domain representation of arbitrary sequence x[n] X(e jω ) = n= x[n]e jωn x[n] = 1 π X(e jω )e jωn dω 2π π

The convolution property x[n] y[n] X(e jω )Y (e jω ) e jω0n H(e jω 0 )e jω 0n A k e jω k n A k H(e jω k )e jω k n k k x[n] = 1 π X(e jω )e jωn dω 2π π A decomposition of x[n] as a linear combination of complex exponentials y[n] = 1 2π π π X(e jω )H(e jω )e jωn dω Y (e jω ) = X(e jω )H(e jω ) y[n] = x[n] h[n]

The symmetry property For real sequences x[n], the symmetry property indicates that the of x[n] is a conjugate symmetric function of ω Other useful : X(e jω ) = X (e jω ) The real part of the is an even function: X R (e jω ) = X R (e jω ) The imaginary part of the is an odd function: X I (e jω ) = X I (e jω ) The amplitude of the is an even function: X(e jω ) The phase of the is an odd function X(e jω )