DFT is a transform method which produces periodic results. Here period is 'N'.
The spectrum of DFT signal is discrete and is defined in the range from 0 to 2(pi), where 0 is included but 2(pi) is excluded.
DFT method breaks the continuous signal into parts and takes the values only as particular intervals, therefore this method does not give exact results bt approximate results, hence the spectrum is also approximate.
The expansion of DFT signal in time domain gives compressed spectrum in frequency domain. And DFT method is computational slow method.
Crisp description. Very well explained.
ReplyDeleteDFT is obtained by sampling of DTFS
ReplyDeleteDFT is slower method than FFT.
ReplyDeleteDFT is slow
ReplyDeleteFFT algorithm has lesser computations than dft
ReplyDeleteFFT is useful for large data sequences
ReplyDeleteThe complex multiplications and additions for the DFT are N^2 and N(N-1) respectively.
ReplyDeleteBy appending more zeroes, the missing values in less point DFT are present in the DFT with more point.
ReplyDeleteDFT produces periodic results
ReplyDeleteDft is slow as compared to fft
ReplyDelete