Scribd
Upload
29 views

Solving Convolution of Finite Duration Sequences: X (N - K), Do The Same Thing, Except X (N - K) Slides As N Changes

1) The document discusses solving convolution sums of finite duration sequences. Convolution sums are solved by considering either the form x[k]h[n - k] or x[n - k]h[k] and summing the product of the sequences over their nonzero or overlapping intervals. 2) As n increases, h[n - k] slides along the k-axis, and the product and summation are considered for each value of n. For some problems, a tabular approach is helpful to consider many values of n. 3) The general solution is piecewise, with expressions for y[n] valid over different intervals corresponding to different cases. Putting all the pieces together yields a solution valid for

Uploaded by

Geti Luta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
29 views

Solving Convolution of Finite Duration Sequences: X (N - K), Do The Same Thing, Except X (N - K) Slides As N Changes

1) The document discusses solving convolution sums of finite duration sequences. Convolution sums are solved by considering either the form x[k]h[n - k] or x[n - k]h[k] and summing the product of the sequences over their nonzero or overlapping intervals. 2) As n increases, h[n - k] slides along the k-axis, and the product and summation are considered for each value of n. For some problems, a tabular approach is helpful to consider many values of n. 3) The general solution is piecewise, with expressions for y[n] valid over different intervals corresponding to different cases. Putting all the pieces together yields a solution valid for

Uploaded by

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

Solving convolution of finite

duration
sequences
As with the convolution integral of Chapter 5, you solve a convolution sum
problem by starting from one of two forms of the sum argument: x[k]h[n k]
or x{n k]h[k]. From there, you sum the product of the two sequences that
form the sum argument.
As n increases from to , h[n k] slides from left to right along the k-axis.
For each value of n, you consider the product x[k]h[n k] and sum the nonzero
or overlap intervals along the k-axis. For some problems, you have to
consider a lot of different n values, but this is where using a table method is
helpful. (I examine this method in the later section Using spreadsheets and
a tabular approach. You can try your hand at the table method in Example
6-5.) For other problems, you find contiguous intervals of n values where you
can use the geometric series sum formula (see Chapter 2). For the form h[k]
x[n k], do the same thing, except x[n k] slides as n changes.
The general solution is piecewise, meaning expressions for y[n] are valid for
some , which corresponds to case i, i = 1, . . . , N. When you put all
the pieces together, you have a solution valid for .
Unlike the convolution integral, the convolution sum may have a support
interval of a single point. The four steps in Figure 6-5, which parallel the
continuoustime scenario of Chapter 5, outline the general solution procedure.
Find a table-based method for solving this problem in Example 6-5.
Example 6-3: Consider the convolution of , using
the convolution sum form .
Figure 6-6a shows the signal and impulse response to be convolved. Figure
6-6b shows both signals on the k-axis with n as a free variable. In Figures 6-6b
through 6-6f, the flipped and shifted sequence h[n k] is additionally

You might also like