Fourier Transforms by Looking at it

  • Thread starter Mindscrape
  • Start date
  • Tags
    Fourier
In summary, some people have found that convolution is a helpful tool for approximating the Fourier transform of functions, such as using the convolution of two square waves to create a triangle wave. While some may view this as a skill or trick, it may simply be a result of experience and practice. Other useful tricks include recognizing patterns and using multiple copies of a shape to simplify the calculations.
  • #1
Mindscrape
1,861
1
Some people are able to do Fourier transforms without doing a single integral (i.e. just looking at a function). After thinking about it for a while I discovered that convolution is really helpful. For example, because two square waves are convolved to make a triangle wave, then the Fourier transform will be the Fourier transform of the square multiplied by the Fourier transform of the square. I am sure there are other methods though, does anybody know of anything better or any good tutorials of approximating the Fourier transform of functions?
 
Mathematics news on Phys.org
  • #2
i've heard of a former prof at my old university who could do stuff like that. people always seemed to just think he was some sort of calculating freak because when talking to someone calculating a Fourier transform never seemed to slow him down. if there's a trick to it i think it would be cool to know.
 
  • #3
It may just be experience. Like the way most of us can do integrals, without having to go through pen/paper or even acknowledge intermediary steps.
 
  • #4
How many Fourier transforms have you done in your lifetime? A couple dozen? How many Fourier transforms do you think he has done in his lifetime? :smile:

In some sense, it's like ordinary arithmetic. If you don't even know your addition tables, it's hard to add things. When you learn your addition tables, you can add things a lot faster, and sometimes in your head. And if you do lots of addition (but not mindlessly), or go looking for them, you can pick up tricks that can let you add faster.
 
  • #5
hmm working at it... that's a good trick :wink: :-p
 
  • #6
That reminds me of a Simpsons episode.

Bart Simpson was once compelled to find a way to distract himself from a disturbing scene, and the only option was to repeatedly read off the names of the planets off of a nearby poster.

He later got an A on an astronomy test. He remarked that the answers were stuck in his brain; it was a whole new kind of cheating!
 
  • #7
Another useful trick is when you have more than one copy of a single shape. For example, consider two gaussians side by side. You can obtain this shape by convolving a single gaussian with two delta functions centered at, say, -T and +T. The Fourier transform of these is just eiwT+e-iwT=2cos(wT), and so the transform of two gaussians is just the transform of a single gaussian modulated by a cosine function. This readily generalizes to more than two copies of the shape (and you can even take the infinite limit to recover the transform of a periodic signal), or copies with different amplitudes.
 

FAQ: Fourier Transforms by Looking at it

1. What is a Fourier transform?

A Fourier transform is a mathematical tool used to decompose a signal into its individual frequency components. It converts a signal from its original domain (e.g. time or space) to a representation in the frequency domain.

2. How does one go about performing a Fourier transform?

To perform a Fourier transform, one first needs to have a signal in a discrete form, such as a digital signal. Then, the signal is multiplied by a complex exponential function at different frequencies, and the resulting values are summed to create a spectrum of frequency components.

3. What can Fourier transforms be used for?

Fourier transforms have a wide range of applications, including signal processing, image analysis, and data compression. They are also commonly used in physics, engineering, and other scientific fields to analyze and understand complex signals and systems.

4. Are there different types of Fourier transforms?

Yes, there are different types of Fourier transforms, including the discrete Fourier transform (DFT), fast Fourier transform (FFT), and inverse Fourier transform. Each type has its own specific use and properties, but they all involve converting a signal between the time/space domain and the frequency domain.

5. How does understanding Fourier transforms benefit scientific research?

Understanding Fourier transforms allows scientists to analyze and interpret complex signals in a more meaningful way. It can help identify patterns and relationships within data, as well as provide insight into the underlying physics or behavior of a system. This knowledge can then be applied to various research areas, such as signal processing, image analysis, and data analysis.

Similar threads

Replies
5
Views
957
Replies
1
Views
1K
Replies
17
Views
2K
Replies
5
Views
2K
Replies
2
Views
1K
Replies
5
Views
3K
Back
Top