A group-theoretic framework for fault-tolerant computation

A general technique for protecting computation with systematic-separate codes is presented. These codes use parity symbols to check the result of computation. A group-theoretic approach and model computation are used as operations in an algebraic group. It is shown that in order for a code to commute with computation, it must define a homomorphism between the original group and the group of parity symbols. A quotient group isomorphism is applied, and the problem of finding coding schemes is reduced to that of finding normal subgroups. In many instances, the method can be shown to identify all possible systematic-separate codes. For a given code, conditions on errors are given so that they may be detected and corrected. The extension of the technique to other algebraic systems is discussed, and two examples are included.<<ETX>>

[1]  Harvey L. Garner Error Codes for Arithmetic Operations , 1966, IEEE Trans. Electron. Comput..

[2]  R. Blahut Theory and practice of error control codes , 1983 .

[3]  Paul E. Beckmann,et al.  Fault-tolerant round-robin A/D converter system , 1991 .

[4]  I. Herstein,et al.  Topics in algebra , 1964 .

[5]  Jacob A. Abraham,et al.  Algorithm-Based Fault Tolerance for Matrix Operations , 1984, IEEE Transactions on Computers.

[6]  W. W. Peterson On Checking an Adder , 1958, IBM J. Res. Dev..

[7]  G. Robert Redinbo System level reliability in convolution computations , 1989, IEEE Trans. Acoust. Speech Signal Process..