The many properties of the DFT become really straightforward (very similar to the Fourier Series) once we have once concept down: Circular Shifts.
Summary: The module looks at circular shifting and how it is can be used as a tool to represent the shifting of a periodic sequence.
The many properties of the DFT become really straightforward (very similar to the Fourier Series) once we have once concept down: Circular Shifts.
We can picture periodic sequences as having discrete points on a circle as the domain
![]() |
Shifting by
![]() |
![]() |
To cyclic shift we follow these steps:
1) Write
![]() |
2) To cyclic shift by
![]() |
If
It's called circular shifting, since we're moving around the circle. The usual shifting is called "linear shifting" (shifting along a line).
![]() |
|
If
With the concept of the circular shifts well-established, we can now better understand the convenience afforded by the circular convolution as opposed to the redundant linear convolution, and better understand the convolution as applied to the DFT.