Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Let us consider length-N sequences defined for 0 ≤ n ≤ N − 1 . Such sequences have sample values
equal to zero for n < 0 and n ≥ N .
For an arbitrary integer n0 , the shifted sequence x1[n] = x[n − n0 ] , may no longer be defined over
the range 0 ≤ n ≤ N − 1 .
This brings the requirement for an other type of shift that will keep the shifted sequence always in
the range 0 ≤ n ≤ N − 1 .
[
x c [ n] = x n − n 0 N
]
where, m N
= m modulo N
x[n − n0 ] n0 ≤ n ≤ N − 1
xc [n] =
x[N − n + n] 0 ≤ n ≤ n0
0
x[n]
(a)
0 1 2 3 4 5
[
x n −1 6
] = x[ n + 5 ] 6
0 1 2 3 4 5
(c)
0 1 2 3 4 5
[
x n−4 6
] = x[ n + 2 ]6
It can be seen from (b) and (c) that right circular shift by n 0 is equivalent to a left circular shift by
(N − n 0 ) .
Circular Convolution
Circular convolution between two length N sequences can be carried out as shown by the
expression below:
[ ]
N −1
yC [n] = ∑ g [m]h n − m N
m=0
Since the above operation involves two length-N sequences it is referred to as the N-point
circular convolution and denoted by:
yC [n ] = g [n ] N h[n ]
2 2 2
1 0 1 1 1
0 1 2 3 0 1 2 3
[ ]
3
yc [n] = g[n] 4 h[n] = ∑ g[m]h n − m N
0≤n≤3
m=0
Therefore:
[ ]
3
yc [0] = ∑ g[m]h − m N
0≤n≤3
m=0
2 2 2 2 1 2 2 2 2
1 1 1 1 1 1 1
0 1 2 3 0 1 2 3 0 1 2 3 0 1 2 3
Ans: yC [N ] = {6,7,6,5}