Discrete Fourier Transform (DFT) is frequency sampled version of Discrete Time fourier transform(DTFT). DFT gives periodic results.
In this experiment,we performed 4-point and 8-point DFT. First we performed 4pt DFT. Later we appended the 4pt signal with 4 zeros and performed 8-point DFT. We also added zeros at even places of 4pt signal and performed 8pt DFT. We plotted the approximate magnitude spectrum of all the DFT signals.
We observed that expansion of signal in time domain gives compressed signal in frequency domain.
We also calculated the no.of computations required to get DFT of a signal and concluded that DFT is computationally slow.
In this experiment,we performed 4-point and 8-point DFT. First we performed 4pt DFT. Later we appended the 4pt signal with 4 zeros and performed 8-point DFT. We also added zeros at even places of 4pt signal and performed 8pt DFT. We plotted the approximate magnitude spectrum of all the DFT signals.
We observed that expansion of signal in time domain gives compressed signal in frequency domain.
We also calculated the no.of computations required to get DFT of a signal and concluded that DFT is computationally slow.
DFT is a discrete version of DTFT which is continuous
ReplyDeleteDFT is obtained by sampling DTFT
DeleteDFT is slower method than FFT.
ReplyDeleteDFT has widespread applications in SpectralAnalysis of systems, LTI systems, Calculating convolution of signals,multiplication of large polynomials, noise removal etc
ReplyDeleteHowever,DFT requires more no. of calculations.as a result results are obtains after long time
DeleteDFT produces periodic results
ReplyDeletefor DFT input is considered to be periodic
DeleteIt always assumes input to be periodic
ReplyDelete