9 ms·
What Is the Fourier Transform?
- teleforce 1y ago>one man’s mathematical obsession gave way to a calculation that now underpins much of mathematics and physics Underpins much of mathematics, science and engineering
- anyfoo 1y agoThat is a very true comment. Electrical Engineering for example would be nothing without Laplace (which is more or less an even more general Fourier).
- deleted 1y ago[deleted]
- Koshkin 1y ago> The waves that oscillate more quickly — meaning they have more energy Isn't this essentially a quantum-mechanical concept?
- IAmBroom 1y ago? It's true for all waves in all media.
- schlauerfox 1y agoAll these comments and no Steinmetz mention. The original papers he wrote applying the transforms to electrical engineering work are so genius and simplifying for the craft, and he's such a nicer person for one of the founders of the field of EE. Also the origin of that old story about $10 for hitting the machine with a hammer $9990 knowing where to hit it, from what I can gather.
- IAmBroom 1y agoSteinmetz is an unsung hero of tech, except to well-educated EE's. Was he a dwarf or a hunchback? I seem to recall a physical setback.
- schlauerfox 1y agoThe story I heard was he had a genetic hunchback, and never married out of fear of passing it on. It never seemed to stop him, he seemed to live a good life surrounded by friends.
- trgn 1y agoCan somebody eli5, im an amateur. How does the transform know the frequencies of the output. Do you have to specify a number n, and then it decomposes it into n frequencies. Or do you give it a list of frequencies, and then it decomposes the coefficient or amplitude or something for each? I guess what i want to know, in the examples it always shows like 3 or 4 constituents frequencies as output, but why not hundreds or a million? Is that decided upfront /paramtetizable? The article isn't helpful, it just says something like "all possible frequencies".
- slickytail 1y agoIn a discrete Fourier transform, the number of frequencies you get out is the number of datapoints you have as input. This is because any frequencies higher than that are impossible to know (ie, they are above the sampling frequency). But in the continuous Fourier transform, the output you get is a continuous function that's defined on the entire real line.
- woopsn 1y agoIf you take N samples of a real signal you will get N/2+1 bins of information from the DFT, covering 0Hz out to about half the sampling rate. The bins do not actually measure a specific frequency, more like an average of the power around that frequency. As you take more and more samples, the bin spacing gets finer and the range of frequencies going into the average becomes tighter (kind of). By collecting enough samples (at an appropriate rate), you can get as precise a measurement as you need around particular frequencies. And by employing other tricks (signal processing). If you graph the magnitude of the DFT, signals that are a combination of power at just a few frequencies show just a few peaks, around the related bins. Eg a major chord would show 3 fundamental peaks corresponding to the 3 tones (then a bunch of harmonics) https://en.wikipedia.org/wiki/Fourier_transform#/media/File:CQT-piano-chord.png https://en.wikipedia.org/wiki/Fourier_transform#/media/File:... So you detect these peaks to find out what frequency components are present. (though peak detection itself is complicated)
- IAmBroom 1y agoI'll try. Suppose you blinde, and are on one side of a black picket fence. Let's say the fence uprights are 1" wide, and 1" apart. If you aim a light meter at the fence, it will sum up all the light of the visible slices of the background. (This meter reads its values out loud!) Suppose the background is all white - the meter sees white slices, and get a 50% reading (because the fence stripes are black). It's as high as you can get. Now move the picket fence half an inch to the left - still all white, still a 50% reading. Now you know the background is 100% white, no other colors. But if when you move it, black stripes are exposed, then the meter reads 0%, and you know that the background is 50/50 white and black, in stripes. Congratulations! You've just done a Fourier transform that can detect the difference between 0-frequency and a 1"-striped frequency pattern. In reality, you're going to continuously move that fence to the left, watching all the time, but this is simple. But instead, imagine you got readings of 40% and 10%. What kind of pattern is that? Gray stripes? White stripes that aren't as wide as the fence posts? You'll have to build another fence, with another spacing - say 1/2" fence posts 1/2" apart. Repeat.
- amai 1y agoSee also "The LCT generalizes the Fourier, fractional Fourier, Laplace, Gauss–Weierstrass, Bargmann and the Fresnel transforms as particular cases." https://en.wikipedia.org/wiki/Linear_canonical_transformation https://en.wikipedia.org/wiki/Linear_canonical_transformatio...
- N_Lens 1y agoI found the 3Blue1Brown explanation to be more intuitive to understand, but this article has more practical examples/details. Here's the 3Blue1Brown explanation: https://www.youtube.com/watch?v=spUNpyF58BY https://www.youtube.com/watch?v=spUNpyF58BY https://www.3blue1brown.com/lessons/fourier-transforms https://www.3blue1brown.com/lessons/fourier-transforms
- timonoko 1y agoBefore computer was ever invented we learned to make Fourier analysis of complex circuitry by hand. Huge matrixes and sliderules. It was most horrible torture, but bloody nazies of Helsinki Polytechnic insisted we must learn to do this without errors and also fast. When I first time used computer for this task around 1974 on clanky ASR-33, I felt totally abused and brain-raped.
- Salgat 1y agoAlways blew my mind that every signal can be recreated simply by adding different sine waves together.
- nomel 1y agoTaking the concept to a 2d path: https://www.myfourierepicycles.com https://www.myfourierepicycles.com And, with your own drawing: https://gofigure.impara.ai https://gofigure.impara.ai
- esafak 1y agoOnly if it is band-limited.
- ajross 1y agoNo, even functions with non-finite frequency representation. You just need a non-finite number of sines. Nyquist speaks only to a finite number of samples.
- CamperBob2 1y agoAnd of infinite duration, if you want to split hairs.
- femto 1y agoSame thing! :-) In the purest sense, finite bandwidth requires infinite duration and finite duration requires infinite duration. The real world is somewhere in between. It must involve quantum mechanics (in a way I don't really understand), as maximum bandwidth/minimum wavelength bump up against limits such as the Planck length and virtual particles in a vacuum.
- ndriscoll 1y agoThe Heisenberg uncertainty principle in quantum mechanics comes about precisely because position and momentum are a Fourier transform pair.
- adamnemecek 1y ago[flagged]
- ajkjk 1y agoThis kind of statement is too vague to be useful. I even know all the words in there and I still don't know what you mean.
- adamnemecek 1y agoAsk away.
- nickff 1y agoYour earlier post comes off as link-spam, as it uses general language to connect something tangentially related to what you're interested in to drive traffic to your website. This is not conducive to questions.
- adamnemecek 1y agoYou can still ask.
- nickff 1y agoI know and use wavelet, Fourier, and other transforms on a daily basis, but your post did not stimulate any interest in me. Also, your reply on the other thread does not strike me as particularly insightful (I'd argue that your 'frequency decomposition' interpretation is flat-out wrong).
- adamnemecek 1y agoAre you familiar with the partition function?
- ajkjk 1y ago
- esafak 1y agoSee also its windowed version, https://en.wikipedia.org/wiki/Short-time_Fourier_transform https://en.wikipedia.org/wiki/Short-time_Fourier_transform
- noncoml 1y ago3Blue1Brown made a video with great visualizations: https://www.youtube.com/watch?v=spUNpyF58BY https://www.youtube.com/watch?v=spUNpyF58BY
- mananaysiempre 1y agoI’ve dabbled in explaining the FT some, and I think there’s an important trait of that video that needs to be highlighted: it’s a superb demonstration of what the Fourier transform does, mechanically, but it does not at all try to explain why it works in the places we usually apply it or how (having, admittedly, a thoroughly anachronistic mathematical background) you could have invented it. To be extra clear: it’s a very good video and you should watch it if you don’t have a feel for the Fourier transform. I’m just trying to proactively instil a tiny bit of dissatisfaction with what you will know at the end of it, so that you will then go looking for more.
- unit149 1y ago[dead]
- laszlokorte 1y agoShameless plug: If you are interested in Fourier Transform and signal processing you might enjoy my somewhat artistic 3D visualisation of the fourier transform as well as the fractional fourier transform [1] (Fractional fourier transform on the top face of the cube) And for short time fourier transform showing how a filter kernel is shiftes across the signal. [2] [1]: https://static.laszlokorte.de/frft-cube/ https://static.laszlokorte.de/frft-cube/ [2]: https://static.laszlokorte.de/time-frequency/ https://static.laszlokorte.de/time-frequency/
- yshklarov 1y agoI love the visualization! Thanks for sharing. How do you compute the fractional FT? My guess is by interpolating the DFT matrix (via matrix logarithm & exponential) -- is that right, or do you use some other method?
- laszlokorte 1y agoI am glad you like it! Yes the simplest way to think of it is to exponentiate the dft matrix to an exponent between 0 and 1 (1 being the classic dft). But then the runtime complexity is O(n^2) (vector multiplied with precomputed matrix) or O(n^3) opposed to the O(n log n) of fast fourier transform. There are tricks to do a fast fractional fourier transform by multiplying and convolving with a chirp signal. My implementation is in rust [1] compiled to web assembly, but it is based on the matlab of [2] who gladly answered all my mails asking many questions despite already being retired. [1]: https://github.com/laszlokorte/svelte-rust-fft/tree/master/src https://github.com/laszlokorte/svelte-rust-fft/tree/master/s... [2]: https://nalag.cs.kuleuven.be/research/software/FRFT/ https://nalag.cs.kuleuven.be/research/software/FRFT/
- xphos 1y agoI made a cool rust fft tui a long time ago too https://github.com/lquinn2015/FFT-tui https://github.com/lquinn2015/FFT-tui
- 1y ago
- carabiner 1y agoWhat really gets me going though is quaternions...
- anyfoo 1y agoIf you like Fourier, you're going to love Laplace (or its discrete counterpart, the z transform). This took me down a very fascinating and intricate rabbit hole years ago, and is still one of my favorite hobbies. Application of Fourier, Laplace, and z transforms is (famously) useful in an incredibly wide variety of fields. I mostly use it for signal processing and analog electronics.
- another_twist 1y agoWhen I first learned Laplace transform in university, it was my goto for differential equations of any kind. I was even naive enough to believe well this is a solved problem now. Eventually found out this wasnt the case after studying PDEs. Its still my favourite transform. Immensely useful not to mention the whole method of moments in random variables is basically laplace transform. I don't like Fourier transform but for petty reasons. In the engineering exams, I messed up a Fourier Transform calculation and ended up just a few points short of a perfect score. Hate it ever since :)
- Sesse__ 1y agoYou know that if you have the Laplace transform, you can just insert s = iω and then you have the Fourier transform, right? :-P (Or jω, if you prefer that notation)
- another_twist 1y agoTell me about it. But I like my numbers real not imaginary !
- artyom 1y agoEssentially that's what electrical/electronics engineering is about.
- segfault99 1y agoWhen I did EE, didn't have access to any kind of computer algebra system. Have 'fond' memories of taking Laplace transform transfer functions and converting to z-transform form. Expand and then re-group and factor. Used a lot of pencil, eraser and line printer fanfold paper for doing the very basic but very tedious algebra. Youngsters today don't know how lucky.. (ties onion to belt, etc., etc.)
- pcfwik 1y agoTo add another suggestion for understanding the Fourier transform, personally the first explanation that ever clicked with me was the Aho/Hopcroft/Ullman algorithms textbook. Rather than talking about sine and cosine waves, they motivate the Fourier transform entirely in terms of polynomials. Imagine you want to multiply two polynomials (p(x) and q(x)). The key is to recognize that there are two ways to represent each polynomial: 1. "Coefficient form," as a set of coefficients [p_0, p_1, p_2, ..., p_d] where p(x) = p_0 + p_1x + p_2x^2 + ... + p_dx^d, OR 2. "Sample form," as a set of sampled points from each polynomial, like [(0, p(0)), (1, p(1)), (2, p(2)), ..., (d, p(d))] Now, naive multiplication of p(x) and q(x) in coefficient form takes O(d^2) scalar multiplications to get the coefficients of p(x)q(x). But if you have p(x) and q(x) in sample form, it's clear that the sample form of p(x)q(x) is just [(0, p(0)q(0)), (1, p(1)q(1)), ...], which requires only O(d) multiplications! As long as you have enough sample points relative to the degree, these two representations are equivalent (two points uniquely defines a line, three a quadratic, four a cubic, etc.). The (inverse) Fourier transform is just a function that witnesses this equivalence, i.e., maps from representation (1) to representation (2) (and vice-versa). If the sample points are chosen cleverly (not just 1/2/3/...) it actually becomes possible to compute the Fourier transform in O(d log d) time with a DP-style algorithm (the FFT). So, long story short, if you want to multiply p(x) and q(x), it's best to first convert them to "sample" form (O(d log d) time using the FFT), then multiply the sample forms pointwise to get the sample form of p(x)q(x) (O(d) time), and then finally convert them back to the "coefficient" form (O(d log d) using the inverse FFT).
- alberto_balsam 1y agoGreat explanation, thanks for sharing
- hbarka 1y agoIsn’t the Fourier series fundamentals generally a required course in undergraduate college EE field?
- sizzzzlerz 1y agoOf course. It's taught in both mathematics courses as well as engineering. The Fourier transform and it's digital domain cousin, the discrete Fourier transform play such a fundamental role across nearly every engineering discipline as well as physics and many other scientific areas, you cannot get through school without learning about them.
- dotnet00 1y agoYes, but how many software engineers remember any of that? Most aren't using it.
- Joel_Mckay 1y agoIndeed, because a Golomb ruler optimized DFT is performant... and thus actually useful. lol =3
- yshklarov 1y agoAs everyone in this thread is sharing links, I'm gonna pitch in, too. This lecture by Dennis Freeman from MIT 6.003 "Signals and Systems" gives an intuitive explanation of the connections between the four popular Fourier transforms (the Fourier transform, the discrete Fourier transform, the Fourier series, and the discrete-time Fourier transform): https://ocw.mit.edu/courses/6-003-signals-and-systems-fall-2011/resources/lecture-19-relations-among-fourier-representations/ https://ocw.mit.edu/courses/6-003-signals-and-systems-fall-2...
- mallowdram 1y agoExcellent! Thanks!
- RachelF 1y agoI wonder what happened to Wavelet transforms? The were very popular years ago, and now one never hears about them.
- yshklarov 1y agoReally, do you think they've somehow fallen out of favor? If so, that's a surprise to me. In any case, they are a bit more advanced, and out of scope for the undergraduate course I linked to.
- energy123 1y agoThe use-case is slightly different. Wavelets are suited for non-stationary signals, while Fourier Transform has no time localization so it's more for stationary signals. Although short-time Fourier transform exists, which can handle non-stationary signals under the assumption of local stationarity. Also, a property of wavelets is they're non-parametric, which limits their utility in knowledge discovery applications. For ML applications, my opinions is that they're somewhat superseded by deep learning methods that apply less restrictive inductive bias. As data grows, the restrictive prior assumptions of wavelets will hurt, sort of like how CNN is being abandoned for ViT, even though CNN can outperform in situations where data is scarce. So overall, they have a pretty small set of usecases where they're more suited than other alternative tools.
- alphazard 1y agoThere's a lot of great Fourier visualizations out there (3Blue1Brown has a series on it as well). A great intuition pump would be a game where the player has to recreate a waveform given to them, by toggling on/off switches for each fundamental frequency (and phase). Has anyone ever seen something like that?
- dsego 1y agoI created a small piece trying to build intuition, my approach was to think of it as probing with test signals, so instead of recreating a waveform, it's more poking at it with sines and seeing how well the test sine matches the target signal. https://dsego.github.io/demystifying-fourier/ https://dsego.github.io/demystifying-fourier/
- ecoled_ame 1y agoI didn’t have time to read the article, but it’s cool that the position operator and the momentum operator in quantum mechanics are fourier transforms of one another.
- deleted 1y ago[deleted]
- antimora 1y agoI think the best explanation and understanding I received about Fourier Transform was from studying linear algebra. The Fourier Transform equation essentially maps a signal from the time domain onto orthogonal complex sinusoidal basis functions through projection. And the article does not even mention this. =)
- ThrowawayR2 1y agoKind of a tangent but why are there so many articles and videos popularizing the Fourier transform and practically none for the Laplace transform? The first person to do a well done 3Blue1Brown style video that focuses on intuition and visualization would probably be an overnight sensation (well, among engineers at least).
- artyom 1y agoMy take on this is that Fourier is easier to understand, has more immediate and relatable practical applications, and can be explained to "common folk" with just-enough sophistication and some tangible analogies (like the wool picture from the article). Explaining Laplace to solve differential equations with analogies it's a bit more... complicated.
- esalman 1y agoReading the comments, it seems there are very few electrical engineers in hacker news.
- bee_rider 1y agoMaybe they are EE’s, who just happen to still find some joy in the stuff from their intro classes. Sometimes little things can still make us happy, after all.
- seam_carver 1y agoFourier transforms are useful in applications like avoiding moire when downscaling manga and reducing rainbow artifacts in color eink manga. All in kindle comic converter.
- blamestross 1y agoMy favorite algorithm (just for the name) is [Lomb-Scargle Periodogram](https://docs.astropy.org/en/latest/timeseries/lombscargle.html https://docs.astropy.org/en/latest/timeseries/lombscargle.ht...) which is a method for performing a Fourier transform on irregularly sampled data.
- astrange 1y ago> A compression algorithm can then remove high-frequency information, which corresponds to small details, without drastically changing how the image looks to the human eye. I slightly object to this. Removing small details = blurring the image, which is actually quite noticeable. For some reason everyone really wants to assume this is true, so for the longest time people would invent new codecs that were prone to this (in particular wavelet-based ones like JPEG-2000 and Dirac) and then nobody would use them because they were blurry. I think this is because it's easy to give up on actually looking at the results of your work and instead use a statistic like PSNR, which turns out to be easy to cheat.
- HarHarVeryFunny 1y agoWell, there are use cases for lossy compression as well as non-lossy, and nobody is saying they are the same. If you really need to heavily compress to reduce file size or transmission bandwidth then you'll likely need to use a lossy CODEC, so the question then becomes how can you minimize the reduction in perceived quality of whatever you are compressing (photos, video, audio), which comes down to how these various human sensory/perceptual systems work. For vision we are much more sensitive to large scale detail (corresponding to low frequency FFT components) than fine scale detail (corresponding to high frequency components), so given the goal of minimizing reduction in perceived quality this is an obvious place to start - throw away some of that fine detail (highest frequency FFT components), and it may not even be noticeable at all if you are throwing away detail at a higher level of resolution than we are able to perceive. It turns out that human vision is more sensitive to brightness than color (due to numbers of retinal rods vs cones, etc), so compression can also take advantage of that to minimize perceptual degradation, which is what JPEG does - first convert the image from RGB to YUV color space, where the Y component corresponds to brightness and the U,V components carry the color information, then more heavily compress the color information than brightness by separately applying FFT (actually DCT) to each of the Y,U,V components and throwing away more high frequency (fine detail) color information than brightness. But, yeah, there is no magic and lossy compression is certainly going to be increasingly noticeable the more heavily you compress.
- 1y ago
- chamomeal 1y agoSo weird, I was just reading this article yesterday. I did an undergrad in physics and really miss this stuff. Ended up getting nostalgic and watching 3 blue 1 brown videos while drinking tequila.
- idiotsecant 1y agoEveryone loves the fourier transform because it's easy to understand but everyone ignores the laplace transform, which is much more beautiful, imo, and quite related.
- wnoise 1y agoThey are quite related, but the Fourier transform seems far more beautiful and generalizable: you can do 2-d, 3-d, etc transforms, and they automatically respect the symmetries of the problems (e.g. rotating the coordinate system rotates the Fourier transform in a corresponding way; frequencies and wave-vectors have meanings). This fully extends to any "nice" abelian group satisfying minor technical conditions, where the mapping is to it's dual group. It even mostly extends to non-abelian groups (representation theory), though some nice properties are lost. The Laplace transform shines in having nicer convergence properties in some specific cases. While those are extremely valuable for control problems, it really is a much more specialized theory, not nearly as widely applicable. (You can come up with n-d versions. The obvious thing to do is copy the Fourier case and iteratively Laplace transform on each coordinate; the special role of one direction either directly in the unilateral case, or indirectly via growth properties in the bilateral case make it hard to argue that this can develop to something more unifying; the domain isn't preserved under rotation.)
- Terr_ 1y agoIANAMathematician, but I've tried to come up with a metaphor which I hope isn't too wrong: 1. You've start with a signal fluctuating going up and down, and it's on a strip of little LEDs labeled from -1 to +1. 2. You mount that strip to a motor, and spin it at a certain rate. After a while the afterimages make a blob-shape. 3. For each rotation rate, measure how much the shape appears off-center. In this way you can figure out how much the underlying signal does (or doesn't) harmonize with a given rotation hertz.
- dsego 1y agoSounds like a variation on the mechanical strobe tuner.
- svantana 1y agoAn interesting mechanical analogy! In this example, the "integration" is done by the eye and perhaps by the LEDs depending on their type. But it's more akin to the Gabor Transform than Fourier, as there is locality in time.
- fracus 1y agoLearning about the FT in engineering and how it can represent pretty much any repeating signal was mind blowing. It was the culmination of so much learning in mathematics that brought me to that wow moment.
- lutusp 1y agoSuch a shame. In an otherwise well-written article, the author mentions Cooley and Tukey's discovery of the FFT, but without mentioning that Gauss discovered it first, among others, each of whom approached the same idea from different directions. The Wikipedia FFT article (https://en.wikipedia.org/wiki/Fast_Fourier_transform https://en.wikipedia.org/wiki/Fast_Fourier_transform) credits Gauss with originating the FFT idea later expanded on by others, and correctly describes Cooley and Tukey's work as a "rediscovery."
- olq_plo 1y agoYes, bad article to omit that. It is such a cool fun fact. Gauss was unreal.
- acjohnson55 1y agoAs they say, everything in modern math is named for the 2nd person to discover it after Gauss.
- abetusk 1y agoI have a pet theory that the reason why the FT, and other transforms (generating functions, Mellin/Laplace/Legendre/Haar), are so useful is because many real world functions are sparse and lend themselves to compressed sensing. The FT, as are many other transforms, are 1-1, so, in theory, there's no information lost or gained. In many real world conditions, looking at a function in frequency space greatly reduces the problem. Why? Pet theory: because many functions that look complex are actually composed of simpler building in the transformed space. Take the sound wave of a fly and it looks horribly complex. Pump it through the FT and you find a main driver of the wings beating at a single frequency. Take the sum of two sine waves and it looks a mess. Take the FT and you see the signal neatly broken into two peaks. Etc. The use of the FT (or DCT or whatever) for JPEG, MP3 or the like, is basically exploiting this fact by noticing the signal response for human hearing and seeing it's not uniform, and so can be "compressed" by throwing away frequencies we don't care about. The "magic" of the FT, and other transforms, isn't so much that it transforms the signal into a set of orthogonal basis but that many signals we care about are actually formed from a small set of these signals, allowing the FT and cousins to notice and separate them out more easily.
- mitthrowaway2 1y agoAs mentioned by other commenters, a reason for the FT's dominance in particular is because sine, cosine, and complex exponentials are the eigenfunctions of the derivative operator. Since so many real-world systems are governed by differential equations, the Fourier Transform becomes a natural lens to analyze these systems. Sound waves are one (of many) examples. And there's another good reason why so many real-world signals are sparse (as you say) in the FT domain in particular: because so many real-world systems involve periodic motion (rotating motors, fly's wings as you noted, etc). When the system is periodic, the FT will compress the signals very effectively because every signal has to be harmonic of the fundamental frequency.
- abdullahkhalids 1y agoThe question is why "so many real-world systems are governed by differential equations" and "so many real-world systems involve periodic motion". Well, stable systems are can either be stationary or oscillatory. If the world didn't contain so many stable systems, or equivalently if the laws of physics didn't allow so, then likely life would not have existed. All life is complex chemical structures, and they require stability to function. Ergo, by this anthropic argument there must be many oscillatory systems.
- _kb 1y agoFor those interested in an extension from this article, https://howthefouriertransformworks.com/ https://howthefouriertransformworks.com/ has a beautifully kitsch set of videos on the topic. They do a really good job at breaking down the fundamental knowledge needed to build an understanding.
- tzury 1y agoThis is a great playlist by 3b1b about the subject: https://www.youtube.com/watch?v=spUNpyF58BY&list=PL4VT47y1w7A1-T_VIcufa7mCM3XrSA5DD https://www.youtube.com/watch?v=spUNpyF58BY&list=PL4VT47y1w7...
- ptzz 1y agoFor lossy compression, turns out a sinusoidal (typically DCT) composition maximizes energy compaction and compress ability. A proof that this is true for AR-processes was a key realization for me. That you get a nice and intuitive domain to work with (modify frequencies) is a nice bonus on top :)
- lovelearning 1y agoApplying FT to images is a great way to see the world very differently, as if through an alien's eyes (or Geordi's visor from ST TNG!). A kind of stimulated out-of-the-box thinking. Dense features like fur or hair manifest as high-frequency components and eventually you start to develop an intuition for their patterns in the magnitude / power spectrums.
- photochemsyn 1y agoFourier's fundamental discovery was that the most natural building blocks for periodic functions are complex exponentials. These in turn were based on Euler's identity, linking complex exponentials to sines and cosines, and which is algebraic (easy to differentiate, integrate, manipulate) and also encodes rotations and waves. So, a good reason to study complex analysis and include it in the engineering maths program. This setup then allowed Fourier to take the limit of the Fourier series using a complex exponential expression. But keep in mind, this is all in the context of 19th century determinisitic thinking(see Fourier's analysis of the heat equation 1807, and Maxwell's treatise on 'Theory of Heat' c. 1870s), and it ran into real-world limits in the late 19th century, first with Poincare and later with sensitive dependence on initial conditions. . Poincare showed that just because you have a deterministic system, you don't automatically get predictability. Regardless this Fourier transform mathematical approach worked well in astronomy (at least at solar-system scale) because the underlying system really was at least quasiperiodic - essentially this led to prediction of new planets like Neptune. But what if you apply Fourier transform analytics to data that is essentially chaotic? This applies to certain aspect of climate science too, eg, efforts to predict the next big El Nino based on the historical record - since the underlying system is significantly chaotic, not strictly harmonic, prediction is poor (tides in contrast are predictable as they are mostly harmonic). How to treat such systems is an ongoing question, but Fourier transforms aren't abandoned, more like modified. Also, the time-energy quantum mechanics relation is interesting though not really a pure QM uncertainty principle, more like a classical example of a Fourier bandwidth relation, squeeze it on one axis and it spreads out on the other - a nice quote on this is "nothing that lives only for a while can be monochromatic in energy." Which sort of leads on to virtual particles and quantum tunneling. (which places a size limit of about 1 nm on chip circuitry). The bottom line is that if you're applying elegant and complex mathematical treatments to real-world physical problems, don't forget that nature doesn't necessarily follow in the footsteps of your mathemetical model.
- niemandhier 1y agoThe Fouriertransform is a change of bases in infinite dimensional space. That sounds complicated but if you look at the integral the exponential kernel is essentially a continuous “matrix” and the function you are integrating over that kernel is a continuous vector. This observation on can be a guide to better understand infinite dimensional Hilbert spaces ( inner product space + stuff) and is one of the core observations in quantum mechanics where it’s part of the particle-wave concept as it transforms location space -> momentum space.
- seanhunter 1y agoOne thing I find fascinating about Fourier analysis is the way the trigonometric Fourier series played such a central role in “breaking mathematics”[1] and the crisis that led to providing a rigorous basis for limits and continuity and all the other stuff that is now called real and complex analysis. Cauchy had just proved that the limit of the sum of an infinite set of continuous functions was itself continous, and then along came Fourier with “are you sure about that bro?” and showed that you could take the infinite sum of very clearly continuous functions (just sine and cosine) and approximate something like a sawtooth function (which was very obviously discontinous) as closely as you like. [1] by which I mean making obvious the fact that they had been proceeding for 100+ years using calculus without a rigorous basis.
- cycomanic 1y agoWhile we are talking about fun facts of the Fourier transform, the transfer function of the DFT is a sinc. That's how OFDM works, it performs an FFT on parallel input symbol streams. If you look at the spectrum of your signal it's sinc (approximately because they are truncated) channels spaced at 1/symbol rate which don't exhibit (theoretically if they weren't truncated) any interchannel interference.
- drmpeg 1y agoIt's going from the frequency domain (parallel symbol streams) to the time domain (multi-carrier RF), so it's using the inverse FFT.
- jtfrench 1y agoOne of my favorites.
- deleted 1y ago[deleted]
- kragen 1y agoThis is maybe a good first thing to read if you've never heard of the Fourier Transform before, but it makes it sound a great deal more arbitrary and random than it actually is. It might set your understanding back by giving you the illusion that you understand things you don't actually understand, and that would be a shame, because some of those things are more beautiful than a sunrise or a hummingbird. It would be very sad to lose those treasures by passing them by because you thought you already had them. As the song says: > When you're young, you're always looking > On the far side of the hill; > You might miss the fairest flower > Standing by your side very still. And the flowers of Fourier analysis are as fair as the fairest flowers in this universe, or any universe. https://news.ycombinator.com/item?id=45134843 https://news.ycombinator.com/item?id=45134843 may be a clue to the hidden beauty, for those who are puzzled as to what I might be talking about.
- nerdsniper 1y agoAs usual, 3 Blue 1 Brown delivers: https://youtu.be/spUNpyF58BY?si=nSqHf_3zbhyu9YGd https://youtu.be/spUNpyF58BY?si=nSqHf_3zbhyu9YGd
- BrandoElFollito 1y ago3b1b is the xkcd of maths
- kragen 1y agoThis is a much better introduction than the article, and it's only 20 minutes.
- zkmon 1y agoThe most shocking thing for me was the realization that frequency and wavelength are kind of dual forms. Ofcourse, every concept and thing that comes into existence does so only in the context of it's opposite or dual form. But recognizing that form is genius. 3b1b video goes a bit deeper. Also a related fact is that the rate of change of a sine wave is itself shifted by pi/2, while the exponential curves need no shifting. I'm not a professional in these matters, but I guess there is a deeper connection between the rate of change and the static world.
- stackbutterflow 1y ago> Fourier argued that the distribution of heat through the rod could be written as a sum of simple waves. How do you even begin to think of such things? Some people are wired differently.
- AIPedant 1y agoIt didn't come completely out of nowhere, Euler and Bernoulli had looked at trigonometric series for studying the elastic motion of a deformed beam or rod. In that case, physical intuition about adding together sine waves is much more obvious. https://en.wikipedia.org/wiki/Euler%E2%80%93Bernoulli_beam_theory https://en.wikipedia.org/wiki/Euler%E2%80%93Bernoulli_beam_t... Other mathematicians before Fourier had used trigonometric series to study waves, and physicists already understood harmonic superposition on eg a vibrating string. I don't have the source but I believe Gauss even noted that trigonometric series were a solution to the heat equation. Fourier's contribution was discovering that almost any function, including the general solution to the heat equation, could be modelled this way, and he provided machinery that let mathematicians apply the idea to an enormous range of problems.
- ndriscoll 1y agoI don't know/remember the historical derivation, but the story you might get in a class goes something like: Energy can't be created or destroyed, so it follows a continuity equation: du/dt + dq/dx = 0. Roughly, the only way for energy to change in time is by coming from somewhere in space. There are no magic sources/sinks (a source or sink would be a nonzero term on the right). Then you have Fourier's law/Newton's law of cooling: heat flows proportional to temperature difference, from high to low: q = -du/dx. Combining these, you get the heat equation: du/dt = d^2 u/dx^2. Now if you're very fancy, you can find deeper reasons for this, but otherwise if you're in engineering analysis class, just guess that u(t,x)=T(t)X(x). i.e. it cleanly factors along time/space. But then T'(t)X(x)=X''(x)T(t), so T'(t)/T(t) = X''(x)/X(x). But the left and right are functions of different independent variables, so they must be constant. So you get X''= λX for some lambda. But then from calc1, X is sin/cos. Likewise T' = λ T so T is e^-λt from calc 1. Then since it's a linear differential equation, the most general solution (assuming it splits the way we guessed) is a weighted sum of any allowable T(t)X(x), so you get a sum of exponentially decaying (in time) waves (in space).
- prameshbajra 1y agoI love the content here but the website hijacks my default mouse highlight and it does not allow me to right click and save highlights which is mildly annoying. Only me?
- meindnoch 1y agoA change of basis.
- oh_fiddlesticks 1y agoThis video [1] from a visual effects channel (Captain Disillusion) has an excellent visual illustration of how the Fourier tranform works and how its used in visual effects in his video about blurring and unblurring ("ENHANCE!") images. 1. https://youtu.be/xDLxFGXuPEc?feature=shared https://youtu.be/xDLxFGXuPEc?feature=shared
- alkyon 1y agoI found this video from 3Blue1Brown more informative in terms of mathematics involved: https://youtu.be/spUNpyF58BY?feature=shared https://youtu.be/spUNpyF58BY?feature=shared Edit: In fact it was already mentioned in the comments, but I haven't noticed
- hybrid_study 1y agoThe Carl Sagan bit is also an amusing tribute.
- lock1 1y agoWhile I like CD's works, I would say "CD / Blur" is the least informational of all the CD slash series. I guess it's a fun and more accessible option, but it certainly lacks depth compared to something like 3B1B's video on FT.
- gus_massa 1y agoI like his videos and most of this particular video. For example, I agree with his choice to not discuss the nasty details of the FFT. Also, I think the "blur" part is fine, but the "unblur" part is too oversimplified. I think he could have explained how the Gaussian filter almost kills all details / high frequency features, then rounding completely destroy them and then they can not be magically reconstructed to "unblur". He gives some hints about this, but they are to few and too general. PS: There are some non lineal ticks "enhance" the "unblur" version , like minimizing the L1 norm of the gradient (or something like that). It helps with some images. I'm not sure which is the current state of the art.
- stared 1y agoSpeaking of the Fourier transform, I recommend these visual explorable explanations: https://injuly.in/blog/fourier-series/index.html https://injuly.in/blog/fourier-series/index.html and https://www.jezzamon.com/fourier/ https://www.jezzamon.com/fourier/
- dghughes 1y agoBill Hammack The Engineer Guy has a video series on this subject. https://www.youtube.com/watch?v=6dW6VYXp9HM https://www.youtube.com/watch?v=6dW6VYXp9HM
- SillyUsername 1y agoAmazing. Until I read this article I didn't properly understand Fourier transforms (I didn't know how image compression bitmaps were derived), now it's opened a whole new world - toying with my own compression and anything that can be continuous represented as it's constituent parts. I can use it for colour quantisation too possibly to determine main and averaged RGB constituents with respect to hue, allowing colour reduction akin to dithering, spreading the error over the wave instead and removing the less frequent elements. It may not work but it'll be fun trying and learning!
- eric-burel 1y agoWhat always bothered me when trying to "feel" Fourier transforms is that to compute the oscillations, you need to wait some time. Mathematically, the transformation includes computing integrals. So it's tricky to understand how you compute the Fourier decomposition for a stream. Illustrations always show the whole signal over time but in real life you get the signal progressively. I'd be eager to read more on this.
- yobbo 1y agoAs I remember intuitively, it's a convolution over a time window. The size of the time window limits the frequencies that can be detected.
- thyristan 1y agoFor a stream, you use a sliding window to compute the FFT. The size of the window of course limits the lowest frequency range that you can 'see', same for the highest frequency through the time quantization that digital data usually has. So there will be an upper and lower frequency limit, beyond those limits the results are meaningless. And the window of course creates a latency, which is sometimes relevant for realtime audio filtering by FFT.
- dsego 1y agoYou do it in short windows, so you get eg. 512 samples and then run a short FFT. Or you can do longer windows that overlap, so e.g. hop by 512 but take 1024, more samples gives you more accurate results.
- jeremyscanvic 1y agoThe keyword you're looking for is time-frequency analysis and the main associated tool is the short-time Fourier transform(s). This is the theory underlying spectrograms and all those niceties!
- acjohnson55 1y agoCheck out https://en.m.wikipedia.org/wiki/Short-time_Fourier_transform https://en.m.wikipedia.org/wiki/Short-time_Fourier_transform This is the "Fourier transform" that is most often used, in practice in computing. A longer window length gives lower frequency resolution, but longer latency.
- chrisweekly 1y agoAs usual, BetterExplained.com has it covered: https://betterexplained.com/articles/an-interactive-guide-to-the-fourier-transform/ https://betterexplained.com/articles/an-interactive-guide-to...
- snake42 1y agoI was going to post this link as well. That site has really helped me understand many things.
- TacticalCoder 1y ago[dead]