DocumentCode :
1117710
Title :
Error-Correcting Codes for Byte-Organized Arithmetic Processors
Author :
Neumann, Peter G. ; Rao, Thammavarapu R.N.
Author_Institution :
Computer Science Group, Stanford. Research Institute
Issue :
3
fYear :
1975
fDate :
3/1/1975 12:00:00 AM
Firstpage :
226
Lastpage :
232
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 :
AN codes, arithmetic codes, biresidue codes, byte-organized, gAN, low-cost residues, multiresidue codes, non-binary codes.; Adders; Arithmetic; Availability; Circuit faults; Computerized monitoring; Error correction; Error correction codes; Large scale integration; Logic circuits; Redundancy; AN codes, arithmetic codes, biresidue codes, byte-organized, gAN, low-cost residues, multiresidue codes, non-binary codes.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1975.224203
Filename :
1672796
Link To Document :
بازگشت