Review of Discrete-Time System

Similar documents
Discrete Time Systems

Lecture 7 Discrete Systems

Digital Signal Processing Lecture 10 - Discrete Fourier Transform

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

EE 521: Instrumentation and Measurements

Multi-rate Signal Processing 7. M-channel Maximally Decmiated Filter Banks

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

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Multi-rate Signal Processing 3. The Polyphase Representation

EEL3135: Homework #4

EC Signals and Systems

Chap 2. Discrete-Time Signals and Systems

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

Digital Signal Processing. Midterm 1 Solution

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

Frequency-Domain C/S of LTI Systems

Discrete-Time Fourier Transform (DTFT)

Discrete Time Fourier Transform

Discrete-time Signals and Systems in

EE 224 Signals and Systems I Review 1/10

ECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION

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

Ch.11 The Discrete-Time Fourier Transform (DTFT)

The Z transform (2) 1

ECE503: Digital Signal Processing Lecture 4

ECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3

Lecture 2 OKAN UNIVERSITY FACULTY OF ENGINEERING AND ARCHITECTURE

Very useful for designing and analyzing signal processing systems

Signals and Systems Spring 2004 Lecture #9

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

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.

EE482: Digital Signal Processing Applications

Question Paper Code : AEC11T02

Lecture 13: Discrete Time Fourier Transform (DTFT)

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

Multidimensional digital signal processing

Lecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.

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) =

ECE-314 Fall 2012 Review Questions for Midterm Examination II

Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.

Lecture 8 - IIR Filters (II)

The Discrete-Time Fourier

Stability Condition in Terms of the Pole Locations

SIGNALS AND SYSTEMS. Unit IV. Analysis of DT signals

ELEN 4810 Midterm Exam

ESE 531: Digital Signal Processing

Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes (cont d)

Discrete Time Systems

Lecture 19: Discrete Fourier Series

Signals & Systems Handout #4

ELEG 305: Digital Signal Processing

ECE 301 Fall 2010 Division 2 Homework 10 Solutions. { 1, if 2n t < 2n + 1, for any integer n, x(t) = 0, if 2n 1 t < 2n, for any integer n.

Use: Analysis of systems, simple convolution, shorthand for e jw, stability. Motivation easier to write. Or X(z) = Z {x(n)}

ESE 531: Digital Signal Processing

Analog vs. discrete signals

x[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn

X. Chen More on Sampling

QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)

2.161 Signal Processing: Continuous and Discrete Fall 2008

The Z-Transform. Fall 2012, EE123 Digital Signal Processing. Eigen Functions of LTI System. Eigen Functions of LTI System

NAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet

ESE 531: Digital Signal Processing

MEDE2500 Tutorial Nov-7

Discrete-Time David Johns and Ken Martin University of Toronto

8 The Discrete Fourier Transform (DFT)

A.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt =

z-transform Chapter 6

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

Discrete-time signals and systems

University Question Paper Solution

ESE 531: Digital Signal Processing

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

Review of Fundamentals of Digital Signal Processing

ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are

Discrete Fourier Transform

Final Exam January 31, Solutions

Signals and Systems Lecture 8: Z Transform

GATE EE Topic wise Questions SIGNALS & SYSTEMS

Lecture 04: Discrete Frequency Domain Analysis (z-transform)

Lecture 8 - IIR Filters (II)

Lecture 14: Windowing

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

Final Exam ECE301 Signals and Systems Friday, May 3, Cover Sheet

ECE503: Digital Signal Processing Lecture 5

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

Lecture 18: Stability

Z Transform (Part - II)

Definition of Discrete-Time Fourier Transform (DTFT)

Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes

ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization

ELEG 305: Digital Signal Processing

Discrete Time Fourier Transform (DTFT)

ELC 4351: Digital Signal Processing

Basic Multi-rate Operations: Decimation and Interpolation

Final Exam 14 May LAST Name FIRST Name Lab Time

ECE431 Digital Signal Processing

Final Exam of ECE301, Section 1 (Prof. Chih-Chun Wang) 1 3pm, Friday, December 13, 2016, EE 129.

Signals and Systems. Spring Room 324, Geology Palace, ,

DIGITAL SIGNAL PROCESSING LECTURE 1

Chapter 5 Frequency Domain Analysis of Systems

Transcription:

Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu. The LaTeX slides were made by Prof. Min Wu and Mr. Wei-Hong Chuang. Contact: minwu@umd.edu. Updated: August 28, 2012. (UMD) ENEE630 Lecture Part-0 DSP Review 1 / 22

Outline Discrete-time signals: δ(n), u(n), exponentials, sinusoids Transforms: ZT, FT Discrete-time system: LTI, causality, stability, FIR & IIR system Sampling of a continuous-time signal Discrete-time filters: magnitude response, linear phase Time-frequency relations: FS; FT; DTFT; DFT Homework: Pick up a DSP text and review. (UMD) ENEE630 Lecture Part-0 DSP Review 2 / 22

0.1 Basic Discrete-Time Signals 1 unit pulse (unit sample) δ[n] = { 1 n = 0 0 otherwise 2 unit step { 1 n 0 u[n] = 0 otherwise Questions: What is the relation between δ[n] and u[n]? How to express any x[n] using unit pulses? x[n] = k= x[k]δ[n k] (UMD) ENEE630 Lecture Part-0 DSP Review 3 / 22

0.1 Basic Discrete-Time Signals 3 Sinusoids and complex exponentials x 1 [n] = A cos(ω 0 n + θ) x 2 [n] = ae jω x 0n 2 [n] has real and imaginary parts; known as a single-frequency signal. 4 Exponentials x[n] = a n u[n] (0 < a < 1) x[n] = a n u[ n] x[n] = a n u[ n] Questions: Is x 1 [n] a single-frequency signal? Are x 1 [n] and x 2 [n] periodic? (UMD) ENEE630 Lecture Part-0 DSP Review 4 / 22

0.2 (1) Z-Transform The Z-transform of a sequence x[n] is defined as X(z) = n= x[n]z n. In general, the region of convergence (ROC) takes the form of R 1 < z < R 2. E.g.: x[n] = a n u[n]: X(z) = 1 1 az 1, ROC is z > a. The same X(z) with a different ROC z < a will be the ZT of a different x[n] = a n u[ n 1]. (UMD) ENEE630 Lecture Part-0 DSP Review 5 / 22

0.2 (2) Fourier Transform The Fourier transform of a discrete-time signal x[n] X DTFT (ω) = X(z) z=e jω = n= x[n]e jωn Often known as the Discrete-Time Fourier Transform (DTFT) If the ROC of X(z) includes the unit circle, we evaluate X(z) with z = e jω, we call X(e jω ) the Fourier Transform of x[n] The unit of frequency variable ω is radians X(ω) is periodic with period 2π The inverse transform is x[n] = 1 2π 2π 0 X(ω)e jωn dω (UMD) ENEE630 Lecture Part-0 DSP Review 6 / 22

0.2 (2) Fourier Transform Question: What is the FT of a single-frequency signal e jω 0n? Since the ZT of a n does not converge anywhere except for a = 0, the FT for x[n] = e jω 0n does not exist in the usual sense. But we can unite its FT as 2πδ a (ω ω 0 ) for ω in the range between 0 < ω < 2π and periodically repeating, by using a Dirac delta function δ a ( ). (UMD) ENEE630 Lecture Part-0 DSP Review 7 / 22

0.2 (3) Parseval s Relation Let X(ω) and Y(ω) be the FT of x[n] and y[n], then n= x[n]y [n] = 1 2π 2π 0 X(ω)Y (ω)dω. i.e., the inner product is preserved (except a multiplicative factor): < x[n], y[n] >=< X(ω), Y(ω) > 1 2π 1 If x[n] = y[n], we have n= x[n] 2 = 1 2π 2π 0 X(ω) 2 dω 2 Parseval s Relation suggests that the energy of x[n] is conserved after FT and provides us two ways to express the energy. Question: Prove the Parseval s Relation. (Hint: start with applying the definition of inverse DTFT for x[n] to LHS) (UMD) ENEE630 Lecture Part-0 DSP Review 8 / 22

0.3 (1) Discrete-Time Systems Question 1: How to characterize a general system? (UMD) ENEE630 Lecture Part-0 DSP Review 9 / 22

0.3 (2) Linear Time-Invariant Systems Suppose Linearity (input) a 1 x 1 [n] + a 2 x 2 [n] (output) a 1 y 1 [n] + a 2 y 2 [n] If the output in response to the input a 1 x 1 [n] + a 2 x 2 [n] equals to a 1 y 1 [n] + a 2 y 2 [n] for every pair of constants a 1 and a 2 and every possible x 1 [n] and x 2 [n], we say the system is linear. Shift-Invariance (Time-Invariance) (input) x 1 [n N] (output) y 1 [n N] i.e., The output in response to the shifted input x 1 [n N] equals to y 1 [n N] for all integers N and all possible x 1 [n]. (UMD) ENEE630 Lecture Part-0 DSP Review 10 / 22

0.3 (3) Impulse Response of LTI Systems An LTI system is both linear and shift-invariant. Such a system can be completely characterized by its impulse response h[n]: (input) δ[n] (output) h[n] Recall all x[n] can be represented as x[n] = By LTI property: m= y[n] = m= x[m]h[n m] x[m]δ[n m] (UMD) ENEE630 Lecture Part-0 DSP Review 11 / 22

0.3 (4) Input-Output Relation of LTI Systems The input-output relation of an LTI system is given by a convolution summation: y[n] = h[n] x[n] = }{{}}{{} m= x[m]h[n m] = m= h[m]x[n m] output input The transfer-domain representation is Y(z) = H(z)X(z), where H(z) = Y(z) X(z) = n= h[n]z n is called the transfer function of the LTI system. (UMD) ENEE630 Lecture Part-0 DSP Review 12 / 22

0.3 (5) Rational Transfer Function A major class of transfer functions we are interested in is the rational transfer function: H(z) = B(z) A(z) = N k=0 b kz k N m=0 a mz m {a n } and {b n } are finite and possibly complex. N is the order of the system if B(z)/A(z) is irreducible. (UMD) ENEE630 Lecture Part-0 DSP Review 13 / 22

0.3 (6) Causality The output doesn t depend on future values of the input sequence. (important for processing a data stream in real-time with low delay) An LTI system is causal iff h[n] = 0 n < 0. Question: What property does H(z) have for a causal system? Pitfalls: note the spelling of words casual vs. causal. (UMD) ENEE630 Lecture Part-0 DSP Review 14 / 22

0.3 (7) FIR and IIR systems A causal N-th order finite impulse response (FIR) system can have its transfer function written as H(z) = N n=0 h[n]z n A causal LTI system that is not FIR is said to be IIR (infinite impulse response). e.g. exponential signal h[n] = a n u[n]: its corresponding H(z) = 1 1 az 1. (UMD) ENEE630 Lecture Part-0 DSP Review 15 / 22

0.3 (8) Stability in the BIBO sense BIBO: bounded-input bounded-output An LTI system is BIBO stable iff n= h[n] < i.e. its impulse response is absolutely summable. This sufficient and necessary condition means that ROC of H(z) includes unit circle: H(z) z=e jω n h[n] 1 < If H(z) is rational and h[n] is causal (s.t. ROC takes the form z > r), the system is stable iff all poles are inside the unit circle (such that the ROC includes the unit circle). (UMD) ENEE630 Lecture Part-0 DSP Review 16 / 22

0.4 (1) Fourier Transform We use the subscript a to denote continuous-time (analog) signal and drop the subscript if the context is clear. The Fourier Transform of a continuous-time signal x a (t) X a (Ω) x a(t)e jωt dt projection x a (t) = 1 2π X a(ω)e jωt dω Ω = 2πf and is in radian per second f is in Hz (i.e., cycles per second) reconstruction (UMD) ENEE630 Lecture Part-0 DSP Review 17 / 22

0.4 (2) Sampling Consider a sampled signal x[n] x a (nt ). T > 0: sampling period; 2π/T : sampling (radian) frequency The Discrete Time Fourier Transform of x[n] and the Fourier Transform of x a (t) have the following relation: X(ω) = 1 T k= X a(ω 2πk T ) Ω= ω T (UMD) ENEE630 Lecture Part-0 DSP Review 18 / 22

0.4 (3) Aliasing If X a (Ω) = 0 for Ω π T (i.e., band limited), there is no overlap between X a (Ω) and its shifted replicas. Can recover x a (t) from the sampled version x[n] by retaining only one copy of X a (Ω). This can be accomplished by interpolation/filtering. Otherwise, overlap occurs. This is called aliasing. Reference: Chapter 7 Sampling in Oppenheim et al. Signals and Systems Book (UMD) ENEE630 Lecture Part-0 DSP Review 19 / 22

0.4 (4) Sampling Theorem Let x a (t) be a band-limited signal with X a (Ω) = 0 for Ω σ, then x a (t) is uniquely determined by its samples x a (nt ), n Z, if the sampling frequency Ω s 2π/T satisfies Ω s 2σ. In the ω domain, 2π is the (normalized) sampling rate for any sampling period T. Thus the signal bandwidth can at most be π to avoid aliasing. (UMD) ENEE630 Lecture Part-0 DSP Review 20 / 22

0.5 Discrete-Time Filters 1 A Digital Filter is an LTI system with rational transfer function. The frequency response H(e jω ) specifies the properties of a filter: H(ω) = H(ω) e jφ(ω) H(ω) : magnitude response φ(ω): phase response 2 Magnitude response determines the type of filters: 3 Linear-phase filter: phase response φ(ω) is linear in ω. Linear phase is usually the minimal phase distortion we can expect. A real-valued linear-phase FIR filter of length N normally is either symmetric h[n] = h[n n] or anti-symmetric h[n] = h[n n]. (UMD) ENEE630 Lecture Part-0 DSP Review 21 / 22

0.6 Relations of Several Transforms (answer) TRANSFORM TIME-DOMAIN (Analysis) FREQUENCY-DOMAIN (Synthesis) Fourier Series (FS) x(t) continuous periodic X n discrete aperiodic X n = 1 + T 2 T T x(t)e j2πnt/t + dt x(t) = X ne j2πnt/t 2 n= Fourier Transform (FT ) Discrete-Time Fourier Transform (DTFT ) x(t) continuous aperiodic X (Ω) continuous aperiodic + X (Ω) = x(t)e jωt dt x(t) = 1 + X (Ω)e jωt dω 2π (or in f where Ω = 2πf ) x[n] discrete aperiodic X (ω) continuous periodic + X (ω) = x[n]e jωn x[n] = 1 +π X (ω)e jωn dω n= 2π π Discrete Fourier Transform (DFT ) x[n] discrete periodic N 1 X [k] = x[n]w kn N n=0 (where W kn N = e j2πkn/n ) X [k] discrete periodic x[n] = 1 N 1 X [k]w kn N N k=0 (UMD) ENEE630 Lecture Part-0 DSP Review 22 / 22

0.6 Relations of Several Transforms TRANSFORM TIME-DOMAIN (Analysis) FREQUENCY-DOMAIN (Synthesis) Fourier Series (FS) x(t) continuous periodic X n discrete aperiodic X n = 1 + T 2 T T x(t)e j2πnt/t + dt x(t) = X ne j2πnt/t 2 n= Fourier Transform (FT ) Discrete-Time Fourier Transform (DTFT ) x(t) continuous aperiodic X (Ω) continuous aperiodic + X (Ω) = x(t)e jωt dt x(t) = 1 + X (Ω)e jωt dω 2π (or in f where Ω = 2πf ) x[n] discrete aperiodic X (ω) continuous periodic + X (ω) = x[n]e jωn x[n] = 1 +π X (ω)e jωn dω n= 2π π Discrete Fourier Transform (DFT ) x[n] discrete periodic N 1 X [k] = x[n]w kn N n=0 (where W kn N = e j2πkn/n ) X [k] discrete periodic x[n] = 1 N 1 X [k]w kn N N k=0 (UMD) ENEE630 Lecture Part-0 DSP Review 1 / 1

0.3 (1) Discrete-Time Systems Question 1: How to characterize a general system? Ans: by its input-output response (which may require us to enumerate all possible inputs, and observe and record the corresponding outputs) Question 2: Why are we interested in LTI systems? Ans: They can be completely characterized by just one response - the response to impulse input (UMD) ENEE630 Lecture Part-0 DSP Review 9 / 22