Amended Truncated Union Bounds on the ML Decoding Performance of Binary Linear Codes over AWGN Channels  

作　　者：LIU Jia MA Xiao BAI Baoming 

机构地区：[1]College of Information Science and Technology, Zhongkai University of Agriculture and Engineering [2]Department of Electronics and Communication Engineering, Sun Yat-sen University [3]State Key Laboratory of Integrated Services Networks, Xidian University

出　　处：《Chinese Journal of Electronics》2014年第3期458-463,共6页电子学报（英文版）

基　　金：supported by the National Basic Research Program of China(973 Program)(No.2012CB316100);the National Natural Science Foundation of China(No.61172082);the Science and Technology Planning Project of Guangdong Province(No.2011B020313022);the Soft Science Project of Guangdong Province(No.2010B070300096)

摘　　要：In this paper＇s simple upper bounds are derived on the frame and bit error probabilities of binary linear codes over Additive white Gaussian noise （AWGN） channels. The conventional union bound is first truncated and then amended, which can be justified by invoking Gallager＇s first bounding technique （GFBT）. Different from most other works, the ＂good region＂ is specified by a suboptimal list decoding algorithm. The error probability caused by the good region can be upper-bounded by the union bounds using pair-wlse error probability and tripletwise error probability, which can be further tightened by exploiting the independence between the error events and certain components of the receiving signal vector. The proposed bounds are simple since they involve only the Q-function. The proposed bounds improve our recently proposed bounds. Numerical results are also presented to compare the proposed bounds with the Divsalar bound, which is a simple tight upper bound with closed-form, and the Tangential-sphere bound （TSB）, which is considered as one of the tightest upper bounds.In this paper, simple upper bounds are derived on the frame and bit error probabilities of binary linear codes over Additive white Gaussian noise(AWGN)channels. The conventional union bound is first truncated and then amended, which can be justified by invoking Gallager's first bounding technique(GFBT). Different from most other works, the "good region" is specified by a suboptimal list decoding algorithm. The error probability caused by the good region can be upper-bounded by the union bounds using pair-wise error probability and tripletwise error probability, which can be further tightened by exploiting the independence between the error events and certain components of the receiving signal vector. The proposed bounds are simple since they involve only the Q-function. The proposed bounds improve our recently proposed bounds. Numerical results are also presented to compare the proposed bounds with the Divsalar bound,which is a simple tight upper bound with closed-form, and the Tangential-sphere bound(TSB), which is considered as one of the tightest upper bounds.

关 键 词：Additive white Gaussian noise （AWGN） channel  Maximum-likelihood （ML） decoding Binary linear block code Union bound  Gallager＇s first bounding technique （GFBT）  List decoding. 

分 类 号：TN911.2[电子电信—通信与信息系统]