A totally self-checking 1-out-of-3 checker
R David - IEEE Transactions on Computers, 1978 - computer.org
R David
IEEE Transactions on Computers, 1978•computer.org… It is probably true as far as only combinational checkers are concerned. Nevertheless, if
one can find a totally self-checking sequential circuit transcoding a 1-out-of-3 code into a
code for which a totally self-checking checker is known, then we have a solution to the
problem. We shall present such a transcoder, giving a 1-out-of-4 code from a 1-out-of-3 code. …
one can find a totally self-checking sequential circuit transcoding a 1-out-of-3 code into a
code for which a totally self-checking checker is known, then we have a solution to the
problem. We shall present such a transcoder, giving a 1-out-of-4 code from a 1-out-of-3 code. …
Abstract
Totally self-checking 1-out-of-m checkers are known for all m except for m= 3. The principle of the 1-out-of-3 checker presented is the following: the 1-out-of-3 code is transcoded in a 1-out-of-4 code by a sequential circuit which is totally self-checking.
computer.org
Showing the best result for this search. See all results