Howtosignalprocessing
What is n point circular convolution?
The circular convolution of two N-point periodic sequences x(n) and y(n) is the N-point sequence a(m) = x(n)* y(n), defined by. (1.80) Since a(m + N) = a(m), the sequence a(m) is periodic with period N. Therefore A(k) = DFT[a(m)] has period N and is determined by A(k) = X(k)Y(k).
How do you find circular convolution using DFT?
For two vectors, x and y , the circular convolution is equal to the inverse discrete Fourier transform (DFT) of the product of the vectors' DFTs. Knowing the conditions under which linear and circular convolution are equivalent allows you to use the DFT to efficiently compute linear convolutions.
