Scribd
Upload
56 views24 pages

6.02 Fall 2012 Lecture #10: - Linear Time-Invariant (LTI) Models - Convolution

This document discusses linear time-invariant (LTI) models and convolution. It introduces LTI systems and their properties of time-invariance and linearity. An LTI system can be completely characterized by its unit sample response h[n]. The output of an LTI system to any input x[n] can be calculated using convolution, which is defined as the sum of shifted and scaled versions of h[n]. Convolution allows predicting the response y[n] to any input based only on the system's unit sample response h[n].

Uploaded by

Karthik Kichu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
56 views24 pages

6.02 Fall 2012 Lecture #10: - Linear Time-Invariant (LTI) Models - Convolution

This document discusses linear time-invariant (LTI) models and convolution. It introduces LTI systems and their properties of time-invariance and linearity. An LTI system can be completely characterized by its unit sample response h[n]. The output of an LTI system to any input x[n] can be calculated using convolution, which is defined as the sum of shifted and scaled versions of h[n]. Convolution allows predicting the response y[n] to any input based only on the system's unit sample response h[n].

Uploaded by

Karthik Kichu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 24

6.

02 Fall 2012
Lecture #10

Linear time-invariant (LTI) models


Convolution

6.02 Fall 2012 Lecture 10, Slide #1


Modeling Channel Behavior
codeword
bits in
generate x[n]
1001110101 digitized modulate DAC
symbols

NOISY & DISTORTING ANALOG CHANNEL

demodulate sample &


ADC & filter threshold
1001110101
y[n]
codeword
bits out

6.02 Fall 2012 Lecture 10, Slide #2


The Baseband** Channel
input response

x[n] S y[n]

A discrete-time signal such as x[n] or y[n] is described by


an infinite sequence of values, i.e., the time index n takes
values in  to +. The above picture is a snapshot at a
particular time n.

In the diagram above, the sequence of output values y[.] is


the response of system S to the input sequence x[.]

The system is causal if y[k] depends only on x[j] for jk

**From before the modulator till after the demodulator &


filter
6.02 Fall 2012 Lecture 10, Slide #3
Time Invariant Systems

Let y[n] be the response of S to input x[n].

If for all possible sequences x[n] and integers N

x[n-N] S y[n-N]

then system S is said to be time invariant (TI). A time


shift in the input sequence to S results in an identical
time shift of the output sequence.

In particular, for a TI system, a shifted unit sample


function [n N ] at the input generates an identically
shifted unit sample response h[n N ] at the output.
6.02 Fall 2012 Lecture 10, Slide #4
Linear Systems

Let y1[n] be the response of S to an arbitrary input x1[n]


and y2[n] be the response to an arbitrary x2[n].

If, for arbitrary scalar coefficients a and b, we have:

ax1[n]+ bx2 [n] S ay1[n]+ by2 [n]

then system S is said to be linear. If the input is the


weighted sum of several signals, the response is the
superposition (i.e., same weighted sum) of the response
to those signals.

One key consequence: If the input is identically 0 for a


linear system, the output must also be identically 0.
6.02 Fall 2012 Lecture 10, Slide #5
Unit Sample and Unit Step Responses

Unit sample Unit sample response

[n] S h[n]

The unit sample response of a system S is the response of


the system to the unit sample input. We will always
denote the unit sample response as h[n].

Similarly, the unit step response s[n]:

Unit step Unit step response

u[n] S s[n]

6.02 Fall 2012 Lecture 10, Slide #6


Relating h[n] and s[n] of an LTI System

Unit sample signal Unit sample response

[n] S h[n]

Unit step signal Unit step response

u[n] S s[n]

[n] = u[n] u[n 1] h[n] = s[n] s[n 1]


n
from which it follows that s[n] = h[k]
k=
(assuming s[] = 0 , e.g., a causal LTI system; more
6.02 Fall 2012
generally, a right-sided unit sample response)
Lecture 10, Slide #7
h[n] s[n]

6.02 Fall 2012 Lecture 10, Slide #8


h[n] s[n]

6.02 Fall 2012 Lecture 10, Slide #9


h[n] s[n]

6.02 Fall 2012 Lecture 10, Slide #10


Unit Step Decomposition

Rectangular-wave digital
signaling waveforms, of the sort
s
we have been considering, are
w
easily decomposed into time-
e
shifted, scaled unit steps --- each
s
ttransition corresponds to another
shifted, scaled unit step.
s

e.g., if x[n] is the transmission of


e
1001110 using 4 samples/bit:
1
x[n]
= u[n]
u[n 4]
+ u[n 12]
u[n 24]
6.02 Fall 2012 Lecture 10, Slide #11
so the corresponding response is

x[n] y[n]

= u[n] = s[n]

u[n 4] s[n 4]

+ u[n 12] + s[n 12]

u[n 24] s[n 24]

Note how we have invoked linearity and time invariance!

6.02 Fall 2012 Lecture 10, Slide #12


Example

6.02 Fall 2012 Lecture 10, Slide #13


Transmission Over a Channel

Ignore this
notation for
now, will
explain
shortly

6.02 Fall 2012 Lecture 10, Slide #14


Receiv ing the Response

Digitization threshold = 0.5V

6.02 Fall 2012 Lecture 10, Slide #15


Faster Transmission

6.02 Fall 2012 Noise margin?


m 0.5  y[28] Lecture 10, Slid
Slide #16
Unit Sample
Decomposition

A discrete-time signal can be decomposed


into a sum of time-shifted, scaled unit
samples.

Example: in the figure, x[n] is the sum of


x[-2][n+2] + x[-1][n+1] + + x[2][n-2].

In general:


x[n] = x[k][n k]
k=

For any particular


l index,
i only
one term of this sum is non-zero
6.02 Fall 2012 Lecture 10, Slide #17
Modeling LTI Systems
If system S is both linear and time-invariant (LTI), then we can
use the unit sample response to predict the response to any
input waveform x[n]:
Sum of shifted, scaled responses
Sum of shifted, scaled unit samples

x[n] = x[k][n k] S y[n] = x[k]h[n k]
k= k=

CONVOLUTION SUM
Indeed, the unit sample response h[n] completely characterizes
the LTI system S, so you often see

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

6.02 Fall 2012 Lecture 10, Slide #18


Convolution
Evaluating the convolution sum

y[n] = x[k]h[n k]
k=

for all n defines the output signal y in terms of the input x and
unit-sample response h. Some constraints are needed to ensure
this infinite sum is well behaved, i.e., doesnt blow up --- well
discuss this later.

We use to denote convolution, and write y=xh. We can then


write the value of y at time n, which is given by the above sum,
as y[n] = (x h)[n] . We could perhaps even write y[n] = x h[n]

6.02 Fall 2012 Lecture 10, Slide #19


Convolution
Evaluating the convolution sum

y[n] = x[k]h[n k]
k=

for all n defines the output signal y in terms of the input x and
unit-sample response h. Some constraints are needed to ensure
this infinite sum is well behaved, i.e., doesnt blow up --- well
discuss this later.

We use to denote convolution, and write y=xh. We can thus


write the value of y at time n, which is given by the above sum,
as y[n] = (x h)[n]

Instead youll find people writing y[n] = x[n] h[n] , where the
poor index n is doing double or triple duty. This is awful
notation, but a super-majority of engineering professors
(including at MIT) will inflict it on their students.
Dont stand for it!
6.02 Fall 2012 Lecture 10, Slide #20
Properties of Convolution

(x h)[n] x[k]h[n k] = h[m]x[n m]
k= m=

The second equality above establishes that convolution is


commutative:
xh = h x

Convolution is associative:

x (h1 h2 ) = ( x h1 ) h2

Convolution is distributive:

x ( h1 + h2 ) = (x h1 ) + (x h2 )

6.02 Fall 2012 Lecture 10, Slide #21


Series Interconnection of LTI Systems
w[n]
x[n] h1[.] h2[.] y[n]

y = h2 w = h2 ( h1 x ) = ( h2 h1 ) x
x[n] (h2h1)[.] y[n]

x[n] (h1h2)[.] y[n]

x[n] h2[.] h1[.] y[n]

6.02 Fall 2012 Lecture 10, Slide #22


Spot Quiz
input response
Unit step response: s[n]
x[n] S y[n]
1
0.5

012345 n
Find y[n]:
x[n]
1 1. Write x[n] as a function of
unit steps
0.5
2. Write y[n] as a function of
unit step responses
0123456789 n
3. Draw y[n]
6.02 Fall 2012 Lecture 10, Slide #23
MIT OpenCourseWare
http://ocw.mit.edu

6.02 Introduction to EECS II: Digital Communication Systems


Fall 2012

For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.

You might also like