In the second lab we studied Discrete Fourier Transform(DFT) and its practical implementation. Three different cases were taken into consideration. In the first case DFT of four point signal is studied then in the second case DFT of zero padded signal is studied and in the last case DFT of expanded spectrum is studied and the magnitude of all the three is plotted. Thus we conclude that DFT produces periodic results. The spectrum is discrete and is in the range of [0,2π). As the length of signal increases due to zero padding the frequency spacing and approximation error decreases also the resolution of spectrum increases.
DFT is computationally slow as compared to FFT
ReplyDeleteIt is the discrete version of DTFT
ReplyDeleteDFT has widespread applications in SpectralAnalysis of systems, LTI systems, Calculating convolution of signals,multiplication of large polynomials, noise removal etc
ReplyDeleteDFT is a discrete version of DTFT which is continuous
ReplyDelete