Hacker News 👾
Назад к новостям
20
kouosi•22.11.26 06:52

Notes on the discrete Fourier transform (DFT)

Источник
Комментарии
4

slow_typist
22.11.26 08:01

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
22.11.26 07:30

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
22.11.26 08:30

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.