Error-Correcting Codes for Byte-Organized Arithmetic Processors
- 1 March 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-24 (3) , 226-232
- https://doi.org/10.1109/t-c.1975.224203
Abstract
This paper considers codes with radix r > 2 which are capable of correcting arbitrary arithmetic errors in any radix r digit. If each radix r digit represents a byte of b binary digits (e.g., r = 2b), these codes correct any combination of errors occurring in the b binary digits of any single byte. A theoretical basis for these codes is presented, along with practical considerations regarding their applicability.Keywords
This publication has 15 references indexed in Scilit:
- Detection of Storage Errors in Mass Memories Using Low-Cost Arithmetic Error CodesIEEE Transactions on Computers, 1978
- An Organization for a Highly Survivable MemoryIEEE Transactions on Computers, 1974
- A General Class of Maximal Codes ror Computer ApplicationsIEEE Transactions on Computers, 1972
- Analog techniques for residue operationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- The STAR (Self-Testing And Repairing) Computer: An Investigation of the Theory and Practice of Fault-Tolerant Computer DesignIEEE Transactions on Computers, 1971
- Arithmetic Error Codes: Cost and Effectiveness Studies for Application in Digital System DesignIEEE Transactions on Computers, 1971
- Concurrent Error Detection for Group Look-ahead Binary AddersIBM Journal of Research and Development, 1970
- Biresidue Error-Correcting Codes for Computer ArithmeticIEEE Transactions on Computers, 1970
- Error-Checking Logic for Arithmetic-Type Operations of a ProcessorIEEE Transactions on Computers, 1968
- Error Detecting and Correcting Binary Codes for Arithmetic OperationsIEEE Transactions on Electronic Computers, 1960