Scribd
Upload
17 views13 pages

Convolutionpresentation

The document discusses the concept of convolution in discrete-time systems, explaining how it combines input signals and impulse responses to produce output signals. It covers the properties of Linear Time-Invariant (LTI) systems, including linearity and time invariance, and provides methods for finding discrete convolution. Additionally, it highlights useful properties of convolution, such as commutativity, associativity, and distributivity.

Uploaded by

Anosha Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
17 views13 pages

Convolutionpresentation

The document discusses the concept of convolution in discrete-time systems, explaining how it combines input signals and impulse responses to produce output signals. It covers the properties of Linear Time-Invariant (LTI) systems, including linearity and time invariance, and provides methods for finding discrete convolution. Additionally, it highlights useful properties of convolution, such as commutativity, associativity, and distributivity.

Uploaded by

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

CONVOLUTION OF

DISCRETE-TIME
SYSTEMS &
CONVOLUTION
PRESENTED BY
Bisma Fatima
Hamail Chaudary

SUM
Simran
Eiman Azeem
Arooba Arshad

Write date here


Convolution
Convolution is a mathematical operation that combines two functions to
produce a third function

x[n] ⋆ h[n] = ⋆ is the convolution


operator
y[n]

x(n) System y(n) = x[n] ⋆ h[n]


h[n
]
x[n] is the input signal.
h[n] is the impulse response of the
system.
DISCRETE-TIME SIGNALS

Discrete-time signals are defined only at certain specific values


of time.

1
- 3
- - 2 - 1 2 4
4 3 1

A discrete-time signal can be decomposed


into a sequence of individual impulses 2
IMPULSE
1

- - - 1 2 3
3 2 1
LTI SYSTEM
An LTI (Linear Time-Invariant) system is a systems where the
principles of linearity and time invariance are maintained.

Linear
A linear system satisfies two key properties:

1.The output is scaled by the same amount as input

2. If several inputs are present at the same time, the output is


the sum of individual outputs for each point
x(n) System y(n)
LTI SYSTEM

Time The output is delayed by the same as the input

Invariant
x(t) y(t) y’(t)
System Delay

x(t) y’(t)
Delay System
x’(t)
Unit Impulse Response for DT
Systems
The simplest input signal to a system is a single unit impulse

h[n] = the system output (response) to a unit impulse


input δ[n]
impuls impulse
e response
δ[n] LTI h[n]
System
1

n= n
0

The unit impulse response completely characterizes the LTI


System
DT system response for shifted unit
impulse δ[n] LTI h[n] System
Unit impulse
Impulse 1

response
n n
0 0

δ[n-k] LTI h[n-k]


Shifted Unit System
Impulse 1 time invariance

n
k n
0 0 k

If the impulse is shifted or delayed by k values, the input to the system


becomes δ(n−k). Since the system is time-invariant, the output is also
shifted by the same k values
DT system response for shifted and scaled unit
impulse
Suppose we have a signal x[n], with value x[k] at n =
k
x[
n] n
0 k
Shifted and scaled Impulse:

x[k]δ[n- LTI
System x[k]h[n- output is now
k]
x[k] k] scaled by the value
x[k]
n
n
0 k 0 k
Here, the input is expressed as x(k)⋅δ(n−k), where x(k) is a numerical value.
Graphically, this results in an impulse at n=k, scaled by the value of x(k). Due to
the system's linearity, the output is a scaled version of the standard impulse
response, with each component multiplied by the corresponding x(k) value.
DT system output for general input signal x(n)
Now, Sum the previous result {x[k]h[n-k]} for all values of k in signal
x[n].
x[k]δ[n- LTI x[k]h[n-
System
∞ k] ∞k]
x[k]δ[n- LTI
System x[k]h[n-
k k] k k]
=−∞ ∞
=−∞
The input is just the signal x(n) x[k]δ[n-
x(n) :
= k k]
=−∞ ∞
x(n) System y(n) = x[k]h[n-
x[ k k]
n] n =−∞
0
THE CONVOLUTION
sum
The results in the previous slide gives the system's output signal y(n)
for any input signal x (n) just by knowing the impulse response h(n)
∞
y(n) = x[k]h[n-
k k]
x[n]
y(n) = =−∞ ⋆ h[n]
x(n) System y(n) = x[n] ⋆ h[n]
h[n
]
Methods to find discrete
Convolution
Tabular method DESCRIBTION

Column method DESCRIBTION


USEFUL PROPERTIES OF
The CONVOLUTION
convolution operation ⋆ is:

1 commutative: x[n] ⋆ h[n] = h[n] ⋆ x[n]

associative: x[n] ⋆ (h[n] ⋆ µ[n]) = (x[n] ⋆ h[n]) ⋆


2
µ[n]

distributive: x[n] ⋆ (h[n] + µ[n]) = x[n] ⋆ h[n] +


3
x[n] ⋆ µ[n]

homogeneous: x[n] ⋆ (ah[n]) = a(x[n] ⋆ h[n]),


4 where a is any
CONVOLUTION
PRACTICAL

You might also like