Skip to Main Content
A new design for a totally self-checking 1-out-of-n checker is presented. A comparison with other existing methods ,  is given. It is shown that for many practical values of n the new scheme requires less hardware and/or is faster than the other methods. The entire checker can be tested by applying all of the n possible 1-out-of-n inputs.