Notes on the discrete Fourier transform (DFT)
23 points by kouosi 3 hours ago | 4 comments
lefra 3 hours ago
I like that this takes care not to conflate the DFT (the computed value), with the FFT (a family of algorithm to compute it).
replybrcmthrowaway 2 hours ago
During college, this guy had some banger articles. Had completely forgotten about the blog.
replyNow 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.
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.
(For DFT there are different scaling conventions which may be taken into account.)