Discrete Fourier Transform(DFT) is used to transform time domain signals into frequency domain signals with the help of sampling. DFT is frequency sampling of Discrete time fourier transfrom (DTFT).In this experiment 4 point and 8 point appended sequence DFT was calculated. DFT results are periodic with length equal to the input signal.
Magnitude spectrum for the same was plotted.We observed that if signal is expanded,the spectrum is compressed and its more accurate compared to 4 point. DFT is computationally slow because large number of multiplications and additions.
Magnitude spectrum for the same was plotted.We observed that if signal is expanded,the spectrum is compressed and its more accurate compared to 4 point. DFT is computationally slow because large number of multiplications and additions.
This comment has been removed by the author.
ReplyDeleteDFT gives discrete spectrum. DFT assumes signal is periodic hence it gives Discrete spectrum
ReplyDeleteDFT is computationally slower
ReplyDeleteFFT is faster than DFT
ReplyDeleteDFT produces periodic results
ReplyDeleteOutput of DFT is periodic because of twiddle factor.
ReplyDeleteDFT is the discrete version of DTFT
ReplyDeleteWell explained
ReplyDeleteDFT is slower than FFT
ReplyDeleteDFT is obtained by sampling of DTFT
ReplyDelete