In applied mathematics, a DFT matrix is a square matrix as an expression of a discrete Fourier transform (DFT) as a transformation matrix, which can be applied to a signal through matrix multiplication. == Definition == An N-point DFT is expressed as the multiplication X = W x {\displaystyle X=Wx} , where x {\displaystyle x} is the original input signal, W {\displaystyle W} is the N-by-N square DFT matrix, and X {\displaystyle X} is the DFT of the signal.
In applied mathematics, a DFT matrix is a square matrix as an expression of a discrete Fourier transform (DFT) as a transformation matrix, which can be applied to a signal through matrix multiplication. == Definition == An N-point DFT is expressed as the multiplication X = W x {\displaystyle X=Wx} , where x {\displaystyle x} is the original input signal, W {\displaystyle W} is the N-by-N square DFT matrix, and X {\displaystyle X} is the DFT of the signal.
Source: Wikipedia "DFT matrix" · CC BY-SA 4.0
Share this article: X · Bluesky