Scribd
Upload
56 views

Convolution Sum PDF

- The document discusses convolution of signals and describes how the range of a convoluted signal is the sum of the lower limits to the sum of the upper limits of the individual signals. - It provides an example of convolving two sequences and calculating the resulting sequence step-by-step. - Limits of convoluted signals are discussed.

Uploaded by

Pretty Fibber
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
56 views

Convolution Sum PDF

- The document discusses convolution of signals and describes how the range of a convoluted signal is the sum of the lower limits to the sum of the upper limits of the individual signals. - It provides an example of convolving two sequences and calculating the resulting sequence step-by-step. - Limits of convoluted signals are discussed.

Uploaded by

Pretty Fibber
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

𝐞𝟔 𝐭 −𝟔𝐭 u(-t) + u(t)

t t t
𝟐𝐭 u(-1- t)
𝐞
1 1

t t
-1 -1
𝐞− 𝟔∨𝐭∨¿ ¿

t
h[n]

…..
x(t)

t
-2 - − 𝜋
2
0 𝜋
2 𝜋 2
x(t)

-4 -2 0 2 4

x(t)

-2 - − 𝜋
2
0 𝜋
2 𝜋 2
• Limits of Convoluted Signal
• If two signals are convoluted then the resulting convoluted signal has
following range:
• Sum of lower limits < t < sum of upper limits
δ (n) System h( n)

δ (n − k ) System h( n− k )

x[n] System x[-1] ]

x[n] System x[0] ]

x[n] System x[1] ]

x[n] System x[1] ]


δ (n) System h( n)

δ (n − k ) System h(n− k )

x[n] System x[-1] ]

x[n] System x[0] ]

x[n] System x[1] ]


.
.
.
x[n] System x[k] ]
Question 1. x[n] = { 1, -1, 2 } h[n] = { 1, 2, 1 }

x[n] h[n]
2 2

1 1

1
n n
2 1 2

-1

y[n] =

Length of convolution = a
Length of convolution = 3 + 3 -1= 5
n = 0 to 4
x[k] h[-k]
2 2

1 1

1
k k
2 -2 -1

-1

The product of the sequence x[k] with the sequence h[0 - k] has two nonzero samples, which may be
summed to obtain

y[0] =X -2 + 0 X -1 + 1 X 1 + (-1) X 0 + 2 x
x[k] h[1-k]
2 2

1 1

1
k k
2 -2 -1 1
-1

y[1] = 0 X 1 + 1 X 2 + (-1) X 1 + 2 X 0 = 2 -1 = 1
x[k] h[2-k]
2 2

1 1

1
k k
2 -1 1 2

-1

y[2] =
x[k] h[3-k]
2 2

1 1

1
k k
2 1 2 3

-1

y[3] =
x[k] h[4-k]
2 2

1 1

1
k k
2 1 2 3 4
-1

y[4] =

y[n] = { 1, 1, 1, 3, 2}
Invertible
• y[n] = x[2n]
• Let, x[n] =
• x[2n] =

• Let, x[n]=

You might also like