A mathematical review of the Fourier transform
A.1 The 1-D Fourier transform
Given a continuous function x(t) of a single variable t, its Fourier transform is defined by the integral
( )
where ω is the Fourier dual of the variable t. If t signifies time, then ω is angular frequency. The temporal frequency f is related to the angular frequency ω by ω = 2πf.
The Fourier transform is reversible; that is, given X(ω), the corresponding time function is
( )
Throughout this book, the following sign convention is used for the Fourier transform. For the forward transform, the sign of the argument in the exponent is negative if the variable is time and positive if the variable is space. Of course, the inverse transform has the opposite sign used in the respective forward transform. For convenience, the scale factor 2π in equations (13) and (14) are omitted.
Generally, X(ω) is a complex function. By using the properties of the complex functions, X(ω) is expressed as two other functions of frequency
( )
where A(ω) and ϕ(ω) are the amplitude and phase spectra, respectively. They are computed by the following equations:
( )
and
( )
where X_{r}(ω) and X_{i}(ω) are the real and imaginary parts of the Fourier transform X(ω). When X(ω) is expressed in terms of its real and imaginary components
( )
and is compared with equation (15), note that
( )
and
( )
We now consider two functions — x(t) and f(t). Listed in Table A-1 are basic theorems that are useful in various applications of the Fourier transform.
Operation | Time Domain | Frequency Domain |
(1) Shifting | x(t − τ) | exp(−iωτ)X(ω) |
(2) Scaling | x(at) | |
(3) Differentiation | dx(t)/dt | iωX(ω) |
(4) Addition | f(t) + x(t) | F(ω) + X(ω) |
(5) Multiplication | f(t) x(t) | F(ω) * X(ω) |
(6) Convolution | f(t) * x(t) | F(ω) X(ω) |
(7) Autocorrelation | x(t) * x(−t) | |
(8) Parseval’s theorem |
* denotes convolution. |
Proofs of these theorems can be found in the classic reference on Fourier transforms by Bracewell (1965)^{[1]}. Also, some of the proofs are left to the exercises at the end of this chapter. Here, we shall derive the convolutional relation (6) for continuous functions, and the same relation for discrete functions in Section A.2. Consider convolution of two functions x(t) and f(t) with their Fourier transforms X(ω) and F(ω), respectively,
( )
which is explicitly given by the integral
( )
The Fourier transform of the resulting function y(t) is
( )
Substitute the convolution integral of equation (22) into equation (23)
( )
and interchange the two integrals
( )
From the shift theorem given by entry (1) of Table A-1, we have
( )
Use this relation in equation (25) to get
( )
then rearrange the terms to obtain
( )
Note that the integral in equation (28) is the Fourier transform of x(t), and therefore,
( )
which is the desired result given by entry (6) of Table A-1.
Alternate conventions and formulations
There are a number of variations on the the conventions and notations employed by mathematicians, electrical engineers, physicists, and geophysicists in formulating the Fourier transform. The conventions employed in Yilmaz's treatment are by no means universal. It is important to see what conventions an author is employing when studying results involving the Fourier transform. As long as consistency is maintained, all results will be equivalent, no matter what conventions are used.
When there are several choices to be made, it is a guarantee that some people will choose the conventions that you don't like. The choices that may be made are notational, and formulational. Mere notational changes will have little ramifications. However, choice of scaling, as to whether or not there is a factor of in front of the inverse transform will yield a result that has a different constant scaling factor, which must be dealt with in a self-consistent manner.
Is the represented by or by
Among electrical engineers, for example, it is common to see the definition because the symbol is often reserved to represent electric current. Particularly in older geophysical literature, or in papers and books produced by particular electrical-engineering oriented research groups, we may see the use of in this fashion.
A second convention is the choice of sign of the exponent of the exponential in the transform. For example a common convention is to choose a plus sign for the forward temporal (time to frequency) transform, requiring that a minus sign be chosen for the inverse (frequency to time) transform. The same authors often choose to use a negative sign for the forward spatial transforms, requiring a plus sign for the inverse temporal transforms. Thus, one common alternative representation for a temporal signal or a spatial signal
and
Causal Fourier transforms
Most signals encountered in the world of physical (and geophysical) measurement are causal, meaning that there is no signal before some critical time, which could be the arrival time of the earliest possible signal, or universally, time So prevalent are causal temporal functions in geophysics that we may consider the
where is an integration contour chosen in the complex plane to yield a causal time domain result. This causal contour choice translates into a requirement of analyticity in a half-plane of (either upper or lower) governed by the choice of the sign of the exponent in the exponential in the inverse transform.
Indeed, causal considerations are not confined to the temporal transform. For problems involving wave propagation, there is a relationship between the frequency and the wavenumber . The choice of integration path for the frequency to time transform will result in a shift of singularities in the inverse wavenumber transform. This shift will be determined by the sign convention for the inverse wavenumber to space transform.
Input and output variables
We may wish to make a distinction between input and output variables. If we are engaged in processing that involves the application of a Fourier transform, followed by an operation in the transform domain, which is subsequently followed by an inverse Fourier transform, the effect may result in a shift either in space or time. Thus, it is to our benefit to define the forward and inverse Fourier transforms making a distinction of input or output. For example we may write
and
Here are the input space and time variables, and are the output variables.
What about the
In many formulations of the Fourier transform we see a factor of in front of the inverse transforms. For example, our notations above would be represented as:
and
The ramifications of this extra factor of may be seen if we cascaded the forward and inverse temporal transform:
The result has to be and we can see by rearranging the order of integrations that we have
This implies that the expression in square brackets is equivalent to the Dirac delta function
Thus, any scaling factor on the inverse Fourier transform will change the definition of the Dirac Delta, and may propagate through calculations.
Angular frequency versus ordinary frequency
Another ramification of the choice of scaling is to consider the definition of We can immediately seen where the factor of comes from, noting that
and
There is no consistent convention for angular versus regular wavenumber, so the space- wavenumber transforms stay the same.
A.2 The z-transform
A discrete time function is called a time series. When digitized, the continuous function x(t) takes the form
( )
where Δt is the sampling interval and δ(t − kΔt) is the Dirac delta function. The discrete equivalent of the Fourier integral given by equation (13) is written as a summation
( )
A new variable z = exp(-iωΔt) now is defined. By substituting into equation (31) and explicitly writing the summation, we get
( )
Function X(z) in equation (32) is called the z-transform of x(t). It is a polynomial of the z variable. The power of z represents the time delay of the discrete samples in the time series x(t).
We now show that convolution of two time series is equivalent to the multiplication of their z-transforms. Consider two discrete time series — x(t) : (x_{0}, x_{1}, x_{2}) and f(t) : (f_{0}, f_{1}). Convolution of the two series is obtained by using Table 1-5. The results of the convolutional process are displayed in Table A-2.
Fixed Array: | ||||||||||||
a_{0}, a_{1}, a_{2}, a_{3}, a_{4}, a_{5}, a_{6}, a_{7} | ||||||||||||
Moving Array: | ||||||||||||
b_{0}, b_{1}, b_{2} | ||||||||||||
Given two arrays, a_{i} and b_{j}: | ||||||||||||
Step 1 : Reverse moving array b_{j}. | ||||||||||||
Step 2 : Multiply in the vertical direction. | ||||||||||||
Step 3 : Add the products and write as output c_{k}. | ||||||||||||
Step 4 : Shift array b_{j} one sample to the right and repeat Steps 2 and 3. | ||||||||||||
Convolution Table: | ||||||||||||
a_{0} | a_{1} | a_{2} | a_{3} | a_{4} | a_{5} | a_{6} | a_{7} | Output | ||||
b_{2} | b_{1} | b_{0} | c_{0} | |||||||||
b_{2} | b_{1} | b_{0} | c_{1} | |||||||||
b_{2} | b_{1} | b_{0} | c_{2} | |||||||||
b_{2} | b_{1} | b_{0} | c_{3} | |||||||||
b_{2} | b_{1} | b_{0} | c_{4} | |||||||||
b_{2} | b_{1} | b_{0} | c_{5} | |||||||||
b_{2} | b_{1} | b_{0} | c_{6} | |||||||||
b_{2} | b_{1} | b_{0} | c_{7} | |||||||||
b_{2} | b_{1} | b_{0} | c_{8} | |||||||||
b_{2} | b_{1} | b_{0} | c_{9} | |||||||||
where | ||||||||||||
The discrete output series y(t) : (y_{0}, y_{1}, y_{2}, y_{3}) is given by
( )
The z-transforms of the two input series are expressed by
( )
and
( )
By multiplying the two polynomials of equations (34) and (35), we obtain
( )
x_{0} | x_{1} | x_{2} | Output | ||
f_{1} | f_{0} | y_{0} | |||
f_{1} | f_{0} | y_{1} | |||
f_{1} | f_{0} | y_{2} | |||
f_{1} | f_{0} | y_{3} |
By comparing the coefficients of the polynomial given by equation (36) with the output of convolution in equations (33), we find that if
( )
then,
( )
and, since z = exp(-iωΔt),
( )
A.3 The 2-D Fourier transform
The 2-D Fourier transform of a 2-D function, such as a wavefield P(x, t), is given by
( )
Function P(x, t) can be reconstructed from P(k_{x},ω) by the 2-D inverse Fourier transform:
( )
The integral given by equation (40) is evaluated in two steps. First, by Fourier transforming in t,
( )
then by Fourier transforming in x, we get the 2-D transform:^{[2]}
( )
References
- ↑ ^{1.0} ^{1.1} Bracewell, R. N., 1965, The Fourier transform and its applications: McGraw-Hill Book Co.
- ↑ Yilmaz, O. and Cumro, D., 1983, Worldwide assortment of field seismic records: Tech. Rep., Western Geophysical Company.
See also
- Introduction to fundamentals of signal processing
- The 1-D Fourier transform
- The 2-D Fourier transform
- Worldwide assortment of shot records
- Gain applications
- Basic data processing sequence
- Exercises