A general linear theory is presented which describes the extension of the convolutional method to nonstationary processes. Two alternate extensions are explored. The first, called nonstationary convolution, corresponds to the linear superposition of scaled impulse responses of a nonstationary filter. The second, called nonstationary combination, does not correspond to such a superposition but is shown to be a linear process capable of achieving arbitrarily abrupt temporal variations in the output frequency spectrum. Both extensions have stationary convolution as a limiting form. The theory is then recast into the Fourier domain where it is shown that stationary filters correspond to a multiplication of the input signal spectrum by a diagonal filter matrix while nonstationary filters generate off-diagonal terms in the filter matrix. The width of significant off-diagonal power is directly proportional to the degree of nonstationarity. Both nonstationary convolution or combination may be applied in the Fourier domain, and for quasi-stationary filters, efficiency is improved by using sparse matrix methods. Unlike stationary theory, a third domain which combines time and frequency is also possible. Here, nonstationary convolution expresses as a generalized forward Fourier integral of the product of the nonstationary filter and the time domain input signal. The result is the spectrum of the filtered signal. Nonstationary combination reformulates as a generalized inverse Fourier integral of the product of the spectrum of the input trace and the nonstationary filter which results in the time domain output signal. The mixed domain is an ideal domain for filter design which proceeds by specifying the filter as an arbitrary complex function on a time-frequency grid. Explicit formulae are given to move nonstationary filters expressed in any one of the three domains into any other.

We have extended the method of stationary spiking deconvolution of seismic data to the context of nonstationary signals in which the nonstationarity is due to attenuation processes. As in the stationary case, we have assumed a statistically white reflectivity and a minimum-phase source and attenuation process. This extension is based on a nonstationary convolutional model, which we have developed and related to the stationary convolutional model. To facilitate our method, we have devised a simple numerical approach to calculate the discrete Gabor transform, or complex-valued time-frequency decomposition, of any signal. Although the Fourier transform renders stationary convolution into exact, multiplicative factors, the Gabor transform, or windowed Fourier transform, induces only an approximate factorization of the nonstationary convolutional model. This factorization serves as a guide to develop a smoothing process that, when applied to the Gabor transform of the nonstationary seismic trace, estimates the magnitude of the time-frequency attenuation function and the source wavelet. By assuming that both are minimum-phase processes, their phases can be determined. Gabor deconvolution is accomplished by spectral division in the time-frequency domain. The complex-valued Gabor transform of the seismic trace is divided by the complex-valued estimates of attenuation and source wavelet to estimate the Gabor transform of the reflectivity. An inverse Gabor transform recovers the time-domain reflectivity. The technique has applications to synthetic data and real data.

No abstract

A prestack time migration is presented that is simple, efficient, and provides detailed velocity information. It is based on Kirchhoff prestack time migration and can be applied to both 2-D and 3-D data. The method is divided into two steps: the first is a gathering process that forms common scatterpoint (CSP) gathers; the second is a focusing process that applies a simplified Kirchhoff migration on the CSP gathers, and consists of scaling, filtering, normal moveout (NMO) correction, and stacking. A key concept of the method is a reformulation of the double square‐root equation (of source‐scatterpoint‐receiver traveltimes) into a single square root. The single square root uses an equivalent offset that is the surface distance from the scatterpoint to a colocated source and receiver. Input samples are mapped into offset bins of a CSP gather, without time shifting, to an offset defined by the equivalent offset. The single square‐root reformulation gathers scattered energy to hyperbolic paths on the appropriate CSP gathers. A CSP gather is similar to a common midpoint (CMP) gather as both are focused by NMO and stacking. However, the CSP stack is a complete Kirchhoff prestack migrated section, whereas the CMP stack still requires poststack migration. In addition, the CSP gather has higher fold in the offset bins and a much larger offset range due to the gathering of all input traces within the migration aperture. The new method gains computational efficiency by delaying the Kirchhoff computations until after the CSP gather has been formed. The high fold and large offsets of the CSP gather enables precise focusing of the velocity semblance and accurate velocity analysis. Our algorithm is formulated in the space‐time domain, which enables prestack migration velocity analysis to be performed at selected locations and permits prestack migration of a 3-D volume into an arbitrarily located 2-D line.

The phase-shift method of wavefield extrapolation applies a phase shift in the Fourier domain to deduce a scalar wavefield at one depth level given its value at another. The phase-shift operator varies with frequency and wavenumber, and assumes constant velocity across the extrapolation step. We use nonstationary filter theory to generalize this method to nonstationary phase shift (NSPS), which allows the phase shift to vary laterally depending upon the local propagation velocity. For