| ▲ | slow_typist 3 hours ago | |
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 3 hours ago | parent [-] | |
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.) | ||