DSP - DFT Circular Convolutionece
DSP - DFT Circular Convolutionece
DSP - DFT Circular Convolutionece
Let us take two finite duration sequences x1n and x2n, having integer length as N. Their
DFTs are X1K and X2K respectively, which is shown below −
N −1
j2Πkn
n=0
N −1
j2Πkn
n=0
Now, we will try to find the DFT of another sequence x3n, which is given as X3K
N −1
j2Πkn
1
x3 (n) = ∑ X3 (K)e N
N
n=0
N −1
m=0
m = 0, 1, 2...N − 1
Let x1 (n) and x2 (n) be two given sequences. The steps followed for circular convolution
of x1 (n) and x2 (n) are
Take two concentric circles. Plot N samples of x1 (n) on the circumference of the
outer circle maintainingequaldistancesuccessivepoints in anti-clockwise
direction.
For plotting , plot N samples of
x2 (n) x2 (n)in clockwise direction on the inner
circle, starting sample placed at the same point as 0th sample of x (n)
1
Multiply corresponding samples on the two circles and add them to get output.
Rotate the inner circle anti-clockwise with one sample at a time.
Matrix method represents the two given sequence x1 (n) and x2 (n) in matrix form.
One of the given sequences is repeated via circular shift of one sample at a time to
form a N X N matrix.