8
Continuous-Time Convolution Linear Systems and Signals Lecture 5 Spring 2008

Continuous-Time Convolution

Embed Size (px)

DESCRIPTION

Spring 2008. Continuous-Time Convolution. Linear Systems and Signals Lecture 5. Convolution Demos. Johns Hopkins University Demonstrations http://www.jhu.edu/~signals Convolution applet to animate convolution of simple signals and hand-sketched signals - PowerPoint PPT Presentation

Citation preview

Page 1: Continuous-Time Convolution

Continuous-Time Convolution

Linear Systems and SignalsLecture 5

Spring 2008

Page 2: Continuous-Time Convolution

5 - 2

Convolution Demos• Johns Hopkins University Demonstrations

http://www.jhu.edu/~signals

Convolution applet to animate convolution of simple signals and hand-sketched signals

Convolve two rectangular pulses of same width gives a triangle (see handout E)

• Some conclusions from the animationsConvolution of two causal signals gives a causal result

Non-zero duration (called extent) of convolution is the sum of extents of the two signals being convolved

Page 3: Continuous-Time Convolution

5 - 3

Transmit One Bit• Transmission over communication channel (e.g.

telephone line) is analog

h t

)(th

1

p t

)(1 tx

A

‘1’ bit

t

p

)(0 tx

-A

‘0’ bit

Model channel as LTI system with impulse response

h(t)

CommunicationChannel

input output

x(t) y(t)t

t

)(1 ty receive‘1’ bit

)(0 ty

-A Th

receive ‘0’ bit

h+p

th+p

h

h

Assume that Th < Tp

A Th

Page 4: Continuous-Time Convolution

5 - 4

Transmit Two Bits (Interference)• Transmitting two bits (pulses) back-to-back

will cause overlap (interference) at the receiver

• How do we prevent intersymbolinterference at the receiver?

h t

)(th

1

Assume that Th < Tp

tp

)(tx

A

‘1’ bit ‘0’ bit

p

* =)(ty

-A Th

tp

‘1’ bit ‘0’ bit

h+p

intersymbol interference

Page 5: Continuous-Time Convolution

5 - 5

Transmit Two Bits (No Interference)• Prevent intersymbol interference by waiting Th

seconds between pulses (called a guard period)

• Disadvantages?

h t

)(th

1

Assume that Th < Tp

* =

tp

)(tx

A

‘1’ bit ‘0’ bit

h+p

t

)(ty

-A Th

p

‘1’ bit ‘0’ bit

h+p

h

Page 6: Continuous-Time Convolution

5 - 6

m

mnxmhny ][ ][ ][ dtxhty

h[n] y[n]x[n]

LTI systemrepresentedby its impulseresponse

h(t) y(t)x(t)

LTI system representedby its impulseresponse

Discrete-time Convolution Preview• Discrete-time

convolution

• For every value of n, we compute a new summation

• Continuous-time convolution

• For every value of t, we compute a new integral

Page 7: Continuous-Time Convolution

5 - 7

1

0

][ ][ ][N

m

mnxmhny

z-1 z-1 z-1…

x[n]

y[n]

h[0] h[1] h[2] h[N-1]

Discrete-time Convolution Preview• Assuming that h[n] has finite

duration from n = 0, …, N-1• Block diagram of an implementation (finite

impulse response digital filter): see slide 2-4

Page 8: Continuous-Time Convolution

5 - 8

Corporate Technical Ladder• Test Engineer

BS degreeTest other people’s designsStarting salary: $55,000

• Design EngineerMS degree, or BS degree plus

2 years experience and design short courses

Design new productsStarting salary: $65,000

• What about the Ph.D.?¾ of Ph.D.’s to industry¼ of Ph.D.’s to academia BSEE Tech.

BSEE

MSEE

PhDEE1

PhDEE2

Technician

Test Eng.

Design Eng.

Proj. Management

Technical Staff (R&D)

VP, Eng.

CTO

Director Eng.

(1) Ph.D. based on system prototyping

(2) Ph.D. with significant theoretical results