0% found this document useful (0 votes)
33 views

Module 2B Linear Systems

The document discusses discrete linear time-invariant (LTI) systems. It defines linearity formally as the properties of superposition and scalability. Superposition means that the output when two inputs are added is equal to the sum of the outputs when each input is applied individually. Scalability means that multiplying an input by a constant results in the output being multiplied by the same constant. Examples of linear and non-linear systems are provided. The document also discusses that time-invariant systems means a shift in input results in the same shift in output. Impulse response and convolution sums are introduced as ways to characterize LTI systems.

Uploaded by

Ty Smith
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
33 views

Module 2B Linear Systems

The document discusses discrete linear time-invariant (LTI) systems. It defines linearity formally as the properties of superposition and scalability. Superposition means that the output when two inputs are added is equal to the sum of the outputs when each input is applied individually. Scalability means that multiplying an input by a constant results in the output being multiplied by the same constant. Examples of linear and non-linear systems are provided. The document also discusses that time-invariant systems means a shift in input results in the same shift in output. Impulse response and convolution sums are introduced as ways to characterize LTI systems.

Uploaded by

Ty Smith
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Discrete Linear Time Invariant

(LTI) Systems (Part 2)

Dr. Clinton L. Edwards

Dr. M. Lee Edwards

Discrete Linear Systems

y(n) = L x ( n )
x1 ( n )

L[]

y1 ( n )

Formal Definition of Linearity:


Superposition and Scalability

L a1 x1 ( n ) + a2 x2 ( n ) = a1L x1 ( n ) + a2 L x2 ( n )
2

Scalability

a1 x1 ( n )

L[]

a1 y1 ( n )

a1 y1 ( n ) = a1L x1 ( n ) = L a1x1 ( n )

Superposition
x1 ( n )

L[]

y1 ( n )

IF

THEN

x2 ( n )

L[]

x1 ( n ) + x2 ( n )

L[]

y1 ( n ) + y2 ( n )

y2 ( n )

L x1 ( n ) + x2 ( n ) = L x1 ( n ) + L x2 ( n ) = y1 ( n ) + y2 ( n )

Superposition and Scalability Imply Linearity

L a1 x1 ( n ) + a2 x2 ( n ) = a1L x1 ( n ) + a2 L x2 ( n )

Examples of Systems
L a1 x1 ( n ) + a2 x2 ( n ) = a1L x1 ( n ) + a2 L x2 ( n )
Non-Linear System

y ( n ) = L x ( n ) = x ( n )

Time-Invariant
x [ n n0 ]

L[]

y [ n n0 ]

A shift in the inputs results in a shift in the outputs.

x[n]

x[n n0 ]

y[n]

y[n n0 ]

Impulse Response
1
0.9
0.8

h(t), impulse response

0.7
0.6
0.5
0.4
0.3
0.2
0.1
0

0.5

1.5
t, (s)

2.5

x(1)h(n-1)

0.5

x(2)h(n-2)

0.5

x(3)h(n-3)

x(0)h(n)

Convolu'on Sum

0.5

0.5

10

15

x(n)=[1 2 4 1]
0

10

15

For n=[0 1 2 3]
0

10

10

15

15

0.5

()

x(k )h ( n k )

k =

()

y n ! x(n) h n

y(n)

y (n) =

10

15

Key Point:
8

You might also like