The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
7 人推荐 · 跨 8 个月 · 2021–2026
中文导读
Reducible 出品的快速傅里叶变换（FFT）可视化漫游。从多项式乘法问题出发，层层递进，展示只要提出正确的问题，就能自然推导出 FFT 的核心精髓。
为什么 HN 推它
被 HN 网友盛赞为「终于让我彻底开窍」的 FFT 神级讲解，不少算法工程师甚至每半年都会回看温习。
「它从多项式乘法推导出 FFT 算法，讲得太绝了，我差不多每半年就要回看一次。」HN 网友原话：It derives the FFT algorithm from polynomial multiplication and it’s fantastic . I rewatch it every 6 months or so.
英文原摘要（HackerTube / Claude 整理）
Reducible's visual walkthrough of the Fast Fourier Transform, motivated by polynomial multiplication. It shows how the FFT's key ideas can be discovered by asking the right questions.
HN repeatedly calls it a fantastic explanation that made FFT click, with some rewatching it periodically.
HN 上的提及
the video focuses specifically on the FFT algorithm, not on Fourier transforms in general.
I truly enjoy this guy’s videos
An excellent and very enjoyable video on the FFT applied to the polynomial multiplication is
That video did the same for me.