Scribd
Upload
37 views17 pages

07 Convolution

Convolution is the mathematical operation used to describe the output of a linear time-invariant system when the input is one signal modulated by another. The relationship between the input x(n) and output y(n) is given by the convolution sum. Convolution has important properties like being commutative, associative, and distributive. Convolutions can be performed directly by evaluating finite or infinite sums, or graphically by plotting and shifting the signals.

Uploaded by

Jordan Johm Mallillin
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
37 views17 pages

07 Convolution

Convolution is the mathematical operation used to describe the output of a linear time-invariant system when the input is one signal modulated by another. The relationship between the input x(n) and output y(n) is given by the convolution sum. Convolution has important properties like being commutative, associative, and distributive. Convolutions can be performed directly by evaluating finite or infinite sums, or graphically by plotting and shifting the signals.

Uploaded by

Jordan Johm Mallillin
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/ 17

CONVOLUTION

CONVOLUTION

• The relationship between the input to a linear shift-invariant system, x(n), and the output, y(n), is
given by the convolution sum

• h(n)=impulse response
• x(n)=input

• x(n)=impulse response
• h(n)=input
CONVOLUTION PROPERTIES

• Convolution is a linear operator and, therefore, has a number of important


properties including the associative, commutative, and distributive properties.
CONVOLUTION PROPERTIES

COMMUTATIVE PROPERTY ASSOCIATIVE PROPERTY

𝑥 ( 𝑛 ) ∗ h ( 𝑛 ) = h ( 𝑛 ) ∗ 𝑥 ( 𝑛 ) [ 𝑥 ( 𝑛 ) ∗ h1 ( 𝑛 ) ] ∗ h 2 ( 𝑛 ) = 𝑥 ( 𝑛 ) ∗ [ h1 ( 𝑛 ) ∗ h2 ( 𝑛 ) ]
CONVOLUTION PROPERTIES

DISTRIBUTIVE PROPERTY

𝑥(𝑛)∗[h1(𝑛)+h2(𝑛)]=𝑥(𝑛)∗h1(𝑛)+𝑥(𝑛)∗h2(𝑛)
PERFORMING CONVOLUTIONS
DIRECT EVALUATION

• In performing convolutions directly, it is usually necessary to evaluate finite or


infinite sums involving terms of the form ‘an’ or ‘nan’.
• This is the mathematical calculation of a convolution
COMMONLY ENCOUNTERED SERIES
EXAMPLE

• What is ?
SOLUTION
EXAMPLE

• Determine the impulse response for the cascade of 2 linear time-invariant


systems having impulse responses
SOLUTION
GRAPHICAL APPROACH

Steps:
1. Plot both sequences, x(k) and h(k), as functions of k
2. Choose one of the sequences, say h(k), and time-reverse it to form the sequence h(-k)
3. Shift the time reversed sequence by n. Note that if n>0, this corresponds to a shift to the right (delay), whereas if n<0, this
corresponds to a shift to the left (advance)
4. Multiply the sequences x(k) and h(n-k) and sum the product for all values of k. The resulting value will be equal to y(n). This
process is repeated for all possible shifts, n.
5. A useful fact to remember in performing the convolution of 2 finite-length sequences is that if x(n) is of length , and h(n) is of
length , will be of length

6. Furthermore, if the nonzero values of x(n) are contained in the interval and the nonzero values of h(n) are contained in the
interval , the nonzero values of y(n) will be confined to the interval
EXAMPLE
SOLUTION
NUMERICAL CALCULATION
SLIDE RULE METHOD

1. Write the values of x(k) along a piece of paper, and the values of h(-k)
along the top of another piece of paper as illustrated
2. Line up the two sequence values x(0) and h(0), multiply each pair of
numbers, and add the products to form the value of y(0)
3. Slide the paper with the time-reversed sequence h(k) to the right by
one, multiply each pair of numbers, sum the products to find the value
of y(1), and repeat all shifts to the right by n>0. Do the same, shifting
the time-reversed sequence to the left, to find the values of y(n) for
n<0

You might also like