Biresidue Error-Correcting Codes for Computer Arithmetic
- 1 May 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-19 (5) , 398-402
- https://doi.org/10.1109/t-c.1970.222937
Abstract
In an earlier paper [11] a scheme for detecting errors in ADD, COMPLEMENT, SHIFT, and ROTATE operations using a residue check circuitry was presented. A scheme for error location and correction in those operations is derived by a suitable application of a code called biresidue arithmetic code described here. Any single error position can be located and also corrected by use of two residue checkers which work separately and in parallel with the arithmetic unit. The estimated cost of redundancy is approximately the same as that required for duplication of the arithmetic unit.Keywords
This publication has 7 references indexed in Scilit:
- Error-Checking Logic for Arithmetic-Type Operations of a ProcessorIEEE Transactions on Computers, 1968
- Arithmetic codes with large distanceIEEE Transactions on Information Theory, 1967
- Error Codes for Arithmetic OperationsIEEE Transactions on Electronic Computers, 1966
- Self-checked computation using residue arithmeticProceedings of the IEEE, 1966
- Residue class error checking codesPublished by Association for Computing Machinery (ACM) ,1961
- Error Detecting and Correcting Binary Codes for Arithmetic OperationsIEEE Transactions on Electronic Computers, 1960
- The Residue Number SystemIEEE Transactions on Electronic Computers, 1959