logoalt Hacker News

slow_typist • today at 8:01 AM • 1 reply • view on HN

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.


Replies

uecker • today at 8:25 AM

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.)

➕ show 1 reply