DSPP LAB 2
Our 2nd experiment was based on the Discrete Fourier Transform where we had to find the DFT of a 4pt and 8pt sequence using the formula method.
This was implemented in C language.Two functions were used which contained arg and trignometric expressions.
In the 4pt DFT ,the spectrum obtained was not that accurate as it was in 8pt sequence.The resolution was increased on appending 4 zeroes to the 4pt sequence to make it a 8pt sequence.
The spectrum obtained was Discrete in nature and was defined in the range of [0,2π).
In the end the formulae for total number of complex and real addition and multiplications were tested for verification.
This was implemented in C language.Two functions were used which contained arg and trignometric expressions.
In the 4pt DFT ,the spectrum obtained was not that accurate as it was in 8pt sequence.The resolution was increased on appending 4 zeroes to the 4pt sequence to make it a 8pt sequence.
The spectrum obtained was Discrete in nature and was defined in the range of [0,2π).
In the end the formulae for total number of complex and real addition and multiplications were tested for verification.
Easy to understand!
ReplyDeleteThanks
Deletewell written
ReplyDeleteThanks pooja.The code was very difficult.
DeleteFast Fourier Transform is more effective in a practical approach when code is executed and implemented
ReplyDeleteYes
DeleteDFT method is slower and involves more calculations as compared to FFT
ReplyDeleteYes it is verified using the formula.
DeleteDFT requires more computations and hence is slower.
ReplyDeleteDFT is frequency sampling of DTFT.
ReplyDeleteWell written.
ReplyDeleteDFT is slower than FFT
ReplyDelete