This practical really helped me understand DFT in a greater depth. It helped me connect the knowledge sir taught in the class, and aquire a greater understanding. In mathematics , the discrete Fourier transform ( DFT ) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. To understand DFT better, we've performed discrete Fourier transform of a 4 point sequence by coding it. What I learned in that experiment is: 1) Results by DFT are always periodic about the number of input values. 2)The spectrum is discrete from o to pi. 3)Upon zero-padding the input signal, the length of the input signal increased- which increases the frequency spacing. 4)As frequ...
Why is the overlapped portion discarded in Overlap save method?
ReplyDeleteSince we initially save extra bits. They are discarded in the last stage.
DeleteThis comment has been removed by the author.
ReplyDeleteHow do you implement these methods?
DeleteYou can create a system to implement these methods by using C programs
DeleteWhy FFT is performed in smaller parts of the data sequence?
ReplyDeleteHigh order FFT increases the complexity?
DeleteWhy does long data sequence need a very high order FFT ? Is there any alternative which is more efficient ?
ReplyDeleteOAM, OSM is used as an alternative.
DeleteVery high order FFT needed, hence these methods.
ReplyDeleteSuch a simple but elegant solution to deal with not being able to solve higher order FFT.
ReplyDelete