Fast fourier transform algorithms and applications
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...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
Nanyang Technological University
2023
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/172128 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|