Systems

Classification &
Properties
1
 Continuous time & Discrete time Systems
In continuous time system the continuous time inputs are
transformed to continuous time outputs.
x(t)  y(t)
In discrete time system the discrete time inputs are transformed
to discrete time outputs.
x(n)  y(n)

2
 Classifications of Systems
Linear and Nonlinear System
A system is said to be linear if it obeys the superposition theorem
Let x1(t)  y1(t) and

x2(t)  y2(t)
Then the system is linear if
• The response to x1(t) + x2(t)  y1(t) + y2(t) (additivity)

• The response to a x1(t)  a y1(t) (scaling or homogeneity)

These two-property defining the linearity can be combined in to
signal statement
Continuous time
3
 Classifications of Systems
Linear and Nonlinear Systems
Discrete time
ax1(n) + bx2(n)  ay1(n) + by2(n) (Superposition)

Check the linearity of the following systems.

a. y(t) = t x(t)
b. y(t) = x2(t)
c. y(n) = 2 x(n) – 3

4
 Classifications of Systems
Linear and Nonlinear Systems
Discrete time
ax1(n) + bx2(n)  ay1(n) + by2(n) (Superposition)

Check the linearity of the following systems.

a. y(t) = t x(t)
b. y(t) = x2(t)
c. y(n) = 2 x(n) – 3

5
 Classifications of Systems
Check the linearity of the following systems.
a. y(t) = t x(t)
Consider two arbitrary inputs x1(t) and x2(t)

x1(t) → y1(t) = t x1(t)

x2(t) → y2(t) = t x2(t)

x3(t) → y3(t) = t x3(t)

Let x3(t) be a linear combination of x1(t) and x2(t) i.e.

x3(t) = a x1(t) + b x2(t)

Where a and b are arbitrary scalers. If the system is linear then
y3(t) = a y1(t) + b y2(t) …1 6
 Classifications of Systems
Check the linearity of the following systems.
a. y(t) = t x(t)
Let x1(t) → y1(t) = t x1(t),

x2(t) → y2(t) = t x2(t)

and x3(t) → y3(t) = t x3(t)

Let x3(t) be the linear combination x1(t) and x2(t).

x3(t) = ax1(t) + bx2(t) if the system is linear, then

y3(t) = ay1(t) + by2(t)

7
 Classifications of Systems
From LHS of the equation
y3(t) = t x3(t) = t [a x1(t) + b x2(t)]

= a t x1(t) + b t x2(t)

= a y1(t) + b y2(t)
= RHS
Therefore, the system is linear.

8
 Classifications of Systems
Check the linearity of the following system.
b. y(t) = x2(t)
Consider two arbitrary inputs x1(t) and x2(t)

x1(t) → y1(t) = x21(t)

x2(t) → y2(t) = x22(t)

x3(t) → y3(t) = x23(t)

Let x3(t) be a linear combination of x1(t) and x2(t) i.e.

x3(t) = a x1(t) + b x2(t)

Where a and b are arbitrary scalers. If the system is linear then
y3(t) = a y1(t) + b y2(t) …1 9
 Classifications of Systems
Check the linearity of the following system.
b. y(t) = x2(t)
Consider the LHS of the equation 1
y3(t) = x23(t) = [a x1(t) + b x2(t)]2

= a2 x21(t) + b2 x22(t) + 2ab x1(t) x2(t)

= a2 y21(t) + b2 y22(t) + 2ab x1(t) x2(t)

≠ RHS
Therefore, the system is nonlinear system.

10
 Classifications of Systems
Linear and Nonlinear Systems
For the system described by the following equations, determine
linearity of the systems

𝑑
𝑎. 𝑦(𝑡)+3𝑦(𝑡)=𝑥(𝑡)
𝑑𝑡
11
 Classifications of Systems
Time varying and Time invariant Systems
Time invariant systems: A system is invariant if the behaviour and
characteristics of the system do not change with time. i.e. a time
shift in the input signal causes an identical time shift in output
signal. For continuous time system
If x(t)  y(t)
then x(t – t0)  y(t – t0)
For discrete time system
If x(n)  y(n)
then x(n – n0)  y(n – n0)
12
 Classifications of Systems
Time varying and Time invariant Systems
Procedure to test whether the system is time invariant or not
1. Let y1(t) be the output corresponding to input x1(t)

2. Consider second input x2(t) obtained by shifting x1(t);

x2(t) = x1(t – t0) and find the output y2(t) corresponding to x2(t)

3. From step 1 find y1(t – t0) and compare with y2(t)

4. If y2(t) = y1(t – t0), then the system is time invariant otherwise

it is time varying system.

13
 Classifications of Systems
Time varying and Time invariant Systems
For each of following system, determine whether the system is
time invariant or not.
1. y(n) = n x(n)
2. y(n) = x(– n)
3. y(t) = sin[x(t)]
4. y(t) = x(2t)

14
 Classifications of Systems
Time varying and Time invariant Systems
Determine whether the system is time invariant or not.
1. y(n) = n x(n)
Consider an arbitrary input x1(n)

x1(n) → y1(n) = n x1(n)

x2(n) → y2(n) = n x2(n)

Let x2(n) be obtained by shifting x1(n) in time i.e.

x2(n) = x1(n – n0)

If the system is invariant, then
y2(n) = y1(n – n0) …1
15
 Classifications of Systems
Time varying and Time invariant Systems
Consider the LHS of equation 1
y2(n) = n x2(n) = n x1(n – n0)
Now consider
y1(n) = n x1(n)

y1(n – n0) = (n – n0) x1(n – n0)

Here y2(n) ≠ y1(n – n0)

Hence the system is not time invariant.

16
 Classifications of Systems
Time varying and Time invariant Systems
Determine whether the system is time invariant or not.
1. y(t) = sin[ x(t)]
Consider an arbitrary input x1(t)

x1(t) → y1(t) = sin[x1(n)]

x2(t) → y2(t) = sin[x2(n)]

Let x2(t) be obtained by shifting x1(t) in time i.e.

x2(t) = x1(t – t0)

If the system is invariant, then
y2(t) = y1(t – t0) …1
17
 Classifications of Systems
Time varying and Time invariant Systems
Consider the LHS of equation 1
y2(t) = sin[x2(t)] = sin[x1(t – t0)]
Now consider
y1(t) = sin[x1(t)]

y1(t – t0) = sin[x1(t – t0)]

Here y2(t) = y1(t – t0)

Hence the system is time invariant.

18
 Classifications of Systems
Causal Systems
Nonanticipatory, Physically realizable
The output of the system at any time t0, n0 depends on the value
of the input at the present time and in the past.
i.e. t ≤ t0 or n ≤ n0

If two inputs x1(n) and x2(n) to a causal system are identical up to

sometime t0, n0, the corresponding outputs must also be equal up

to this time.
The causal system cannot predict if the two inputs will be
different after t0, n0 (in future)
19
 Classifications of Systems
Causal Systems
For each of the following input output relationships, determine
whether the corresponding system is causal
A . y(n) = n x(n)
B. y(n) = x(-n)
C. y(n) = sin(x(n))
D. y(t) = x(2t)
E. y(t) = x(t) cos(t + 1)

20
 Classifications of Systems
Causal Systems
A . y(n) = n x(n)
Consider the output y(n) at a positive time n0

y(n)|n = n0 = y(n0) = n x(n)|n = n0 = n0 x(n0)

Now, consider the output y(n) at a negative point time -n0

y(n)|n = -n0 = y(-n0) = n x(n)|n = -n0 = -n0 x(-n0)

In both the cases the present output depends upon present input
and hence the system is causal

21
 Classifications of Systems
Causal Systems
B. y(n) = x(-n)
Consider the output y(n) at a positive time n0

y(n)|n = n0 = y(n0) = x(-n)|n = n0 = x(-n0)

Now, consider the output y(n) at a negative point time -n0

y(n)|n = -n0 = y(-n0) = x(-n)|n = -n0 = x(n0)

First case the present output depends upon past input and
In second case the present output depends upon future input
hence the system is noncausal.

22
 Classifications of Systems
Stable Systems
A system is said to be bounded input bounded output (BIBO)
stable if and only if every bounded input results in bounded
output.
Signal x(t) is said to be bounded if its magnitude does not grow
beyond the limit (bound)
I x(t) I ≤ Bx < ∞ for all t.
A system is BIBO stable if for any bounded input x(t), the
response y(t) is also bounded.
I x(t) I ≤ Bx < ∞  I y(t) I ≤ By < ∞
23
 Classifications of Systems
Stable Systems
For each of the following input output relationships, determine
whether the corresponding system is stable or not.
a. y(t) = t x(t)
b. y(t) = ex(t)
c. y(n) = 1/3 [x(n) + x(n-1) + x(n-2)

24
 Classifications of Systems
Stable Systems
a. y(t) = t x(t)
Assume that
|x(t)| ≤ Bx < ∞ for all t
Using the given input output relation, we have
y(t) = t x(t)
and so we may write
|y(t)| = |t x(t)| = |t||x(t)| = |t| Bx
As t → ∞ the output |y|→ ∞ which is unbounded, so the system
is unstable
25
 Classifications of Systems
Systems With and Without Memory
System with memory
Memory System or Dynamic System
A system to said to be dynamic system if its output signal
depends on the past and/or future values of input signal.
Memoryless system or Static or Instantaneous
A system said to be static system if its output depends upon only
present value of input signal.

26
 Classifications of Systems
Invertibility and Inverse Systems
A system is invertible if by observing the output, we can
determine the input.
i.e. For invertible system, there is an inverse system which when
cascaded with the original system gives output which is input of
the first system.

x(n) System y(n) Inverse w(n) = x(n)

System

27
Convolution

28
 Convolution Integral

The unit impulse response is defined as the output of an LTI

system due to a unit impulse signal input applied at time t = 0 or
n = 0.
x(t) = δ(t) LTI y(t) = h(t) x(n) = δ(n) LTI y(n) = h(n)
System System
Continuous time LTI system Discrete time LTI system

x(t)  y(t) x(n)  y(n)

δ(t)  h(t) δ(n)  h(n)

29
 Convolution Integral

For linear system

x1(t)  y1(t)

x2(t)  y2(t)
The system is linear if
x(t) = a x1(t) + b x2(t)  y(t) = a y1(t) + b y2(t)

Let x(t) be a weighted sum of signals xi(t) &

y(t) be the weighted sum of signals yi(t) 𝑛

𝑥(𝑡)=𝑎1 𝑥 1 (𝑡)+𝑎2 𝑥 2 (𝑡)+...+𝑎𝑛 𝑥 𝑛 (𝑡)=∑ 𝑎𝑖 𝑥𝑖 (𝑡)
𝑖=1
30
 Convolution Integral

By shifting property of impulse function


x(t )  x( ) (t   )d


any signal x(t) can be expressed as a range (band) of weighted

impulses.

31
 Convolution Integral

Consider a continuous time LTI system with input x(t)

Using the superposition & time invariant property of LTI system
output y(t) can be expressed as a linear combination of responses
of the system to the shifted impulse signals
x(t )  y (t )
 (t )  h(t )
 (t   )  h(t   )
x( ) (t   )  x( )h(t   )
 
x(t )  x( ) (t   )d  y (t )  x( )h(t   )d
 

32
 Convolution Integral

Therefore, the system output y(t) to an arbitrary input x(t) in

terms of unit impulse response h(t) is

y (t )  x( )h(t   )d

is also called as convolution integral of signal x(t) and h(t). And
represented as
y(t) = x(t) * h(t)

33
 Properties of Convolution Integral

1. Commutative Property
x(t) * h(t) = h(t) * x(t)

x(t) y(t) h(t) y(t)

h(t) x(t)

x(t ) * h(t )  x( )h(t   )d


34
 Properties of Convolution Integral

2. Associative Property
x(t) * [h1(t) * h2(t)] = [x(t) * h1(t)] * h2(t)]
The cascade combination of a LTI systems can be replaced by a
single system whose impulse response is the convolution of the
individual impulse response

x(t) y(t) x(t) y(t)

h1(t) h2(t) h1(t)*h2(t)

35
 Properties of Convolution Integral

3. Distributive Property
x(t) * [h1(t) + h2(t)] = x(t) * h1(t) + x(t) * h2(t)]
The parallel combination of LTI systems is equivalent to a single
system whose impulse response is the sum of individual impulse
responses in the parallel configuration.

h1(t) y(t) x(t) y(t)

x(t) h1(t)+h2(t)
+

h2(t)

36
 Properties of Convolution Integral

4. Shift Property
If x(t) * h(t) = y(t)
Then x(t) * h(t – t0) = x(t – t0) * h(t) = y(t – t0)

x(t – t1) * h(t – t2) = y(t – t1 – t2)

5. Convolution with an Impulse
The convolution of a signal x(t) with a unit impulse function
results in the signal x(t) itself
x(t) * δ(t) = x(t)

37
 Properties of Convolution Integral

6. Width Property
The width of the non-zero extent (the interval of the time
between first and last non-zero values) of the continuous
convolution of two functions equals to the sum of the width of
the non-zero extent of the two functions.
If the durations of x(t) and h(t) are finite and given by Wx and Wh

respectively then the duration of x(t) * h(t) is Wx + Wh

38
 Properties of Convolution Integral

7. Differentiation Property

if 𝑥 (𝑡)∗h (𝑡)= 𝑦 (𝑡)

8. Time scaling property

1
then 𝑥 (𝑎𝑡 ) ∗h (𝑎𝑡 )= 𝑦 (𝑎𝑡)
|𝑎|

39
 Properties of Convolution Integral

Show that
1. The convolution of an odd function and an even function is an
odd function
2. The convolution of two odd functions is an even function
3. The convolution of two even function of an even function

40
 Properties of Convolution Integral

Prove the following

1.𝑥(𝑡)∗𝛿(𝑡−𝑡 0)=𝑥(𝑡−𝑡 0)

41
 Properties of Convolution Integral

Prove the following

By sampling property

42
 Properties of Convolution Integral

Prove the following

Since

43
 Properties of Convolution Integral

Prove the following

Since

44
 Properties of Convolution Integral

Determine and sketch the convolution of

and

45
 Convolution Sum

For any arbitrary input x(n)

𝑥(𝑛)𝛿(𝑛−𝑘)=𝑥(𝑘)𝛿(𝑛−𝑘)
i.e. The component of x(n) at n =k is x(k)xδ(n-k)
The multiplication of a signal by a time shifted impulse response
results in a time shifted impulse with amplitude of the signal at
that time
46
 Convolution Sum

Thus, the x(n) can be expressed as weighted sum of time shifted

impulses
x(n) ...  x( 2) (n  2)  x( 1) (n  1)  x(0) (n) 
 x(1) (n  1)  x(2) (n  2)  ...

  x(k ) (n  k )
k 

x(-2)δ(n+2) x(-1)δ(n+1)

-1 -1
-2 1 2 -2 1 2

47
 Convolution Sum
x(0)δ(n) X(1)δ(n-1)

-1 -1
-2 1 2 -2 1 2

x(2)δ(n-2) x(n)

-1 -1
-2 1 2 -2 1 2

48
 Convolution Sum

For linear system

If impulse response h(n) is known, the system response to any
arbitrary input could be obtained by summing system response to
various impulse components.
Let for any discrete time LTI system
x ( n)  y ( n)
 ( n)  h( n)
 (n  k )  h(n  k ) time shift
x(k ) (n  k )  x(k )h(n  k )
 
x(n)   x(k ) (n  k )  y (n)   x(k )h(n  k )
k  k 

49
 Convolution Sum

We obtained the system output y(n) to an arbitrary input x(n) in

terms of unit impulse response h(n)
∞
𝑦 (𝑛)= ∑ 𝑥 (𝑘 ) h(𝑛 −𝑘 )
𝑘=− ∞

The relationship is called as convolution sum of sequences x(n)

and h(n)
y(n) = x(n) * h(n)

50
 Convolution Sum

y(n) = x(n) * h(n)

If x(n) = 0 for n < k1 and

h(n) = 0 for n < k2 then

x(k) = 0 for k < k1 and

h(n-k) = 0 for n – k < k2  k > (n – k2)

∴ 𝑦(𝑛)=𝑥(𝑛)∗h(𝑛)
51
 Properties of Convolution Sum

1. Commutative Property
x(n) * h(n) = h(n) * x(n)

2. Associative Property
x(n) * [h1(n) * h2(n)] = [x(n) * h1(n)] * h2(n)

3. Distributive Property
x(n) * [h1(n) + h2(n)] = x(n) * h1(n) + x(n) * h2(n)
52
 Properties of Convolution Sum

4. Shifting Property
if x(n) * h(n) = y(n)
then x(n) * h(n – n0) = y(n – n0)
x(n – n0) * h(n) = y(n – n0)
and x(n – n1) * h(n – n2) = y(n – n1 – n2)

5. Convolution with an Impulse

x(n) * δ (n) = x(n)

53
 Properties of Convolution Sum

6. Width Property
Let Ny be the number of samples in y(n)

Nx be the number of samples in x(n)

Nh be the number of samples in h(n)

Ny = Nx + Nh – 1

Let REx be the position of right most sample in x(n)

REh be the position of right most sample in h(n)

LEx be the position of left most sample in x(n)

LEh be the position of left most sample in h(n)

54
N = RE – LE +1
 Properties of Convolution Sum

6. Width Property
REy = REx + REh

LEy = LEx + LEh

Ny = REy – LEy + 1

= REx + REh – LEx – LEh + 1

= [REx – LEx + 1] + [REh – LEh + 1] – 1

= Nx + Nh – 1

55
 Properties of Convolution Sum

7. Sum Property
The sum of impulses in a convolution sum of two discrete
time sequences is
the product of sum impulses in the two individual
sequences.
Let Sy be the sum of the impulses in y(n)

Sx be the sum of the impulses in x(n)

Sh be the sum of the impulses in h(n)

then
Sy = S x Sh
56
 Properties of Convolution Sum

7. Sum Property

57
 Numericals

1. Find the convolution of and

2. Find the convolution of and
3. If the signal is convoluted with an unknown signal the result
is . Find .

58
 Relationship between the LTI system Properties and the
impulse response
1. LTI system with and without Memory

for the system to be memory less, y(n) must depend only on

x(n) not on x(n – k) for k ≠ 0.
hence every term in above equation must be zero except
h(0)x(n).
this condition implies that h(k) = 0 for k ≠ 0.
thus, a discrete time LTI system is memory less if and only if
h(n) = K δ(n)

59
 Relationship between the LTI system Properties and the
impulse response
1. LTI system with and without Memory
h(n) = K δ(n)
Where the K = h(0) is constant, and the convolution sum reduces
to the relation
y(n) = K x(n)
If a discrete time LTI system has an impulse response h(n) that is
not identically zero for n ≠ 0, then the system has the memory.
For continuous time LTI system y(t) = Kx(t) and has the impulse
response h(t) = K δ(t).

60
 Relationship between the LTI system Properties and the
impulse response
2. Causality for LTI System
The output of causal system depends only on present & past
inputs

Present & past inputs value are associated with k ≥ 0, future input
values are associated with k < 0
For y(n) to be depend only on past and present input, we need to
have h(k) = 0 for k < 0

61
 Relationship between the LTI system Properties and the
impulse response
2. Causality for LTI System
Hence for discrete time LTI causal system
h(n) = 0 for n < 0
& the system response is

For continuous time

h(t) = 0 for t < 0
& the system response is

62
 Relationship between the LTI system Properties and the
impulse response
3. Stability for LTI System
A system is stable if every input produces a bounded output.
the output of LTI system is given by

y (n)  x(n) * h(n) h(n) * x(n)   h (k )x (n  k )
k  

the magnitude of the output is


y ( n)  h( n) * x ( n)   h ( k )x ( n  k )
k  

  h ( k )x ( n  k )
k  

As the input is bounded

x(n) Bx  ,  x ( n  k )  Bx
 
hence y (n)  Bx  h ( k ) B  h ( k )
k  
x
k  
63
 Relationship between the LTI system Properties and the
impulse response
3. Stability for LTI System

| |
∞ ∞
hence |𝑦(𝑛)|≤𝐵 𝑥 ∑ h(𝑘) =𝐵𝑥 ∑ |h(𝑘)|
𝑘=−∞ 𝑘=−∞

forcontinuoustimesystem
64
 Relationship between the LTI system Properties and the
impulse response
4. Invertibility for LTI System
consider a continuous (or a discrete) time LTI system with
impulse response h(t) (or h(n)). This system is invertible only
if an inverse system exists that when connected in series with
the original system produces an output equal to the input to
original system.
i.e. If an LTI system is invertible then it has an LTI inverse.

x(t) y(t) x(t)

h(t) h1(t)

x(n) y(n) x(n)

h(n) h1(n)
65
 Relationship between the LTI system Properties and the
impulse response
4. Invertibility for LTI System
The output of the cascade combination is

𝑥 (𝑡 )= 𝑥 (𝑡 ) ∗¿
Similarly, the impulse response of a discrete time LTI inverse
system h1(n) must satisfy

h (𝑛)∗ h1 (𝑛)=𝛿 (𝑛)

66
Summary of Relationship between the LTI system Properties
and the impulse response

Property Continuous Time System Discrete time System

Memory less h(t ) K (t ) h ( n )  K ( n )
Causality h(t ) 0, for t  0 h(n) 0, for n  0
∞
Stability ∞

Invertibility
∫ h(𝑡)𝑑𝜏 <∞ ∑ |h( 𝑛)|<∞
−∞ 𝑛 =− ∞

h(t ) * h1 (t )  (t ) h(n) * h1 (n)  (n)

67
 Unit Step Response of an LTI system

The step input signal are often used to characterized the

response of an LTI system to sudden changes in the input.
The step response s(t) or s(n) is defined as the output due to a
unit step input signal x(n) = u(n) or x(t) = u(t).
The step response of a discrete time LTI system is

68
 Unit Step Response of an LTI system

𝑠(𝑛)=h(𝑛)+𝑠(𝑛−1)
Therefore, the step response of a discrete time LTI system is
running sum of its impulse response
The impulse response of a discrete time system is the first
difference of its step response.

69
 Unit Step Response of an LTI system

For continuous time LTI system

∞
𝑠(𝑡)= ∫ h(𝜏)𝑢(𝑡−𝜏)𝑑𝜏
−∞

Therefore, the step response of a continuous time LTI system is

running integral of its impulse response.
The unit impulse response is the first derivative of the unit step
response 70
 Circular convolution

Circular time shift

Consider a sequence x(n)

The # denoted the sample at n = 0.

Now find the linear time shift and
and

Now find the circular shift and

and

The sequence is shifted in a circle / loop. 71

 Circular convolution

Time inversion
Consider a sequence x(n)

The is

In this operation
the sample "4" moved from n = 3 to n = - 3,
the sample “3" moved from n = 2 to n = - 2
the sample “2" moved from n = 1 to n = - 1
but the "1" stayed at the zero point.

72
 Circular convolution

Circular time inversion

Consider a sequence x(n)

To produce a result x[<-n>] / x((-n))

The "1" (in the zero position) has not moved in either direction,
nor have we shifted to the left or right, because we aren't adding
or subtracting anything to our argument (n). So, we can put 1
back in the same place as it was.
All the rest of the numbers (2 3 and 4) all shifted to the right of
the sequence, and therefore we will loop them around to the
other side 73
 Circular convolution

Circular time inversion

Therefore, the result x[<-n>] / x((-n)) is

In general, for circular time inversion

74
 Circular convolution

Circular time inversion

Let and be the two discrete time sequences with length N, the
circular convolution is given by

75
 Circular convolution:
x1(1) x2(1)

x1(2) x1(m) x1(0) x2(2) x2(m) x2(0)

x1(3) x2(3)
x2(3)

x2(2) x2(-m) x2(0)

76
x2(1)
 Circular convolution:
x2(3) x2(0)
Shift x2(-m)
anticlockwise
by one unit
x2(2) x2(-m) x2(0) to obtain x2(3) x2(1-m) x2(1)
x2(1-m)

Shift x2(1-m)
anticlockwise
x2(1) by one unit x2(2)
to obtain
x2(1) x2(2-m) x2(2)

Shift x2(2-m)
anticlockwise
x2(0) x2(2-m) x2(2) by one unit to x2(1) x2(3-m) x2(3)
obtain x2(3-
m)

77
x2(3) x2(0)
 Circular convolution

Find the circular convolution of

&
the circular convolution is given by

78
 Circular convolution: Stockham’s Method

x2(3)=4

x1(1)=1

x2(2) x (2) x1(0) x2(0)

1
=3 =2 =2 =1

x1(3)=1

x2(1)=2

Draw the two circles as shown. Divide the circles into number of
sample in the sequences. Inner circle is for first sequence whose
values are in anticlockwise direction. Outer circle is for second
sequence whose values are in clockwise direction.
79
 Circular convolution: Stockham’s Method

x2(3)=4
=1x4 =4
x1(1)=1

x2(2) x (2) x1(0) x2(0)

1
=3 =1 =2x1 =2 Y(0) = 2 + 4 + 6 + 2 = 14
=2 =2

=2x3 =6 x1(3)=1
=1x2 =2
x2(1)=2

Now multiply the values in dotted circles and add all

multiplication results.

80
 Circular convolution: Stockham’s Method

x2(0)=1
=1x1 =1
x1(1)=1

x2(3) x (2) x1(0) x2(1)

1
=4 =2 =2x2 =4 Y(1) = 1 + 8 + 3 + 4 = 16
=2 =2

=2x4 =8 x1(3)=1
=1x3 =3
x2(2)=3

Shift all the values of outer circle in anticlockwise direction by

one step.
Multiply the values in dotted circles and add all multiplication
results.
81
 Circular convolution: Stockham’s Method

x2(1)=2
=1x2 =2
x1(1)=1

x2(0) x (2) x1(0) x2(2)

1
=1 =3 =2x3 =6 Y(2) = 2 + 4 + 6 + 2 = 14
=2 =2

=2x1 =2 x1(3)=1
=1x4 =4
x2(3)=4

Again, shift all the values of outer circle in anticlockwise direction

by one step.
Multiply the values in dotted circles and add all multiplication
results.
82
 Circular convolution: Stockham’s Method

x2(2)=3
=1x3 =3
x1(1)=1

x2(1) x (2) x1(0) x2(3)

1
=2 =4 =2x4 =8 Y(3) = 1 + 8 + 3 + 4 = 16
=2 =2

=2x2 =4 x1(3)=1
=1x1 =1 Y(n) = [14, 16, 14, 16]
x2(0)=1

Again, shift all the values of outer circle in anticlockwise direction

by one step.
Multiply the values in dotted circles and add all multiplication
results.
83
 Circular convolution: Matrix Method
In this method write one sequence in the form of matrix. And it
is multiplied by column vector of another sequence.
Find the circular convolution of
&

84
 Circular convolution: Tab method
In this method write one sequence in the form of table. And it is
multiplied by another sequence.
Find the circular convolution of
&

85
 Circular convolution: Tab method
Perform the following on the sequences
&
1. Linear convolution
2. Circular convolution
3. Circular convolution using linear convolution
4. Linear convolution using circular convolution

Find the convolution of

86