news
16
A reader discussion highlights how the matrix formulation of the discrete Fourier transform makes it easy to prove invertibility, since the adjoint DFT matrix serves as its inverse up to scaling conventions. It also emphasizes keeping the DFT as a computed transform distinct from the FFT, which is a family of algorithms for computing it.
Comments
0Discuss on Hacker NewsOnly full members can comment
Log in to express your opinion.
No comments yet.