LINEAR RECURRING SEQUENCES AND THE PATH WEIGHT ENUMERATOR OF A CONVOLUTIONAL CODE

被引：7

作者：

FITZPATRICK, P ^{[1
]}

NORTON, GH ^{[1
]}

机构：

[1] UNIV BRISTOL,FAC ENGN,CTR COMMUN RES,BRISTOL BS8 1TR,AVON,ENGLAND

来源：

ELECTRONICS LETTERS | 1991年 / 27卷 / 01期

关键词：

CONVOLUTION; CODES AND CODING;

D O I：

10.1049/el:19910062

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The theory of integer recurrence relations is applied to give a new algebraic algorithm SYN ENUM which computes the path weight enumerator of a convolutional code. This algorithm may therefore be used to obtain performance bounds for a maximum likelihood decoder of a convolutional code. The path weight enumerator of a well known (2, 1, 6) code is computed.

引用

页码：98 / 99

页数：2