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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Intuitive explication of Fourier Transformation

280 点作者 ecaradec大约 14 年前

13 条评论

wnewman大约 14 年前
The author wrote "This formula, as anyone can see, makes no sense at all. I decided that Fourier must have been speaking to aliens, because if you gave me all the time and paper in the world, I would not have been able to come up with that." That sounds like a predictable symptom of trying to understand Fourier analysis while avoiding linear algebra. And that seems like unnecessary masochism, because basic linear algebra is very useful and pretty easy. And once you have it, (elementary) Fourier analysis becomes trivial to understand as a change of basis by recognizing the supposed "no sense at all" formula as a perfectly sensible change of basis to a basis of sinusoidal functions.<p>Then you just need to understand that the sines and cosines are a complete basis. So think about the sines and cosines for a while until you can say "yeah, they're orthogonal, and I can believe they're a complete basis for the kind of functions under consideration." Then to promote this from "I can believe" to "obviously," for the discrete FT (the orthogonality and) counting/dimensionality arguments suffice, and for the continuous FT you can look at Gaussians, say "obviously Gaussians are a complete basis for the kinds of functions under consideration" and then do the easy integrals to show that any Gaussian can be expressed as a linear combination of sines and cosines.<p>(This assumes you're interested in transforming reasonably smooth things like wavefunctions in chemistry, as opposed to trying to see how far you can push Fourier analysis into the netherworld of bizarre jagged twisted functions shown to exist by invoking the Axiom of Choice. If you want to do that, feel free to take a course from Terence Tao studying theorems whose prerequisites involve concepts like "countable.")
评论 #2556141 未加载
评论 #2556178 未加载
评论 #2561250 未加载
评论 #2556372 未加载
评论 #2556740 未加载
mturmon大约 14 年前
The quickest "explanation" of the FT I ever heard was in a casual aside from a professor once -- he referred to the Fourier domain as the "reciprocal domain". It took me a while to work out what he meant.<p>It was just that frequency = 1 / time. In this (barbarically reductive) conception, taking the FT is just a change of variable.<p>This relationship is one way to "derive" many of the standard Fourier facts.<p>For example, the scaling property, that if x(t) has transform X(f), then x(at) has transform (1/a) * X(f/a). It also "explains" why time signals concentrated around t=0 tend to have lots of high-frequency content (f = 1/t = 1/0 = infinity), and vice versa.<p>It also "explains" why the inverse FT formula looks just like the forward FT formula (since if f = 1/t, then t = 1/f). And, for the same reason, most of the duality relationships between the two domains.<p>All with just arithmetic! You can dispense with linear algebra, not to mention complex arithmetic, groups, or measure theory.
评论 #2558324 未加载
评论 #2558292 未加载
评论 #2558325 未加载
demallien大约 14 年前
Maybe I'm naive, but I personally find it much simpler just to see how you can construct an arbitrary waveform using the summation of a series of sinusoids - and then a Fourier transform is just the inverse operation...
评论 #2555777 未加载
评论 #2555660 未加载
评论 #2555722 未加载
wbhart大约 14 年前
To really understand the discrete fourier transform properly you need to understand the mathematical concept of a group. Fortunately, you only need to understand one particular group G, namely the integers mod n. Once one thinks of the input to the Discrete Fourier Transform (DFT) as a function on G (i.e. the input to the function is an element of G and the output is a complex number), then it is possible to frame the DFT in terms of a map between functions on G to functions on the dual of G (using something called Pontryagin duality). The thing is, functions on the dual of G multiply pointwise whereas functions on G itself multiply like polynomials mod x^n - 1.<p>Therefore to multiply polynomials, one thinks of them as functions on G, uses the DFT to take you to functions on the dual of G, multiplies pointwise, then does an inverse transform to get you back to functions on G again. I'm skimming over lots of details and oversimplifying a bit, but what I just described is the process of using a convolution to multiply polynomials.<p>The really great thing is if n is a power of 2. Then you have this cool Cooley-Tukey algorithm called the Fast Fourier Transform to do the DFT (and IFFT) really fast (in time O(n log n) instead of O(n^2)). It works by recognising that computing an FFT is <i>precisely</i> the same thing as evaluating a polynomial at the n-th roots of unity. This can be done by repeatedly breaking the problem into halves and recognising that the same pattern of roots of unity occurs in the first half as in the second. By factoring that out, you can (recursively) save yourself half the work.<p>Again, oversimplified, but that's the nub of it.
tspiteri大约 14 年前
The article, and quite a few posts here, describe the way they understand the Fourier Transform as the way to understand the Fourier Transform. For it to be intuitive depends on who is trying to understand it. Getting that out of the way, this is how I find the Fourier Transform intuitive (using pseudo-code instead of math notation to make it a bit verbose and emphasize the steps):<p><pre><code> fourier_trasform(signal sig(t), frequency freq): let sinu(t) = sinusoid with frequency freq let mult(t) = sig(t) * sinu(t) value = integral of mult(t) from -infinity to infinity </code></pre> If the input signal sig(t) has the same frequency as the sinusoid sinu(t), then integrating mult(t) over infinity will give an infinitely large value, and that case is handled better by the Fourier Series.<p>If the input signal sig(t) has no relation to the frequency of the sinusoid, then integrating mult(t) over infinity will give zero.<p>If the signal has a component with the required frequency, it will kind of resonate with the sinusoid and give a non-zero value. The value then depends on the magnitude of the signal and to how much it "resonates" with the sinusoid.<p>When you do this for a range of different frequencies freq, but using the same signal sig(t), you can plot how much the signal sig(t) resonates with all frequencies, and that plot is the plot of the Fourier Transform.
评论 #2557038 未加载
drblast大约 14 年前
I think these concepts became clear to me when I learned about the complex plane, Euler's formula, and demodulation of an FM signal.<p>Particularly enlightening was the demodulation of a frequency modulated sine wave when the tuner was imperfectly matched to the carrier frequency. Looking at it on an oscilloscope was similar to watching an old TV with the Vertical Hold improperly set.<p>That made me start thinking in terms of a signal (sine wave) that was a cycle rather than a sinusoidal shape. Seeing that you can graph the amplitude and phase of any signal on the complex plane and that the frequency was the change in phase from one moment to the next was the aha! moment.<p>Then if you think about sampling and how if you sample a sinusoid exactly at its peaks how that would graph as a constant point on the complex plane, but if you sampled at any other mismatched frequently, the point would rotate and change amplitude with respect to either axis. The further away from the actual frequency you'd go the the points would look more random, and they'd average out to zero with fewer samples.<p>This would be a fun animation or java applet to make; I'm sure someone has done it.
hammock大约 14 年前
That was a great explanation, particularly the summary at the end with the color-coded words corresponding to terms in the formula.<p>I came to the comments expecting to see nods of approbation at how cool this explanation was (I stopped taking math at about Calc 3, so no linear algebra for me) but instead I see people geeking out saying things like "to really understand you need to grasp the complex plane, and groups and DPTs and so forth."<p>Well, just so you know, for me the OP's intutitive explanation was enough.
regularfry大约 14 年前
That's possibly the most intuitive explanation for what the maths is actually doing that I've ever come across.
codesink大约 14 年前
A great resource to read about Fourier transformation and Wavelets<p><a href="http://users.rowan.edu/~polikar/WAVELETS/WTpart1.html" rel="nofollow">http://users.rowan.edu/~polikar/WAVELETS/WTpart1.html</a>
szany大约 14 年前
I visualize it as projecting the function (as a vector) onto spirals of different twisting rates.<p>Only 3 dimensions required, which is nice.
评论 #2556100 未加载
guscost大约 14 年前
I like the explanation, but there's no reason to skip over the complex exponents and Euler's formula like that. They're not really that hard to understand intuitively: think of all multiplication as a continuous process. Then f = e^x is simply the function that <i>transforms</i> the multiplicative identity (1) into ln(x).<p>Substitute "-1" into the left side of that equation, and see that no real value of x will suffice. This is related to the fact that the imaginary constant (i) wasn't discovered, it was simply <i>declared</i> as an unknown quantity that squares to -1.<p>The real magical part is that i <i>still works</i> in more complicated situations: multiplying any real number by e^(ix) as x increases gradually <i>transforms</i> it into an imaginary number, and then into its own negative, behaving like <i>a counter-clockwise rotation</i> when visualized in the complex plane.
torstesu大约 14 年前
I love the idea that a man can sit down behind his desk, think for days, weeks, months, years or even decades and come up with something which is so abstract and beautiful explaining natural phenomenons with simple mathematical formulas.<p>It takes some serious entrepreneurial skills and mindset to embark on a problem which is seemingly impossible, and never giving up until the solution has been derived.<p>Inspirational, to say the least!
评论 #2555770 未加载
nothis大约 14 年前
I wish all maths books would have their formulas illustrated like this: <a href="http://altdevblogaday.org/wp-content/uploads/2011/05/DerivedDFT.png" rel="nofollow">http://altdevblogaday.org/wp-content/uploads/2011/05/Derived...</a><p>That is beautiful.
评论 #2557192 未加载