METHOD OF CALCULATING THE EVENT ERROR PROBABILITY OF CONVOLUTIONAL CODES WITH MAXIMUM LIKELIHOOD DECODING

被引:7
作者
SCHALKWIJK, JPM [1 ]
POST, KA [1 ]
AARTS, JPJC [1 ]
机构
[1] EINDHOVEN UNIV TECHNOL,DEPT MATH,EINDHOVEN,NETHERLANDS
关键词
D O I
10.1109/TIT.1979.1056098
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Maximum likelihood (ML) decoding of short constraint length convolutional codes became feasible with the invention of the Viterbi decoder. Several authors have since upper bounded the performance of ML decoders. A method to calculate the event error probability of an ML decoder for convolutional codes is described. ©1979 IEEE
引用
收藏
页码:737 / 743
页数:7
相关论文
共 10 条
[1]   CONVOLUTIONAL CODES .1. ALGEBRAIC STRUCTURE [J].
FORNEY, GD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1970, 16 (06) :720-+
[2]  
MEEBERG LVD, 1974, IEEE T INFORM THEORY, V20, P389
[4]   EXPLICIT EVALUATION OF VITERBIS UNION BOUNDS ON CONVOLUTIONAL CODE PERFORMANCE FOR BINARY SYMMETRIC CHANNEL [J].
POST, KA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (03) :403-404
[5]   SYNDROME DECODING OF CONVOLUTIONAL CODES [J].
SCHALKWIJK, JPM ;
VINCK, AJ .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1975, CO23 (07) :789-792
[6]   SYNDROME DECODING OF BINARY RATE 1/2 CONVOLUTIONAL CODES [J].
SCHALKWIJK, JPM ;
VINCK, AJ .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1976, 24 (09) :977-985
[7]   SYNDROME DECODING OF BINARY RATE K-N CONVOLUTIONAL CODES [J].
SCHALKWIJK, JPM ;
VINCK, AJ ;
POST, KA .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (05) :553-562
[8]  
SCHALKWIJK JPM, 1978, JUN P AGARD M DIG CO
[9]  
VITERBI A, 1978, PRINCIPLES DIGITAL C
[10]   CONVOLUTIONAL CODES AND THEIR PERFORMANCE IN COMMUNICATION SYSTEMS [J].
VITERBI, AJ .
IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1971, CO19 (05) :751-+