What Causes Repetition in Fourier Transforms of Audio and Visual Data?

In summary: The blue signal is the right channel and the white noise is the sum of the two channels.In summary, the conversation involves discussing the properties of repetitive Fourier transforms and their relationship to the original signal. The concept of inverse transforms and their similarity to the forward transforms is also mentioned. The discussion also delves into the conventions and necessary signs for the transforms. A visual representation is provided to illustrate the concepts.
  • #1
mertcan
344
6
I would like to express that when I am viewing the repetitive Fourier transform on Internet I encounter that for instance twice Fourier transform may lead the same value at the end of first Fourier transform. When does repetitive( twice or third... consecutively)fourier transform be same with the first Fourier transform? Or what kind of functions have this property when they are transformed according to fourier??
 
Physics news on Phys.org
  • #2
Fourier transform and inverse transform have almost identical kernels [tex]e^{itx} \ and\ e^{-itx}[/tex]. That might explain your concern.
 
  • Like
Likes mertcan
  • #3
mertcan said:
I would like to express that when I am viewing the repetitive Fourier transform on Internet I encounter that for instance twice Fourier transform may lead the same value at the end of first Fourier transform. When does repetitive( twice or third... consecutively)fourier transform be same with the first Fourier transform? Or what kind of functions have this property when they are transformed according to fourier??

@mathman is right. In detail:

If for any function ##f## from reals to complex numbers, we define ##F(f)## to be that function ##\tilde{f}## such that:

##\tilde{f}(y) = \frac{1}{\sqrt{2\pi}}\int f(x) e^{-iyx} dx##

Then ##F(F(f))## is that function ##f'## such that ##f'(x) = f(-x)##.

So a double transform returns you almost to where you started, except the mirror-image. ##F(F(F(F(f))))## will always be equal to ##f##. (Well, if ##f## is sufficiently smooth, anyway.)
 
  • Like
Likes mertcan
  • #4
The Fourier transform of a Gaussian gives a Gaussian. There may be other functions that have this property but I have never seen one. Are you looking for a proof of a functional form that is preserved under repeated Fourier transformation operations? Maybe a mathematician on this forum can point you to literature on the subject.

Peace
Fred
 
  • #5
A quick google search for self Fourier transforms gives a host of references...

There are multiple functions that have this property.
 
  • #6
Just it's inverse... sort of at least, the only difference between a forward transform and an inverse transform is the sign of the exponential and the initial data... So apply Euler's formula and have X[k] = x[n]*(cos(-2.0*k*n*pi/frame_size) + i*sin(-2.0*k*n*pi/frame_size)) or for the inverse, x[n] = X[k]*(cos(2.0*k*n*pi/frame_size) + i*sin(2.0*k*n*pi/frame_size)). Video sample here:



The example is slight more complicated because a z transform is used...

I'm taking things slow, because I would like to understand the butterfly idea with going fast; anyone got any hints for me?

EDIT:
I'm sort of casual with my explaining. I presume that you already understand this material like me.

A forward Fourier transform will bring you to the transform domain. The transform domain's data is the magnitude and phase of the signal. The magnitude is displayed in red above.

An inverse Fourier transform takes the transform data and brings it back to the time domain; shown above as the yellow signal.
 
Last edited:
  • #7
just for fun:

 
  • #8
yet another:

 
  • #9
mathman said:
Fourier transform and inverse transform have almost identical kernels
eitx and e−itxeitx and e−itx​
e^{itx} \ and\ e^{-itx}. That might explain your concern.

A forward transform has a negative sign, the inverse is positive...
 
  • #10
ADDA said:
A forward transform has a negative sign, the inverse is positive...
Yes, but that is a matter of convention, just like there are two conventions for the factor of [itex] (2\pi)^{-n}[/itex] in front of the integral.
 
  • #11
Dr Transport said:
Yes, but that is a matter of convention, just like there are two conventions for the factor of [itex] (2\pi)^{-n}[/itex] in front of the integral.

It might be a convention as to whether you use a + sign or - sign in the definition of the Fourier transform, but it's absolutely necessary that the inverse uses the opposite sign.
 
  • #13
just for fun:

60HZ frame rate audio or a 44.1k sample rate

3HZ visual frames

The green signal would be a representation of the left channel or the data received by your stereo or phone. The background data transforms that green signal to the top yellow signal or original audio in blue.

 

1. What is a Repetitive Fourier transform?

The Repetitive Fourier transform is a mathematical tool used to analyze periodic signals or functions. It decomposes a signal into its constituent frequencies and their corresponding amplitudes.

2. How does a Repetitive Fourier transform differ from a regular Fourier transform?

A Repetitive Fourier transform is used specifically for analyzing periodic signals, whereas a regular Fourier transform can be used for any signal. Additionally, a Repetitive Fourier transform takes into account the periodic nature of the signal and produces a discrete spectrum, while a regular Fourier transform produces a continuous spectrum.

3. What are the applications of a Repetitive Fourier transform?

Repetitive Fourier transforms are commonly used in fields such as signal processing, image and audio compression, and analysis of periodic systems in physics and engineering. They are also used in data analysis and pattern recognition.

4. How is a Repetitive Fourier transform calculated?

A Repetitive Fourier transform is calculated using a series of complex mathematical equations involving integrals and trigonometric functions. It can be done manually using a mathematical table or with the help of software and programming languages such as MATLAB or Python.

5. Are there any limitations to using a Repetitive Fourier transform?

One limitation of a Repetitive Fourier transform is that it assumes the signal is periodic, which may not always be the case in real-world scenarios. It also requires the signal to have a finite number of cycles, otherwise, the analysis may not be accurate. Additionally, the accuracy of the results depends on the sampling rate and the length of the signal.

Similar threads

Replies
3
Views
1K
  • Calculus
Replies
8
Views
4K
Replies
4
Views
5K
  • Calculus and Beyond Homework Help
Replies
1
Views
786
Replies
1
Views
2K
Replies
4
Views
3K
Replies
3
Views
1K
Replies
8
Views
3K
  • Calculus and Beyond Homework Help
Replies
3
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
3K
Back
Top