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

Similar documents
DIGITAL SIGNAL PROCESSING LECTURE 3

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

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

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

Computing the output response of LTI Systems.

EEO 401 Digital Signal Processing Prof. Mark Fowler

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

ECE 308 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

COMM 602: Digital Signal Processing

FIR Filter Design: Part II

Signals & Systems Chapter3

Frequency Response of FIR Filters

EECE 301 Signals & Systems

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

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

Ch3 Discrete Time Fourier Transform

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

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

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

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

Lecture 2 Linear and Time Invariant Systems

Solution of Linear Constant-Coefficient Difference Equations

EE Midterm Test 1 - Solutions

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

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

6.003 Homework #3 Solutions

Unit 6: Sequences and Series

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

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

ADVANCED DIGITAL 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.

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

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

Time-Domain Representations of LTI Systems

Difference Equation Construction (1) ENGG 1203 Tutorial. Difference Equation Construction (2) Grow, baby, grow (1)

Linear time invariant systems

Ma 530 Introduction to Power Series

Appendix: The Laplace Transform

Question1 Multiple choices (circle the most appropriate one):

Ma 530 Infinite Series I

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

Infinite Sequences and Series

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

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

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

Frequency Domain Filtering

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

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

MIXED REVIEW of Problem Solving

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

The Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)

6.867 Machine learning, lecture 7 (Jaakkola) 1

MAXIMALLY FLAT FIR FILTERS

M2.The Z-Transform and its Properties

Math 113 Exam 3 Practice

Chapter 10: Power Series

Math 155 (Lecture 3)

MCT242: Electronic Instrumentation Lecture 2: Instrumentation Definitions

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

Chapter 7 z-transform

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

Sequences I. Chapter Introduction

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

2D DSP Basics: 2D Systems

2.4 - Sequences and Series

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Math 128A: Homework 1 Solutions

1 Lecture 2: Sequence, Series and power series (8/14/2012)

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

is also known as the general term of the sequence

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Finite-length Discrete Transforms. Chapter 5, Sections

Section 11.8: Power Series

Math 113 Exam 3 Practice

MA131 - Analysis 1. Workbook 2 Sequences I

DSP First, 2/e. Lecture 11 FIR Filtering Intro

Define and Use Sequences and Series

Polynomial Functions and Their Graphs

x a x a Lecture 2 Series (See Chapter 1 in Boas)

Introduction to Signals and Systems, Part V: Lecture Summary

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.

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

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

Exponential Moving Average Pieter P

CHAPTER 1 SEQUENCES AND INFINITE SERIES

Jacob Hays Amit Pillay James DeFelice 4.1, 4.2, 4.3

Lecture 2 Appendix B: Some sample problems from Boas, Chapter 1. Solution: We want to use the general expression for the form of a geometric series

EE422G Homework #13 (12 points)

Chapter 2 Systems and Signals

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

Fall 2018 Exam 3 HAND IN PART 0 10 PIN: 17 INSTRUCTIONS

A New Sifting function J ( ) n+ 1. prime distribution. Chun-Xuan Jiang P. O. Box 3924, Beijing , P. R. China

4.3 Growth Rates of Solutions to Recurrences

Machine Learning Theory (CS 6783)

Quiz No. 1. ln n n. 1. Define: an infinite sequence A function whose domain is N 2. Define: a convergent sequence A sequence that has a limit

6.3 Testing Series With Positive Terms

OPTIMAL ALGORITHMS -- SUPPLEMENTAL NOTES

CONTENTS. Course Goals. Course Materials Lecture Notes:

Transcription:

FIR Filters Lecture #7 Chapter 5 8

What Is this Course All About? To Gai a Appreciatio of the Various Types of Sigals ad Systems To Aalyze The Various Types of Systems To Lear the Skills ad Tools eeded to Perform These Aalyses. To Uderstad How Computers Process Sigals ad Systems 8

Discrete-time Systems: Filters Study Discrete-time systems Discrete-time Filters Fiite Impulse Respose (FIR) Filters Ifiite Impulse Respose (IIR) Filters Recall: Discrete-time system. y[]=t {x[]} 8

Movig Average Filter Movig average or ruig average filter: Choose a -poit averagig method: For example: y[]= / (x[]+x[]+x[]) y[]= / (x[]+x[]+x[]) Or y[]= / (x[]+x[+]+x[+]) This is called a differece equatio Used to completely describe the FIR for - < < 8

Example The followig sequece, x[], is a fiite legth sequece sice it oly has values with a fiite rage 4. This rage is called the support of the sequece If we apply the differece equatio we have the follow sequece for y[]: 7 x[ ] 6 5 4-4 - - - 4 5 6 7 7 y[ ] 6 5 4-4 - - - 4 5 6 7 84

A closer Look If we tabulate the x[] ad y[] - - - 4 5 6 x [ ] 4 6 4 y [ ].6666667 4 4.6666667 4.6666667 The highlighted umbers show how y[] is calculated. Note that the output is loger tha the iput. Ad if stads for time, the y[] is a predictio of the future. For example, y[] depeds ot oly o x[] but also o x[] ad x[]. 85

Causality A system whose preset values deped oly o the preset ad the past is called a Causal system A system whose preset values deped o the future is called a No-causal system Let s rewrite our movig average filter to be causal: y[]= / (x[]+x[-]+x[-]) 86

Causal Movig Average filter The ew sequeces: 7 6 x[ ] 7 6 y[ ] 5 5 4 4 - - - 4 5 6 7 - - - 4 5 6 7 The ew table: - - - 4 5 6 7 x [ ] 4 6 4 y [ ].6666667 4 4.6666667 4.6666667 87

The Geeral FIR Filter We ca exted our movig average differece equatio to this geeral form: Note that: y[ ] M k this system is causal depeds o a fiite sequece of past values of x[] The coefficiets, b k s, ca viewed as a weights ad therefore our filter becomes a weighted ruig average We call M the order of the FIR ad umber of coefficiets is called the filter legth ad is equal to M+ b k x[ k] 88

Aother Example Let s see how the followig sequece is affected by a -poit FIR ad a 7-poit FIR x[] x[ ]. cos( 8 elsewhere y[ ] - poit FIR k x[ k] ) 4 y[] -poit FIR for 4 7 - poit FIR y[ ] 7 6 k x[ k] -5 5 5 5 5 4 45-5 5 5 5 5 4 45 y[] 7-poit FIR -5 5 5 5 5 4 45 5 89

Uit Impulse Sequece The uit impulse oly has a value at =. The otatio used to represet the uit impulse is called the (Kroecker) delta fuctio: δ [] = for =, elsewhere Therefore, shifted impulses are: δ[-] = for =, elsewhere δ[-k] = for =k, elsewhere 9

Applicatio of the Uit Impulse Oe may use the uit impulse to represet our first sequece as: 7 6 5 4 x[ ] -4 - - - 4 5 6 7 x[ ] [ ] 4 [ ] 6 [ ] 4 [ ] [ 4] - 4 5 [] 4 [ -] 4 6 [ -] 6 4 [ -] 4 [ -4] x [ ] 4 6 4 9

Uit Impulse Represetatio of a Sequece I fact, ay sequece ca be represeted as sum of uit impulse fuctios. x[ ] k x[ k] [ x[] [ x[ ] [ ] k] ] x[] [ x[] [ ] ] 9

Uit Impulse Respose Sequece Whe the iput to a FIR is a uit impulse sequece x []=δ [], the output is defied as the uit impulse respose, h []. b,,,, M h[ ] M k b [ k k] otherwise I other words, the impulse respose h[] of the FIR is the sequece of differece equatio coefficiets. Sice h[]= for < ad > M, the legth of the h[] is fiite. This is why the system is called a fiite impulse respose, FIR, system 9

Uit Impulse Respose Sequece M h [ ] bk[ k] b[ ] + b[ ] + b[ ] bl[ l] bm[ M] k h[ ] h[] b h[] b hl [] b hm [ ] b hm [ ] l M - h[] b b b b b M l l M M+ 94

95 The Uit Impulse Respose of a - poit Average FIR ]} [ ] [ ] [ { ] [ ] [ ] [ ] [ - poit FIR k h k x y k k h[].5 - - - 4 5 6

Uit-Delay System A simple operator performs shift of the sequece by uits. y[]=x[ - ] Whe =, the system is called the uit delay. y[]=x[ -] The impulse respose of this system becomes: h[]=δ [ - ] 96

A Uit Delay System 7 x[ ] 6 5 4 - - - 4 5 6 7 7 y[ ] 6 5 4 - - - 4 5 6 7 7 6 5 4 y[ ] What is this oe? - - - 4 5 6 7 97

Homework Exercises: 5. 5.4 Problems: 5., 5., 5., 5.6 98