This
experiment was based on developing a program to perform FFT and DFT of a N
point signal on CCS. DFT is one of the most powerful tools in digital
signal processing; it enables us to find the spectrum of a finite-duration
signal x(n). We observed that as the length of input signal increases frequency
spacing and error decreases and resolution increases. FFT is an algorithm
that samples a signal over a period of time and divides it into its frequency
components.FFT is a simpler and faster method. This is very useful when the
value of N is large.
On paper FFT is slower than DFT cz it has got a lot of steps!
ReplyDeleteFFT works really fast on a normal DSP.
ReplyDeleteZero padding improves the spectrum. It does not provide any additional information about the spectrum.
ReplyDeleteThe DFT is also used to efficiently solve partial differential equations, and to perform other operations such as convolutions or multiplying large integers.
ReplyDeleteAmount of information after DFT remains same if the signal is appended with zeros.
ReplyDelete