Analytic expressions for the bit error probabilities of rate-1/2 memory 2 convolutional encoders

被引:13
作者
Lentmaier, M [1 ]
Truhachev, DV [1 ]
Zigangirov, KS [1 ]
机构
[1] Lund Univ, Dept Informat Technol, Lund, Sweden
关键词
binary-symmetric channel (BSC); bit error probability; convolutional codes; maximum-likelihood (ML) decoding;
D O I
10.1109/TIT.2004.828105
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Analytic expressions for the exact bit error probabilities of rate R = 1/2, memory m = 2 convolutional encoders are derived for a maximum-likelihood (ML) decoder and transmission over the binary-symmetric channel (BSC). The resulting expressions are rational functions of the crossover probability of the BSC. In addition to classical nonsystematic encoders without feedback, we consider also recursive systematic encoders which became especially important as component encoders in concatenated coding schemes. To attest the validity of the results, they are compared to computer simulations. Based on the presented technique also the bit error probability and the probability distribution of the output log-likelihood ratios of the Max-Log-MAP algorithm are derived in analytic form.
引用
收藏
页码:1303 / 1311
页数:9
相关论文
共 22 条
[1]  
[Anonymous], P IEEE GLOB TEL C 19
[2]  
[Anonymous], P INT C COMM JUN
[3]   OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].
BAHL, LR ;
COCKE, J ;
JELINEK, F ;
RAVIV, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287
[4]   ON A TECHNIQUE TO CALCULATE THE EXACT PERFORMANCE OF A CONVOLUTIONAL CODE [J].
BEST, MR ;
BURNASHEV, MV ;
LEVY, Y ;
RABINOVICH, A ;
FISHBURN, PC ;
CALDERBANK, AR ;
COSTELLO, DJ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (02) :441-447
[5]   COVERING PROPERTIES OF CONVOLUTIONAL-CODES AND ASSOCIATED LATTICES [J].
CALDERBANK, AR ;
FISHBURN, PC ;
RABINOVICH, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1995, 41 (03) :732-746
[6]   Tighter bounds on the error probability of fixed convolutional codes [J].
Engdahl, K ;
Zigangirov, KS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) :1625-1630
[7]   VITERBI ALGORITHM [J].
FORNEY, GD .
PROCEEDINGS OF THE IEEE, 1973, 61 (03) :268-278
[8]   On the Equivalence Between SOVA and Max-Log-MAP Decodings [J].
Fossorier, Marc P. C. ;
Burkert, Frank ;
Lin, Shu ;
Hagenauer, Joachim .
IEEE COMMUNICATIONS LETTERS, 1998, 2 (05) :137-139
[9]  
JOHANNESSON R, 2000, CODES GRAPHS SYSTEMS
[10]  
Johannesson R., 1999, FUNDAMENTALS CONVOLU