Design of Totally Self-Checking Check Circuits for m-Out-of-n Codes
IEEE Transactions on Computers
Modular Design of Asynchronous Circuits Defined by Graphs
IEEE Transactions on Computers
Note on Self-Checking Checkers
IEEE Transactions on Computers
Design of Totally Self-Checking Checker for 1-out-of-3 Code
IEEE Transactions on Computers
PLA Implementation of k-out-of-n Code TSC Checker
IEEE Transactions on Computers
Multivalued I2L Circuits for TSC Checkers
IEEE Transactions on Computers
Totally Self-Checking Checker for 1-out-of-n Code Using Two-Rail Codes
IEEE Transactions on Computers
| Hi-index | 14.99 |
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.