On Totally Self-Checking Checkers for Separable Codes
- 1 August 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-26 (8) , 737-744
- https://doi.org/10.1109/tc.1977.1674911
Abstract
Design of totally self-checking (TSC) checkers for separable codes is studied. Assuming a specific checker design, a sufficient condition on separable codes is derived such that the assumed checker is TSC. It is shown that the proposed checker is applicable to certain Berger codes and residue codes. A class of codes equivalent to Berger codes is derived for which the proposed checker is TSC.Keywords
This publication has 17 references indexed in Scilit:
- On Totally Self-Checking Checkers for Separable CodesIEEE Transactions on Computers, 1977
- Implementation of an Experimental Fault-Tolerant Memory SystemIEEE Transactions on Computers, 1976
- Partially Self-Checking Circuits and Their Use in Performing Logical OperationsIEEE Transactions on Computers, 1974
- Arithmetic Algorithms for Error-Coded OperandsIEEE Transactions on Computers, 1973
- Design of Totally Self-Checking Check Circuits for m-Out-of-n CodesIEEE Transactions on Computers, 1973
- Logic Design for Dynamic and Interactive RecoveryIEEE Transactions on Computers, 1971
- Arithmetic Error Codes: Cost and Effectiveness Studies for Application in Digital System DesignIEEE Transactions on Computers, 1971
- A note on error detection codes for asymmetric channelsInformation and Control, 1961
- Generalized Parity CheckingIEEE Transactions on Electronic Computers, 1958
- On Checking an AdderIBM Journal of Research and Development, 1958