Sphere bound revisited: A new simulation approach to performance evaluation of binary linear codes over AWGN channels

In this paper, the sphere bound (SB) is revisited within a general bounding framework based on nested Gallager regions. We show that the SB proposed by Herzberg et al. is equivalent to the SB proposed by Kasami et al.. Interestingly, this general framework provides a new way to evaluate the performance of binary linear codes over additive white Gaussian noise (AWGN) channels. This simulation approach relies on only the geometry structure of the code itself. Therefore, simulation results can be used to evaluate not only the performance over AWGN channels but also that over other symmetrical real channels. Numerical results obtained with the new performance evaluation approach are presented.

[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]  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 .

[3]  Shlomo Shamai,et al.  Variations on the Gallager bounds, connections, and applications , 2002, IEEE Trans. Inf. Theory.

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

[5]  E.R. Berlekamp,et al.  The technology of error-correcting codes , 1980, Proceedings of the IEEE.

[6]  Bai,et al.  Amended Truncated Union Bounds on the ML Decoding Performance of Binary Linear Codes over AWGN Channels , 2014 .

[7]  Xiao Ma,et al.  New Techniques for Upper-Bounding the ML Decoding Performance of Binary Linear Codes , 2011, IEEE Transactions on Communications.

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

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

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

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

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

[13]  Xiao Ma,et al.  Improved Hamming sphere bounds on the MLD performance of binary linear codes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[14]  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.