Fast fourier transform algorithms and applications

• المؤلف الرئيسي: Chin, Natalyn Shi Hui
• مؤلفون آخرون: Wu Guohua
• التنسيق: Final Year Project
• اللغة: English
• منشور في: Nanyang Technological University 2023
• الموضوعات: Science::Mathematics; Science::Physics
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/172128

The Discrete Fourier Transform (DFT) has many important applications such as in signal processing. However, direct computation of the DFT has a time complexity of O(N^2), where N is the number of sample points. In 1965, James Cooley and John Tukey introduced a fast algorithm to decrease the time com...