Re-indexing the DFT (n and k)
- We can investigate the various
implementations of the DFT by looking at ways to re-index values of n and k.
- Idea:
- Using properties of addition and
multiplication we can rewrite the equation. π π = Οπ=0
πβ1 π¦ π πβπ2πππ/π = Οπ=0 πβ1 π¦ π π π ππ
- Notice that the sum of n from 0 to N-1 can
take on any sequence as long as all the integer terms exist are included only once.
- Furthermore, these terms can include
multiples of N as WN
kn+mN = WN kn.
- For these cases, WN
kn is replace with:
WN
kn mod N