TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Understanding Fast Fourier Transforms

34 点作者 vha3大约 3 年前

1 comment

geoduck14大约 3 年前
Oh my gosh. That is a lot of math!<p>I have a BSEE, and my professor described Fourier Transforms (the regular kind) like this:<p>Imagine a recipe for making a cake.<p>1 cup of Flower<p>1 cup of Sugar<p>1 cup of Eggs<p>You combine them and you get a cake!<p>A Fourier Transform is like taking a sifter that sifts out <i>only</i> flour. You put your cake through it. How much flour do you get? 1 cup. Then you put your cake through the sugar sifter... 1 cup of sugar. Through the egg sifter... 1 cup of egg!<p>The ingredients are <i>orthogonal</i>: the flour doesn&#x27;t contain <i>any</i> sugar or egg... the egg doesn&#x27;t contain <i>any</i> flour or sugar.<p>The inputs are mapped 1-to-1 to an output. If you change any ingredients bu any amount (say 1.1 cup of flower) you get a <i>different</i> cake. And if you take the Fourier transform of <i>that</i> cake, you <i>always</i> get the original amount of ingredients- <i>always</i><p>The Fourier Transform does this same thing, but with numbers on a time line, and the &quot;ingredients&quot; are sine waves of different frequency.<p>Also, not just sine waves, also cosines to account for the imaginary dimension (which will only confuse you if this is your first introduction into Fourier transforms... so you can ignore it)
评论 #30397737 未加载