Fourier transform

From testwiki
Jump to navigation Jump to search

Fourier Transform represents a function s(t) as a "linear combination" of complex sinusoids at different frequencies ω. Fourier proposed that a function may be written in terms of a sum of complex sine and cosine functions with weighted amplitudes.

In Euler notation the complex exponential may be represented as:

ejωt=cos(ωt)+jsin(ωt)

Thus, the definition of a Fourier transform is usually represented in complex exponential notation.

The Fourier transform of s(t) is defined by S(ω)=s(t)ejωtdt.

Under appropriate conditions original function can be recovered by:

s(t)=12πS(ω)ejωtdω.

The function S(ω) is the Fourier transform of s(t). This is often denoted with the operator , in the case above, S(ω)=(s(t))

The function s(t) must satisfy the Dirichlet conditions in order for s(t) for the integral defining Fourier transform to converge.

Forward Fourier Transform(FT)/Anaysis Equation

S(ω)=s(t)ejωtdt.


Inverse Fourier Transform(IFT)/Synthesis Equation

s(t)=12πS(ω)ejωtdω.

Explanation coming from Linear Algebra

According to linear algebra, for every orthogonal B of a vector space H, and every element x of H

x=bBb,xb.

holds true.

B:={bk|k1,2,..,N},withbk:=(e12πik/N,e22πik/N,...,eN2πik/N)T/N

is an orthonormal basis as can be confirmed by calculating the scalar products. This means that

xn=k=1NXken2πik/N/N,withXk:=n=1Nxnen2πik/N/N

(xn denotes the n'th component of the vector x) holds true for every N-dimensional vector x. Xk is exactly the discrete Fourier transform, and we just proved that the inverse discrete Fourier transform of the discrete Fourier transform of a vector x is the vector x, which is the central theorem of discrete Fourier theory. Discrete Fourier theory essentially means writing something in the Fourierbasis B. This also explains the linearity of the Fourier transformation.

Relation to the Laplace Transform

In fact, the Fourier Transform can be viewed as a special case of the bilateral Laplace Transform. If the complex Laplace variable s were written as s=σ+jω, then the Fourier transform is just the bilateral Laplace transform evaluated at σ=0. This justification is not mathematically rigorous, but for most applications in engineering the correspondence holds.

Properties

Template:Center top

× Time Function Fourier Transform Property
1 z(t)=x(t)± y(t) Z(ω)=X(ω)± Y(ω) Linearity
2 Z(t) 2πz(ω) Duality
3 cx(t), c = constant cX(ω) Scalar Multiplication
4 dx(t)dt jωX(ω) Differentiation in time domain
5 xtx(τ)dτ X(ω)jω, if x(t)dt=0 Integration in Time domain
6 tx(t) jdX(ω)dω Differentiation in Frequency Domain
7 x(t) X(ω) Time reversal
8 x(at) 1|a|X(ωa) Time Scaling
9 x(ta) ejωaX(ω) Time shifting
10 x(t)cosω0t 12[X(ω+ω0)+X(ωω0)] Modulation
11 x(t)sinω0t 12j[X(ωω0)X(ω+ω0)] Modulation
12 eatx(t) X(ω+a) Frequency shifting
13 x1(t)×x2(t) 12πππX1(λ)X2(ωλ)dλ Convolution

Template:Center bottom