4.DFT & FFT
In this experiment we came to know unlike the DFT, I could identify patterns in the butterfly diagram taught in the class. Formulating this pattern into a code format and making this code generic(for 4-point and 8-point) and efficient was the real highlight of this code.FFT is a proven faster method as compared to the DFT algorithm
In this experiment we came to know unlike the DFT, I could identify patterns in the butterfly diagram taught in the class. Formulating this pattern into a code format and making this code generic(for 4-point and 8-point) and efficient was the real highlight of this code.FFT is a proven faster method as compared to the DFT algorithm
Excited to learn
ReplyDeleteFast Fourier Transform is more effective in a practical approach when code is executed and implemented.
ReplyDeleteThe FFT algorithm divides the N-point DFT input signal into 2 parts-even and odd signal values of the input.
ReplyDelete