Journal ArticleDOI
Error-propagation properties of uniform codes
TLDR
Comparison of the performance of an ordinary feedback decoder with a genie-aided feedbackDecoder, which never propagates errors, indicates that error propagation with uniform codes is a minor problem if the optimum orthogonalization rules are used, but that the situation is somewhat worse with nonoptimum orthogonaization.Abstract:
The problem of error propagation in uniform codes is investigated using the concept of parity-parallelogram submatrices and the threshold-decoding algorithm. A set of optimum orthogonalization rules is presented and it is shown that if these rules are incorporated into the decoder, then sufficient conditions can be found for the return of the decoder to correct operation following a decoding error. These conditions are considerably less stringent than the requirement that the channel be completely free of errors following a decoding error. However, this is not the case if the prescribed orthogonalization rules are not followed, as is demonstrated with a simple example. It is also shown that the syndrome memory required with Massey's orthogonalization procedure for definite decoding of uniform codes is the lowest possible. The results of simulation of the rate \frac{1}{4} and \frac{1}{8} uniform codes are presented, and these codes are seen to make fewer decoding errors with feedback decoding than with definite decoding. Comparison of the performance of an ordinary feedback decoder with a genie-aided feedback decoder, which never propagates errors, indicates that error propagation with uniform codes is a minor problem if the optimum orthogonalization rules are used, but that the situation is somewhat worse with nonoptimum orthogonalization.read more
Citations
More filters
Journal ArticleDOI
Error propagation and definite decoding of convolutional codes
TL;DR: A decoding method having no internal feedback, definite decoding (DD), is formalized and it is shown that a code using FD with limited L exists if and only if that same code can be decoded using DD.
Journal ArticleDOI
A.Construction for Convolutional Codes Using Block Codes
Sudhakar M. Reddy,J.P. Robinson +1 more
TL;DR: It is shown that any linear binary uniform convolutional code can be constructed using a MacDonald block code in the simplest algorithm.
Journal ArticleDOI
A decoding algorithm for some convolutional codes constructed from block codes
Sudhakar M. Reddy,J.P. Robinson +1 more
TL;DR: A new decoding algorithm for some convolutional codes constructed from block codes is given and it is shown that the codes obtained from one-step orthogonalizable block codes are majority decodable.
Journal ArticleDOI
Comments on "A New Random-Error-Correction Code"
TL;DR: This correspondence investigates the error propagation properties of six different systems using a (12, 6) systematic double-error-correcting convolutional encoder and a one-step majority-logic feedback decoder and finds a third system which, even if temporary hardware errors in the decoder are taken into account, is superior to the system proposed by En.
Journal ArticleDOI
Punctured uniform codes
TL;DR: From this lattice, punctured uniform codes, i.e., uniform codes with parity bits deleted, are constructed, which can be threshold decoded and have limited error propagation.
References
More filters
Journal ArticleDOI
A class of binary recurrent codes with limited error propagation
J.P. Robinson,A. Bernstein +1 more
TL;DR: A class of binary recurrent codes for correcting independent errors is given which has guaranteed error-limiting properties and the results of a computer simulation indicate that these codes perform better in some situations than other codes using threshold decoding.
Journal ArticleDOI
Application of Lyapunov's direct method to the error-propagation effect in convolutional codes (Corresp.)
J. Massey,R. Liu +1 more
Journal ArticleDOI
Error propagation and definite decoding of convolutional codes
TL;DR: A decoding method having no internal feedback, definite decoding (DD), is formalized and it is shown that a code using FD with limited L exists if and only if that same code can be decoded using DD.
Book ChapterDOI
Advances in Threshold Decoding
TL;DR: It seems highly significant that most of the new codes found for implementation by threshold decoders have their origins in number theory rather than in algebra, which promises to provide additional classes of codes suitable for threshold decoding.
Journal ArticleDOI
Uniform codes
TL;DR: It is shown that the error performance of these classes of codes is nearly identical but that the uniform codes have simpler encoding circuits, which is of importance in space applications.
Related Papers (5)
The serial concatenation of rate-1 codes through uniform random interleavers
Henry D. Pfister,Paul H. Siegel +1 more