×

Upper bound on the bit error probability of systematic binary linear codes via their weight spectra. (English) Zbl 1476.94039

Summary: In this paper, upper bound on the probability of maximum a posteriori (MAP) decoding error for systematic binary linear codes over additive white Gaussian noise (AWGN) channels is proposed. The proposed bound on the bit error probability is derived with the framework of Gallager’s first bounding technique (GFBT), where the Gallager region is defined to be an irregular high-dimensional geometry by using a list decoding algorithm. The proposed bound on the bit error probability requires only the knowledge of weight spectra, which is helpful when the input-output weight enumerating function (IOWEF) is not available. Numerical results show that the proposed bound on the bit error probability matches well with the maximum-likelihood (ML) decoding simulation approach especially in the high signal-to-noise ratio (SNR) region, which is better than the recently proposed Ma bound.

MSC:

94B05 Linear codes (general theory)
94B70 Error probability in coding theory

Software:

OEIS
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Sason, I.; Shamai, S., Performance analysis of linear codes under maximum-likelihood decoding: a tutorial, Foundations and Trends in Communications and Information Theory, 3, 1-2, 1-225 (2006), Delft, Netherlands: NOW, Delft, Netherlands · Zbl 1156.94436
[2] Divsalar, D., A simple tight bound on error probability of block codes with application to turbo codes, 1-35 (1999), Pasadena, CA, USA: JPL, Pasadena, CA, USA, TMO Progress Report 42-139
[3] Sason, I.; Shamai, S., Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum, IEEE Transactions on Information Theory, 46, 1, 24-47 (2000) · Zbl 0998.94047 · doi:10.1109/18.817506
[4] Zangl, J.; Herzog, R., Improved tangential sphere bound on the bit error probability of concatenated codes, IEEE Journal on Selected Areas in Communications, 19, 5, 825-830 (2001) · doi:10.1109/49.924866
[5] Liu, J., Performance analysis of systematic linear codes over AWGN channels, Proceedings of the 2016 IEEE International Conference on RFID Technology and Applications
[6] Berlekamp, E. R., The technology of error-correcting codes, Proceedings of the IEEE, 68, 5, 564-593 (1980) · doi:10.1109/proc.1980.11696
[7] Kasami, T.; Fujiwara, T.; Takata, T.; Tomita, K.; Lin, S., Evaluation of the block error probability of block modulation codes by the maximum-likelihood decoding for an AWGN channel, Proceedings of the 15th Symposium on Information Theory and its Applications
[8] Kasami, T.; Fujiwara, T.; Takata, T.; Lin, S., Evaluation of the block error probability of block modulation codes by the maximum-likelihood decoding for an AWGN channel, Proceedings of the 1993 IEEE International Symposium on Information Theory
[9] Herzberg, H.; Poltyrev, G., Techniques of bounding the probability of decoding error for block coded modulation structures, IEEE Transactions on Information Theory, 40, 3, 903-911 (1994) · Zbl 0821.94011 · doi:10.1109/18.335901
[10] Poltyrev, G., Bounds on the decoding error probability of binary linear codes via their spectra, IEEE Transactions on Information Theory, 40, 4, 1284-1292 (1994) · Zbl 0821.94035 · doi:10.1109/18.335935
[11] Divsalar, D.; Biglieri, E., Upper bounds to error probabilities of coded systems beyond the cutoff rate, IEEE Transactions on Communications, 51, 12, 2011-2018 (2003) · doi:10.1109/tcomm.2003.820746
[12] Yousefi, S.; Khandani, A. K., Generalized tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN interference, IEEE Transactions on Information Theory, 50, 11, 2810-2815 (2004) · Zbl 1283.94150 · doi:10.1109/tit.2004.836666
[13] Mehrabian, A.; Yousefi, S., Improved tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN and block fading channels, IEE Proceedings-Communications, 153, 6, 885-893 (2006) · doi:10.1049/ip-com:20050493
[14] Ma, X.; Liu, J.; Bai, B., New techniques for upper-bounding the ML decoding performance of binary linear codes, IEEE Transactions on Communications, 61, 3, 842-851 (2013) · doi:10.1109/tcomm.2012.122712.120225
[15] Liu, J., The parameterized Gallager’s first bounds based on conditional triplet-wise error probability, Mathematics and Computers in Simulation, 163, 32-46 (2019) · Zbl 07316705 · doi:10.1016/j.matcom.2019.02.005
[16] Ma, X.; Huang, K.; Bai, B., Systematic block Markov superposition transmission of repetition codes,, IEEE Transactions on Information Theory, 64, 3, 1604-1620 (2018) · Zbl 1390.94880 · doi:10.1109/tit.2017.2787571
[17] The OEIS Foundation Inc., List of Weight Distributions (2013), NJ, USA: The OEIS Foundation Inc., NJ, USA, http://oeis.org/wiki/List_of_weigth_distributions
[18] Ren, J.; Han, J.; Dalla Mura, M., Special issue on multimodal data fusion for multidimensional signal processing, Multidimensional Systems and Signal Processing, 27, 4, 801-805 (2016) · Zbl 1441.94004 · doi:10.1007/s11045-016-0441-0
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.