Fourier transform - book
|Series||Geophysical References Series|
|Title||Digital Imaging and Deconvolution: The ABCs of Seismic Exploration and Processing|
|Author||Enders A. Robinson and Sven Treitel|
|Store||SEG Online Store|
What is the Fourier transform (or spectrum) of a wavelet? Recall that in Chapter 6, we learned about the Fourier transform and its many applications for using a system’s time function to determine the system’s frequency function. Now we will extend this discussion and give more applications. The time functions in question will be Wavelets.
Geophysicists follow the same convention that electrical engineers use with respect to the Fourier transform. This practice is wise because electrical engineers write most of the books on digital filtering. Specifically, electrical engineers choose to use (which has a negative sign) in their definition of the Fourier transform and not (which has a positive sign), as mathematicians usually do. The variable f represents cyclical frequency in units of hertz (i.e., cycles per second). The electrical engineering version of the Fourier transform (or spectrum) of a two-sided wavelet b is
where A(f) is the amplitude spectrum, where is the phase-lead spectrum and where is the phase-lag spectrum. The phase-lag spectrum is the negative of the phase-lead spectrum. Either one can be called the phase spectrum. However, because the exponential in the Fourier transform carries a negative sign, the choice of , which also has a negative sign in the exponential, seems to be favored. For that reason, we choose to let the word phase refer to the phase lag and not to the phase lead . For example, the Fourier transform of the unit delay (which is 1 for n = 1 and 0 otherwise) is simply
so the phase spectrum (i.e., the phase-lag spectrum) is .
The sampling frequency is . Thus,
which shows that the spectrum is periodic with a period equal to the sampling frequency. Often, it is more convenient to compute the spectrum over the range instead of the more usual Nyquist range , to which we were introduced in Chapter 4.
If we define the time unit not as 1 s but as the sampling interval (so ), then . The variable represents angular frequency in units of cycles per radian. As a result, the Fourier transform becomes
where the Nyquist range is .
What is the Fourier transform (or spectrum) of the zero-point reverse wavelet? The spectrum of the zero-point reverse of the wavelet b is
Thus, the zero-point reverse wavelet has an amplitude spectrum that is the same as the wavelet’s amplitude spectrum, and it has a phase spectrum that is the negative the wavelet’s phase spectrum.
What is the discrete Fourier transform? Often, we deal with a finite wavelet of length N + 1, whose coefficients may be complex. Its Fourier transform reduces to the discrete Fourier transform (DFT)
where for k 0, 1, …, N – 1. The inverse discrete Fourier transform (IDFT) is
for n = 0, 1, …, N – 1. The fast Fourier transform (FFT) (Cooley and Tukey, 1965) gives a computationally efficient way of computing the DFT and its inverse.
- ↑ Cooley, J. W., and J. W. Tukey, 1965, An algorithm for the machine calculation of complex Fourier series: Mathematics of Computation, 19, 297–301.
|Previous section||Next section|
|Previous chapter||Next chapter|
Also in this chapter
- Delay: Minimum, mixed, and maximum
- Two-length wavelets
- Illustrations of spectra
- Delay in general
- Canonical representation
- Zero-phase wavelets
- Symmetric wavelets
- Ricker wavelet
- Appendix G: Exercises