Review of DSP.

Slides:



Advertisements
Similar presentations
Signals and Systems Fall 2003 Lecture #22 2 December 2003
Advertisements

The z-Transform: Introduction
Signal Processing in the Discrete Time Domain Microprocessor Applications (MEE4033) Sogang University Department of Mechanical Engineering.
Copyright ©2010, ©1999, ©1989 by Pearson Education, Inc. All rights reserved. Discrete-Time Signal Processing, Third Edition Alan V. Oppenheim Ronald W.
Hany Ferdinando Dept. of Electrical Eng. Petra Christian University
AMI 4622 Digital Signal Processing
Chapter 8: The Discrete Fourier Transform
Lecture #8 INTRODUCTION TO THE Z-TRANSFORM Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh, Pennsylvania.
Discrete-Time Signal processing Chapter 3 the Z-transform
9.0 Laplace Transform 9.1 General Principles of Laplace Transform linear time-invariant Laplace Transform Eigenfunction Property y(t) = H(s)e st h(t)h(t)
Lecture #07 Z-Transform meiling chen signals & systems.
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.
Digital Signals and Systems
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.
UNIT - 4 ANALYSIS OF DISCRETE TIME SIGNALS. Sampling Frequency Harry Nyquist, working at Bell Labs developed what has become known as the Nyquist Sampling.
Chapter 2 Discrete-Time Signals and Systems
1 Signals & Systems Spring 2009 Week 3 Instructor: Mariam Shafqat UET Taxila.
Chapter 2: Discrete time signals and systems
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
(Lecture #08)1 Digital Signal Processing Lecture# 8 Chapter 5.
Discrete-time Systems Prof. Siripong Potisuk. Input-output Description A DT system transforms DT inputs into DT outputs.
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.
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
Zhongguo Liu_Biomedical Engineering_Shandong Univ. Chapter 8 The Discrete Fourier Transform Zhongguo Liu Biomedical Engineering School of Control.
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
Department of Electrical and Computer Engineering Brian M. McCarthy Department of Electrical & Computer Engineering Villanova University ECE8231 Digital.
Fourier Analysis of Signals and Systems
EEE 503 Digital Signal Processing Lecture #2 : EEE 503 Digital Signal Processing Lecture #2 : Discrete-Time Signals & Systems Dr. Panuthat Boonpramuk Department.
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.
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
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.
DISP 2003 Lecture 5 – Part 1 Digital Filters 1 Frequency Response Difference Equations FIR versus IIR FIR Filters Properties and Design Philippe Baudrenghien,
Digital Signal Processing Applications(310253) UNIT-III Z-Transform Prof. Vina M. Lomte RMDSSOE,Warje 3/18/2016.
Chapter 2. Signals and Linear Systems
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.
In summary If x[n] is a finite-length sequence (n  0 only when |n|
The z-Transform Page 1 Chapter 2 Z-transfrom The Z-Transfrom.
Discrete Time Signal Processing Chu-Song Chen (陳祝嵩) Institute of Information Science Academia Sinica 中央研究院 資訊科學研究所.
Review of DSP.
The Z-Transform.
CHAPTER 5 Z-Transform. EKT 230.
CEN352 Dr. Nassim Ammour King Saud University
Linear Constant-coefficient Difference Equations
Recap: Chapters 1-7: Signals and Systems
LAPLACE TRANSFORMS PART-A UNIT-V.
Prof. Vishal P. Jethava EC Dept. SVBIT,Gandhinagar
Research Methods in Acoustics Lecture 9: Laplace Transform and z-Transform Jonas Braasch.
Discrete-Time Signal processing Chapter 3 the Z-transform
Z TRANSFORM AND DFT Z Transform
Discrete-Time Signal processing Chapter 3 the Z-transform
Signals & Systems (CNET - 221) Chapter-3 Linear Time Invariant System
Discrete-Time Signal processing Chapter 3 the Z-transform
Concept of frequency in Discrete Signals & Introduction to LTI Systems
10.0 Z-Transform 10.1 General Principles of Z-Transform Z-Transform
Review of DSP.
Lecture 3 Discrete time systems
Presentation transcript:

Review of DSP

Signal and Systems: Signal are represented mathematically as functions of one or more independent variables. Digital signal processing deals with the transformation of signal that are discrete in both amplitude and time. Discrete time signal are represented mathematically as sequence of numbers.

Signals and Systems: A discrete time system is defined mathematically as a transformation or operator. y[n] = T{ x[n] } T{.} x [n] y [n]

Linear Systems: The class of linear systems is defined by the principle of superposition. And Where a is the arbitrary constant. The first property is called the additivity property and the second is called the homogeneity or scaling property.

Linear Systems: These two property can be combined into the principle of superposition, H Linear System H H

Time-Invariant Systems: A Time-Invariant system is a system for witch a time shift or delay of the input sequence cause a corresponding shift in the output sequence. H H

LTI Systems: A particular important class of systems consists of those that are linear and time invariant. LTI systems can be completely characterized by their impulse response. From principle of superposition: Property of TI:

LTI Systems (Convolution): Above equation commonly called convolution sum and represented by the notation

Convolution properties: Commutativity: Associativity: Distributivity: Time reversal:

…Convolution properties: If two systems are cascaded, The overall impulse response of the combined system is the convolution of the individual IR: The overall IR is independent of the order: H1 H2 H2 H1

Duration of IR: Infinite-duration impulse-response (IIR). Finite-duration impulse-response (FIR) In this case the IR can be read from the right-hand side of:

Transforms: Transforms are a powerful tool for simplifying the analysis of signals and of linear systems. Interesting transforms for us: Linearity applies: Convolution is replaced by simpler operation:

…Transforms: Most commonly transforms that are used in communications engineering are: Laplace transforms (Continuous in Time & Frequency) Continuous Fourier transforms (Continuous in Time) Discrete Fourier transforms (Discrete in Time) Z transforms (Discrete in Time)

The Z Transform: Definition Equations: Direct Z transform The Region Of Convergence (ROC) plays an essential role.

The Z Transform (Elementary functions): Elementary functions and their Z-transforms: Unit impulse: Delayed unit impulse:

The Z Transform (…Elementary functions): Unit Step: Exponential:

Z Transform (Cont’d) Important Z Transforms |z| > |a| Region Of Convergence (ROC) Whole Page Whole Page Unit Circle |z| > |a|

The Z Transform (Elementary properties): Elementary properties of the Z transforms: Linearity: Convolution: if ,Then

The Z Transform (…Elementary properties): Shifting: Differences: Forward differences of a function, Backward differences of a function,

The Z Transform (…Region Of Convergence for Z transform): Since the shifting theorem

The Z Transform (Region Of Convergence for Z transform): The ROC is a ring or disk in the z-plane centered at the origin :i.e., The Fourier transform of x[n] converges at absolutely if and only if the ROC of the z-transform of x[n] includes the unit circle. The ROC can not contain any poles.

The Z Transform (…Region Of Convergence for Z transform): If x[n] is a finite-duration sequence, then the ROC is the entire z-plane, except possibly or . If x[n] is a right-sided sequence, the ROC extends outward from the outermost finite pole in to . The ROC must be a connected region.

The Z Transform (…Region Of Convergence for Z transform): A two-sided sequence is an infinite-duration sequence that is neither right sided nor left sided. If x[n] is a two-sided sequence, the ROC will consist of a ring in the z-plane, bounded on the interior and exterior by a pole and not containing any poles. If x[n] is a left-sided sequence, the ROC extends in ward from the innermost nonzero pole in to .

The Z Transform (Application to LTI systems): We have seen that By the convolution property of the Z transform Where H(z) is the transfer function of system. Stability A system is stable if a bounded input produced a bounded output, and a LTI system is stable if:

Fourier Transform Time Transform Type Frequency Continuous Continuous Discrete Continuous Discrete Time Continuous FFT Continuous Discrete Fourier Series Discrete Discrete Discrete Time Discrete FFT

The Discrete Fourier Transform (DFT) It is customary to use the Then the direct form is:

The Discrete Fourier Transform (DFT) With the same notation the inverse DFT is

The DFT (Elementary functions): Elementary functions and their DFT: Unit impulse: Shifted unit impulse:

The DFT (…Elementary functions): Constant: Complex exponential:

The DFT (…Elementary functions): Cosine function:

The DFT (Elementary properties): Elementary properties of the DFT: Symmetry: If ,Then Linearity: if and

The DFT (…Elementary properties): Shifting: because of the cyclic nature of DFT domains, shifting becomes a rotation. if ,Then Time reversal:

The DFT (…Elementary properties): Cyclic convolution: convolution is a shift, multiply and add operation. Since all shifts in the DFT are circular, convolution is defined with this circularity included.