Totally Self-Checking Checker for 1-out-of-n Code Using Two-Rail Codes
- 1 July 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (7) , 677-681
- https://doi.org/10.1109/tc.1982.1676065
Abstract
A new design for a totally self-checking 1-out-of-n checker is presented. A comparison with other existing methods [1], [10] 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.Keywords
This publication has 5 references indexed in Scilit:
- Design of Totally Self-Checking Checker for 1-out-of-3 CodeIEEE Transactions on Computers, 1984
- Efficient Design of Self-Checking Checker for any m-Out-of-n CodeIEEE Transactions on Computers, 1978
- A Totally Self-Checking 1-Out-of-3 CheckerIEEE Transactions on Computers, 1978
- Note on Self-Checking CheckersIEEE Transactions on Computers, 1974
- Design of Totally Self-Checking Check Circuits for m-Out-of-n CodesIEEE Transactions on Computers, 1973