Ch3.2 Discrete Fourier Transform
Ch3.2 Discrete Fourier Transform
Ch3.2 Discrete Fourier Transform
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Circular Convolution<br />
• To develop a convolution-like operation resulting in a length-N<br />
sequence , we need to define a circular time-reversal, and then<br />
apply a circular time-shift.<br />
• Resulting operation, called a circular convolution, is defined by<br />
∑<br />
,01<br />
<br />
• Since the operation defined involves two length-N sequences, it is<br />
often referred to as an N-point circular convolution, denoted as<br />
N .<br />
• The circular convolution is commutative,<br />
<br />
N<br />
N<br />
Elec3100 Chapter 3<br />
22
Change language