SIGNALS AND SYSTEM

( ZERO STATE RESPONSE & CONVOLUTION-DT)

Instructor
Md Waseem Ahmad
Dept. of Electrical and Electronics Engineering
NITK 1
DISCRETE SIGNAL AS SUMMATION OF IMPULSE

x[n] = x[0]δ [n] + x[1]δ [n − 1] + x[2]δ [n − 2] + .....

+ x[−1]δ [n + 1] + x[−2]δ [n + 2] + x[−3]δ [n + 3] + ...
m =∞
= ∑ x[m]δ [n − m]
m = −∞

 Arbitrary sequence x[n] can be viewed as a

summation of several impulses summed
from m = -ꝏ to ꝏ

2
CONVOLUTION SUMMATION

δ [n] LTI h[n]

δ (n - m) LTI h(n - m)

x[m]δ [n - m] LTI x(m)h[n - m]

m = −∞ m = −∞

∑ x[m]δ [n - m] LTI ∑ x[m]h[n - m]

m = −∞
Convolution summation
m = −∞

X[n] y[n]
RESPONSE OF THE SYSTEM
 For any LTI system with input x[n], output y[n], and impulse response h[n],
the following relationship holds:
y[n] = x[n] ∗h[n]
 In other words, a LTI system simply computes a convolution.

 Furthermore, a LTI system is completely characterized by its impulse

response.

 That is, if the impulse response of a LTI system is known, we can

determine the response of the system to any input.
 Causality restriction on both signals and systems further simplifies the
limits of summation .
Causal system’s unit impulse response h[n] is causal.
For causal system and signal , convolution is given by
n
the product x [m ] h [n - m] = 0
y[n] = ∑ x[m]h[n − m] for m < 0 and for m >n
m =0

4
PROPERTIES OF CONVOLUTION
 Commutativity x[n]*y[n]= y[n]* x[n]
Associativity {x[n]*y[n]}*z[n]= x[n]*{y[n]*z[n]}
Distributivity { x[n] + y[n] } *z[n] = x[n]*z[n]+ y[n]* z[n]

 If y[n]= x[n] *h[n] , then

x[n] * h[n-m] = x[n-m] * h[m] = y[n-m) (Shift property )
And x[n-m]*h(n-p] = y[n-m-p]

 Convolution with impulse x[n] * δ[n] = x[n]

 Width Property: If the durations (widths) of x1[n]and x2[n] are finite, given
by W1 and W2, respectively,
then the duration (width) of x1[n]* x2[n] is W1 + W2

NOTE:
The width of a signal is one less than the number of its elements (length)
If x1[n] and x2[n] have finite lengths of L1 and L2, elements respectively,
then the length of x1[n] * x2[n] is L1 + L2-1 elements.
5
ANALYTICAL METHOD

Solution

0 ≤ m ≤ n. If n ≥ 0 (m ≥ 0, n - m ≥ 0) ⇒ u[m] = u[n - m] = 1
If n < 0 ⇒ u[m] = 0

6
CONTD…

7
GRAPHICAL METHOD
∞
c[n] = ∑ x[m]g[n − m]
m = −∞

8
CONTD….

9
CONTD…..
 The procedure for graphical convolution can be summarized as follows
∞
c[n] = ∑ x[m]g[n − m]
m = −∞

1. Keep the function x [m] fixed.

2. Visualize the function g[m] as a rigid wire frame, and rotate (or invert)
this frame about the vertical axis (m= 0)]to obtain g [- m] .

3. Shift the inverted frame along the m axis by n units. The shifted frame
now represents g[n- m] .

4. Multiply x[m] and g[n – m] (the shifted frame) and add all the product to
obtain c[n] the value of the convolution at n

5. Repeat this procedure, shifting the frame by different values (positive

and negative) to obtain c[n] for all values of n over range -ꝏ to ꝏ

10
THE SLIDING TAPE METHOD
This algorithm is convenient when the sequences f1[m] and f2[m] are short
or when they are available only in graphical form
Here, data is represented as sequence of numbers

Procedure
Step1
The signal values are recorded on two tapes, one tape for the values
of the signal f1[m] and another tape for the values of the signal f2[m]
‰

11
CONTD….
Step 2:
One of the tapes, say, the second tape, is flipped about its value at
f2[0] to form the signal f2[-m]

Signal f2[m] ¨ is flipped in such a way that the signal value f2[0] remains in
the same position
Step 3:
The second tape is shifted to the left and right, that is, a traveling signal
f2[k-m] ¨ is formed. The parameter k is an integer that theoretically takes
all values from ­ꝏ to ꝏ

After we shift the second tape for the given value of k, we evaluate the
products of the corresponding overlapping signal values on the tapes.
The sum of all products gives the convolution value for the chosen value
of the parameter k.
This procedure is repeated for all values of k for which the convolution
12
sum may be different from zero.
EXAMPLE
Calculate c[k]=f1[k]*f2[k]

c[0]=1 ×-1=-1

c[1]=1 ×3+2 × -1=-1

c[2]=2 × 3=6

13
EXAMPLE
Calculate c[n]=x[n]*g[n]

14
EXAMPLE

15
THANK YOU

16