Abstract:
A method is disclosed to provide optimal or near-optimal vertical stacking of seismic records within the constraints imposed by real time data acquisition procedures. This method is characterized by forming output seismic traces which are a sum of prorated input traces, such proration being performed by application of smoothly varying weight functions derived from estimated signal and noise power levels within each input trace. Each weight function is computed using frequency domain filtering techniques to obtain a well behaved bandlimited time series for each function. The method also includes a procedure for clipping grossly large noise spikes in the input traces before the stacking procedure is performed, thereby guarding the weight calculation procedure against aliasing effects induced by such spikes.

Description:
BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     This invention pertains to the data processing of seismic traces to suppress noise and more specifically to such processing of stacked data through the development and employment of improved weighting factors. 
     2. Description of the Prior Art 
     This invention is relevant to acquisition of seismic data in the field of geophysical exploration for petroleum and minerals. Although it is not restricted to exploration in either land or marine environments, this method is presented with primary emphasis on land seismic applications since this is the area in which it has the most direct and widespread application. 
     The general seismic prospecting method involves transmission of acoustic waves through the earth and reception of these waves at the earth&#39;s surface via transducers called geophones. Typically, these geophones are wired in parallel collections called groups in order to increase electrical signal levels and attentuate surface traveling noises. The acoustic waves may be generated by various types of sources, dynamite and hydraulic vibrators being the most common. As these waves propagate downward through the earth, portions of their energy are sent back toward the earth&#39;s surface through the effects of reflections and refractions which occur whenever abrupt changes in acoustic impedance are encountered. Since these impedance changes coincide with sedimentary layer boundaries it is possible to image the layers by appropriate processing of the signals returned to geophone groups. 
     The quality of the images obtained from seismic data processing is limited by three principal factors. First, the factor of spherical divergence causes the signal amplitude to decay in a manner which is inversely proportional to the distance traveled. Second, the effects of absorption due to the inelasticity of the media of propagation further reduces the available signal level. Finally, the effects of source generated and environmentally generated noise tend to mask whatever signal remains after divergence and absorption effects. In fact, it is the effect of noise which limits the depth to which the seismic method can penetrate. To some extent this limitation can be overcome by increasing the source signal strength so that the received signal level is raised relative to the noise. However, since there are practical limitations on the size of the source, a preferable approach is to suppress the noise level as much as possible. 
     The amount of achievable noise reduction and the techniques used to suppress noise differ according to the type of noise being attacked. Since source generated noise is not random and is repeatable over various trials it is difficult if not impossible to suppress it until the data is processed. On the other hand, noise which is not source generated is generally random and, even if it is not, it is almost certainly asynchronous with the data gathering sequence. These factors allow environmentally generated noise to be suppressed by techniques performed as the data is being acquired. 
     There are three techniques which are effective at reducing environmentally generated noise. First, it is possible in some cases to detect and edit noise bursts out of the acquired data. This technique is therefore referred to as noise or trace editing. Second, it is possible to cancel random noises by summing like traces acquired during successive repetitions of the data acquisition sequence This process is referred to as vertical stacking. Finally, the process of correlation provides an improvement in signal-to-noise ratio in cases where vibratory sources are used. 
     Seismic sources fall within one of two classifications, impulsive and non-impulsive. Impulsive sources are those which produce energy distributions which are highly time-limited but whose energy concentration is high. Typically, the signals produced by these are considered minimum phase or near-minimum phase time series, indicating that the rate of energy generation is as fast as possible for a given spectral energy distribution. As the bandwidth of such sources increases their corresponding output signals, or signatures, collapse in time. In the limit of infinite bandwidth, such signatures would reduce to what is referred to in signal processing literature as a delta function, a pulse of infinitesimal width and possessing infinite amplitude. Such pulses typically require little or no processing to reduce the pulse duration to acceptable limits. Conversely, non-impulsive sources are characterized by waveforms which are distributed in time which can have spectral energy densities which are comparable to impulsive sources but whose signatures persist in time and with lower amplitude. The signals produced by such sources are termed mixed-phase since the rate of energy generation is not as fast as their corresponding spectra will allow. One common conception of signals from non-impulsive sources is to consider them as concatenated collections of minute impulses of varying magnitude and sign. 
     Data collected from the use of non-impulsive sources such as vibrators always requires processing aimed at reducing the effective time duration of the signature. In such cases, a process known as correlation or matched filtering is applied to the data to collapse the pulse primarily by rotating the phase spectrum of the associated signature. While this process requires additional steps in processing, it does provide a certain amount of noise rejection. It also allows certain trace editing procedures to be performed prior to correlation which serve to suppress noise energy without seriously impacting the signal content of the processed output. This is intuitively evident by observing first of all that since a non-impulsive signal is broadly distributed in time, it is possible to remove small segments of it without detracting significantly from the total signal energy. Second, it can be observed that correlation applies the same phase adjustments to noise energy such that localized noise bursts which were once confined to a small time segment are spread over a broad segment of the data after correlation This later principle has the effect of increasing the signal-to-noise ratio of the correlated data provided that the noise bursts are not large and are randomly distributed throughout the traces. 
     In considering the effect of noise upon the output of the correlation procedure, it is first necessary to define two classifications of noise. The first type of noise to be considered is that which persists in time with the same statistical characteristics, such as noise associated with certain types of stationary mechanical and electrical equipment as well as ground unrest due to other noise generators that are asynchronous in nature and are far removed so that no single noise source is dominant. In statistical terms, such noise sources are characterized by probability density functions which are constant or &#34;stationary&#34; with time and as such they are termed stationary noise sources. Conversely, the second classification of noise sources involves those that are sporadic in nature, such as lightning and activity of the crew along a seismic line. Such noise sources are characterized by probability density functions that are time-variant and are termed &#34;non-stationary&#34; noise sources. 
     Differentiation between stationary and non-stationary noise sources can be ambiguous since the probability density functions obtained vary considerably with the size of the time gate over which the noise source is analyzed. For example, a noise source which produces pulses at half-second intervals would have a constant probability density function and would appear to be stationary if the analysis time gate were sufficiently long. Conversely, if the time gate is small the estimate of the probability density function tends to vary according to the number of noise pulses each contains and in such cases the noise would appear to be non-stationary. In the seismic case, the issue of stationarity is generally resolved by using time gates which are comparable to the period of the lowest frequency included in the signal. 
     The relative effects of stationary and non-stationary noises on correlated data quality can be seen by considering the nature of these noises and their effect on the correlation process. The phase shifts that occur during the correlation process have no effect on stationary noises since by definition stationary noises are already distributed throughout each input trace. Non-stationary noise sources on the other hand, can and typically do produce noise energy that arrives in bursts. The phase shifts associated with correlation then effectively smear the energy contained in the bursts into surrounding time segments. This will have effects that vary from being unnoticeable to that of corrupting the correlated trace and possibly the output trace into which it is summed. 
     The effect of correlation on data that contains noise bursts can be handled more analytically by recognizing that correlation is quite similar to convolution, the only difference being that in correlation one of the operand traces is effectively time reversed. By analogy, a noise burst embedded in an input trace is similar to a filter impulse response which is convolved with an input time series. The net effect on the output is to overlay a filtered and time reversed version of the correlation reference trace on top of the correlated trace. By this observation it is apparent that not only the amplitude of the noise burst but also its shape have a bearing on the manner in which the noise is transmitted into the correlated trace. 
     Considerations concerning the shape of noise bursts point up some potential pitfalls of noise limiting techniques since they can have a significant effect on the shape of noise bursts. Consider, for example, the pulse which results when an impulse is applied to a inelastic medium. This is very appropriate since the surface of the earth is generally very inelastic. The initial compressional lobe of the pulse peaks at a large amplitude are followed by a relaxational lobe that has substantially the same area but a lower peak amplitude and longer duration. The approach taken by some traditional limiter techniques would be to detect and clip the initial lobe but leave the second lobe intact since it is of lower amplitude. This approach has the intended effect of reducing the peak-to-peak amplitude of the pulse, however it also modifies the spectrum of the noise burst by introducing an additional low frequency content that could still correlate well with portions of the reference signal. In such cases, the net effect of clipping may be to trade off the frequencies at which the noise burst correlates with the reference In light of this, the ideal solution to the limiter problem would be to somehow detect and scale the entire noise burst down in amplitude to some optimal value. 
     One problem associated with the elimination of noise bursts is first, that it is difficult to determine relative amounts of signal and noise, and second, that it is difficult to discriminate against noise without also affecting signal. In the example given above, the only reason that the noise burst was recognized as such was that it has an anomolously high amplitude. On a trace by trace basis without any information other than the expected level and approximate bandwidth of the signal, the only criteria for noise burst detection is the presence of obvious amplitude anomalies. One advantage of using non-impulsive sources is that due to their mixed-phase quality their signal strength is relatively low and sharp changes in signal strength are rare. It is, therefore, easier to detect noise bursts due to their contrasting qualities of high levels and sharp onset. 
     Assuming that a noise burst is first detected, the problem then arises concerning the effective elimination of the noise while minimizing any effects on signal. Furthermore, as stated above, the problem of eliminating the noise burst without causing problems in the correlation results also exists. In addition to the basic technique of clipping noise bursts, several more elaborate schemes have been developed. A typical example of this is known as the recursive edit in which a time segment of the trace is zeroed starting at the last zero crossing before the noise burst and lasting for a specified amount of time after the burst. By zeroing all data between zero crossings this method attempts to minimize generation of high frequencies as well as the edge effects on correlation. Clearly, however, this does not recover the signal which was in the time segment along with the noise burst. A method first employed by Embree and discussed in his U.S. Pat. No. 3,398,396, neatly addresses problems of noise detection and suppression in one straightforward procedure. This procedure is called the Diversity Stack and has found wide application in suppressing non-stationary noise while preserving signal. 
     The power of the Diversity Stack procedure comes from exploitation of the fact that signal is invariant between input traces originating from the same geodetic receiver location and relationship to the source location. Assuming that signal is uncorrelated with noise the total energy within a trace time segment is given by: ##EQU1## 
     If it is assumed that S(t) is invariant between like trace time segments, any relative increase in Pi must be due to an increased noise level for that trace segment. Using this fact the Diversity Power Stack prorates corresponding segments of input traces according to the inverse of the energy within that segment before stacking each trace. A weight stack is also maintained as a record of the total weight applied to each trace sample so that the aggregate weighting can be removed when the stack is complete. This last step is referred to as stack normalization. 
     The following is a formal detailed analysis of optimal stacking in the presence of time-varying noise components which are characterized by sporadic increases in noise amplitudes: 
     Given a set of trace time series which originate from a single surface location as the result of multiple seismic excitations at a substantially constant surface location, each trace within the set may be described by G i  (t)=S i  (t)+N i  (t) where S i  (t) is the signal component containing useful seismic information and N i  (t) is the noise component consisting of sporadic time-variant noises and ambient time-invariant noise. The subscript  i  is used to indicate the trace within the set which arises from the i&#39;th seismic excitation at the source location. A generalized weighted trace stack is then given by ##EQU2## 
     By definition the signal S i  (t) is independent of i so that the above may be rewritten as ##EQU3## 
     The total energy in G(t) is ##EQU4## 
     Here the first term is the total signal energy and the second term represents the total noise energy in G(t) after weighting, stacking and normalization. 
     The optimal value for an arbitrary weight W k  is obtained by minimizing the noise energy term with respect to W k . Differentiating with respect to W k  ##EQU5## 
     Setting the numerator to zero and simplifying the following relationship is obtained: ##EQU6## 
     Upon inspection, it is apparent that the relationship W i  =C/η i  for i=1, M provides a general solution where C is an arbitrary constant. 
     Although W i  is not time varying, the above derivation may be extended to show that W i  (t)=1/η i  (t) is an optimal time varying weight function where η i  (t) is the noise energy in a time gate containing t. The only restriction is that this time gate be large enough to obtain an accurate estimate of η i  (t). 
     Substituting W i  =W i  (t), δ=δ(t) and η i  =η i  (t) into the above equations ##EQU7## 
     Assuming optimal weighting η(t) becomes ##EQU8## 
     The signal noise power ratio is then ##EQU9## where σ i  (t) is the signal to noise power ratio of the component traces. The signal to noise amplitude ratio is ##EQU10## 
     From these relationships for θ(t) and φ(t), it is evident that the signal to noise power ratio of the optimally weighted stack is equal to the sum of the signal to noise power ratios of the component traces. Furthermore when N i  (t), i=1, M are all stationary random time series with equal variance the signal to noise amplitude ratio reduces to ##EQU11## 
     Thus, the improvement in signal to noise ratio of the weighted stack is equivalent to that obtainable by unweighted stacking. In fact since W i  (t)=1/η i  (t)=1/η, the weighted stack becomes an unweighted stack in the absence of non-stationary noise components. 
     Since the actual relationship of signal and noise energies is not generally known, the approximation for W i  (t) must be based upon (δ(t)+η i  (t)) instead of η i  (t) alone. The first and most obvious approximation takes the form W i  &#39;(t)=C&#39;/(δ(t)+η i  (t)), but in this case W i  &#39;(t) underestimates W i  (t) except when δ(t)&lt;&lt;η i  (t). 
     In order to overcome this underestimation and optimize W i  (t) for estimated signal to background noise ratios an additional parameter β i  (t) is added so that the approximation becomes ##EQU12## 
     Since only relative weighting is of concern, the objective in evaluating β i  (t) is not to force W i  &#39;(t)=W i  (t) but rather d W i  &#39;(t)/dη i  (t)=dW i  (t)/dη 1  (t), or alternatively ##EQU13## 
     This relationship allows β i  (t) to be calculated based upon estimated or anticipated signal to noise ratios. Theoretically, there should be no upper bound on β i  (t). From a practical standpoint, however, it can be argued that when δ(t)/η i  (t)&gt;&gt;1, the signal to noise ratio of the component traces G i  (t) is already so large that any further increase in β i  (t) and consequently the weight function W i  (t) would have only marginal value. It may also be observed that when 
     δ(t)&lt;&lt;η(t), β(t) reduces to the value 2.0 as embodied in the Diversity Power Stack, consistent with the fact that it also assumes δ(t)&lt;&lt;η(t). 
     As mentioned previously the signal to noise power ratio δ(t)/η i  (t) is not generally known unless some type of coherence analysis is performed prior to stacking, but to do this on a large scale would certainly be cost prohibitive. Since the purpose of β i  (t) is to equivalence noise dependent variations in the optimal weight ω i  (t) and the approximate optimal weight Wi&#39;(t), some efficient criteria for estimating β i  (t) is needed in lieu of coherence analysis procedures. Here, a fairly accurate estimate can be made of expected noise power using time gates at the start and end of one or more component traces and assuming that the power observed in these gates is solely due to noise with both stationary and non-stationary components which are assumed to be uncorrelated. This estimate is given by ##EQU14## 
     The justification in using the median as opposed to another estimator such as the average is that it is not overly influenced by large noise bursts which happen to fall within an estimation gate. This tends to give an estimate for ηe that is nested within the noise estimates of the majority of the time gates. 
     Using this estimate the following approximations are made for δ(t) and β i  (t): ##EQU15## 
     This last expression allows the function β i  (t) to be computed on a per trace basis using quantities that are directly obtainable from the data, the total trace energy G i  (t) and the background noise estimate η e . The lower bound on β i  (t) is set due to knowledge that optimal β i  (t) never goes below 2 and values of β i  (t) which violate this constraint must be due to overestimation of ηe. By setting the lower limit of β i  (t) at 2, the risks associated with overestimation of the noise power are minimized by restricting β i  (t) from assuming values which are know to be sub-optimal in any case. 
     Since Embree&#39;s development of the Diversity Power Stack, Robinson, &#34;Statistically Optimal Stacking of Seismic Data&#34;, Geophysics, June 1970, and Smith et al., U.S. Pat. No. 4,561,075, have also addressed the theory of optimal stacking, both of these treatments further refined the development of the weight function. Methods proposed and evaluated by Robinson were directed toward optimizing weight functions with a minimal number of assumptions about the relative levels of signal and noise energies within the constituent traces. For this reason, the methods of weighting that Robinson developed were very robust but required a large amount of computation and memory storage capacity which made them impractical for real time field applications. Smith et al. on the other hand set forth a recording system which used the basic prior art Diversity Stacking method but went further in allowing selection of integer exponents other than 2 to compensate for signal to noise ratios that are comparable to or in excess of 1. The selection of the exponent was then based upon the expected relationship of signal and noise typical among all traces. Exponents which are greater than two result in a more dramatic suppression of trace amplitude for a given increase in noise energy than do exponents of lower orders. This provides a more optimal weighting of traces during periods of high signal to noise ratio with the consequence that later portions of the traces where the signal component has decayed are overly suppressed in the presence of sporadic noise bursts. 
     Traditional methods of computing the Diversity Stack typically use time domain linear interpolation between time segments to approximate the weight function, W(t), which causes two fundamental problems. First, the derivatives of W(t) are discontinuous, thus producing high frequencies in the spectrum of W(t). Since multiplication in the time domain is equivalent to convolution in the frequency domain, these higher frequency components will cause spectral smearing in the weighted trace. The second problem is that these methods produce inaccurate estimates of W(t), since the time relationship between the noise bursts and time segments is not controllable. 
     Therefore, it is a feature of the present invention to provide the development of an improved optimized seismic stack trace utilizing a weighted trace stack and a weight stack wherein the individual weight functions are determined on a one-to-one correspondence with the individual seismic traces following the removal of gross amplitude anomalies, the resulting weighted trace stack then being divided by the resulting weight stack. 
     It is another feature of the present invention to provide an improved procedure for developing the weights for individual traces whereby the development employs conversions of individual sampled digital data from the time domain to the frequency domain and back again to minimize the mathematical manipulations required for application of filters and the time decimation and converse resampling of time domain counterparts. 
     SUMMARY OF THE INVENTION 
     It is assumed that the individual recorded traces for a stack each includes noise as well as signal and that the noise includes time-variant and time-invariant portions. Furthermore, it i assumed that the signal components of all traces that are weighted and summed together are substantially identical. Generally, the method involves removing the gross amplitude anomalies from each individual trace, establishing a plurality of weight functions for each respective seismic trace, summing the weight functions to produce a weight stack, applying the individual weight functions to each of the traces and summing the result to produce a weighted trace stack, and finally, dividing the weighted trace stack by the weight stack to produce an optimized stack trace in which the signal component is enhanced and the noise component is suppressed. 
     The procedure for computing each particular weight function involves squaring each sample of a trace time series to obtain an instantaneous power time series, transforming the power time series to produce a frequency spectrum, low pass filtering this spectrum and truncating the resultant spectrum so as to effect time decimation of the corresponding time domain function, transforming the truncated spectrum to the time domain producing an energy envelope function which is decimated in time relative to the input trace, calculating a corresponding weight function by exponentiating each sample of the energy envelope function by a negative factor, transforming the weight function to the frequency domain, low pass filtering and expanding the resultant spectrum to reverse the effects of the previous time decimation, and transforming this expanded spectrum back to the time domain to produce a weight function having a common sampling interval with the input trace. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     So that the manner in which the above-recited features, advantages and objects of the invention, as well as others which will become apparent, are attained and can be understood in detail, more particularly description of the invention briefly summarized above may be had by reference to the embodiments thereof that are illustrated in the drawings, which drawings form a part of the specification. It is to be noted, however, that the appended drawings illustrate only preferred embodiments of the invention and are, therefore, not to be considered limiting of its scope for the invention may admit to other equally effective embodiments. 
     IN THE DRAWINGS 
     FIG. 1 is a waveform diagram of a typical weighted trace processed in accordance with the prior art method of performing the Diversity Power Stack. 
     FIG. 2 is a waveform diagram of the same input trace as in FIG. 1 weighted in accordance with the present invention so as to correspond with the waveform diagram shown in FIG. 1. 
     FIG. 3 is a process flow graph of the noise suppressed weighting process of a preferred sequence in accordance with the present invention. 
     FIG. 4 is a process flow graph of the noise suppressed stack normalization process of a preferred sequence in accordance with the present invention. 
     FIG. 5 is a block diagram of the noise suppressed stack weighting process in accordance with the present invention. 
     FIG. 6 is a block diagram of the noise suppressed stack normalization process in accordance with the present invention. 
     FIG. 7 is a process flow graph of the adaptive threshold limiter procedure. 
     FIG. 8 is a waveform diagram demonstrating the application of the adaptive threshold limiter procedure to a noise burst induced by recording system errors. 
     FIG. 9 is a waveform diagram demonstrating the application of the adaptive threshold limiter procedure to a noise burst generated by an environmental noise source. 
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     Now referring to the drawings, and first to FIGS. 1 and 2, a comparison of the Diversity Power Stack as practiced in the prior art and the Diversity Power Stack as implemented in the present invention, is illustrated. The weighting of a Diversity Power Stack is probably the closest procedure in the prior art to weighting in accordance with the present invention. In the procedure illustrated, the portion or plot gate of the selected input trace G i  (10) is shown in the time period between 4600 and 5598 milliseconds. The trace is assumed to include both a signal and a noise component. The trace is divided into time periods at 4800, 5000, 5200, and 5400 milliseconds. The weight function is determined for the inverse of the average amount of energy represented for each time period and a point is plotted at the mid-point for each time period, namely, at mid-points 12, 14, 16, 18 and 20. The points are then sequentially joined together by linear interpolation. It should be noted that the weight function is substantially zero at mid-point 16 in the time window having the largest average energy level, which also appears to include a great deal of spurious noise. For example purposes, it may also be seen that the weight function in the first time period is substantially the value of &#34;one&#34;. When the weight function is multiplied times the input trace, a weighted trace 22 is produced. 
     It is especially evident that the straight line interpolation between points 12, 14, 16, 18 and 20 has produced a weighted trace that is corrected for weighting values that are not accurately determined for each sampled point. Furthermore, the noise in the center time window of the weighted trace is still large and, therefore, if assumed to be signal is obviously giving false information to the investigator. 
     By contrast, the same input trace 10 is shown divided into the same time windows as shown in FIG. 1. A time window determines the filter width at 200 milliseconds. A smoothly changing weight function 24 is developed in accordance with the procedures hereafter described, which, in turn, determines the development of weighted trace 26, also in accordance with the procedures hereafter discussed. The exponential bias is selected to be 2.0, commensurate with the Diversity Power Stack. 
     For the FIG. 2 weighted trace, the meaningful signal appears to be approximately the same from time window to time window and, where it is known that a large amount of noise exists, namely, in the middle window, that covers up or obscures whatever meaningful signal might be present, the amplitude in the resulting weighted trace is purposely reduced because it is of very little value. 
     The development of the weighted trace and the development of a normalized trace from a weighted trace stack can best be set forth in a mathematical development. The following is a list of all operator, variable and vector names used in process flow charts of FIGS. 3 and 4. By convention all variables and vectors used in the context of the time domain are specified in printed form (i.e., A, B, C, etc.). All variables and vectors used in the context of the frequency domain are specified in script form (i.e., A, B, C, etc.). Indices pertaining to both time and frequency domains are always in lower case printed form. 
     
         ______________________________________          DEFINITION______________________________________OPERATORFFT              Forward Fast Fourier Trans-            form producing L/2 complex            frequency samples from L            real time samples.FFT.sup.-1       Inverse Fast Fourier            Transform producing L real            time samples from L/2            complex frequency samples.ATL              Adaptive Threshold Limiter            process used to clip large            spikes which would be            deleterious to the weighting            process.VARIABLE, CONSTANTOR VECTORi                Index variable used to            denote input trace being            processed by i&#39;th iteration            of weighting process. ι             ##STR1##j                Running index used to            specify elements within time            and frequency domain vec-            tors.k                Index limit used in specify-            ing the limits of values            which j assumes.N.sub.t          Total number of traces            processed by the weighting            process.G.sub.i          Time domain vector contain-            ing the input trace being            processed by the i&#39;th            iteration of the weighting            process.G.sub.w          The weighted trace stack            which is accumulated during            the N.sub.T iterations of the            weighting process. This            stack contains the final            normalized stack output            after the normalization            process.N.sub.g          Number of samples in G.sub.i and            G.sub.w.N                Number defined as first            power of 2 greater than N.sub.g.η            Defined as N/2 giving the            number of complex elements            in the output of FFT.F                Real vector containing the            time domain representation            of low pass filter used to            estimate energy envelope of            G.sub.i. Both positive and            negative time lags of the            filter are specified. A            zero phase filter is assumed            in this particular embodi-            ment. It is anticipated            that other filters could be            used.B                Exponential bias parameter.N.sub.f          Number of samples defining            non-zero duration of filter            F in both positive and            negative time.F                M.sub.f point complex frequency            spectrum corresponding to            filter impulse response F.M.sub.f          Number of complex points            required to accurately            estimate the actual filter F.            and its time domain counter-            part F.M                Size of FFT required for            frequency domain application            of filter F to N point time            series.M                Number defined as M/2.ε        η complex point vector used            to develop time-decimated            energy envelope E.P                N point real vector defined            as G.sub.i.sup.2 giving the instantan- - eous power of            G.sub.i as a            function of time.E.sub.d          Time-decimated energy envel-            ope estimate.D                Time decimation factor given            by D = N/M.W.sub.d          Time-decimated weight func-            tion vector consisting of M            real points.ω          M complex point vector used            to develop weight function            W.W                Weight function used to            weight G.sub.i during the i&#39;th            iteration of the weighting            process.V                The weight function stack            after frequency domain            interpolation back to            original time sampling rate.ν             The η  complex point frequen-            cy spectrum of the final            weight stack V. Only the            first M.sub.F points of this            spectrum are non-zero and            only these require storage.______________________________________ 
    
     The preferred procedure for developing a noise suppressed, weighted stack in accordance with the present invention involves the following steps as shown in FIG. 3 for computing and applying weight functions to each of a plurality of related input traces, adding the resultant weighted traces to a weighted trace stack and adding the weight function spectra to form a weight stack spectrum: 
     Step 301--Accumulator buffers for the weight stack and weighted trace stack are zeroed. Index i is set equal to one indicating the first trace to be processed. 
     Step 302--The adaptive threshold limiter procedure is applied to trace G i  to clip large amplitude anomalies prior to weighting. This procedure eliminates large spikes which would otherwise have a deleterious effect on weight function calculations. 
     Step 303--The N g  samples of trace G i  are squared on a sample-by-sample basis to obtain an instantaneous power time series. The series is further augmented to N samples as required for input to the FFT 304. 
     Step 304--The N sample time series P obtained in Step 303 is transformed to an η sample frequency spectrum ε via forward Fast Fourier Transform form in preparation for filtering and reduction of the resulting spectrum. 
     Step 305--Spectrum ε is multiplied by low pas filter F for the first M f  samples of the spectrum. This result is then augmented to M complex samples by padding with complex zeroes. Reducing the size of the spectrum to M complex points from its original size of η complex points results in spectral truncation which has the effect of sub-sampling or decimating the corresponding time series. The equivalent time domain effect of the filter application is a convolution of the filter&#39;s impulse response with the instantaneous power time series developed in step 302. Ideally, the impulse response of the filter is a center-weighted bell curve which has little or no side lobes and, hence, has no negative values of significant magnitude. Filter operators of this type have been referred to as finite time integrators since their net effect is to integrate time functions over limited time segments. Hence, application of this filter to the instantaneous power time series integrates the power values to form a time varying estimate of the energy which is local to each sample time. 
     Step 306--Truncated spectrum ε is transformed to the time domain yielding a time-decimated energy envelope function E d  having a sampling interval larger than the sampling interval of G i  by a factor of D=η/M, where M is the size of the truncated spectrum and η is the size of the untruncated spectrum generated at step 304. 
     Step 307--The center portion of weight function W d  is computed by exponentiating samples of E d  by a factor of -B/2. This has two effects. First, a multiplicative inversion of each sample takes place due to the negative valued exponent. Second, the magnitude of the exponent is adjusted to account for the fact that the input time series was squared in step 303, thereby compensating for values of exponential bias B other than 2.0. If B is equal to 2.0, this step reduces to multiplicative inversion of each sample necessary to form the weight function from the energy estimate. 
     Step 308--Since step 305 implied the time domain convolution of a low pass filter with the time series P, the energy envelope is invalid due to edge effects for a number samples at locations corresponding to the first N f  /2 samples of trace G i . Here the value of W d  at the decimated sampling time k=N f  /2D+1 is propagated into sample locations 1 through k-1 to compensate for the edge effect at the start of the time series W d . 
     Step 309--Also due to the edge effects of the convolution of step 305, the sample of W d  at decimated time sample k=(N g  -(N f  /2))/D is propagated into sample locations k+1 through M to compensate for the edge effect at the end of time series W d . 
     Step 310--The decimated weight function time series consisting of the M samples constructed in steps 307-309 is transformed to the frequency domain in preparation for spectral augmentation and optional low pass filtering. 
     Step 311--This step indicates the option to post filter the weight function spectrum to eliminate higher frequencies caused by the non-linear exponentiation performed at step 307. 
     Step 312--Low pass filter F is applied by complex multiplication of its spectrum with the weight function spectrum for M f  complex points. 
     Step 313--The weight function spectrum added to the weight stack spectrum υ. Since on M f  points of filter F are non-zero, only M f  points need to be added and only M f  points of υ require permanent storage. 
     Step 314--The weight function spectrum ω is augmented with complex zeroes to obtain a η complex point spectrum. This has the effect of resampling the corresponding time function, reversing the time decimation effects of steps 305 and 306. That is, the sampling interval between successive samples in the corresponding time domain function is decreased by a factor D=N/M corresponding to the original decimation. 
     Step 315--The inverse Fast Fourier Transform is applied to the η complex point weight function spectrum, producing a weight function whose sampling interval is equal to the sampling interval of the original trace G i . 
     Step 316--Trace G i  is multiplied by the first N g  samples of weight function W on a sample-by-sample basis and the result is added to weighted trace stack G w . 
     Step 317--Trace index i is incremented by one to the next trace to be processed. 
     Step 318--Trace index i is compared to N t , the total number of traces within the stack. If more traces remain, the above sequence is repeated starting at step 302. If no traces remain, the process of weighting and stacking ends. 
     After steps 302 through 318 have been performed for each trace input to the stack, the weight spectrum stack reflects the composite weighting applied through the weighting of individual traces. The weighted trace stack reflects the composite effects of summing weighted traces, hence the amplitude of the signal is a distorted version of the actual signal. In order to restore the weighted trace stack to its true amplitude relationships, the stack must be normalized by backing out the composite weight function. This is accomplished in steps 321 through 323 of FIG. 4 as follows: 
     Step 321--The weight stack spectrum υ, which was originally M f  points long, is augmented to η complex points by padding with complex zeroes. This has the effect of resampling the corresponding time domain function, reversing the time decimation effects of steps 305 and 306. That is, the time interval between successive samples is reduced by a factor equal to D=η/M, corresponding to the original decimation. 
     Step 322--The inverse Fast Fourier Transform is applied to the weight stack spectrum to υ to obtain a weight stack V consisting of a time series whose sampling interval is the same as the sampling interval of traces G i . 
     Step 323--The weighted trace stack G w  is normalized by dividing it by the weight stack V. In doing so the signal component of G w  is made identical within a constant scale factor to the signal component common to all traces input to the stack. 
     Now referring to FIGS. 5 and 6, a block diagram implementation of the above-described procedures are illustrated. The process of vertical stacking includes sequentially acquiring a plurality of input records, each one of which is the result of data acquisition associated with one injection of energy into earth&#39;s surface by the source. Furthermore, each such input record includes of a plurality of traces with each trace being associated with a single receiver. During each input record cycle a typical trace k is stored in data memory buffer k 120. At the end of the record cycle, trace k is processed by the adaptive threshold limiter 121 for the purpose of removing anomalously large spikes. Such spikes would typically be due to digital acquisition faults, atmospheric disturbances or the location of a noise source near to the receiver. The output of the adaptive threshold limiter 121 is then squared at block 122 to obtain a time series corresponding to the instantaneous power at each sample time. The Fast Fourier Transform 123 is then applied to the resultant time series to obtain the corresponding complex frequency series. This result is then subjected to low pass filter 124 which has the effect of a finite time integrator on the instantaneous power times series. The output of low pass filter 124 is then the complex frequency spectrum of a time series 
     estimates the energy that is local to corresponding sample times with the input trace G i  (t). The inverse Fast Fourier Transform is applied in block 125 to transform this spectrum back to the time domain. The size of the inverse FFT at this point is reduced to include only the samples of the spectrum that still contain energy after low pass filter application in filter 124. The reduction or truncation of this spectrum has the equivalent effect of increasing the time sampling interval in the output of inverse FFT 125 and hence the output is decimated in time. The resultant time series is then exponentiated in block 126 by a factor equal to -B/2. This has two effects, the first being that multiplicative inversion is performed on each sample of the time series. The second effect is that compensation is made for exponents other than 2. The forward Fast Fourier Transform at block 127 then transforms the resulting time series back to the frequency domain using an FFT size equivalent to that of inverse FFT 125. Low pass filter 128 is then optionally reapplied to eliminate high frequencies generated by the nonlinear operation of exponentiation in block 126. The inverse Fast Fourier Transform at block 129 is then applied. The size of this inverse FFT corresponds to the size of forward FFT 123 so that the resulting time series is returned to the original sampling interval of trace G i  (t) in data memory buffer 120. The resulting weight function is then multiplied at block 130 by trace G i  (t) from data memory buffer 120. This result is then added to the previous contents of corresponding locations in stack memory 131. The complex spectral output of low pass filter 128 is also added to reserved locations within stack memory accumulator 131 for the purpose of normalizing the weighted trace stack after the plurality of input traces have been weighted and accumulated into stack memory buffer k 131. 
     After weighting of the plurality of input traces is completed, the weight stack 132 and weighted trace stack 133 are withdrawn from stack memory accumulator buffer k 131, as shown in FIG. 6. The weight stack, which is in the complex frequency domain, is then transformed via inverse Fast Fourier Transform 134, which is of the same size as inverse Fast Fourier Transform 129, and as such, the resulting time series also has the same time sampling interval as the plurality of input traces obtained from data memory buffer k 120. The weighted trace stack 133 is then divided 135 by this time series so that the relative amplitude of signal in the final weighted and normalized stack trace is consistent with the signal found in each of the plurality of input traces G i  (t). The result is then stored back into stack memory accumulator buffer k 131. 
     The following is a description of all operators, parameters and variables used to describe the adaptive threshold limiter process in the process flow diagram of FIG. 7: 
     
         ______________________________________          Description______________________________________Operator namemin[. . .]       function that returns the            minimum value from a list of            arguments.sign[. . .]      function that assumes the            value +1 if its argument is            positive or zero or the            value -1 if its argument is            negative.Parameter of variableNamen                running index used to            specify sampling time.N                total number of sampling            times within input trace            G(n).G(n)             N length time series of            input trace samples.G&#39;(n)            N length time series of            amplitude limited trace            samples.A(n)             variable containing trace            amplitude estimate at            sampling time n.T(n)             variable containing limit            threshold at sampling time            n.P                parameter indicating number            of samples of G(n) to be            used in forming initial            amplitude estimate A(1).C                threshold multiplier con-            stant used to obtain thresh-            old T(n) from amplitude            estimate A(n).D                limit multiplier used to            establish the current limit            value DxA(n) at sampling            time n.h                filter hold count variable            used to determine the status            and duration of the filter            hold condition. The filter            hold condition exists if h            is zero or positive.            Otherwise, the filter is            allowed to track changes in            trace amplitude.H                integer parameter specifying            the value to which variable            h is set whenever G(n)            exceeds the value of T(n) at            the n&#39;th sampling time.α          parameter specifying adap-            tive filter time constant.______________________________________ 
    
     The overall strategy of the adaptive threshold limiter algorithm is to limit the magnitude of trace samples based upon a running estimate A(n) of the trace&#39;s average amplitude prior to sampling time n. With certain exceptions, the averaging technique has the characteristics of a simple first order recursive filter. The first exception is that samples of trace G(n) whose magnitudes exceed the limit threshold T(n) at sampling time n are not allowed to influence the output of the filter and, hence, do not influence the amplitude estimate A(n). Furthermore, no samples of trace G(n) are allowed to influence the amplitude estimate within a specified number of samples after an out-of-limit condition. The provision of this filter&#39;s hold feature is to allow uniform limiting across a series of amplitude anomalies that could otherwise cause the amplitude estimate and, hence the limit threshold, to grow undesirably. 
     For a given input trace G(n), the adaptive threshold limiter process begins by establishing an initial amplitude estimate A(1) of the trace for sampling time number 1. In the current embodiment, this estimate includes a simple arithmetic average 250 of the magnitudes of the first P samples in G(n). Another estimator such as the median value of the magnitudes of the first P samples could be used instead. The initial limit threshold T(1) 251 is formed by multiplying A(1) by threshold multiplier parameter C. Prior to processing the N samples of G(n), the hold count h 252 is set to a value of -1 indicating the absence of the hold condition and sampling time index 253 is set to one to indicate the first sampling time. Upon entering the sample processing loop the magnitude of G(n) 254 is compared to the current limit threshold T(n) for sampling time n. If |G(n)| exceeds T(n) the hold count h 256 is reset to a value equal to hold time parameter H. Otherwise, h is decremented by one to h=h-1 255 to mark the occurrence of a within-limit sample. Hold count h 255 or 256 is then compared to zero in comparison step 257. If h is greater than or equal to zero, the hold state exists and hence the new value A(n+1) is set equal in step 258 to the current estimate A(n). Furthermore, the magnitude of sample G(n) is limited in step 259 to a value which is less than or equal to the value D×A(n) and placed into output sample G&#39;(n) while preserving its original sign. If h is less than zero, the hold state does not exist and A(n+1) is set equal in step 260 to a weighted combination of A(n) and the magnitude of the trace sample G(n) at sampling time n. Furthermore, the sample G(n) is passed through in step 261 as output sample G&#39;(n) unchanged. The form of the equation in step 260 will be recognized as that of a single-pole, auto-regressive filter with a time constant of α. 
     The limit threshold T(n+1) for the next sampling time is then calculated from A(n+1) by multiplication step 262 by threshold multiplier parameter C. Sampling time index n is incremented in step 263 and compared in step 264 to the number of sampling times N. If n is less than or equal to N, the sequence returns to the top in step 252 of the sample processing loop, from which point the above process is repeated for the next sample. Otherwise, the processing of trace G(n) is terminated. 
     Two test cases for the adaptive threshold limit procedure are shown in FIGS. 8 and 9. In both cases the filter time constant T f  is set to 50 milliseconds and the threshold multiplier C is set to 6. 
     FIG. 8 demonstrates its application to a large noise burst caused by digital errors within the recording system. Due to the fact that limit multiplier D is set to one, the noise burst is limited to the value of the amplitude estimate A at the time of burst onset when the trace amplitude first exceeds the threshold function T. 
     FIG. 9 demonstrates the application of the adaptive threshold limiter to a moderately sized noise burst generated by an acoustic disturbance in the recording environment. In this case, the value of the limit multiplier D is equal to the value of the threshold multiplier C so that the burst is limited to the value of the threshold function T for the duration of the burst. It should be noted that the noise burst contains samples that fall within the threshold limits as well as those outside the threshold limits. Absence of the procedure&#39;s hold feature would cause both the amplitude estimate A and the threshold function T to grow undesirably throughout the noise burst due to the fact that the filter used to obtain the amplitude estimate would be influenced by all within-limit samples. 
     FIGS. 8 and 9 may also be used to demonstrate the preferred method of using the adaptive threshold limiter in conjunction with the noise suppression stacking procedure above. Note that in FIG. 8 the noise has been limited to a value approximately equal to the average of the trace amplitude prior to the burst, whereas in FIG. 9 the noise has been limited to a value equal to the threshold function at the time of burst onset. It should be observed that since the above suppression procedure weights traces inversely to their amplitudes, the burst of FIG. 8 will be undesirably accentuated by the weighting, in contrast to the burst in FIG. 9, which will receive proper treatment. In other words, it is desirable to limit noise bursts only to the extent that it is necessary to prevent aliasing effects in the weight computation and then let the suppression stacking perform its function of further limiting the burst. 
     While particular embodiments of the invention have been shown, it will be understood that the invention is not limited thereto. Many modifications may be made, which will become apparent to those skilled in the art. For example, it is assumed that the Fourier Transform steps can be efficiently performed using Fast Fourier Transform (FFT) procedures. These steps can each alternatively be performed using a Fast Hartley Transform (FHT) procedure instead or any other computationally efficient means of computing the forward and inverse Discrete Fourier Transforms.