IEEE Transactions on Computers · 1983 · 10 citations · 32 references
EngineeringComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsBoolean AlgebraBoolean OperationsDigital Logic DesignError Control CodingError DetectionLogic SynthesisBitwise OperationsBoolean Function RepresentationBoolean FunctionsComplex Logic ModelsDigital Logic CircuitsError Detection CircuitsFault MaskingFault-tolerant Logic Design
In this paper, an algebraic model of fault-masking logic (FML) circuits, assuming bitwise logical operations and a separate single-valued coding system is presented. From this model, the neccessary and sufficient conditions to construct FML circuits are derived, and the error-propagating and error-correcting characteristics of such FML circuits are defined in terms of a Boolean vector algebra and a syndrome-like function. The capabilities and limitations of FML circuits are characterized and several constructive techniques are explored. Optimum FML constructions are developed for correcting a maximum number of faults in a minimum number of logic levels for simple logic structures. For complex logic structures, these constructions apply but it is not known if they are optimum. In addition, the enhancement of FML circuits with fault-detecting capabilities is developed in the event that the error-correcting capabilities of FML circuits should be exceeded.
32
R. G. Gallager, W. W. Peterson · Mathematics of Computation · 1962 · 2.1K citations
J. J. Stiffler · 1971 · 1.4K citations