DSPP Practicals
DFT (Discrete Fourier Transform) is basically the sampled version of DTFT (Discrete Time Fourier Transform) signal.
Depending upon the maximum length of input signal mentioned in the code, an input sequence of length=4 was entered. However if 8-point sequence was entered with the last four values as zero, then the resolution and accuracy increases i.e. between every 2 values of 4-pt DFT output, a new value got added.
It was seen from the code that DFT requires a number of real and complex additions and multiplications. Hence processing of a signal using DFT takes longer time.
Depending upon the maximum length of input signal mentioned in the code, an input sequence of length=4 was entered. However if 8-point sequence was entered with the last four values as zero, then the resolution and accuracy increases i.e. between every 2 values of 4-pt DFT output, a new value got added.
It was seen from the code that DFT requires a number of real and complex additions and multiplications. Hence processing of a signal using DFT takes longer time.
Sampling in the frequency domain helps to analyse in a digital system
ReplyDeleteso dft is better to compute than dtft
ReplyDeleteSince op of dtft is continuous and dft results are discrete
Deleteyes, freq domain sampling is easy to analyse
ReplyDeleteDft is frequency sampling of dtft signal
DeleteDFT is slow
ReplyDelete