NEW SHORT CONSTRAINT LENGTH RATE (N-1)/N PUNCTURED CONVOLUTIONAL-CODES FOR SOFT-DECISION VITERBI DECODING

被引：12

作者：

HOLE, KJ ^{[1
]}

机构：

[1] UNIV BERGEN, DEPT INFORMAT, N-5014 BERGEN, NORWAY

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1988年 / 34卷 / 05期

关键词：

Decision Theory and Analysis;

D O I：

10.1109/18.21236

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Punctured convolutional codes with good performance are reported for rates (n-1)/n with n = 5,6,7,8 and constraint lengths k = 2,3,...,6. The tabulated codes are nonsystematic binary convolutional codes with maximum free distance and minimum information weight, for use with soft-decision Viterbi decoding.

引用

页码：1079 / 1081

页数：3

共 8 条

[1]

BRUN OH, 1986, EVALUATION CONVOLUTI

[2] PUNCTURED CONVOLUTIONAL CODES OF RATE (N-1)-N AND SIMPLIFIED MAXIMUM LIKELIHOOD DECODING [J].