Experiment 2
Discrete Fourier Transform (DFT) is frequency sampling of Discrete Time Fourier Transform (DTFT).
DFT of 4 point sequence was calculated and then. we padded the 4-point signal with 4 zeroes and observed the change in magnitude spectrum from the 4-point signal. DFT results are periodic with period equal to length of the input signal.
If the input signal is expanded, its Magnitude Spectrum is compressed. The total number of multiplications and additions in DFT is higher and hence DFT is computationally slow.
DFT is slower than FFT
ReplyDeleteResults of DFT can be stored in memory.
ReplyDeleteDFT is sampling of DTFT spectrum.
ReplyDelete
ReplyDeleteDFT does discretization of frequency response so as to store it.
Dft has more number of computations
ReplyDeleteDFT has application in digital image processing
ReplyDelete