快速傅里叶变换（FFT）算法

快速傅里叶变换（FFT）算法是离散傅里叶变换（DFT）的一种高效、快速计算方法。它是根据离散傅里叶变换的奇偶、虚实等特性，对DFT算法进行改进获得的。FFT算法能够大大减少计算机计算DFT所需要的乘法次数，特别是当被变换的抽样点数N越多时，FFT算法的计算效率更为显著。<span class="em">1</span><span class="em">2</span><span class="em">3</span>
#### 引用[.reference_title]
- *1* [FFT快速傅里叶变换算法](https://blog.csdn.net/weixin_30432007/article/details/97579630)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT0_1"}}] [.reference_item style="max-width: 50%"]
- *2* *3* [十分简明易懂的FFT（快速傅里叶变换）](https://blog.csdn.net/enjoy_pascal/article/details/81478582)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v92^chatsearchT0_1"}}] [.reference_item style="max-width: 50%"]
[ .reference_list ]