Fourier transform - Wikipedia, the free encyclopedia

3/14/14, 2:18 PM

Function

Fourier transform unitary, ordinary frequency

Fourier transform Fourier transform non-unitary, angular unitary, angular frequency frequency

Remarks

Definition

101 102 103

Linearity Shift in time domain Shift in frequency domain, dual of 102 Scaling in the time domain. If is large, then

104

is concentrated around 0 and spreads out and flattens. Duality. Here needs to be calculated using the same method as Fourier transform column. Results from swapping "dummy" variables of and or or .

105

106 107 108 109 110 For 111 112 113 For For purely real a purely a purely , , and and are purely real even functions. are purely imaginary odd functions. Complex conjugation, generalization of 110 This is the dual of 106 The notation denotes the convolution of and

this rule is the convolution theorem This is the dual of 108 Hermitian symmetry. conjugate. indicates the complex

real even function real odd function

Square-integrable functions
The Fourier transforms in this table may be found in (Campbell & Foster 1948), (Erdlyi 1954), or the appendix of (Kammler 2000).

http://en.wikipedia.org/wiki/Fourier_transform

Page 15 of 22

Fourier transform - Wikipedia, the free encyclopedia

3/14/14, 2:18 PM

Function

Fourier transform unitary, ordinary frequency

Fourier transform unitary, angular frequency

Fourier transform non-unitary, angular frequency

Remarks

201

The rectangular pulse and the normalized sinc function, here defined as sinc(x) = sin(!x)/(!x) Dual of rule 201. The rectangular function is an ideal lowpass filter, and the sinc function is the non-causal impulse response of such a filter. The sinc function is defined here as sinc(x) = sin(!x)/(!x) The function tri(x) is the triangular function Dual of rule 203. The function u(x) is the Heaviside unit step function and a>0. This shows that, for the unitary Fourier transforms, the Gaussian function exp(!"x2) is its own Fourier transform for some choice of ". For this to be integrable we must have Re(")>0. For a>0. That is, the Fourier transform of a decaying exponential function is a Lorentzian function. Hyperbolic secant is its own Fourier transform

202

203 204 205

206

207 208

is the Hermite's polynomial. If a = 1 then the Gauss209 Hermite functions are eigenfunctions of the Fourier transform operator. For a derivation, see Hermite polynomial. The formula reduces to 206 for n = 0.

Distributions
The Fourier transforms in this table may be found in (Erdlyi 1954) or the appendix of (Kammler 2000). Fourier transform unitary, ordinary frequency Fourier transform unitary, angular frequency Fourier transform non-unitary, angular frequency

Function

Remarks

301

The distribution #($) denotes the Dirac delta function.

http://en.wikipedia.org/wiki/Fourier_transform

Page 16 of 22