Codes for High Speed Arithmetic and Burst Correction.
Abstract
An analytic technique for analyzing the burst-error correcting and detecting capabilities of codes with a generator factor ((x sup p) - 1)((x sup q) - 1) have been developed. The Gilbert algebraic code and Gilbert AN code have been shown to have near optimal burst-error correcting and detecting capabilities. Several examples have been shown using this technique to investigate codes with any generator polynomial. Three kinds of errors which occur very often in high speed arithmetic have been analyzed. Three classes of arithmetic codes have been constructed to correct those three kinds of errors. Those codes have very simple encoding circuits, hence they are highly feasible for implementation. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1973
- Accession Number
- AD0758314
Entities
People
- Rouh Tyan Bow
Organizations
- University of Illinois Urbana–Champaign