The DFT is just sampling the DTFT at equally spaced frequencies
Notes on the discrete Fourier transform (DFT)

Eli Bendersky explains the Discrete Fourier Transform by treating a finite signal as one period of a periodic sequence, then showing that the DFT coefficients are exactly equally spaced samples of the DTFT. He derives the Fourier matrix from complex roots of unity, proves the inverse via conjugate transpose, and provides Python code for direct computation, matrix multiplication, and NumPy's FFT. A worked triangular-wave example demonstrates perfect reconstruction, and spectral leakage from truncated cycles is discussed.
In mathematics, it’s always a good sign when we obtain the same result using different methods!
- slow_typist
The matrix approach for calculating the DFT also gives us a nice way to proof that the DFT can always be inverted. We just need to show that matrix F is always (for any positive integer N) invertible.
That can be proved in a number of ways. E.g. showing that det(F)!=0 or showing linear independence of the columns of F is sufficient.
- lefra
I like that this takes care not to conflate the DFT (the computed value), with the FFT (a family of algorithm to compute it).
- brcmthrowaway
During college, this guy had some banger articles. Had completely forgotten about the blog.
Now I check it and the burning question.. is it full of AI slop/psychosis (i.e. similar to the https://nullprogram.com guy..) Seems to have escaped the scourge.
Likely made enough $ at GOOG to retire.