DFT (Discrete Fourier Transform) is carried out to overcome the limitation of Fourier series as well as DTFT.
The programming language used in this experiment was C. For DFT(Discrete Fourier Transform) experiment we had considered 2 cases. The first case included calculations of 4 point DFT of given input signal. The second case had calculation of 8 point DFT of the same input signal x[n]. Magnitude spectrum was plotted for both the cases. The magnitude spectrum of 8 point signal has more resolution as compared to that of 4 point signal. We also performed the inverse Discrete Fourier transform of the same signal.
The programming language used in this experiment was C. For DFT(Discrete Fourier Transform) experiment we had considered 2 cases. The first case included calculations of 4 point DFT of given input signal. The second case had calculation of 8 point DFT of the same input signal x[n]. Magnitude spectrum was plotted for both the cases. The magnitude spectrum of 8 point signal has more resolution as compared to that of 4 point signal. We also performed the inverse Discrete Fourier transform of the same signal.
Why does DFT gives discrete spectrum?
ReplyDeleteDFT gives discrete spectrum because it assumes the input is periodic
DeleteDFT assumes input signal to be periodic and hence gives discrete spectrum
ReplyDeleteYes however DTFT produces continuous spectrum
DeleteDFT produces periodic results
ReplyDeleteYes
DeleteThe twiddle factors all lie on a unit circle; so the more the samples, the more that circle becomes complete, and hence the resolution gets better. The resolution increases because of more twiddle factors taken
ReplyDeleteYes thanks for the information
DeleteDft is slow as compared to fft
ReplyDeleteDFT assumes input signal to be periodic and hence gives discrete spectrum
ReplyDeleteYes. DFT is basically frequency sampling of DTFT
Delete