11: Discrete Fourier Transforms
( \newcommand{\kernel}{\mathrm{null}\,}\)
The Discrete Fourier Transform (DFT) is a discretized version of the Fourier transform, which is widely used in numerical simulation and analysis. Given a set of N numbers {f0,f1,…,fN−1}, the DFT produces another set of N numbers N numbers {F0,F1,…,FN−1}, defined as follows:
DFT{f0,f1,…,fN−1}={F0,F1,…,FN−1}whereFn=N−1∑m=0e−2πimnNfm.
The inverse of this transformation is the Inverse Discrete Fourier Transform (IDFT):
IDFT{F0,F1,…,FN−1}={f0,f1,…,fN−1}wherefm=1NN−1∑n=0e2πimnNFn.
The inverse relationship between the DFT and the IDFT is straightforward to prove, by using the identity
N−1∑m=0e±2πim(n−n′)N=Nδnn′,
where δnn′ denotes the Kronecker delta. This identity is derived from the geometric series formula.