- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
ISRN Applied Mathematics
Volume 2012 (2012), Article ID 630702, 7 pages
Sign Data Derivative Recovery
1Louisiana Accelerator Center, The University of Louisiana at Lafayette, Lafayette, LA 70504-4210, USA
2Ion Beam Modification and analysis Laboratory, Department of Physics, University of North Texas, Denton, TX 76203, USA
Received 2 November 2011; Accepted 29 November 2011
Academic Editors: J. Shen and F. Zirilli
Copyright © 2012 L. M. Houston et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Given only the signs of signal plus noise added repetitively or sign data, signal amplitudes can be recovered with minimal variance. However, discrete derivatives of the signal are recovered from sign data with a variance which approaches infinity with decreasing step size and increasing order. For industries such as the seismic industry, which exploits amplitude recovery from sign data, these results place constraints on processing, which includes differentiation of the data. While methods for smoothing noisy data for finite difference calculations are known, sign data requires noisy data. In this paper, we derive the expectation values of continuous and discrete sign data derivatives and we explicitly characterize the variance of discrete sign data derivatives.
Sign-bit recording systems discard all information on the detailed motion of the geophone and ask only whether its output is positive or negative, whether it is going up or coming down. In a sign-bit system, therefore, the signal waveform is converted into a square wave. All amplitude information is lost .
It is well known that, for a range of signal-to-noise ratios between about 0.1 and 1, the final result of sign-bit recording, after stacking, correlating, and other processing, looks no less good, to the eye, than the result from full-fidelity recording. This is considered to be as intriguing as it is surprising . Alternatively, what we present in this paper is evidence that the processing of sign-bit data (i.e., sign data) can be limited for certain cases relative to the processing of the full-bandwidth data.
Model signal appears as a one-dimensional function, , and noise as a random variable, . In industries like the seismic industry, measurements of signal, and noise, , are recorded for multiple iterations of the noise. The average of the measurement (i.e., the expectation ) recovers the signal If the noise is chosen to be uniform, where is the density function such that then the variance, , reduces to As reported by O’Brien et al. , it was empirically discovered that the average of the signs of signal plus noise recovers the signal if the signal-to-noise ratio is less than or equal to one. This can be shown mathematically  using the signum function , , , , Because is even and equals The variance is , reducing to Consequently, the error is minimal when the signal-to-noise ratio is near unity.
The advantage of retaining only the signs of signal plus noise is the requirement of approximately 1 bit to record the information as opposed to requiring 16 to 20 bits to record full amplitude data .
The goal of this paper is to examine the recovery of derivatives from sign data in uniform noise. The issue is that recovery of signal from sign data can be extended to recovery of derivatives of the signal through the use of finite differences and that recovery is constrained by the size of the variance. In this paper, we first examine sign data derivatives for both the discrete and continuous case. We follow with a derivation of variance. We conclude our analysis with a computational test, which lists the true variance versus the variance estimate derived statistically for a test function for selected step sizes.
2. Sign Data Derivatives
Let the signal be an th order differentiable function. Based on signal recovery from sign data, it can be shown that derivatives of the signal are also recoverable. Using the linearity of the expectation value, where is the th order finite difference operator with respect to the variable . In this case, a nonunit step size, , is used (e.g., ).
In detail, we can write where the notation represents the binomial coefficient and where are independent representations of the random variable, .
Substituting from (1.6) into (2.1) yields In the limit of infinitesimal step size, this becomes a continuous derivative or Equation (2.4) presents an alternative solution to direct integration. For example, using the rule, , , the integral loses all terms with derivatives of the delta functional, reducing to In general, It follows that the noise is restricted such that .
3. The Variance of Sign Data Derivatives
Letting , compute the variance, . From (2.3), it follows that . can be found by inductively generalizing from : where , , and .
These results generalize to Since is differentiable, and, thus, is finite. Based on definition, .
Consequently, . Similarly, . The variance of a discrete sign derivative approaches infinity with decreasing step size and increasing order. In addition, since , , so in the case of the continuous derivatives (2.5) the variance is infinite.
Use (3.2) to find the variance of the first discrete sign derivative by letting : The variance of the second discrete sign derivative () is similarly computed as
4. Computational Tests
These results can be tested computationally. Variance can be estimated for iterations with where the index designates the sample number.
Consider the test function . Using the first-order sign data derivative (), compare to , and using the second-order sign data derivative (), compare to for , , and . The results are shown in Tables 1 and 2.
We illustrate the change in variance in Figure 1, which shows three curves, each consisting of iterations. The first curve in blue shows the sign data recovery of the function or for and . The second curve in green shows the sign data recovery , which approximates for and . The third curve in red shows the sign data recovery , which approximates for and .
Recovery of signal from the signs of signal plus noise incurs a variance, which only depends on the noise amplitude, while recovery of discrete derivatives from the signs of signal plus noise (i.e., sign data) incurs a variance which grows infinite for infinitesimal step size and infinite order.
The application problem is that sign data can be used in the seismic industry in processes which may differentiate the data. In such cases, if the step size or order of the finite difference is not constrained, the process will incur large variance and convergence of the process will be minimized. While methods for smoothing noisy data for finite difference calculations are known, sign data requires noisy data. In this paper, we have characterized the problem by explicitly evaluating the variance of discrete sign data derivatives.
Thanks are due to Gwendolyn Houston for advice and proofreading.
- N. A. Anstey, Seismic Prospecting Instruments, Gebruder Borntraeger, Berlin, Germany, 2nd edition, 1981.
- J. T. O'Brien, W. P. Kamp, and G. M. Hoover, “Sign-bit amplitude recovery with applications to seismic data,” Geophysics, vol. 47, no. 11, pp. 1527–1539, 1982.
- L. M. Houston and B. A. Richard, “The Helmholtz-Kirchoff 2.5D integral theorem for sign-bit data,” Journal of Geophysics and Engineering, vol. 1, no. 1, pp. 84–87, 2004.
- R. A. Gabel and R. A. Roberts, Signals and Linear Systems, Wiley, New York, NY, USA, 3rd edition, 1987.
- W. G. Kelley and A. C. Peterson, Difference Equations, Academic Press, Boston, Mass, USA, 1991.
- D. M. Dubois, “Computing anticipatory systems with incursion and hyperincursion, computing anticipatory systems,” in Proceedings of the 1st International Conference on Computing Anticipatory Systems (CASYS '98), vol. 437 of AIP Conference Proceedings, pp. 3–29, The American Institute of Physics, 1998.
- G. Arfken, Mathematical Methods for Physicists, Academic Press, New York, NY, USA, 1966.