Paper Info
Title
Failure-Detecting Arithmetic Convolutional Codes and an Iterative Correcting Strategy
Abstract
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.
Year
DOI
Venue
2003
10.1109/TC.2003.1244941
Computers, IEEE Transactions
Keywords
Field
DocType
error correction,binary burst-correcting code,iterative feedback decoder processing,binary code,systematic convolutional code,iterative correcting strategy,failure-detecting arithmetic convolutional codes,arithmetic convolutional code,underlying basis code,new class,normal signed arithmetic,fixed-point arithmetic structure,fault tolerance,satisfiability,fixed point arithmetic,convolutional code,convolutional codes,error detection,binary codes,data processing
Concatenated error correction code,Convolutional code,Computer science,Low-density parity-check code,Block code,Turbo code,Serial concatenated convolutional codes,Arithmetic,Algorithm,Reed–Solomon error correction,Linear code
Journal
Volume
Issue
ISSN
52
11
0018-9340
Citations 
PageRank 
References 
1
0.36
5
Authors
1
Name
Order
Citations
PageRank
G. Robert Redinbo15415.28