UNIT - 4 ANALYSIS OF DISCRETE TIME SIGNALS. Sampling Frequency Harry Nyquist, working at Bell Labs developed what has become known as the Nyquist Sampling.

Slides:



Advertisements
Similar presentations
Z-Plane Analysis DR. Wajiha Shah. Content Introduction z-Transform Zeros and Poles Region of Convergence Important z-Transform Pairs Inverse z-Transform.
Advertisements

Signals and Systems Fall 2003 Lecture #22 2 December 2003
The z-Transform: Introduction
ECON 397 Macroeconometrics Cunningham
IT-101 Section 001 Lecture #8 Introduction to Information Technology.
Signal and System I Causality ROC for n < 0 causal All z -n terms, not include any z terms If and only if ROC is exterior of a circle and include.
Hany Ferdinando Dept. of Electrical Eng. Petra Christian University
ELEN 5346/4304 DSP and Filter Design Fall Lecture 7: Z-transform Instructor: Dr. Gleb V. Tcheslavski Contact:
AMI 4622 Digital Signal Processing
EE-2027 SaS, L13 1/13 Lecture 13: Inverse Laplace Transform 5 Laplace transform (3 lectures): Laplace transform as Fourier transform with convergence factor.
Lecture 19: Discrete-Time Transfer Functions
Discrete-Time Signal processing Chapter 3 the Z-transform
Z-Transform Fourier Transform z-transform. Z-transform operator: The z-transform operator is seen to transform the sequence x[n] into the function X{z},
Image (and Video) Coding and Processing Lecture 2: Basic Filtering Wade Trappe.
EC 2314 Digital Signal Processing By Dr. K. Udhayakumar.
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
The sampling of continuous-time signals is an important topic It is required by many important technologies such as: Digital Communication Systems ( Wireless.
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Properties of the z-Transform
The z-Transform Prof. Siripong Potisuk. LTI System description Previous basis function: unit sample or DT impulse  The input sequence is represented.
10.0 Z-Transform 10.1 General Principles of Z-Transform linear, time-invariant Z-Transform Eigenfunction Property y[n] = H(z)z n h[n]h[n] x[n] = z n.
CE Digital Signal Processing Fall 1992 Z Transform
Fourier Series Summary (From Salivahanan et al, 2002)
CHAPTER 4 Laplace Transform.
1 1 Chapter 3 The z-Transform 2 2  Consider a sequence x[n] = u[n]. Its Fourier transform does not converge.  Consider that, instead of e j , we use.
Signal and Systems Prof. H. Sameti Chapter 5: The Discrete Time Fourier Transform Examples of the DT Fourier Transform Properties of the DT Fourier Transform.
CHAPTER 4 Laplace Transform.
Dan Ellis 1 ELEN E4810: Digital Signal Processing Topic 4: The Z Transform 1.The Z Transform 2.Inverse Z Transform.
Chapter 5 Z Transform. 2/45  Z transform –Representation, analysis, and design of discrete signal –Similar to Laplace transform –Conversion of digital.
Z Transform Chapter 6 Z Transform. z-Transform The DTFT provides a frequency-domain representation of discrete-time signals and LTI discrete-time systems.
1 Z-Transform. CHAPTER 5 School of Electrical System Engineering, UniMAP School of Electrical System Engineering, UniMAP NORSHAFINASH BT SAUDIN
The Inverse z-Transform In science one tries to tell people, in such a way as to be understood by everyone, something that no one ever knew before. But.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Department of Computer Eng. Sharif University of Technology Discrete-time signal processing Chapter 3: THE Z-TRANSFORM Content and Figures are from Discrete-Time.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Z TRANSFORM AND DFT Z Transform
ES97H Biomedical Signal Processing
Digital Signal Processing
Signal and Systems Prof. H. Sameti Chapter 10: Introduction to the z-Transform Properties of the ROC of the z-Transform Inverse z-Transform Examples Properties.
The Z-Transform Quote of the Day Such is the advantage of a well-constructed language that its simplified notation often becomes the source of profound.
Transform Analysis of LTI Systems Quote of the Day Any sufficiently advanced technology is indistinguishable from magic. Arthur C. Clarke Content and Figures.
Chapter 7 The Laplace Transform
Lecture 5 – 6 Z - Transform By Dileep Kumar.
Sampling and Reconstruction The impulse response of an continuous-time ideal low pass filter is the inverse continuous Fourier transform of its frequency.
Digital Signal Processing Applications(310253) UNIT-III Z-Transform Prof. Vina M. Lomte RMDSSOE,Warje 3/18/2016.
Chapter 2 The z-transform and Fourier Transforms The Z Transform The Inverse of Z Transform The Prosperity of Z Transform System Function System Function.
Review of DSP.
Lecture 26 Outline: Z Transforms Announcements: Reading: “8: z-transforms” pp (no inverse or unilateral z transforms) HW 9 posted, due 6/3 midnight.
The z-Transform Page 1 Chapter 2 Z-transfrom The Z-Transfrom.
Properties of the z-Transform
Review of DSP.
(2) Region of Convergence ( ROC )
The Z-Transform.
CHAPTER 5 Z-Transform. EKT 230.
LAPLACE TRANSFORMS PART-A UNIT-V.
Chapter 5 Z Transform.
The Inverse Z-Transform
UNIT II Analysis of Continuous Time signal
Quick Review of LTI Systems
The sampling of continuous-time signals is an important topic
Prof. Vishal P. Jethava EC Dept. SVBIT,Gandhinagar
Chapter 5 DT System Analysis : Z Transform Basil Hamed
Discrete-Time Signal processing Chapter 3 the Z-transform
Z TRANSFORM AND DFT Z Transform
Discrete-Time Signal processing Chapter 3 the Z-transform
Discrete-Time Signal processing Chapter 3 the Z-transform
9.0 Laplace Transform 9.1 General Principles of Laplace Transform
10.0 Z-Transform 10.1 General Principles of Z-Transform Z-Transform
Review of DSP.
Presentation transcript:

UNIT - 4 ANALYSIS OF DISCRETE TIME SIGNALS

Sampling Frequency Harry Nyquist, working at Bell Labs developed what has become known as the Nyquist Sampling Theorem: – In order to be ‘perfectly’ represented by its samples, a signal must be sampled at a sampling rate (also called sampling frequency) equal to at least twice its highest frequency component – Or: f s = 2f – Note that f s here is frequency of sampling, not the frequency of the sample How often do you sample? The sampling rate depends on the signal’s highest frequency (for baseband)

Sampling Rate Examples Take Concert A: 440 Hz – What would be the minimum sampling rate needed to accurately capture this signal? – f s = 2 x 440 Hz = 880 Hz Take your telephone  used for voice, mostly – Highest voice component is: 3000 Hz – Minimum sampling rate: f s = 2 x 3000 Hz = 6000 Hz – Real telephone digitization is done at 8000 Hz sampling rate (supporting a 4 kHz bandwidth). Why? Remember that Nyquist said “equal to at least twice…”

 Undersampling and Oversampling Undersampling – Sampling at an inadequate frequency rate – Aliased into new form - Aliasing – Loses information in the original signal Oversampling – Sampling at a rate higher than minimum rate – More values to digitize and process – Increases the amount of storage and transmission – COST $$

Effects of Undersampling Original waveform Reconstructed waveform

DISCRETE TIME FOURIER TRANSFROM (DTFT)

FREQUENCY SPECTRUM

Derivation of the Discrete-time Fourier Transform

Recall DTFS pair where

The limit of integration is over any interval of 2  in   Periodic in  with period 2  Thus,

DTFT Pair

Conditions for Convergence

Examples

IDTFT

6) Complex Exponentials

DTFT of Periodic Signals Recall the following DTFT pair: Represent periodic signal x[n] in terms of DTFS:

Example: A discrete-time Sine Function

Example: A discrete-time Periodic Impulse Train The DTFS coefficients for this signal are: ckck

Properties of DTFT

Convolution Property

Multiplication Property

PROPERTIES OF DTFT

The z-Transform

Content Introduction z-Transform Zeros and Poles Region of Convergence Important z-Transform Pairs Inverse z-Transform z-Transform Theorems and Properties System Function

The z-Transform Introduction

Why z-Transform? A generalization of Fourier transform Why generalize it? – FT does not converge on all sequence – Notation good for analysis – Bring the power of complex variable theory deal with the discrete-time signals and systems

The z-Transform z-Transform

Definition The z-transform of sequence x(n) is defined by Let z = e  j . Fourier Transform

z-Plane Re Im z = e  j   Fourier Transform is to evaluate z-transform on a unit circle.

z-Plane Re Im X(z)X(z) Re Im z = e  j  

Periodic Property of FT Re Im X(z)X(z)  X(ej)X(ej) Can you say why Fourier Transform is a periodic function with period 2  ?

The z-Transform Zeros and Poles

Definition Give a sequence, the set of values of z for which the z-transform converges, i.e., |X(z)|< , is called the region of convergence. ROC is centered on origin and consists of a set of rings.

Example: Region of Convergence Re Im ROC is an annual ring centered on the origin. r

Stable Systems A stable system requires that its Fourier transform is uniformly convergent. Re Im 1 Fact: Fourier transform is to evaluate z-transform on a unit circle. A stable system requires the ROC of z-transform to include the unit circle.

Example: A right sided Sequence n x(n)x(n)...

Example: A right sided Sequence For convergence of X(z), we require that

a aa Example: A right sided Sequence ROC for x(n)=a n u(n) Re Im 1 a aa Re Im 1 Which one is stable?

Example: A left sided Sequence n x(n)x(n)...

Example: A left sided Sequence For convergence of X(z), we require that

a aa Example: A left sided Sequence ROC for x(n)=  a n u(  n  1) Re Im 1 a aa Re Im 1 Which one is stable?

The z-Transform Region of Convergence

Represent z-transform as a Rational Function where P(z) and Q(z) are polynomials in z. Zeros: The values of z’s such that X(z) = 0 Poles: The values of z’s such that X(z) = 

Example: A right sided Sequence Re Im a ROC is bounded by the pole and is the exterior of a circle.

Example: A left sided Sequence Re Im a ROC is bounded by the pole and is the interior of a circle.

Example: Sum of Two Right Sided Sequences Re Im 1/2  1/3 1/12 ROC is bounded by poles and is the exterior of a circle. ROC does not include any pole.

Example: A Two Sided Sequence Re Im 1/2  1/3 1/12 ROC is bounded by poles and is a ring. ROC does not include any pole.

Example: A Finite Sequence Re Im ROC: 0 < z <  ROC does not include any pole. N-1 poles N-1 zeros Always Stable

Properties of ROC A ring or disk in the z-plane centered at the origin. The Fourier Transform of x(n) is converge absolutely iff the ROC includes the unit circle. The ROC cannot include any poles Finite Duration Sequences: The ROC is the entire z-plane except possibly z=0 or z= . Right sided sequences: The ROC extends outward from the outermost finite pole in X(z) to z= . Left sided sequences: The ROC extends inward from the innermost nonzero pole in X(z) to z=0.

More on Rational z-Transform Re Im abc Consider the rational z-transform with the pole pattern: Find the possible ROC’s

More on Rational z-Transform Re Im abc Consider the rational z-transform with the pole pattern: Case 1: A right sided Sequence.

More on Rational z-Transform Re Im abc Consider the rational z-transform with the pole pattern: Case 2: A left sided Sequence.

More on Rational z-Transform Re Im abc Consider the rational z-transform with the pole pattern: Case 3: A two sided Sequence.

More on Rational z-Transform Re Im abc Consider the rational z-transform with the pole pattern: Case 4: Another two sided Sequence.

The z-Transform Important z-Transform Pairs

Z-Transform Pairs Sequencez-TransformROC All z All z except 0 (if m>0) or  (if m<0)

Z-Transform Pairs Sequencez-TransformROC

The z-Transform Inverse z-Transform

The Inverse Z-Transform Formal inverse z-transform is based on a Cauchy integral Less formal ways sufficient most of the time – Inspection method – Partial fraction expansion – Power series expansion

Inspection Method – Make use of known z-transform pairs such as Example: The inverse z-transform of

Inverse Z-Transform by Partial Fraction Expansion Assume that a given z-transform can be expressed as Apply partial fractional expansion First term exist only if M>N – B r is obtained by long division Second term represents all first order poles Third term represents an order s pole – There will be a similar term for every high-order pole Each term can be inverse transformed by inspection

Partial Fractional Expression Coefficients are given as

Example: 2 nd Order Z-Transform – Order of nominator is smaller than denominator (in terms of z -1 ) No higher order pole

Example Continued ROC extends to infinity – Indicates right sided sequence

Example #2 Long division to obtain B o

Example #2 Continued ROC extends to infinity – Indicates right-sides sequence

Inverse Z-Transform by Power Series Expansion The z-transform is power series In expanded form Z-transforms of this form can generally be inversed easily Especially useful for finite-length series

Example,

Z-Transform Properties: Linearity Notation Linearity – Note that the ROC of combined sequence may be larger than either ROC – This would happen if some pole/zero cancellation occurs – Example: Both sequences are right-sided Both sequences have a pole z=a Both have a ROC defined as |z|>|a| In the combined sequence the pole at z=a cancels with a zero at z=a The combined ROC is the entire z plane except z=0

Z-Transform Properties: Time Shifting Here n o is an integer – If positive the sequence is shifted right – If negative the sequence is shifted left The ROC can change the new term may – Add or remove poles at z=0 or z=  Example

Z-Transform Properties: Multiplication by Exponential ROC is scaled by |z o | All pole/zero locations are scaled If z o is a positive real number: z-plane shrinks or expands If z o is a complex number with unit magnitude it rotates Example: We know the z-transform pair Let’s find the z-transform of

Z-Transform Properties: Differentiation Example: We want the inverse z-transform of Let’s differentiate to obtain rational expression Making use of z-transform properties and ROC Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing86

Z-Transform Properties: Conjugation Example Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing87

Z-Transform Properties: Time Reversal ROC is inverted Example: Time reversed version of Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing88

Z-Transform Properties: Convolution Convolution in time domain is multiplication in z-domain Example:Let’s calculate the convolution of Multiplications of z-transforms is ROC: if |a| 1 if |a|>1 ROC is |z|>|a| Partial fractional expansion of Y(z) Copyright (C) 2005 Güner Arslan 351M Digital Signal Processing89

The z-Transform z-Transform Theorems and Properties

Linearity Overlay of the above two ROC’s

Shift

Multiplication by an Exponential Sequence

Differentiation of X(z)

Conjugation

Reversal

Real and Imaginary Parts

Initial Value Theorem

Convolution of Sequences

The z-Transform System Function

Shift-Invariant System h(n)h(n) h(n)h(n) x(n)x(n) y(n)=x(n)*h(n) X(z)X(z)Y(z)=X(z)H(z) H(z)H(z)

Shift-Invariant System H(z)H(z) H(z)H(z) X(z)X(z) Y(z)Y(z)

N th -Order Difference Equation

Representation in Factored Form Contributes poles at 0 and zeros at c r Contributes zeros at 0 and poles at d r

Stable and Causal Systems Re Im Causal Systems : ROC extends outward from the outermost pole.

Stable and Causal Systems Re Im Stable Systems : ROC includes the unit circle. 1

Example Consider the causal system characterized by Re Im 1 a

Determination of Frequency Response from pole-zero pattern A LTI system is completely characterized by its pole-zero pattern. Example: Re Im z1z1 p1p1 p2p2

Determination of Frequency Response from pole-zero pattern A LTI system is completely characterized by its pole-zero pattern. Example: Re Im z1z1 p1p1 p2p2 |H(e j  )|=?  H(e j  )=?

Determination of Frequency Response from pole-zero pattern A LTI system is completely characterized by its pole-zero pattern. Example: Re Im z1z1 p1p1 p2p2 |H(e j  )|=?  H(e j  )=? |H(e j  )| = | 11 22 33  H(e j  ) =  1  (  2 +  3 )

Example Re Im a dB