Efficient design of totally self-checking checkers for all low-cost arithmetic codes
- 1 July 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 37 (7) , 807-814
- https://doi.org/10.1109/12.2226
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Totally Self-Checking Checkers for Low-Cost Arithmetic CodesIEEE Transactions on Computers, 1985
- Design of Totally Self-Checking Comparators with an Arbitrary Number of InputsIEEE Transactions on Computers, 1984
- Totally Self-Checking Checker for 1-out-of-n Code Using Two-Rail CodesIEEE Transactions on Computers, 1982
- Detection of Storage Errors in Mass Memories Using Low-Cost Arithmetic Error CodesIEEE Transactions on Computers, 1978
- On Totally Self-Checking Checkers for Separable CodesIEEE Transactions on Computers, 1977
- Detection of Unidirectional Multiple Errors Using Low-Cost Arithmetic CodesIEEE Transactions on Computers, 1975
- Design of Totally Self-Checking Check Circuits for m-Out-of-n CodesIEEE Transactions on Computers, 1973
- Concurrent Error Detection for Group Look-ahead Binary AddersIBM Journal of Research and Development, 1970
- Error Detecting and Correcting Binary Codes for Arithmetic OperationsIEEE Transactions on Electronic Computers, 1960
- On Checking an AdderIBM Journal of Research and Development, 1958