Convolution. Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2,

Similar documents
Review of Frequency Domain Fourier Series: Continuous periodic frequency components

LTI Systems (Continuous & Discrete) - Basics

Digital Signal Processing Lecture 4

Lecture 7 Discrete Systems

The Convolution Sum for Discrete-Time LTI Systems

EE 521: Instrumentation and Measurements

Convolution and Linear Systems

2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal

Discrete-time signals and systems

Cosc 3451 Signals and Systems. What is a system? Systems Terminology and Properties of Systems

Lecture 19 IIR Filters

Lecture 14: Windowing

E : Lecture 1 Introduction

Module 1: Signals & System

Discussion Section #2, 31 Jan 2014

1 otherwise. Note that the area of the pulse is one. The Dirac delta function (a.k.a. the impulse) can be defined using the pulse as follows:

Properties of LTI Systems

Frequency Response (III) Lecture 26:

Chap 2. Discrete-Time Signals and Systems

Analog vs. discrete signals

VU Signal and Image Processing

Linear Convolution Using FFT

APPLIED SIGNAL PROCESSING

Chapter 3 Convolution Representation

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

EE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet

x(t) = t[u(t 1) u(t 2)] + 1[u(t 2) u(t 3)]

2 Classification of Continuous-Time Systems

Aspects of Continuous- and Discrete-Time Signals and Systems

Continuous-Time Frequency Response (II) Lecture 28: EECS 20 N April 2, Laurent El Ghaoui

Therefore the new Fourier coefficients are. Module 2 : Signals in Frequency Domain Problem Set 2. Problem 1

Responses of Digital Filters Chapter Intended Learning Outcomes:

University Question Paper Solution

Fourier Series Representation of

Introduction to DSP Time Domain Representation of Signals and Systems

Ch. 7: Z-transform Reading

Digital Signal Processing, Homework 1, Spring 2013, Prof. C.D. Chung

ECE 308 Discrete-Time Signals and Systems

EECS 20. Midterm No. 2 Practice Problems Solution, November 10, 2004.

Lecture 2 Discrete-Time LTI Systems: Introduction

Digital Signal Processing Lecture 8 - Filter Design - IIR

Discrete Time Fourier Transform (DTFT)

Digital Signal Processing

EEO 401 Digital Signal Processing Prof. Mark Fowler

LAB 6: FIR Filter Design Summer 2011

Lecture 8 ELE 301: Signals and Systems

EE482: Digital Signal Processing Applications

3 Fourier Series Representation of Periodic Signals

Problem Value

DFT-Based FIR Filtering. See Porat s Book: 4.7, 5.6

/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by

Review of Fundamentals of Digital Signal Processing

NAME: 23 February 2017 EE301 Signals and Systems Exam 1 Cover Sheet

Cast of Characters. Some Symbols, Functions, and Variables Used in the Book

Efficient algorithms for the design of finite impulse response digital filters

06/12/ rws/jMc- modif SuFY10 (MPF) - Textbook Section IX 1

Problem Value

Introduction to Computer Vision. 2D Linear Systems

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

New Mexico State University Klipsch School of Electrical Engineering. EE312 - Signals and Systems I Spring 2018 Exam #1

EEM 409. Random Signals. Problem Set-2: (Power Spectral Density, LTI Systems with Random Inputs) Problem 1: Problem 2:

Digital Signal Processing Lecture 9 - Design of Digital Filters - FIR

Stability Condition in Terms of the Pole Locations

Review of Discrete-Time System

Introduction to Digital Signal Processing

CMPT 889: Lecture 5 Filters

EE 224 Signals and Systems I Review 1/10

Digital Filters. Linearity and Time Invariance. Linear Time-Invariant (LTI) Filters: CMPT 889: Lecture 5 Filters

Introduction to Signals and Systems Lecture #4 - Input-output Representation of LTI Systems Guillaume Drion Academic year

Discrete-Time Fourier Transform (DTFT)

ELEN 4810 Midterm Exam

ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin

Digital Signal Processing Lecture 3 - Discrete-Time Systems

Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME

EC Signals and Systems

New Mexico State University Klipsch School of Electrical Engineering EE312 - Signals and Systems I Fall 2015 Final Exam

IT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A

Fourier series for continuous and discrete time signals

Discrete-Time Systems

ELEN E4810: Digital Signal Processing Topic 2: Time domain

ECE 301 Division 1 Exam 1 Solutions, 10/6/2011, 8-9:45pm in ME 1061.

Chapter 2: Linear systems & sinusoids OVE EDFORS DEPT. OF EIT, LUND UNIVERSITY

EE 210. Signals and Systems Solutions of homework 2

Question Paper Code : AEC11T02

DSP Configurations. responded with: thus the system function for this filter would be

Let H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )

Problem Value

Digital Signal Processing. Lecture Notes and Exam Questions DRAFT

Introduction to DFT. Deployment of Telecommunication Infrastructures. Azadeh Faridi DTIC UPF, Spring 2009

Digital Signal Processing. Midterm 1 Solution

EECS 20N: Midterm 2 Solutions

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

Communication Theory II

DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A

EE 225D LECTURE ON DIGITAL FILTERS. University of California Berkeley

Lecture 5 - Assembly Programming(II), Intro to Digital Filters

! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular

How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches

DIGITAL SIGNAL PROCESSING UNIT III INFINITE IMPULSE RESPONSE DIGITAL FILTERS. 3.6 Design of Digital Filter using Digital to Digital

EEL3135: Homework #4

Transcription:

Filters

Filters So far: Sound signals, connection to Fourier Series, Introduction to Fourier Series and Transforms, Introduction to the FFT Today Filters Filters: Keep part of the signal we are interested in More generally: Operate on a digital signal and transform it to have some desired property Wrap up signal processing

Convolution Define a mathematical operation on discrete-time signals called convolution, represented by *. Given two discrete-time signals x 1, x 2, n, (x 1 x2)(n) x1(k)x 2(n k) k We can also define convolutions for continuous-time signals. Given two continuous-time signals x 1, x 2, t, ( x1 x2)(t) x1( τ)x2 τ (t τ) dτ

Properties of Convolution Convolution is commutative: x 1 * x 2 x 2 * x 1. Convolution is associative: (x 1 * x 2 ) * x 3 x 1 * (x 2 * x 3 ). Convolution also has the following properties: for scalars a, x 1 (x2 + x3) x1 x2 + x1 x3 x1 (ax2) a(x1 x2) These stem from the fact that integration and summation have additivity and homogeneity properties.

Defining LTI Systems Using Convolution When a system is excited it responds to the signal and the observed signal is a combination of the forcing signal and the system Linear time invariant systems are linear, and their response does not change with time. A Linear Time Invariant system can be defined using convolution. Take any discrete-time function g. The convolution S(x)(n) (g x)(n) k defines an LTI system S. The output for any input is obtained through convolution. The properties of convolution ensure that S is LTI. When we define a system this way, we call the defining function g the convolution kernel. This method may be used to define continuous-time systems too. g(k)x(n k)

Example Consider the system defined by the kernel { 1/3 if t [0, 3] t g(t) 0 otherwise The output of this system for any input x is y(t) g( τ)x(t τ) dτ τ y(t) 3 τ 0 1 3 x(t τ)dτ The output is the average value of x over the last 3 time units.

Impulse Response as Kernel The output for a discrete-time Single Input Single Output LTI system can be given by the convolution of the input and the impulse response h: y(n) (h x)(n) h(k)x(n k) k The impulse response is the particular system output obtained when the input is the Kronecker delta function n, δ(n) { 1 if n 0 0 if n 0

Dirac Delta Function We define the impulse response h for a continuous-time system as the output for a particular input called the Dirac delta function. The Dirac delta function is not really a function. We define the Dirac delta function δ: Reals Reals to have the following properties: t Reals \ {0}, δ(t) 0 ε ε Reals with ε>0, ε δ(t)dt 1

Dirac Delta Function So the Dirac delta function δ(t) has infinite value at t0, and is zero everywhere else. Yet, the area under the function is equal to 1. If we scale the function by a, the function aδ(t) will still be zero for all nonzero t and infinite at t 0. But, the area under the function will now equal a. We draw the Dirac delta function as an arrow pointing up at t0 indicating its infinite value there. δ(t) 1 The height of the arrow represents the weight, the area under the function. t

Sifting Property Both the Kronecker and Dirac delta functions have the following property: When a signal is convolved with a delta function, it remains unchanged. This is called the sifting property. For the discrete-time case, k x(k) δ(n x(n) we see that the delta function is zero for all k except k n. So there is only one term in the sum, x(n)δ(n-n) x(n). For the continuous time case, δ(t-τ) will be nonzero only for τt. So it doesn t matter what δ(t-τ) multiplies for τ t : x ( τ) δ(t τ)dτ x(t) δ(t τ)dτ x(t) δ(t τ)dτ τ τ τ k) x(t)

Impulse Response for Continuous-Time The sifting property expresses x as a sum of shifted and scaled delta functions. x(t) x( τ) δ(t τ) dτ τ If we apply an LTI system S to a sum of shifted and scaled delta functions, we can distribute over the sum (integral) and pull out scaling factors: S(x)(t) x( τ) S( δ)(t τ) dτ τ S(δ) is the impulse response; the output of the system when the input is the Dirac delta function. We rename S(δ) as h, and see that the output S(x) x * h, just like in discrete-time: S(x)(t) y(t) x( τ) h(t τ) dτ τ

Impulse Response for Cascade Suppose we connect two systems with impulse responses h 1 and h 2 in cascade. x h 1 h 2 y What is the impulse response of the composite system? y h 2 * (h 1 * x) y (h 2 * h 1 ) * x The impulse response of the composite system is h 2 * h 1.

Relationship to Frequency Domain It was much easier to find the frequency response for a cascade system, rather than the impulse response. Given two systems in cascade with frequency responses H 1 and H 2, the overall frequency response of the system was H 1 H 2. Sometimes it is easier to draw conclusions using the frequency response system description, and sometimes it is better to use the impulse response description. It turns out that the impulse response and frequency response are quite related, and we can find one from the other. We can transfer from the time domain, using the impulse response description, to the frequency domain, using the frequency response description.

Example Find the frequency response of the system with impulse response t Reals, h(t) { 1/3 if t \in [0, 3] 0 otherwise H( ω) τ h( τ)e iωτ dτ 3 τ 0 1 3 e iωτ dτ 1 i 3ω ( ) e i 3ω 1 H( ω) i 3ω ( ) e i 3ω 1

Convolution with Impulse Response For both continuous and discrete-time LTI systems, we define the impulse response as the special output that occurs when the input is an impulse function (Dirac delta for continuous-time systems, Kronecker Delta for discrete-time systems). This impulse response, called h, gives us the output for any input via convolution: For x given, t Reals, y(t) (h x)(t) h( τ) x(t τ) dτ τ For x, n, y(n) (h x)(n) k h(k)x(n Recall that the roles of h and x in the above may be reversed. k)

From Impulse Response to Frequency Response Consider the case when the input to a continuous-time LTI system, x, is an eigenfunction given by x(t) e iωt. We can find the output y using convolution with the impulse response h: t Reals, y(t) ω ωτ h( τ)e iω(t τ) dτ e i t h( τ)e i τ τ dτ Recall that an LTI system scales an eigenfunction x(t) e iωt by a factor H(ω). From above, we see this scaling factor is H( ω) τ h( τ)e iωτ dτ The frequency response is the Fourier transform of the impulse response.

From Impulse Response to Frequency Response For the discrete-time case, with x(t) e iωn for n Integers, We can find the output y using convolution with the impulse response h: n Integers, y(n) k h(k)e iω(n k) iωn From above, we see the scaling factor on the eigenfunction is e k h(k)e iωk H( ω) k h(k)e iωk The frequency response is the discrete-time Fourier transform (DTFT) of the impulse response.

Importance of H and h We want to design systems with a particular frequency response H for many possible applications: Audio signal correction: getting rid of noise, compensating for an imperfect audio channel The equalizer on your stereo lets you modify your stereo s H Blurring and edge detection in images: an abrupt change in color in an image indicates high frequency, blocks of constant color are low frequencies AM radio reception: we want to keep a signal at one particular carrier frequency, and filter out neighboring carrier frequencies Practical implementation of H, at least in digital systems, is easily accomplished by convolution with the corresponding h.

Designing FIR Discrete-Time Systems We want to be able to specify a desired frequency response, H(ω) for all ω in Reals, and come up with the corresponding impulse response h(n) for all n in Integers. Our life will be easiest if h(n) is nonzero only for a finite set of samples n {0, 1, L-1}. Then the length of the impulse response will be L, and the convolution sum will be finite: y(n) (h x)(n) k h(k)x(n k) L 1 k 0 h(k)x(n k) So we would like to come up with an FIR implementation of our desired frequency response function H(ω). MATLAB can help.

Designing FIR Filters Using MATLAB The remez() function in MATLAB implements an algorithm called the Parks-McClellan algorithm based on the Remez algorithm. It comes up with an impulse response of desired length L that implements a bandpass filter minimizing gain in the stopband. You specify the passband, the frequencies your filter should amplify, the passband stopband, the frequencies it should zero out, and the transition band, the don t care area of transition between 0 and 1. stopband

Designing IIR Discrete-Time Systems Notice that when we were designing our FIR system, with L 1 y(n) h(k)x(n k) k 0 we were really picking the coefficients of a difference equation. We can implement a wider variety of systems with the more general difference equation that involves feedback: L 1 M 1 y(n) b(k)x(n k 0 k 1 These systems may have impulse responses of infinite duration (IIR), and the convolution sum would have infinite terms. So, we design them by selecting the coefficients a and b and implement them using feedback as above. k) + a(k)y(n k)

Using MATLAB to Design IIR Filters MATLAB has several functions that come up with the difference equation coefficients a and b to implement a system with a desired frequency response H(ω) for all ω in Reals. Using butter() cheby1() cheby2() elliptic Butterworth filter Chebyshev 1 filter Chebyshev 2 filter Elliptic filter you can specify the passband, stopband, and order (number of terms in the difference equation) of your desired H. MATLAB will return the corresponding coefficients in the difference equation.