Experiment 3
For
finding DFT for large signal we use FFT which divides N point signal
into two equal parts with each part consists of alternate values.
On comparing the arithmetic computing properties for complex addition, Complex multiplication, real addition and real multiplication of FFT with DFT, we observed that number of calculations were less for FFT, thus making FFT much faster than DFT. The reason for fast computation in FFT is parallel processing.
On comparing the arithmetic computing properties for complex addition, Complex multiplication, real addition and real multiplication of FFT with DFT, we observed that number of calculations were less for FFT, thus making FFT much faster than DFT. The reason for fast computation in FFT is parallel processing.
FFT is faster
ReplyDeleteFFT is used in filtering algorithms
ReplyDeleteFFT uses parallel processing
ReplyDeleteIt is also used in MPEG coding techniques.
ReplyDeleteFFT has less no. Of computations than dft
ReplyDeleteRadix is the size of FFT decompositions
ReplyDeleteRadix 2 fft is computationally fastest algorithm
ReplyDelete