Tightened upper bounds on the ML decoding error probability of binary linear block codes

被引:17
|
作者
Twitto, Moshe [1 ]
Sason, Igal [1 ]
Shamai, Shlomo [1 ]
机构
[1] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel
关键词
block codes; bounds; linear codes; maximum-likelihood (ML) decoding;
D O I
10.1109/TIT.2007.892807
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and output-symmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes over the additive white Gaussian noise (AWGN) channel. An expurgation of the distance spectrum of binary linear block codes further tightens the resulting upper bounds.
引用
收藏
页码:1495 / 1510
页数:16
相关论文
共 50 条