This is a only a summary of knowledge.
Fourier transform
There are many conventions as in where to put the normalisation 2π factor.
- Forward Fourier transform (Fourier analysis)
- Inverse Fourier transform (Fourier synthesis)
Another common convention is to put 1√2π before both integrals (balanced convention).
Properties
Linearity
h(x)=αf(x)+βg(x)⟺˜h(k)=α˜f(k)+β˜g(k)Rescaling (real α)
g(x)=f(αx)⟺˜g(k)=1|α|˜f(kα)Shift / exponential (real α)
g(x)=f(x−α)⟺˜g(k)=e−ikα˜f(k)g(x)=eikαf(x)⟺˜g(k)=˜f(k−α)Differentiation / multiplication
g(x)=f′(x)⟺˜g(k)=ik˜f(k)g(x)=xf(x)⟺˜g(k)=i˜f′(k)Duality
g(x)=˜f(x)⟺˜g(k)=2πf(−k)Complex conjugation and parity inversion
g(x)=[f(x)]∗⟺˜g(k)=[˜f(−k)]∗Symmetry - even & odd
f(−x)=±f(x)⟺˜f(−k)=±˜f(k)FT of special functions
Top-hat function
FT is sinc.
e.g. f(x) is a top hat of strength 1, (−1,1), then ˜f(k)=2sinkk.
Gaussian
FT is another Gaussian, with inversely proportional width, σxσk=1.
Done by completing the square of the exponent. Also need Jordan’s lemma.
Delta function
Gives a definite position, hence should give no information about the momentum - a constant. Then we have the identity
∫∞−∞e±ikxdx=2πδ(k)Convolution theorem & such
What is convolution
Definition
The convolution h of two function f and g
h=f∗g⟺h(x)=∫∞−∞f(y)g(x−y)dxThis is a symmetric operation, i.e. f∗g=g∗f.
Concept
Fix one function in space, reverse the other function in space. Then convolution is a function of the position of the reversed function, with the value of the integral of the product of the two functions.
Function / plot intuition
Copy and (continuously) pasting f at x with the weight g(x).
The simplist illustration of this idea is if g is a delta function, or a sum of several delta functions. This is the same as “lattice & motif” idea.
Probability
If f(x) and g(y) are two (independent) probability distribution functions, then h(z) is the PDF of z=x+y.
Convolution theorem
h=f∗g⟺˜h(k)=˜g(k)˜f(k)So, it is easiest to manipulate a convolution in the frequency space, as a product.
- Deconvolution is possible as a division in the frequency space.
Correlation
The correlation of two functions is
h=f⊗g⟺h(x)=∫∞−∞[f(y)]∗g(x+y)dx- If two signals are in phase, the correlation is positive;
- Vice versa
- If two signals are completely unrelated (e.g. noises), then correlation is 0.
Parseval’s theorem
∫∞−∞[f(x)]∗g(x)dx=12π∫∞−∞[˜f(k)]∗˜g(k)dkor more commonly, when f=g,
∫∞−∞|f(x)|2dx=12π∫∞−∞|˜f(k)|2dkDerive from: either the Fourier transform of a correlation; or change the order of integration and use the delta function identity.
Fourier transform preserves the inner product of functions, hence it is a unitary transformation.