On the check base selection problem for fast adders

Abstract

Considers the problem of selecting a suitable check base for on-line error detection by residue codes in fast adders. The dependency between structural properties of an adder and its set of possible error values is characterized. Based on this characterization an efficient procedure is developed for testing the appropriateness of a check base for a specific adder.<>