Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight Spectra

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 tec...

Full description

Saved in:
Bibliographic Details
Main Authors: Jia Liu, Mingyu Zhang, Chaoyong Wang, Rongjun Chen, Xiaofeng An, Yufei Wang
Format: Article
Language:English
Published: Wiley 2020-01-01
Series:Discrete Dynamics in Nature and Society
Online Access:http://dx.doi.org/10.1155/2020/1469090
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832560701549314048
author Jia Liu
Mingyu Zhang
Chaoyong Wang
Rongjun Chen
Xiaofeng An
Yufei Wang
author_facet Jia Liu
Mingyu Zhang
Chaoyong Wang
Rongjun Chen
Xiaofeng An
Yufei Wang
author_sort Jia Liu
collection DOAJ
description 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.
format Article
id doaj-art-dd90530d0a044943985c741b8ad22c2a
institution Kabale University
issn 1026-0226
1607-887X
language English
publishDate 2020-01-01
publisher Wiley
record_format Article
series Discrete Dynamics in Nature and Society
spelling doaj-art-dd90530d0a044943985c741b8ad22c2a2025-02-03T01:27:04ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2020-01-01202010.1155/2020/14690901469090Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight SpectraJia Liu0Mingyu Zhang1Chaoyong Wang2Rongjun Chen3Xiaofeng An4Yufei Wang5School of Information Engineering, Jilin Engineering Normal University, Changchun 130052, ChinaSchool of Information Engineering, Jilin Engineering Normal University, Changchun 130052, ChinaSchool of Information Engineering, Jilin Engineering Normal University, Changchun 130052, ChinaSchool of Computer Science, Guangdong Polytechnic Normal University, Guangzhou 510665, ChinaSchool of Information Engineering, Jilin Engineering Normal University, Changchun 130052, ChinaSchool of Information Engineering, Jilin Engineering Normal University, Changchun 130052, ChinaIn 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.http://dx.doi.org/10.1155/2020/1469090
spellingShingle Jia Liu
Mingyu Zhang
Chaoyong Wang
Rongjun Chen
Xiaofeng An
Yufei Wang
Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight Spectra
Discrete Dynamics in Nature and Society
title Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight Spectra
title_full Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight Spectra
title_fullStr Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight Spectra
title_full_unstemmed Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight Spectra
title_short Upper Bound on the Bit Error Probability of Systematic Binary Linear Codes via Their Weight Spectra
title_sort upper bound on the bit error probability of systematic binary linear codes via their weight spectra
url http://dx.doi.org/10.1155/2020/1469090
work_keys_str_mv AT jialiu upperboundonthebiterrorprobabilityofsystematicbinarylinearcodesviatheirweightspectra
AT mingyuzhang upperboundonthebiterrorprobabilityofsystematicbinarylinearcodesviatheirweightspectra
AT chaoyongwang upperboundonthebiterrorprobabilityofsystematicbinarylinearcodesviatheirweightspectra
AT rongjunchen upperboundonthebiterrorprobabilityofsystematicbinarylinearcodesviatheirweightspectra
AT xiaofengan upperboundonthebiterrorprobabilityofsystematicbinarylinearcodesviatheirweightspectra
AT yufeiwang upperboundonthebiterrorprobabilityofsystematicbinarylinearcodesviatheirweightspectra