A NEW UPPER BOUND ON THE 1ST-EVENT ERROR-PROBABILITY FOR MAXIMUM-LIKELIHOOD DECODING OF FIXED BINARY CONVOLUTIONAL-CODES

被引:4
作者
CEDERVALL, M [1 ]
JOHANNESSON, R [1 ]
ZIGANGIROV, KS [1 ]
机构
[1] ACAD SCI USSR,INST INFORMAT TRANSMISS PROBLEMS,MOSCOW V-71,USSR
关键词
D O I
10.1109/TIT.1984.1056961
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes on the binary symmetric channel is derived. The bound is evaluated for rate 1/2 codes, and comparisons are made with simulations and with bounds of Viterbi, Van de Meeberg, and Post. In particular, the new bound is significantly better than Van de Meeberg's bound for rates above R//c//o//m//p.
引用
收藏
页码:762 / 766
页数:5
相关论文
共 9 条
[1]   A HEURISTIC DISCUSSION OF PROBABILISTIC DECODING [J].
FANO, RM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1963, 9 (02) :64-+
[2]  
GALLAGER RG, 1968, INFORMATION THEORY R
[3]   ROBUSTLY OPTIMAL RATE ONE-HALF BINARY CONVOLUTIONAL CODES [J].
JOHANNESSON, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (04) :464-468
[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]  
POST KA, 1980, MAY P S INF BEN ZOET
[6]   METHOD OF CALCULATING THE EVENT ERROR PROBABILITY OF CONVOLUTIONAL CODES WITH MAXIMUM LIKELIHOOD DECODING [J].
SCHALKWIJK, JPM ;
POST, KA ;
AARTS, JPJC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (06) :737-743
[7]   TIGHTENED UPPER BOUND ON ERROR PROBABILITY OF BINARY CONVOLUTIONAL CODES WITH VITERBI DECODING [J].
VANDEMEE.L .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (03) :389-391
[8]   CONVOLUTIONAL CODES AND THEIR PERFORMANCE IN COMMUNICATION SYSTEMS [J].
VITERBI, AJ .
IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1971, CO19 (05) :751-+
[9]  
VITERBI AJ, 1979, PRINCIPLES DIGITAL C