LAPLACE TRANSFORMS PART-A UNIT-V.

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
Signal Processing in the Discrete Time Domain Microprocessor Applications (MEE4033) Sogang University Department of Mechanical Engineering.
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.
ELEN 5346/4304 DSP and Filter Design Fall Lecture 7: Z-transform Instructor: Dr. Gleb V. Tcheslavski Contact:
AMI 4622 Digital Signal Processing
Bogazici University Dept. Of ME. Laplace Transforms Very useful in the analysis and design of LTI systems. Operations of differentiation and integration.
EE-2027 SaS, L11 1/13 Lecture 11: Discrete Fourier Transform 4 Sampling Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
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},
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.
UNIT - 4 ANALYSIS OF DISCRETE TIME SIGNALS. Sampling Frequency Harry Nyquist, working at Bell Labs developed what has become known as the Nyquist Sampling.
THE LAPLACE TRANSFORM LEARNING GOALS Definition The transform maps a function of time into a function of a complex variable Two important singularity functions.
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
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 9: Laplace Transform  Motivatio n and Definition of the (Bilateral) Laplace Transform  Examples of Laplace.
Chapter 5 Z Transform. 2/45  Z transform –Representation, analysis, and design of discrete signal –Similar to Laplace transform –Conversion of digital.
1 Z-Transform. CHAPTER 5 School of Electrical System Engineering, UniMAP School of Electrical System Engineering, UniMAP NORSHAFINASH BT SAUDIN
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.
10. Laplace TransforM Technique
THE LAPLACE TRANSFORM LEARNING GOALS Definition
ES97H Biomedical 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.
Chapter 7 The Laplace Transform
Motivation for 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.
The z-Transform Page 1 Chapter 2 Z-transfrom The Z-Transfrom.
Properties of the z-Transform
Digital and Non-Linear Control
Review of DSP.
Lecture 7: Z-Transform Remember the Laplace transform? This is the same thing but for discrete-time signals! Definition: z is a complex variable: imaginary.
(2) Region of Convergence ( ROC )
The Z-Transform.
CHAPTER 5 Z-Transform. EKT 230.
Mathematical Modeling of Control Systems
Recap: Chapters 1-7: Signals and Systems
Complex Frequency and Laplace Transform
Everything You Ever Wanted to Know About Filters*
Chapter 5 Z Transform.
The Inverse Z-Transform
UNIT II Analysis of Continuous Time signal
Signal and Systems Chapter 9: Laplace Transform
LECTURE 28: THE Z-TRANSFORM AND ITS ROC PROPERTIES
The sampling of continuous-time signals is an important topic
Prof. Vishal P. Jethava EC Dept. SVBIT,Gandhinagar
Research Methods in Acoustics Lecture 9: Laplace Transform and z-Transform Jonas Braasch.
Chapter 5 DT System Analysis : Z Transform Basil Hamed
Discrete-Time Signal processing Chapter 3 the Z-transform
Z TRANSFORM AND DFT Z Transform
1 Z Transform Dr.P.Prakasam Professor/ECE 9/18/2018SS/Dr.PP/ZT.
Z-Transform ENGI 4559 Signal Processing for Software Engineers
Discrete-Time Signal processing Chapter 3 the Z-transform
Lecture #6 INTRODUCTION TO 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
CHAPTER 4 Laplace Transform. EMT Signal Analysis.
Review of DSP.
Signals and Systems Lecture 27
THE LAPLACE TRANSFORM LEARNING GOALS Definition
Presentation transcript:

LAPLACE TRANSFORMS PART-A UNIT-V

The Laplace Transform of a function, f(t), is defined as; The Inverse Laplace Transform is defined by In the undergraduate curriculum, usually there are 3 transform pairs that are studied. These are The Laplace Transform The Fourier Transform The Z-Transform The Laplace transform is usually used in solving continuous linear differential equations of the type encountered in circuit theory and systems. The advantage of the Laplace transform is that it makes cumbersome differential equations algebraic and therefore the math becomes simpler to handle. In the end we can take the inverse and go back to the time domain. In systems, for example, we stay with the Laplace variable “s” while investigating system stability, system performance. We use tools such as the root locus and block diagrams which are directly in the s variable. Even Bode is used where s is replaced by jw. We are “walking” with one foot in s but thinking the time domain. The Fourier transform is used very much in communication theory, field theory and generally in the study of signal spectrum and both analog and digital filter analysis and design. The Z-transform is sort of similar to the Laplace transform. In fact, many of the manipulations such as partial fraction expansion, taking the inverse, interrupting stability are very similar to those performed in the Laplace. The big difference is that the Z-transform is used for discrete systems and difference equations. At the University of Tennessee you will be studying the Fourier and Z-transforms in your junior year and you will also study the Laplace transform again.

The Laplace Transform The Laplace Transform of a unit step is: Laplace Transform of the unit step. The unit step is called a singularity function because it does not possess a derivative at t = 0. We also say that it is not defined at t = 0. Along this line, you will note that many text books define the Laplace by using a lower limit of 0- rather than absolute zero. One must ask, if you integrate from 0 to infinity for a unit step, how are you handling the lower limit when the step is not defined at t = 0? We will not get worked up over this. You can take this apart later after you become experts in transforms. The Laplace Transform of a unit step is:

The Laplace Transform (t – t0) = 0 t The Laplace transform of a unit impulse: Pictorially, the unit impulse appears as follows: f(t) (t – t0) t0 At this point, the best thing to do is not to worry about it. Accept it as we have defined it here and go ahead and use it. Probably one day in a higher level math course you may give more attention to its attributes. Mathematically: (t – t0) = 0 t

The Laplace Transform The Laplace transform of a unit impulse: An important property of the unit impulse is a sifting or sampling property. The following is an important.

The Laplace Transform The Laplace transform of a unit impulse: In particular, if we let f(t) = (t) and take the Laplace

The Laplace Transform Building transform pairs: A transform pair

The Laplace Transform Frequency Shift

The Laplace Transform Time Integration: The property is:

The Laplace Transform Time Integration: Making these substitutions and carrying out The integration shows that

The Laplace Transform Time Differentiation: If the L[f(t)] = F(s), we want to show: Integrate by parts: As noted earlier, some text will use 0- on the lower part of the defining integral of the Laplace transform. When this is done, f(0) above will become f(0-).

The Laplace Transform Time Differentiation: Making the previous substitutions gives, So we have shown:

The Laplace Transform Time Differentiation: We can extend the previous to show;

The Laplace Transform Transform Pairs: f(t) F(s)

The Laplace Transform Transform Pairs: f(t) F(s)

The Laplace Transform Theorem: Initial Value Theorem: Initial Value If the function f(t) and its first derivative are Laplace transformable and f(t) Has the Laplace transform F(s), and the exists, then Initial Value Theorem The utility of this theorem lies in not having to take the inverse of F(s) in order to find out the initial condition in the time domain. This is particularly useful in circuits and systems.

The Laplace Transform Theorem: Final Value Theorem: Final Value If the function f(t) and its first derivative are Laplace transformable and f(t) has the Laplace transform F(s), and the exists, then Final Value Theorem Again, the utility of this theorem lies in not having to take the inverse of F(s) in order to find out the final value of f(t) in the time domain. This is particularly useful in circuits and systems.

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

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

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.

Example: Region of Convergence Im r

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

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

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 left sided Sequence Re Im ROC is bounded by the pole and is the interior of a circle. a

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

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

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 Consider the rational z-transform with the pole pattern: Re Im a b c Case 1: A right sided Sequence.

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

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

Linearity Overlay of the above two ROC’s

Conjugation

Reversal

Real and Imaginary Parts

Initial Value Theorem

Convolution of Sequences

Convolution of Sequences

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

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

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

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

Determination of Frequency Response from pole-zero pattern A LTI system is completely characterized by its pole-zero pattern. Example: Re Im z1 p1 p2