EE123 Digital Signal Processing

Similar documents
EE123 Digital Signal Processing

EE123 Digital Signal Processing

EE123 Digital Signal Processing

Signal Processing. Lecture 02: Discrete Time Signals and Systems. Ahmet Taha Koru, Ph. D. Yildiz Technical University.

ELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems

ECE4270 Fundamentals of DSP. Lecture 2 Discrete-Time Signals and Systems & Difference Equations. Overview of Lecture 2. More Discrete-Time Systems

Signals and Systems. Problem Set: From Continuous-Time to Discrete-Time

DIGITAL SIGNAL PROCESSING LECTURE 3

2D DSP Basics: 2D Systems

ADVANCED DIGITAL SIGNAL PROCESSING

x[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.

Signal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform

Solution of EECS 315 Final Examination F09

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ELEG3503 Introduction to Digital Signal Processing

M2.The Z-Transform and its Properties

Solutions - Homework # 1

Signals & Systems Chapter3

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

Solutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.

Computing the output response of LTI Systems.

EECE 301 Signals & Systems

EEO 401 Digital Signal Processing Prof. Mark Fowler

ECE 308 Discrete-Time Signals and Systems

Discrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Question1 Multiple choices (circle the most appropriate one):

Linear time invariant systems

Chapter 2 Systems and Signals

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

Frequency Response of FIR Filters

Introduction to Signals and Systems, Part V: Lecture Summary

Generalizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations

COMM 602: Digital Signal Processing

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

Discrete-Time System Properties. Discrete-Time System Properties. Terminology: Implication. Terminology: Equivalence. Reference: Section 2.

Chapter 7: The z-transform. Chih-Wei Liu

Definition of z-transform.

Discrete-time signals and systems See Oppenheim and Schafer, Second Edition pages 8 93, or First Edition pages 8 79.

Lecture 2 Linear and Time Invariant Systems

Chapter 7 z-transform

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

Digital Signal Processing

Exam. Notes: A single A4 sheet of paper (double sided; hand-written or computer typed)

Time-Domain Representations of LTI Systems

Review of Discrete-time Signals. ELEC 635 Prof. Siripong Potisuk

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

from definition we note that for sequences which are zero for n < 0, X[z] involves only negative powers of z.

EE123 Digital Signal Processing

6.003: Signal Processing

MAS160: Signals, Systems & Information for Media Technology. Problem Set 5. DUE: November 3, (a) Plot of u[n] (b) Plot of x[n]=(0.

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

1. Nature of Impulse Response - Pole on Real Axis. z y(n) = r n. z r

Digital Signal Processing, Fall 2006

Digital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved

Introduction to Digital Signal Processing

ECE-314 Fall 2012 Review Questions

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

Classification of DT signals

AND SYSTEMS 2.0 INTRODUCTION

Exponential Moving Average Pieter P

Finite-length Discrete Transforms. Chapter 5, Sections

Ch3 Discrete Time Fourier Transform

The z-transform can be used to obtain compact transform-domain representations of signals and systems. It

Web Appendix O - Derivations of the Properties of the z Transform

Chapter 3. z-transform

Image pyramid example

Lecture 1: Channel Equalization 1 Advanced Digital Communications (EQ2410) 1. Overview. Ming Xiao CommTh/EES/KTH

Solution of Linear Constant-Coefficient Difference Equations

The Z-Transform. Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, Prentice Hall Inc.

Module 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation

EE Midterm Test 1 - Solutions

Chap 2. Discrete-Time Signals and Systems

III. Time Domain Analysis of systems

Fall 2011, EE123 Digital Signal Processing

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

FIR Filter Design: Part II

CHAPTER 1 SEQUENCES AND INFINITE SERIES

EECE 301 Signals & Systems Prof. Mark Fowler

Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2004 Lecture 2 Linear Systems. Topics

EE123 Digital Signal Processing

Chapter 4 : Laplace Transform

5.1. Periodic Signals: A signal f(t) is periodic iff for some T 0 > 0,

Chapter 8. DFT : The Discrete Fourier Transform

Notes 20 largely plagiarized by %khc

Dynamic Response of Linear Systems

x c the remainder is Pc ().

EE123 Digital Signal Processing

Ideal Amplifier/Attenuator. Memoryless. where k is some real constant. Integrator. System with memory

Sound II. Sound intensity level. Question. Energy and Intensity of sound waves

Digital Signal Processing. Homework 2 Solution. Due Monday 4 October Following the method on page 38, the difference equation

6.003: Signals and Systems. Feedback, Poles, and Fundamental Modes

Math 312 Lecture Notes One Dimensional Maps

Morphological Image Processing

Transcription:

Discrete Time Sigals Samples of a CT sigal: EE123 Digital Sigal Processig x[] =X a (T ) =1, 2, x[0] x[2] x[1] X a (t) T 2T 3T t Lecture 2 Or, iheretly discrete (Examples?) 1 2 Basic Sequeces Uit Impulse [] = 1 =0 0 6= 0 Basic Sequeces Expoetial x[] = A 0 0 <0 0 < < 1 > 1 Uit Step U[] = 1 0 0 <0 1 < < 0 Bouded ubouded < 1 3 4

Discrete Siusoids x[] = A cos(! 0 + ) x[] = Ae j! 0+j or, Discrete Siusoids x[] = A cos(! 0 + ) x[] = Ae j! 0+j or, Q: Periodic or ot? x[ + ] =x[] for iteger Q: Periodic or ot? x[ + ] =x[] for iteger A: If! 0 / is ratioal (Differet tha C.T.!) To fid fudametal period Fid smallest itegers K, :! 0 / =2 K 5 6 Discrete Siusoids Example: cos(5/7 ) = 14 (K = 5) cos( /5) = 10 (K = 1) Discrete Siusoids Aother Differece: Q: Which oe is a higher frequecy?! 0 = or! 0 = 3 2 cos(5/7 ) + cos( /5) ) = S.C.M{10, 14} = 70 7 8

Discrete Siusoids Discrete Siusoids Aother Differece: Aother Differece: Q: Which oe is a higher frequecy?!0 = Q: Which oe is a higher frequecy? or!0 = 3 2!0 = A: cos( ) cos(3 /2) = cos( /2) =4 9 10 Discrete Siusoids - 3 2!0 = =2 r or!0 = Discrete Siusoids Recall the periodicity of DTFT!0 = 0!0 = /8 cos(w0 )!0 = /4!0 = 11 12

Discrete Siusoids Discrete Time Systems cos(w 0 )! 0 =2! 0 = 15 8! 0 = 7 4 x[] What properties? Causality: T { } y[] y[ 0 ] depeds oly o x[] for 0! 0 = 13 14 Properties of D.T. Systems Cot. Memoryless: y[] depeds oly o x[] Example: y[] = x[] 2 Liearity: Superpositio: T {x 1 []+x 2 []} = T {x 1 []} + T {x 2 []} = y 1 []+y 2 [] Properties of D.T. Systems Cot. Time Ivariace: y[] = T {x[]} If: The: BIBO Stability x[] apple B x < 1 If: The: y[ 0 ] = T {x[ 0 ]} y[] apple B y < 1 8 8 Homogeeity: T {ax 1 []} = at {x[]} = ay[] 15 16

Example: Examples Time Shift y[] = x[ d ] Accumulator y[] = X x[k] Causal L TI memoryless if d>=0 Why the compressor is OT Time Ivariat? Suppose M=2, if d=0 BIBO stable x[ Compressor y[] = x[m ], - 0 Q 1 tft, 6J 6= y[ 1] 17 18 Example: Removig Shot oise From PR This America Life, ep.203 The Greatest Phoe Message i the World /MIL y[]a_= tj»-l.f).)f?_ S'(<;r M.!.Mf/2!/VI ffltf-f( MED{x[ k],, x[ + k]} =- m o[ r[jj-k.'],...1 :X{+-tJ1 * j0 cl] o-liear system: Media Filter 1] M >1 Examples y[] x[] = cos[ /2 ] em.. (giggle) There comes a time i life, whe.. eh... whe we hear the greatest phoe mail message of all times ad... well here it is... eh.. you have to hear it to believe it.. '}CxJ :> corrupted message -i - -1 s?- e ee }'lhl 19 20

Spectrum of Speech Speech Low Pass Filterig LP-Filter Spectrum Corrupted Speech 21 22 Low-Pass Filterig of Shot oise Corrupted Low-Pass Filterig of Shot oise Corrupted LP-filtered Med-filter 23 24

The Greatest Message of All Times... I thought you ll get a kick out of a message from my mother... Hi Fred, you ad the little mermaid ca go blip yourself. I told you to stay ear the phoe... I ca t fid those books.. you have other books here.. it must be i Le hoya.. call me back... I m ot goig to stay up all ight for you...... Bye Bye... 25 Discrete-Time LTI Systems The impulse respose h[] completely characterizes a LTI system DA of LTI [] x[] LTI LTI y[] = 1X = 1 h[] y[] =h[] x[] h[m]x[ m] discrete covolutio Sum of weighted, delayed impulse resposes! 26 BIBO Stability of LTI Systems BIBO Stability of LTI Systems A LTI system is BIBO stable iff h[] is absolutely summable 1X h[k] < 1 Proof: if y[] = apple 1X h[k]x[ k] 1X h[k] x[ k] apple B x apple B x 1 X h[k] < 1 27 28

BIBO Stability of LTI Systems Proof: oly if P 1 h[k] = 1 suppose show that there exists bouded x[] that gives ubouded y[] Let: 29