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 Shift of a Sequence<br />
• Consider a length-N sequence defined for 01.<br />
Sample values are equal to zero for values of 0and .<br />
• For any arbitrary integer , the shifted sequence <br />
, is no longer defined for the range 0 1.<br />
• Thus, we need to define another type of “shift” that will always keep<br />
the shifted sequence in the range 0 1.<br />
• The desired shift, called the circular shift, is defined using a<br />
modulo operation:<br />
<br />
For 0(right circular shift), the above<br />
equation implies<br />
,for 1<br />
,for 0 <br />
Elec3100 Chapter 3<br />
19
Change language