Fourier transform
This article may be confusing or unclear to readers. (March 2008) (Learn how and when to remove this template message) 
 This article specifically discusses Fourier transformation of functions on the real line; for other kinds of Fourier transformation, see Fourier analysis and list of Fourierrelated transforms. For generalizations, see fractional Fourier transform and linear canonical transform.
In mathematics, the continuous Fourier transform is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation of the original function (where the original function is often a function in the timedomain). In this specific case, both domains are continuous and unbounded. The term Fourier transform can refer to either the frequency domain representation of a function or to the process/formula that "transforms" one function into the other. Template:Fourier transforms
Contents
Definitions
There are several common conventions for defining the Fourier transform of a complexvalued Lebesgue integrable function f:R→C. One common definition is:
 for every real number ν.
When the independent variable t represents time (with SI unit of seconds), the transform variable ν represents ordinary frequency (in hertz). If f is Hölder continuous, then it can be reconstructed from F by the inverse transform:
 for every real number t.
Other notations for are: and
The interpretation of is aided by expressing it in polar coordinate form: where:
 the amplitude
 the phase. (see arg function)
Then the inverse transform can be written:
which is a recombination of all the frequency components of f(t). Each component is a complex sinusoid of the form e^{2πiνt} whose amplitude is A(ν) and whose initial phase angle (at t=0) is φ(ν).
The Fourier transform is often written in terms of angular frequency: ω = 2πν whose units are radians per second.
The substitution ν = ω/(2π) into the formulas above produces this convention:
 ^{[1]}
which is also a bilateral Laplace transform evaluated at s=iω.
The 2π factor can be split evenly between the Fourier transform and the inverse, which leads to another popular convention:
This makes the transform a unitary one.
Variations of all three conventions can be created by conjugating the complexexponential 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.
angular frequency (rad/s) 
unitary 

nonunitary 
 
ordinary frequency ν (hertz) 
unitary 

Some Fourier transform properties
Notation: denotes that f(t) and F(ω) are a Fourier transform pair.
 Linearity
 Multiplication
(unitary normalization convention) (nonunitary convention) (ordinary frequency)
 Modulation
 Convolution
(unitary convention) (nonunitary convention) (ordinary frequency)
 Integration (example of convolution)
 ^{[2]}
 Conjugation
 Scaling
 Time reversal
 Time shift
 Parseval's theorem
(unitary convention) (nonunitary convention) (ordinary frequency)
The section "Table of important Fourier transforms" (below) documents more properties of the continuous Fourier transform.
Generalization
Using two arbitrary real constants a and b, the most general definition of the forward 1dimensional 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 ordinary frequency convention corresponds to (a,b) = (0,2π), and in that case the variable ω is changed to ν. If ν and t carry units, their product must be dimensionless. For example, t may be in units of time, specifically seconds, and ν would be in hertz.
The unitary, angular frequency convention is (a,b) = (0,1), and the nonunitary convention (above) is (a,b) = (1,1).
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.
More properties
Completeness
We define the Fourier transform on the set of integrable complexvalued functions of R and then extend it by continuity to the Hilbert space of squareintegrable functions with the usual innerproduct. Then : L^{2}(R) → L^{2}(R) is a unitary operator. That is and the transform preserves innerproducts (see Parseval's theorem, also described below). Note that, refers to adjoint of the Fourier Transform operator.
Moreover we can check that:
where is the TimeReversal operator defined as:
and is the Identity operator defined as:
Multidimensional version
The Fourier transform, can be expanded to arbitrary dimension . In the unitary, angular frequency convention, the definition is:
where and are dimensional vectors, and is the inner product, also written of the 2 vectors. The integration is performed over all dimensions.
The function is assumed to belong to the "space" of integrable functions defined on R^{n}:
where:
and C(R^{n}) is the space of continuous functions on R^{n}.
One may now use this to define the Fourier transform for compactly supported smooth functions, which are dense in L^{2}(R^{n}). The Plancherel theorem then allows us to extend the definition of the Fourier transform to functions on L^{2}(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 HausdorffYoung 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 squareintegrable and F(ω) and G(ω) are their unitary Fourier transforms, then we have Parseval's theorem:
where the bar denotes complex conjugation. Therefore, the Fourier transform yields an isometric automorphism of the Hilbert space L^{2}(R^{n}).
The Plancherel theorem, which is equivalent to Parseval's theorem, states:
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 viceversa; 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 selfdual 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 selfdual. There are also some explicit examples of selfdual functions, the most important being constant multiples of the Gaussian function
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 selfdual does not make it in any way special: many selfdual functions exist.
The tradeoff 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 finiteenergy (i.e. squareintegrable) function. Without loss of generality, we assume that f(t) is normalized:
It follows from Parseval's theorem that F(ω) is also normalized.
Define the expected location^{[3]} of a particle (with probability density f(t)^{2}) as
and the expectation value of the momentum^{[3]} of the particle (with probability density F(ω)^{2}) as
Also define the variances around the abovedefined average values as
and
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 "timefrequency".
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 ω → ± ∞.
Eigenfunctions
One important choice of orthonormal (under norm) eigenfunctions of the Fourier transform are the Hermite functions
where is the physicistdefined Hermite polynomial. When using the unitary definition of the Fourier Transform, the relation is
However, this choice of eigenfunctions is not unique. Because there are only four different eigenvalues of the Fourier transform (±1 and ±i), each highly degenerate, any linear combination of eigenfunctions with the same eigenvalue gives another eigenfunction. However, the choice of Hermite functions is convenient because they are exponentially localized in both frequency and time domains, and thus give rise to the fractional Fourier transform used in timefrequency analyses.
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^{n} 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 unitary normalization convention, this means that if:
where * denotes the convolution operation, then:
The above formulas hold true for functions defined on both one and multidimension 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 unitary normalization convention, this means that if f(t) = p(t) q(t) then:
Crosscorrelation theorem
In an analogous manner, it can be shown that if is the crosscorrelation of and :
then the Fourier transform of is:
where capital letters are again used to denote the Fourier transform.
Tempered distributions
The most general and useful context for studying the 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.
Domain and range of the Fourier transform
The domain and range of the Fourier transform cannot be described as two welldefined sets of functions. Instead, they can be chosen in several different ways depending on exactly what is meant by a function and an integral. Furthermore, for some pair of domain and range which can be described for the Fourier transform, it may sometimes be of interest to consider the restriction of the transform to a proper subset of the domain. In general, however, it is of interest to describe as "large" sets as possible for the domain. Such extensions can be done in different ways and may lead to domains where either one is not a subset of the other. Some examples of domains and ranges which are described in the literature are
 The set of Schwartz functions is closed under the Fourier transform. Schwartz functions are rapidly decaying functions and does not include all functions which are relevant for the Fourier transform.
 is closed under the Fourier transform. This is a much richer set than Schwartz functions but is, technically speaking, not a set of functions but rather equivalence classes of functions.
 The set of tempered distributions is closed under the Fourier transform. Tempered distributions are also a form a generalization of functions. It is in this generality that one can define the Fourier Transform of objects like the Dirac delta function.
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
Signal  Fourier transform unitary, angular frequency 
Fourier transform unitary, ordinary frequency 
Remarks  




101  Linearity  
102  Shift in time domain  
103  Shift in frequency domain, dual of 102  
104  If is large, then is concentrated around 0 and spreads out and flattens. It is interesting to consider the limit of this as tends to infinity  the delta function  
105  Duality property of the Fourier transform. Results from swapping "dummy" variables of and .  
106  Generalized derivative property of the Fourier transform  
107  This is the dual of 106  
108  denotes the convolution of and — this rule is the convolution theorem  
109  This is the dual of 108  
110  is purely real, and an even function  and are purely real, and even functions  
111  is purely real, and an odd function  and are purely imaginary, and odd functions 
Squareintegrable functions
Signal  Fourier transform unitary, angular frequency 
Fourier transform unitary, ordinary frequency 
Remarks  




201  The rectangular pulse and the normalized sinc function, here defined as  
202  Dual of rule 201. The rectangular function is an ideal lowpass filter, and the sinc function is the noncausal impulse response of such a filter.  
203  tri is the triangular function  
204  Dual of rule 203.  
205  is the Heaviside unit step function and .  
206  Shows that the Gaussian function is its own Fourier transform. For this to be integrable we must have .  
210  a>0  
211  the transform is the function itself  
212  J_{0}(t) is the Bessel function of first kind of order 0  
213  it's the generalization of the previous transform; T_{n} (t) is the Chebyshev polynomial of the first kind.  
214 


U_{n} (t) is the Chebyshev polynomial of the second kind  
215  Hyperbolic secant is its own Fourier transform 
Distributions
Signal  Fourier transform unitary, angular frequency 
Fourier transform unitary, ordinary frequency 
Remarks  




301  denotes the Dirac delta distribution.  
302  Dual of rule 301.  
303  This follows from 103 and 301.  
304  Follows from rules 101 and 303 using Euler's formula:  
305  Also from 101 and 303 using  
306  
307  
common in optics  
308  Here, is a natural number. is the th distribution derivative of the Dirac delta. This rule follows from rules 107 and 302. Combining this rule with 101, we can transform all polynomials.  
309  Here is the sign function; note that this is consistent with rules 107 and 302.  
310  Generalization of rule 309.  
311  The dual of rule 309.  
312  Here is the Heaviside unit step function; this follows from rules 101 and 311.  
313  The Dirac comb — helpful for explaining or understanding the transition from continuous to discrete time. 
Twodimensional functions
Signal  Fourier transform unitary, angular frequency 
Fourier transform unitary, ordinary frequency 
Remarks 

Both functions are Gaussian bumps, which may not have unit volume.  
The circle has unit radius if we think of circ(t) as step function u(1t); The Airy distribution is expressed using J_{1} (the order 1 Bessel function of the first kind); f_{r} is the magnitude of the frequency vector {f_{x},f_{y}}. 
Threedimensional functions
Signal  Fourier transform unitary, angular frequency 
Fourier transform unitary, ordinary frequency 
Remarks 

The sphere has unit radius; f_{r} is the magnitude of the frequency vector {f_{x},f_{y},f_{z}}. 
About notation
The Fourier transform is a mapping on a function space. This mapping is here denoted and is used to denote the Fourier transform of the function s. This mapping is linear, which means that can also be seen as a linear transformation on the function space and implies that the standard notation in linear algebra of applying a linear transformation to a vector (here the signal s) can be used to write instead of . Since the result of applying the Fourier transform is again a function, we can be interested in the value of this function evaluated at the value for its variable, and this is denoted either as or as . Notice that in the former case, it is implicitly understood that is applied first to s and then the resulting function is evaluated at , not the other way around.
In mathematics and various applied sciences it is often necessary to distinguish between a function s and the value of s when its variable equals t, denoted s(t). This means that a notation like formally can be interpreted as the Fourier transform of the values of s at t, which must be considered as an illformed expression since it describes the Fourier transform of a function value rather than of a function. Despite this flaw, the previous notation appears frequently, often when a particular function or a function of a particular variable is to be transformed. For example, is sometimes used to express that the Fourier transform of a rectangular function is a sinc function, or is used to express the shift property of the Fourier transform. Notice, that the last example is only correct under the assumption that the transformed function is a function of t, not of . If possible, this informal usage of the operator should be avoided, in particular when it is not perfectly clear which variable the function to be transformed depends on.
Notes
 ↑ F(ν) and F(ω) represent different, but related, functions, as shown in the table labeled Summary of popular forms of the Fourier transform.
 ↑ is the Heaviside_step_function, and
 ↑ ^{3.0} ^{3.1} 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.
See also
 Fourier series
 Fast Fourier transform
 Laplace transform
 Discrete Fourier transform
 Discretetime Fourier transform
 Fractional Fourier transform
 Linear canonical transform
 Fourier sine transform
 Shorttime Fourier transform
 Analog signal processing
 Transform (mathematics)
References
This article or section includes a list of references or a list of external links, but its sources remain unclear because it lacks intext citations. You can improve this article by introducing more precise citations. 
 Fourier Transforms from eFunda  includes tables
 Dym & McKean, Fourier Series and Integrals. (For readers with a background in mathematical analysis.)
 K. Yosida, Functional Analysis, SpringerVerlag, 1968. ISBN 3540586547
 L. Hörmander, Linear Partial Differential Operators, SpringerVerlag, 1976.
 A. D. Polyanin and A. V. Manzhirov, Handbook of Integral Equations, CRC Press, Boca Raton, 1998. ISBN 0849328764
 R. G. Wilson, "Fourier Series and Optical Transform Techniques in Contemporary Optics", Wiley, 1995. ISBN10: 0471303577
 R. N. Bracewell, The Fourier Transform and Its Applications, 3rd ed., Boston, McGraw Hill, 2000.
External links
 Fourier Series Applet (Tip: drag magnitude or phase dots up or down to change the wave form).
 Tables of Integral Transforms at EqWorld: The World of Mathematical Equations.
 Eric W. Weisstein, Fourier Transform at MathWorld.
 Fourier Transform Module by John H. Mathews
 Fourier at xkcd
ar:تحويل فوريي bexold:Пераўтварэньне Фур'е cs:Fourierova transformace da:Fouriertransformation de:FourierTransformation eu:Fourierren transformaketa fa:تبدیل فوریه gl:Transformada de Fourier he:התמרת פורייה ko:푸리에 변환 id:Transformasi Fourier is:Fourier–vörpun it:Trasformata di Fourier nl:Fouriertransformatie no:Fouriertransformasjon simple:Fourier transformation sr:Фуријеова трансформација fi:Fourier'n muunnos sv:Fouriertransform th:การแปลงฟูริเยร์