du broff convolution

77
Tau-Vee Convolution An alternative to the “sliding function” method of convolution

Upload: marco-velazquez

Post on 28-Oct-2014

27 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Du Broff Convolution

Tau-Vee Convolution

An alternative to the “sliding function” method of convolution

Page 2: Du Broff Convolution

Contents

• What is Convolution (Slides 3-5)

• Preliminaries (Slides 6-7)

• A Detailed Example (Slides 8-47)

• Additional Examples (Slides 48-62)

• Summary (Slides 63-77)

Page 3: Du Broff Convolution

Convolution with Impulses

... 0 0 ...y t x h t x h t

Page 4: Du Broff Convolution

Approximating Continuous Data

0.5

0.5

ˆk

k

x k x t dt x k

Page 5: Du Broff Convolution

x t

t

t

h t

x

x

h t

Overlap

0 0

ˆ

k

k

y t x h t x h t

x k h t k

y t x k h t k x h t d

Page 6: Du Broff Convolution

Disclaimer

• This presentation is free, without any restrictions, to anyone who wants to use it.

• There is no copyright on this presentation.

Page 7: Du Broff Convolution

What you will need

• A pencil (possibly with an eraser if you make mistakes).

• A printer because you may find the presentation easier to follow if you print out a few slides.

Page 8: Du Broff Convolution

Let’s get started

Let d where

0 1 0 0

1 1 2 0 1 and

2 2 3 0 1

0 3

Find .

y t f t g t f g t

t t

t t tf t g t

t t

t

y t

Page 9: Du Broff Convolution

Change of variables

Define so that

0 1 0 0

1 1 2 0 1 and

2 2 3 0 1

0 3

v t

v

v vf g v

v

Page 10: Du Broff Convolution

Breakpoints

The points where the definitions of and change

are called breakpoints. Breakpoints occur at 1,2,3

and 0,1 . As shown in the next slide, these breakpoints

divide the plane into a number of

f g v

v

v

subdomains. In the

next series of slides you will be guided through the process of

constructing a map of these subdomains. If you would like

to follow along with this part of the presentation please

begin by printing a copy of the next slide.

Page 11: Du Broff Convolution

Print this slide

Page 12: Du Broff Convolution

Follow Along if You Dare

Copy the next series of lines and points onto your printed slide.

Page 13: Du Broff Convolution
Page 14: Du Broff Convolution
Page 15: Du Broff Convolution
Page 16: Du Broff Convolution
Page 17: Du Broff Convolution
Page 18: Du Broff Convolution
Page 19: Du Broff Convolution
Page 20: Du Broff Convolution
Page 21: Du Broff Convolution
Page 22: Du Broff Convolution
Page 23: Du Broff Convolution
Page 24: Du Broff Convolution
Page 25: Du Broff Convolution
Page 26: Du Broff Convolution
Page 27: Du Broff Convolution
Page 28: Du Broff Convolution

Done!

Page 29: Du Broff Convolution

So what?

You have now divided the plane into 6 diagonal bands with each band corresponding to one range of time:

Band 1: t less than -1

Band 2: t between -1 and 0

Band 3: t between 0 and 2

Band 4: t between 2 and 3

Band 5: t between 3 and 4

Band 6: t greater than 4

Page 30: Du Broff Convolution
Page 31: Du Broff Convolution
Page 32: Du Broff Convolution
Page 33: Du Broff Convolution
Page 34: Du Broff Convolution
Page 35: Du Broff Convolution
Page 36: Du Broff Convolution

Band 1:Tau-Vee Method

Page 37: Du Broff Convolution

Band 1: Sliding Function Method

Page 38: Du Broff Convolution

Band 2:Tau-Vee Method

Page 39: Du Broff Convolution

Band 2: Sliding Function Method

Page 40: Du Broff Convolution

Band 3:Tau-Vee Method

Page 41: Du Broff Convolution

Band 3: Sliding Function Method

Page 42: Du Broff Convolution

Band 4: Tau-Vee Method

Page 43: Du Broff Convolution

Band 4: Sliding Function Method

Page 44: Du Broff Convolution

Band 5: Tau-Vee Method

Page 45: Du Broff Convolution

Band 5: Sliding Function Method

Page 46: Du Broff Convolution

Band 6:Tau-Vee Method

Page 47: Du Broff Convolution

Band 6: Sliding Function Method

Page 48: Du Broff Convolution

Further Comments

Page 49: Du Broff Convolution

Question: Do these drawings have to be very carefully drawn in order to work?

Answer: Probably as long as you have the breakpoints in order it will still work. The next slide shows a pretty messy free-hand version of the diagram for the same example.

Page 50: Du Broff Convolution

Another fine mess

Page 51: Du Broff Convolution

This drawing was pretty crummy when I drew it. To make it worse, I spilled weak coffee on it , rode over it with a bicycle, crumpled it up, uncrumpled it, and stomped it on the ground. Only then did I scan it into this presentation. You can still see the 6 diagonal bands and should be able to figure out the integrands and integration limits for all 6 bands! It is still usable! Amazing!

Page 52: Du Broff Convolution

I also deliberately did not use the correct scale. You can see that the distance from tau=-1 to tau=2 is almost equal to the distance between tau=2 and tau=3. That’s part of the reason why the lines of constant t are deformed into curves instead of nice straight lines at a 45 degree angle. Just try to avoid “time catastrophes”—two different constant time lines intersecting!

Page 53: Du Broff Convolution

Can this method work for discrete convolution?

Let

1,2, 1, 3 for 0,1,2,3

0 for all other values of

2,4,6 for 5,6,7

0 for all other values of

Let m

nx n

n

ny n

n

z n x n y n x m y n m

k n m

Page 54: Du Broff Convolution
Page 55: Du Broff Convolution
Page 56: Du Broff Convolution
Page 57: Du Broff Convolution

Therefore

2,8,12,2, 18, 18 for 5,6,7,8,9,19

0 for all other values of

nz

n

Page 58: Du Broff Convolution

Reference

The tau-vee method for discrete convolution is essentially identical to a method previously described in the following reference:

Enders A. Robinson, “The Minimum Delay Concept in System Design, Part I”, Digital Electronics, Dec. 1963.

Page 59: Du Broff Convolution

Functions that Extend to Infinity

All functions in the previous examples were nonzero only over a finite interval of time. Does this method work for functions that start and or stop at infinity?

Page 60: Du Broff Convolution

Example

Let

for 0 and for 1

1 for 0 1

and let 0 for all 1 while g 0 whenever t 1.

Note that the definition of extends back towards .

Find *

te tf t g t t t t

t t

f t t t

f t

f g

Page 61: Du Broff Convolution
Page 62: Du Broff Convolution
Page 63: Du Broff Convolution

Summary of Tau-Vee Method

Page 64: Du Broff Convolution

Lines of constant v

Breakpoints in are represented by

horizontal lines.

g v

Page 65: Du Broff Convolution

Lines of constant v

Page 66: Du Broff Convolution

Lines of constant tau

Breakpoints in are represented by

vertical lines.

f

Page 67: Du Broff Convolution

Lines of constant tau

Page 68: Du Broff Convolution

Corners

Corners occur at each intersection of a constant

line with a constant line. The value of at a corner

is given by

v

t

t v

Page 69: Du Broff Convolution

Corners

Page 70: Du Broff Convolution

Lines of Constant t

Lines of constant are diagonal lines (or curves) along which

the value of is constant. Lines of constant are drawn

through each corner. These lines then divide the plane into

a number of d

t

t v t

v

iagonal bands.

Page 71: Du Broff Convolution

Lines of Constant t

Page 72: Du Broff Convolution

Integration Path

Each band corresponds to a range of values of . The

convolution within a band is represented by a path on

the diagram. For the convolution of piecewise defined

functions, each time the path crosses a

t

line of constant

the definition of changes. Each time the path

crosses a line of constant the definition of changes.

v g v

f

Page 73: Du Broff Convolution

Integration Path

Page 74: Du Broff Convolution

Integration Path

1 2

2 2 2 1

For values of in this band:

*

t

f g f g v d

f g v d f g v d

Page 75: Du Broff Convolution

Integration limits

When the path crosses a line of constant , the

corresponding integration limit is simply the value of

. When the path crosses a line of constant the

corresponding integration limit is found by sol

v

ving

the equation for the value of , i.e. .

In this case the integration limit will be in the form of

a number. For example:

v t t v

t

Page 76: Du Broff Convolution

Integration Limits

Page 77: Du Broff Convolution

Eliminating the variable, v

6

1 2

?

3 ?

2 2 2 1

6 3

*

? Depends on intersections not shown on the

previous diagram

t

t

f g f g t d

f g v d f g v d