FFT is a proven faster method as compared to the DFT algorithm. Some of the similar complexities re-appeared in this code too (example - integration of complex numbers). 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. Though a generic N-point FFT code, still remains an ambitious task.
Wednesday, 24 April 2019
FFT
FFT is a proven faster method as compared to the DFT algorithm. Some of the similar complexities re-appeared in this code too (example - integration of complex numbers). 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. Though a generic N-point FFT code, still remains an ambitious task.
Subscribe to:
Post Comments (Atom)
can you give all the applications of FFT?
ReplyDeletewhy is fft faster than other algorithms?
ReplyDeleteNice Read
ReplyDeleteIt was helpful
ReplyDelete