This was the second experiment done by us in dspp practical session. This experiment required us to take x(n) and calculate its Fourier Transform. This experiment included two cases. First case was done using N=4 and second case was with N=8. The second case was done by adding zeroes to the x(n) with N=4.Also IDFT was calculated from the X[k] obtained in the first part of the experiment.
As N is increased
1. The frequency spacing reduced
2.The resolution of the the spectrum increased.
http://preranasarode1995.blogspot.com/2016/04/dft-idft.html
Very clear and concise explanation!
ReplyDeleteHowever the processing of the signal is slower as the inputs have to be in sequential order and parallel processing is not possible in case of DFT.
ReplyDeleteThe error reduces by appending the input sequence by zeroes.
ReplyDeleteno of complex multiplications required in DFT is N^2
ReplyDelete