The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2003 vol.52)
pp: 1434-1442
ABSTRACT
<p><b>Abstract</b>—Errors due to failures in data processing algorithms may be detected and even corrected by employing systematic convolutional codes defined over the fixed-point arithmetic structures supporting the computations. A new class of arithmetic convolutional codes using symbols from the finite ring associated with normal signed arithmetic is based on binary burst-correcting codes and a code's performance in the larger context exceeds that of an underlying basis code. When failures satisfy the usual guard band requirements for the binary code, error correction is possible using an iterative feedback decoder processing syndromes that are defined over the integers modulo a power of two. A class of high rate burst-correcting codes is discussed in more detail and their properties guarantee the detection of the onset of errors. The corrector also contains failure error-detecting capabilities.</p>
INDEX TERMS
Algorithm-based fault tolerance, convolutional codes over integers, iterative decoding, free modules, fixed-point arithmetic, burst-correcting codes, syndrome decoding, real number codes.
CITATION
G. Robert Redinbo, "Failure-Detecting Arithmetic Convolutional Codes and an Iterative Correcting Strategy", IEEE Transactions on Computers, vol.52, no. 11, pp. 1434-1442, November 2003, doi:10.1109/TC.2003.1244941
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool