We consider the problem of error detection in programs or specialised devices computing real functions f(x), where the argument x is represented in binary form. For error detection we use the linear check inequalities |∑τeTf(x ⊕ τ) − C| ≤ e, where e ≥ 0 is some given small constant, ⊕denotes componentwise addition mod 2 of binary vectors, T is some set of binary vectors and C is a constant. A method for the construction of a minimal check set T and constant C for the given f(x) and ɛ is proposed. This method is based on the techniques of Walsh transforms and least-absolute-error polynomial approximation. Several important examples of optimal checks for programs computing exponential, logarithmic and trigonometric functions will be given.
[1]
Cecil Hastings,et al.
Approximations for digital computers
,
1955
.
[2]
James L. Massey,et al.
Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972)
,
1973,
IEEE Trans. Inf. Theory.
[3]
Mark G. Karpovsky,et al.
Linear Checking Equations and Error-Correcting Capability for Computation Channels
,
1977,
IFIP Congress.
[4]
Robert J. Lechner.
HARMONIC ANALYSIS OF SWITCHING FUNCTIONS
,
1971
.
[5]
Garry J. Tee,et al.
Handbook for computing elementary functions
,
1968
.