arXiv:1202.0592

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

Xiao Ma, Jia Liu, Baoming Bai

Published Feb 3, 2012• 0 citations

Abstract

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.

DOI: 10.48550/arxiv.1202.0592

Related papers

A New Simulation Approach to Performance Evaluation of Binary Linear Codes in the Extremely Low Error Rate Region

Xiao Ma, Jia Liu, Shancheng Zhao

In this paper, the sphere bound (SB) is revisited within a general bounding framework based on nested Gallager regions. The equivalence is revealed between the SB proposed by Herzberg and Poltyrev and the SB proposed by Kasami et al., whereas the latter was rarely cited in the literatures. Interestingly and importantly, the derivation of the SB based on nested Gallager regions suggests us a new simulation approach to performance evaluation of binary linear codes over additive white Gaussian noise (AWGN) channels. In order for the performance evaluation, the proposed approach decouples the geometrical structure of the code from the noise statistics. The former specifies the conditional error probabilities, which are independent of signal-to-noise ratios (SNRs) and can be simulated and estimated efficiently, while the latter determines the probabilities of those conditions, which involve SNRs and can be calculated numerically. Numerical results show that the proposed simulation approach matches well with the traditional simulation approach in the high error rate region but is able to evaluate efficiently the performance in the extremely low error rate region.

arXiv:1610.06712Oct 21, 20160 citations

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

Shancheng Zhao, Jia Liu, Xiao Ma

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.

International Symposium on Turbo Codes and Iterative Information ProcessingSep 1, 20164 citations

A New Upper Bound on the ML DecodingError Probability of Linear Binary Block Codes in AWGN Interference

Shahram Yousefi, Amir Keyvan Khandani

Performance evaluation of maximum-likelihood (ML) soft-decision-decoded binary block codes is usually carried out using bounding techniques. Many tight upper bounds on the error probability of binary codes are based on the so-called Gallager's first bounding technique (GFBT). The tangential sphere bound (TSB) of Poltyrev which has been believed for many years to offer the tightest bound developed for binary block codes is an example. Within the framework of the TSB and GFBT, we apply a new method referred to as the "added-hyper-plane" (AHP) technique, to the decomposition of the error probability. This results in a bound developed upon the application of two stages of the GFBT with two different Gallager regions culminating in a tightened upper bound beyond the TSB. The proposed bound is simple and only requires the spectrum of the binary code.

IEEE Transactions on Information TheoryNov 30, 200445 citations

Gallager bounds for linear codes in binary-input output-symmetric memoryless channels

Alfonso García Martínez, Albert Guillén i Fàbregas, Giuseppe Caire

This paper presents a general methodology to extend Gallager bounds on the maximum-likelihood decoding error probability to arbitrary binary-input output-symmetric memoryless channels. Based on the log-likelihood ratios, a new space is constructed in which the signals naturally lie on a sphere, and for which geometric analysis is straightforward. In particular, we focus on Poltyrev's tangential-sphere bound, and we illustrate its connections with the Engdahl-Zigangirov bound. Approximations to these bounds are shown to be very tight.

IEEE International Symposium on Information Theory (ISIT)Jan 1, 20050 citations

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

Jia Liu, Mingyu Zhang, Chaoyong Wang +3 more

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.

Discrete Dynamics in Nature and SocietyJan 29, 20200 citations

On the Error Exponents of Improved Tangential Sphere Bounds

Moshe Twitto, Igal Sason

The performance of maximum-likelihood (ML) decoded binary linear block codes over the additive white Gaussian noise (AWGN) channel is addressed via the tangential sphere bound (TSB) and two of its recent improved versions. The correspondence is focused on the derivation of the error exponents of these bounds. Although it was shown that some recent improvements of the TSB tighten this bound for finite-length codes, it is demonstrated in this correspondence that their error exponents coincide. For an arbitrary ensemble of binary linear block codes, the common value of these error exponents is explicitly expressed in terms of the asymptotic growth rate of the average distance spectrum

IEEE Transactions on Information TheoryMar 1, 200714 citations