Title :
The performance of a severely punctured convolutional code, some high rate distance-two block codes, and a Hamming code with maximum likelihood decoding
Author :
Michelson, Arnold M. ; Rosen, George
Author_Institution :
GTE Gov. Syst. Corp., Needham Heights, MA, USA
Abstract :
A severely punctured version of the well known rate-1/2, constraint length 7 convolutional code is considered for transmission of short to moderate length messages. Transmissions are assumed to be truncated by use of tail bits. By severely punctured the authors mean that the only redundancy conveyed is contained in the tail. It is shown that the resulting codes are high rate distance-2 codes and for certain message lengths they are cyclic. The figure of merit assumed is the probability of not correctly decoding a message, and, with maximum likelihood decoding, significant coding gains are demonstrated. In one case, a Hamming code results and its performance is determined. The coding gains observed range from 3.8 dB for the Hamming code to 2.4 dB for the longest distance-2 code considered, a (5040, 5034) code
Keywords :
Hamming codes; block codes; convolutional codes; cyclic codes; decoding; error correction codes; maximum likelihood estimation; redundancy; (5040, 5034) code; Hamming code; coding gains; cyclic code; distance-2 codes; figure of merit; high rate distance-two block codes; maximum likelihood decoding; messages; probability; rate-1/2 constraint length 7 convolutional code; redundancy; severely punctured convolutional code; tail bits; truncation; Additive white noise; Block codes; Circuits; Convolutional codes; Error correction; Maximum likelihood decoding; Redundancy; Signal detection; Tail; Viterbi algorithm;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.1994.577007