On Parameterized Gallager's First Bounds for Binary Linear Codes over AWGN Channels

In this paper, nested Gallager regions with a single parameter is introduced to exploit Gallager's first bounding technique (GFBT). We present a necessary and sufficient condition on the optimal parameter. We also present a sufficient condition (with a simple geometrical explanation) under which the optimal parameter does not depend on the signal-to-noise ratio (SNR). With this general framework, three existing upper bounds are revisited, including the tangential bound (TB) of Berlekamp, the sphere bound (SB) of Herzberg and Poltyrev, and the tangential-sphere bound (TSB) of Poltyrev. This paper also reveals that the SB of Herzberg and Poltyrev is equivalent to the SB of Kasami et al., which was rarely cited in literature.

[1]  Shu Lin,et al.  Evaluation of the Block Error Probability of Block Modulation Codes by the Maximum-Likelihood Decoding for an Awgn Channel , 1993, Proceedings. IEEE International Symposium on Information Theory.

[2]  H. Herzberg,et al.  Techniques of bounding the probability of decoding error for block coded modulation structures , 1994, IEEE Trans. Inf. Theory.

[3]  Neil J. A. Sloane,et al.  Techniques of Bounding the Probability of Decoding Error for Block Coded Modulation Structures , 1994 .

[4]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

[5]  Erik Agrell,et al.  Voronoi regions for binary linear block codes , 1996, IEEE Trans. Inf. Theory.

[6]  Erik Agrell,et al.  On the Voronoi Neighbor Ratio for Binary Linear Block Codes , 1998, IEEE Trans. Inf. Theory.

[7]  D. Divsalar A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes , 1999 .

[8]  Shlomo Shamai,et al.  Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum , 2000, IEEE Trans. Inf. Theory.

[9]  Dariush Divsalar,et al.  Upper bounds to error probabilities of coded systems beyond the cutoff rate , 2003, IEEE Trans. Commun..

[10]  Amir K. Khandani,et al.  Generalized tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN interference , 2004, IEEE Transactions on Information Theory.

[11]  Amir K. Khandani,et al.  A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference , 2004, IEEE Transactions on Information Theory.

[12]  A. Mehrabian,et al.  Improved tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN and block fading channels , 2006 .

[13]  Shlomo Shamai,et al.  Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial , 2006, Found. Trends Commun. Inf. Theory.

[14]  Xiao Ma,et al.  Maximum likelihood decoding analysis of LT codes over AWGN channels , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[15]  Xiao Ma,et al.  New techniques for upper-bounding the MLD performance of binary linear codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.