New Techniques for Upper-Bounding the ML Decoding Performance of Binary Linear Codes
New Techniques for Upper-Bounding the ML Decoding Performance of Binary Linear Codes
复制标题
提高二进制线性码 ML 解码性能上限的新技术
DOI:
10.1109/tcomm.2012.122712.120225
复制
发表时间:
2011-04
影响因子:
8.3
通讯作者:
Baoming Bai
中科院分区:
文献类型:
--
作者:
Xiao Ma;Jia Liu;Baoming Bai
In this paper, new techniques are presented to either simplify or improve most existing upper bounds on the maximum-likelihood (ML) decoding performance of the binary linear codes over additive white Gaussian noise (AWGN) channels. Firstly, the recently proposed union bound using truncated weight spectrum by Ma et al. is re-derived in a detailed way based on Gallager's first bounding technique (GFBT), where the "good region" is specified by a sub-optimal list decoding algorithm. The error probability caused by the bad region can be upper-bounded by the tail-probability of a binomial distribution, while the error probability caused by the good region can be upper-bounded by most existing techniques. Secondly, we propose two techniques to tighten the union bound on the error probability caused by the good region. The first technique is based on pair-wise error probabilities. The second technique is based on triplet-wise error probabilities, which can be upper-bounded by the fact that any three bipolar vectors form a non-obtuse triangle. The proposed bounds improve the conventional union bounds but have a similar complexity since they involve only the Q-function. The proposed bounds can also be adapted to bit-error probabilities.
登录
查看更多内容
影响因子:
2.5
作者:
Eran Hof;I. Sason;S. Shamai
通讯作者:
Eran Hof;I. Sason;S. Shamai
DOI:
10.1109/18.335901
发表时间:
1994-05
期刊:
IEEE Trans. Inf. Theory
影响因子:
--
作者:
H. Herzberg;G. Poltyrev
通讯作者:
H. Herzberg;G. Poltyrev
DOI:
--
发表时间:
1999-07
期刊:
--
影响因子:
--
作者:
D. Divsalar
通讯作者:
D. Divsalar
DOI:
10.1109/18.737535
发表时间:
1998-11
期刊:
IEEE Trans. Inf. Theory
影响因子:
--
作者:
E. Agrell
通讯作者:
E. Agrell
影响因子:
20.6
作者:
BERLEKAMP, ER
通讯作者:
BERLEKAMP, ER