y=dft(x)
Inputs  
x 
A real or complex vector or matrix. 
Outputs  
y 
A (generally complex) vector of the same size as x which is the discrete Fourier transform of the input.

dft
of each column is computed separately.
Unless the size of x
is small, dft
is much slower than fft
.