Discover

:''This article specifically discusses Fourier transformation of functions on the real line; for other kinds of Fourier transformation, see Fourier analysis and list of Fourier-related transforms.''
In mathematics, the 'Fourier transform', named in honor of French mathematician Joseph Fourier, is a certain linear operator that maps functions to other functions. Loosely speaking, the Fourier transform decomposes a function into a continuous spectrum of its ''frequency components'', and the inverse transform synthesizes a function from its spectrum of frequency components. A useful analogy is the relationship between a series of pure notes (the frequency components) and a musical chord (the function itself). In mathematical physics, the Fourier transform of a signal ''x''(''t'') can be thought of as that signal in the "frequency domain." This is similar to the basic idea of the various other Fourier transforms including the Fourier series of a periodic function.
(''See also fractional Fourier transform and linear canonical transform for generalizations.'')

Contents

Definitions

Generalization

Properties

Completeness

Extensions

The Plancherel theorem and Parseval's theorem

Localization property

Analysis of differential equations

Convolution theorem

Cross-correlation theorem

Tempered distributions

Table of important Fourier transforms

Functional relationships

Square-integrable functions

Distributions

Fourier transform properties

See also

Notes

References

External links

Definitions

There are several common conventions for defining the Fourier transform of a complex-valued Lebesgue integrable function, $x.,$  In communications and signal processing, for instance, it is often the function':'
:$X(f)\; =\; int\_\{-infty\}^\{infty\}\; x(t)\; e^\{-i\; 2pi\; f\; t\},dt,$   for every real number $f.,$
When the independent variable $t,$ represents ''time'' (with SI unit of seconds), the transform variable $f,$ represents ordinary frequency (in hertz).  The complex-valued function, $X,,$ is said to represent $x,$ in the 'frequency domain'.   I.e., if $x,$ is a continuous function, then it can be reconstructed from $X,$ by the 'inverse transform:'
:$x(t)\; =\; int\_\{-infty\}^\{infty\}\; X(f)\; e^\{\; i\; 2\; pi\; f\; t\},df,$   for every real number $t.,$
Other notations for $X(f),$ are':'  $hat\{x\}(f),$  and  $mathcal\{F\}\{x\}(f).,$
The interpretation of $X,$ is aided by expressing it in polar coordinate form':'  $X(f)\; =\; A(f)\; e^\{i\; phi\; (f)\},,$  where':'
:$A(f)\; =\; |X(f)|,\; ,$   the amplitude
:   the phase.
Then the inverse transform can be written':'
:$x(t)\; =\; int\_\{-infty\}^\{infty\}\; A(f)\; e^\{\; i(2pi\; f\; t\; +phi\; (f))\},df,$
which is a recombination of all the 'frequency components' of $x(t).,$   Each component is a complex sinusoid of the form $e^\{i\; 2pi\; f\; t\}$ whose amplitude is $A(f)$ and whose initial phase angle (at $t=0$) is $phi(f)$.
In mathematics, the Fourier transform is commonly written in terms of angular frequency':'  $omega\; =\; 2pi\; f,,$  whose units are radians per second.
The substitution into the formulas above produces this convention':'
:$X(omega)\; =\; int\_\{-infty\}^infty\; x(t)\; e^\{-\; iomega\; t\},dt$^[1]
:
which is also a bilateral Laplace transform evaluated at $s=iomega$.
The $2pi$ factor can be split evenly between the Fourier transform and the inverse, which leads to another popular convention':'
:
:
This convention and the $X(f)$ convention are 'unitary' transforms.
Variations of all three conventions can be created by conjugating the complex-exponential kernel of both the forward and the reverse transform. The signs must be opposites. Other than that, the choice is (again) a matter of convention.
{| border="1" cellspacing="0" cellpadding="12"
|+ 'Summary of popular forms of the Fourier transform'
|-
| rowspan="2" align="center" style="color: darkred"| 'angular
frequency
$omega\; ,$
(rad/s)
| align="center" style="color: darkblue" | 'unitary'
|
ight ),


|-
| align="center" style="color: darkblue" | 'non-unitary'
|
ight ) ,


|-
| rowspan="2" align="center" style="color: darkred"| 'ordinary
frequency
$f\; ,$
(hertz)
| align="center" style="color: darkblue" | 'unitary'
| $X\_3(f)\; stackrel\{mathrm\{def\}\}\{=\}\; int\_\{-infty\}^\{infty\}\; x(t)\; e^\{-i\; 2\; pi\; f\; t\}\; dt\; =\; sqrt\{2\; pi\}\; X\_1(2\; pi\; f)\; =\; X\_2(2\; pi\; f),$

$x(t)\; =\; int\_\{-infty\}^\{infty\}\; X\_3(f)\; e^\{i\; 2\; pi\; f\; t\},\; df$
|}

Generalization

There are several ways to define the Fourier transform pair. The "forward" and "inverse" transforms are always defined so that the operation of both transforms in either order on a function will return the original function. In other words, the composition of the transform pair is defined to be the identity transformation. Using two arbitrary real constants ''a'' and ''b'', the most general definition of the forward 1-dimensional Fourier transform is given by
:
and the inverse is given by
:
Note that the transform definitions are symmetric; they can be reversed by simply changing the signs of ''a'' and ''b''.
The convention adopted in this article is (''a'',''b'') = (0,1). The choice of ''a'' and ''b'' is usually chosen so that it is geared towards the context in which the transform pairs are being used. The non-unitary convention above is (''a'',''b'') = (1,1). Another very common definition is (''a'',''b'') = (0,2π) which is often used in signal processing applications. In this case, the angular frequency ω becomes ordinary frequency ''f''. If ''f'' (or ω) and ''t'' carry units, then their product must be dimensionless. For example, ''t'' may be in units of time, specifically seconds, and ''f'' (or ω) would be in hertz (or radian/s).

Properties

In this section, all the results are derived for the following definition (normalization) of the Fourier transform:
:
See also the "Table of important Fourier transforms" section below for other properties of the continuous Fourier transform.

Completeness

We define the Fourier transform on the set of compactly-supported complex-valued functions of 'R' and then extend it by continuity to the Hilbert space of square-integrable functions with the usual inner-product. Then $mathcal\{F\}$: ''L''²('R') → ''L''²('R') is a unitary operator. That is. $mathcal\{F\}^$
★ =mathcal{F}^{-1} and the transform preserves inner-products (see Parseval's theorem, also described below). Note that, $mathcal\{F\}^$
★ refers to adjoint of the Fourier Transform operator.
Moreover we can check that,
:$mathcal\{F\}^2\; =\; mathcal\{J\},quad\; mathcal\{F\}^3\; =\; mathcal\{F\}^$
★ = mathcal{F}^{-1}, quad mbox{and} quad mathcal{F}^4 = mathcal{I}quad
where $mathcal\{J\}$ is the Time-Reversal operator defined as,
:$||mathcal\{J\}\{f\}(t)\; -\; f(-t)||\_2\; =0$
and $mathcal\{I\}$ is the Identity operator defined as,
:$||mathcal\{I\}\{f\}(t)\; -\; f(t)||\_2\; =0$

Extensions

The Fourier transform can also be extended to the space of integrable functions defined on 'R'^''n''
:$mathcal\{F\}:L^1(mathbb\{R\}^n)$
ightarrow C(mathbb{R}^n).
where,
:
and ''C''('R'^''n'') is the space of continuous functions on 'R'^''n''.
In this case the definition usually appears as
:
ight)^{n}int_{R^n} f(x)e^{-iomegacdot x},dx.
where ω ∈ 'R'ⁿ and ω · ''x'' is the inner product of the two vectors ω and ''x''.
One may now use this to define the continuous Fourier transform for compactly supported smooth functions, which are dense in ''L''²('R'ⁿ). The Plancherel theorem then allows us to extend the definition of the Fourier transform to functions on ''L''²('R'^''n'') (even those not compactly supported) by continuity arguments. All the properties and formulas listed on this page apply to the Fourier transform so defined.
Unfortunately, further extensions become more technical. One may use the Hausdorff-Young inequality to define the Fourier transform for ''f'' ∈ ''L''^''p''('R'^''n'') for 1 ≤ ''p'' ≤ 2. The Fourier transform of functions in ''L''^''p'' for the range 2 < ''p'' < ∞ requires the study of distributions, since the Fourier transform of some functions in these spaces is no longer a function, but rather a distribution.

The Plancherel theorem and Parseval's theorem

It should be noted that depending on the author either of these theorems might be referred to as the Plancherel theorem or as Parseval's theorem.
If ''f''(''t'') and ''g''(''t'') are square-integrable and ''F''(ω) and ''G''(ω) are their Fourier transforms, then we have Parseval's theorem:
:
where the bar denotes complex conjugation. Therefore, the Fourier transformation yields an isometric automorphism of the Hilbert space ''L''²('R'ⁿ).
The Plancherel theorem, which is equivalent to Parseval's theorem, states that
:$int\_\{mathbb\{R\}^n\}\; left|\; f(t)$
ight|^2, dt = int_{mathbb{R}^n} left| F(omega)
ight|^2, domega.
This theorem is usually interpreted as asserting the unitary property of the Fourier transform. See Pontryagin duality for a general formulation of this concept in the context of locally compact abelian groups.

Localization property

As a rule of thumb: the more concentrated ''f''(''t'') is, the more spread out ''F''(ω) is. In particular, if we "squeeze" a function in ''t'', it spreads out in ω and vice-versa; and we cannot arbitrarily concentrate both the function and its Fourier transform.
Therefore a function which equals its Fourier transform strikes a precise balance between being concentrated and being spread out. It is easy in theory to construct examples of such functions (called self-dual functions) because the Fourier transform has order 4 (that is, iterating it four times on a function returns the original function). The sum of the four iterated Fourier transforms of any function will be self-dual. There are also some explicit examples of self-dual functions, the most important being constant multiples of the Gaussian function
:
ight).
This function is related to Gaussian distributions, and in fact, is an eigenfunction of the Fourier transform operators. Again, it is worth
stressing that the mere fact that the Gaussian is self-dual does not make it in any way special: many self-dual functions exist.
The trade-off between the compaction of a function and its Fourier transform can be formalized in the form of a 'Fourier Uncertainty Principle'. Suppose ''f''(''t'') and ''F''(ω) are a Fourier transform pair for a finite-energy (i.e. square-integrable) function. Without loss of generality, we assume that ''f''(''t'') is normalized:
:$int\_\{-infty\}^infty\; |f(t)|^2\; ,dt=1.$
It follows from Parseval's theorem that ''F''(ω) is also normalized.
Define the expected ''location''Location, momentum and particle do not have any physical meaning here; they are simply convenient monikers chosen with analogy to the interpretation used in the Heisenberg Uncertainty Principle. of a particle (with probability density |''f''(''t)''|²) as
:$u\_f\; stackrel\{mathrm\{def\}\}\{=\}\; int\_\{-infty\}^infty\; t|f(t)|^2,dt.$
and the expectation value of the ''momentum'' of the particle (with probability density |''f''(ω)|²) as
:$xi\_F\; stackrel\{mathrm\{def\}\}\{=\}\; int\_\{-infty\}^infty\; omega\; |F(omega)|^2,domega.$
Also define the variances around the above-defined average values as
:$sigma^2\_\{f\}\; stackrel\{mathrm\{def\}\}\{=\}\; int\_\{-infty\}^infty\; (t-u\_f)^2|f(t)|^2,dt$
and
:$sigma^2\_\{F\}\; stackrel\{mathrm\{def\}\}\{=\}\; int\_\{-infty\}^infty\; (omega-xi\_F)^2\; |F(omega)|^2,domega.$
Then it can be shown that
:
The equality is achieved for the Gaussian function listed above, which shows that the Gaussian function is maximally concentrated in "time-frequency".
The most famous practical application of this property is found in quantum mechanics. Following from the axioms of quantum mechanics, the momentum and position wave functions are Fourier transform pairs to within a factor of ''h''/2π and are normalized to unity. The above expression then becomes a statement of the Heisenberg uncertainty principle.
The Fourier transform also translates between smoothness and decay. If ''f''(''t'') is several times differentiable, then ''F''(ω) decays rapidly towards zero for ω → ± ∞.

Analysis of differential equations

Fourier transforms, and the closely related Laplace transforms are widely used in solving differential equations. The Fourier transform is compatible with differentiation in the following sense: if ''f''(''t'') is a differentiable function with Fourier transform ''F''(ω), then the Fourier transform of its derivative is given by ''i''ω ''F''(ω). This can be used to transform differential equations into algebraic equations. Note that this technique only applies to problems whose domain is the whole set of real numbers. By extending the Fourier transform to functions of several variables (as outlined below), partial differential equations with domain 'R'ⁿ can also be translated into algebraic equations.

Convolution theorem

:''Main article:'' Convolution theorem
The Fourier transform translates between convolution and multiplication of functions. If ''f''(''t'') and ''h''(''t'') are integrable functions with Fourier transforms ''F''(ω) and ''H''(ω) respectively, and if the convolution of ''f'' and ''h'' exists and is absolutely integrable, then the Fourier transform of the convolution is given by the product of the Fourier transforms ''F''(ω) ''H''(ω) (possibly multiplied by a constant factor depending on the Fourier normalization convention).
In the current normalization convention, this means that if
:$g(t)\; =\; \{f$
★ h}(t) = int_{-infty}^infty f(s)h(t - s),ds
where
★ denotes the convolution operation; then
:$G(omega)\; =\; sqrt\{2pi\}cdot\; F(omega)H(omega).,$
The above formulas hold true for functions defined on both one- and multi-dimension real space. In linear time invariant (LTI) system theory, it is common to interpret ''h''(''t'') as the impulse response of an LTI system with input ''f''(''t'') and output ''g''(''t''), since substituting the unit impulse for ''f''(''t'') yields ''g''(''t'')=''h''(''t''). In this case, ''H''(ω) represents the frequency response of the system.
Conversely, if ''f''(''t'') can be decomposed as the product of two other functions ''p''(''t'') and ''q''(''t'') such that their product ''p''(''t'')''q''(''t'') is integrable, then the Fourier transform of this product is given by the convolution of the respective Fourier transforms ''P''(ω) and ''Q''(ω), again with a constant scaling factor.
In the current normalization convention, this means that if ''f''(''t'') = ''p''(''t'') ''q''(''t'') then:
:
★ Q(omega) igg) = rac{1}{sqrt{2pi}} int_{-infty}^infty P(lpha)Q(omega - lpha),dlpha.

Cross-correlation theorem

In an analogous manner, it can be shown that if $g(t)$ is the cross-correlation of $f(t)$ and $h(t)$:
:
then the Fourier transform of $g(t)$ is:
:$G(omega)\; =\; sqrt\{2pi\},overline\{F\}(omega),H(omega)$
where capital letters are again used to denote the Fourier transform.

Tempered distributions

The most general and useful context for studying the continuous Fourier transform is given by the tempered distributions; these include all the integrable functions mentioned above and have the added advantage that the Fourier transform of any tempered distribution is again a tempered distribution and the rule for the inverse of the Fourier transform is universally valid. Furthermore, the useful Dirac delta is a tempered distribution but not a function; its Fourier transform is a constant function (whose specific value depends upon the form of the Fourier transform used). Distributions can be differentiated and the above mentioned compatibility of the Fourier transform with differentiation and convolution remains true for tempered distributions.

Table of important Fourier transforms

The following table records some important Fourier transforms. ''G'' and ''H'' denote Fourier transforms of ''g''(''t'') and ''h''(''t''), respectively. ''g'' and ''h'' may be integrable functions or tempered distributions. Note that the two most common unitary conventions are included.

Functional relationships

{| class="wikitable"
! !! Signal !! Fourier transform
unitary, angular frequency !! Fourier transform
unitary, ordinary frequency !! Remarks
|-
|
|align="center"|$g(t),$
|align="center"|$G(omega)!\; stackrel\{mathrm\{def\}\}\{=\}\; !$


|align="center"|$G(f)!\; stackrel\{mathrm\{def\}\}\{=\}$

$int\_\{-infty\}^\{infty\}!!g(t)\; e^\{-i\; 2pi\; f\; t\},\; dt$
|
|-
| 101
|$acdot\; g(t)\; +\; bcdot\; h(t),$
|$acdot\; G(omega)\; +\; bcdot\; H(omega),$
|$acdot\; G(f)\; +\; bcdot\; H(f),$
|Linearity
|-
| 102
|$g(t\; -\; a),$
|$e^\{-\; i\; a\; omega\}\; G(omega),$
|$e^\{-\; i\; 2pi\; a\; f\}\; G(f),$
|Shift in time domain
|-
| 103
|$e^\{\; iat\}\; g(t),$
|$G(omega\; -\; a),$
|
ight),
|Shift in frequency domain, dual of 102
|-
| 104
|$g(a\; t),$
|
ight),
|
ight),
|If $|a|,$ is large, then $g(a\; t),$ is concentrated around 0 and
ight), spreads out and flattens. It is interesting to consider the limit of this as $|a|$ tends to infinity - the delta function
|-
| 105
|$G(t),$
|$g(-omega),$
|$g(-f),$
|Duality property of the Fourier transform. Results from swapping "dummy" variables of $t\; ,$ and $omega\; ,$.
|-
| 106
|
|$(iomega)^n\; G(omega),$
|$(i\; 2pi\; f)^n\; G(f),$
|Generalized derivative property of the Fourier transform
|-
| 107
|$t^n\; g(t),$
|
|
ight)^n rac{d^n G(f)}{df^n},
|This is the dual of 106
|-
| 108
|$(g$
★ h)(t),
|$sqrt\{2pi\}\; G(omega)\; H(omega),$
|$G(f)\; H(f),$
|$g$
★ h, denotes the convolution of $g,$ and $h,$ — this rule is the convolution theorem
|-
| 109
|$g(t)\; h(t),$
|$(G$
★ H)(omega) over sqrt{2pi},
|$(G$
★ H)(f),
|This is the dual of 108
|-
| 110
|$g(t),$ is purely real, and an even function
|colspan="2" align="center"|$G(omega),$ and $G(f),$ are purely real, and even functions
|
|-
| 111
|$g(t),$ is purely real, and an odd function
|colspan="2" align="center"|$G(omega),$ and $G(f),$ are purely imaginary, and odd functions
|
|}

Square-integrable functions

{| class="wikitable"
! !! Signal !! Fourier transform
unitary, angular frequency !! Fourier transform
unitary, ordinary frequency !! Remarks
|-
|
|align="center"|$g(t)\; ,$
|align="center"|$G(omega)!\; stackrel\{operatorname\{def\}\}\{=\}\; !$


|align="center"|$G(f)!\; stackrel\{operatorname\{def\}\}\{=\}$

$int\_\{-infty\}^\{infty\}!!g(t)\; e^\{-i\; 2pi\; f\; t\}\; operatorname\{d\}t\; ,$
|
|-
| 201
|$operatorname\{rect\}(a\; t)\; ,$
|
ight)
|
ight)
|The rectangular pulse and the normalized sinc function
|-
| 202
|$operatorname\{sinc\}(a\; t),$
|
ight)
|
ight),
|Dual of rule 201. The rectangular function is an idealized low-pass filter, and the sinc function is the non-causal impulse response of such a filter.
|-
| 203
|$operatorname\{sinc\}^2\; (a\; t)\; ,$
|
ight)
|
ight)
| ''tri'' is the triangular function
|-
| 204
|$operatorname\{tri\}\; (a\; t)\; ,$
|
ight)
|
ight) ,
| Dual of rule 203.
|-
| 205
|
|
|
|Shows that the Gaussian function is its own Fourier transform. For this to be integrable we must have .
|-
| 206
|
ight|_{lpha = -i a} ,
|
ight)}
|
ight)}
| common in optics
|-
| 207
|$cos\; (\; a\; t^2\; )\; ,$
|
ight)
|
ight)
|
|-
| 208
|$sin\; (\; a\; t^2\; )\; ,$
|
ight)
|
ight)
|
|-
| 209
|$operatorname\{e\}^\{-a|t|\}\; ,$
|
|
| ''a>0''
|-
| 210
|
|
|
| the transform is the function itself
|-
| 211
|$J\_0\; (t),$
|
ight)}{sqrt{1 - omega^2}}
|
| ''J₀(t)'' is the Bessel function of first kind of order 0
|-
| 212
|$J\_n\; (t)\; ,$
|
ight)}{sqrt{1 - omega^2}}
|
| it's the generalization of the previous transform; ''T_n (t)'' is the Chebyshev polynomial of the first kind.
|-
| 213
|
|

 
ight)
|

  $cdot\; sqrt\{1\; -\; 4\; pi^2\; f^2\}\; operatorname\{rect\}\; (\; pi\; f\; )$
| ''U_n (t)'' is the Chebyshev polynomial of the second kind
|-
| 214
|$operatorname\{sech\}(a\; t)\; ,$
|
ight)
|
ight)
|Hyperbolic secant is its own Fourier transform
|}

Distributions

{| class="wikitable"
! !! Signal !! Fourier transform
unitary, angular frequency !! Fourier transform
unitary, ordinary frequency !! Remarks
|-
|
|align="center"|$g(t)\; ,$
|align="center"|$G(omega)!\; stackrel\{mathrm\{def\}\}\{=\}\; !$


|align="center"|$G(f)!\; stackrel\{mathrm\{def\}\}\{=\}$

$int\_\{-infty\}^\{infty\}!!g(t)\; e^\{-i\; 2pi\; f\; t\},\; dt$
|
|-
| 301
|$1,$
|$sqrt\{2pi\}cdot\; delta(omega),$
|$delta(f),$
|$displaystyledelta(omega)$ denotes the Dirac delta distribution.
|-
| 302
|$delta(t),$
|
|$1,$
|Dual of rule 301.
|-
| 303
|$e^\{i\; a\; t\},$
|$sqrt\{2\; pi\}cdot\; delta(omega\; -\; a),$
|
|This follows from and 103 and 301.
|-
| 304
|$cos\; (a\; t),$
|
|
|Follows from rules 101 and 303 using Euler's formula: $displaystylecos(a\; t)\; =\; (e^\{i\; a\; t\}\; +\; e^\{-i\; a\; t\})/2.$
|-
| 305
|$sin(\; at),$
|
|
|Also from 101 and 303 using $displaystylesin(a\; t)\; =\; (e^\{i\; a\; t\}\; -\; e^\{-i\; a\; t\})/(2i).$
|-
| 306
|$t^n,$
|$i^n\; sqrt\{2pi\}\; delta^\{(n)\}\; (omega),$
|
ight)^n delta^{(n)} (f),
|Here, $displaystyle\; n$ is a natural number. $displaystyledelta^n(omega)$ is the $displaystyle\; n$-th distribution derivative of the Dirac delta. This rule follows from rules 107 and 302. Combining this rule with 1, we can transform all polynomials.
|-
| 307
|
|
|$-ipicdot\; sgn(f),$
|Here $displaystylesgn(omega)$ is the sign function; note that this is consistent with rules 107 and 302.
|-
| 308
|
|
|
|Generalization of rule 307.
|-
| 309
|$sgn(t),$
|
|
|The dual of rule 307.
|-
| 310
|$u(t)\; ,$
|
ight),
|
ight),
|Here $u(t)$ is the Heaviside unit step function; this follows from rules 101 and 309.
|-
| 311
|$e^\{-\; a\; t\}\; u(t)\; ,$
|
|
|$u(t)$ is the Heaviside unit step function and $a\; >\; 0$.
|-
| 312
|$sum\_\{n=-infty\}^\{infty\}\; delta\; (t\; -\; n\; T)\; ,$
|
ight),
|
ight) ,
|The Dirac comb — helpful for explaining or understanding the transition from continuous to discrete time.
|}

Fourier transform properties

Notation':' $f(t)\; quad\; stackrel\{mathcal\{F\}\}\{Longleftrightarrow\}quad\; F(omega)$ denotes that ''f''(''t'') and ''F''(ω) are a Fourier transform pair.
;Linearity
::::$af\_1(t)\; +\; bf\_2(t)\; quad\; stackrel\{mathcal\{F\}\}\{Longleftrightarrow\}quad\; aF\_1(omega)\; +\; bF\_2(omega)$
;Convolution
::::$f\_1(t)$
★ f_2(t) quad stackrel{mathcal{F}}{Longleftrightarrow}quad F_1(omega)F_2(omega)
;Conjugation
::::$overline\{f(t)\}\; quad\; stackrel\{mathcal\{F\}\}\{Longleftrightarrow\}quad\; overline\{F(-omega)\}$
;Scaling
::::
e 0
;Time reversal
::::$f(-t)\; quad\; stackrel\{mathcal\{F\}\}\{Longleftrightarrow\}quad\; F(-omega)$
;Time shift
::::$f(t-t\_0)\; quad\; stackrel\{mathcal\{F\}\}\{Longleftrightarrow\}quad\; e^\{-iomega\; t\_0\}F(omega)$
;Modulation (multiplication by complex exponential)
::::$f(t)cdot\; e^\{iomega\_\{0\}t\}\; quad\; stackrel\{mathcal\{F\}\}\{Longleftrightarrow\}quad\; F(omega-omega\_\{0\})qquad\; omega\_\{0\}\; in\; mathbb\{R\},$
;Multiplication by sin $omega$₀t  
::::
;Multiplication by cos $omega$₀t
::::
;Integration
::::
;Parseval's theorem
::::$int\_\{mathbb\{R\}\}\; f(t)cdot\; overline\{g(t)\},\; dt\; =\; int\_\{mathbb\{R\}\}\; F(omega)cdot\; overline\{G(omega)\},\; domega\; ,$

See also

★ Fourier series

★ Fast Fourier transform

★ Laplace transform

★ Discrete Fourier transform

★ Fractional Fourier transform

★ Linear canonical transform

★ Fourier sine transform

★ Short-time Fourier transform

Notes

1.
''X''(''f'') and ''X''(ω) represent different, but related, functions, as shown in the table labeled ''Summary of popular forms of the Fourier transform''.

References

★ Fourier Transforms from eFunda - includes tables

★ Dym & McKean, ''Fourier Series and Integrals''. (For readers with a background in mathematical analysis.)

★ K. Yosida, ''Functional Analysis'', Springer-Verlag, 1968. ISBN 3-540-58654-7

★ L. Hörmander, ''Linear Partial Differential Operators'', Springer-Verlag, 1976. (Somewhat terse.)

★ A. D. Polyanin and A. V. Manzhirov, ''Handbook of Integral Equations'', CRC Press, Boca Raton, 1998. ISBN 0-8493-2876-4

★ R. G. Wilson, "Fourier Series and Optical Transform Techniques in Contemporary Optics", Wiley, 1995. ISBN-10: 0471303577

★ R. N. Bracewell, The Fourier Transform and Its Applications, 3rd ed., Boston, McGraw Hill, 2000.

External links

★ Tables of Integral Transforms at EqWorld: The World of Mathematical Equations.

★

★ Fourier Transform Module by John H. Mathews

★ Extending Laplace & Fourier Transforms by Dr. Shervin Erfani