macintosh.world | Log In | Register

Today | News | Books | Recipes
Notes | QuickTake | Wiki | Browse
Maps | Reference | Reddit | YouTube
Chat | Games | About

Back to HN

Notes on the discrete Fourier transform (DFT)

by kouosi | 42 points | 5 comments | 2026-11-22 00:52:25 Central

Open Source Link | Read Source Here

Open on Hacker News

Comments

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.

  > uecker
The simplest way to show this is that the adjoint
(complex transpose) DFT matrix is the inverse, so U^H
U = I.(For DFT there are different scaling conventions
which may be taken into account.)

    > > slow_typist
Maybe not the simplest way but constructive proofs
are always nice.

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.