Information Theory Cohen-Merhav bounds on the symbol error rate of uncoded signalling in AWGN interference

Using a recent Bonferroni-type inequality proposed by Cohen and Merhav, we develop new tight lower bounds on the word error probability of uncoded systems with optimal Maximum A Posteriori (MAP) coherent detection for non-uniform signalling over additive white Gaussian noise channel. Our results are compared to the state-of-the-art Kuai-Alajaji-Takahara (KAT) lower bounds and it is shown that the superiority of one bound to another is dependent on the signal constellation, the amount of non-uniformity of the Bernoulli source to be communicated and the SNR range of interest. It is noted that bounding techniques for the performance evaluation of communication systems are receiving increasing attention today, thanks to their suitability for a wide variety of schemes ranging from uncoded signalling to space–time-coded multiple-input multiple-output (MIMO) systems. Copyright © 2007 John Wiley & Sons, Ltd.

[1]  Dominique de Caen,et al.  A lower bound on the probability of a union , 1997, Discret. Math..

[2]  Gérald E. Séguin.  A Lower Bound on the Error Probability for Signals in White Gaussian Noise , 1998, IEEE Trans. Inf. Theory.

[3]  Fady Alajaji,et al.  Tight error bounds for space-time orthogonal block codes under slow Rayleigh flat fading , 2005, IEEE Transactions on Communications.

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

[5]  David J. Hunter.  An upper bound for the probability of a union , 1976, Journal of Applied Probability.

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

[7]  John G. Proakis,et al.  Probability, random variables and stochastic processes , 1985, IEEE Trans. Acoust. Speech Signal Process..

[8]  T. Donnelly,et al.  Algorithm 462: bivariate normal distribution , 1973 .

[9]  G. Kaplan,et al.  On Information Rates for Mismatched Decoders , 1993, Proceedings. IEEE International Symposium on Information Theory.

[10]  Neri Merhav,et al.  Lower bounds on the error probability of block codes based on improvements on de Caen's inequality , 2004, IEEE Transactions on Information Theory.

[11]  Norman C. Beaulieu.  A simple series for personal computer computation of the error function Q(·) , 1989, IEEE Trans. Commun..

[12]  S. Yousefi,et al.  Performance evaluation of maximum-likelihood decoded linear binary block codes in AWGN interference using Bonferroni-type and geometrical bounds , 2006 .

[13]  Dariush Divsalar,et al.  Some new twists to problems involving the Gaussian probability integral , 1998, IEEE Trans. Commun..

[14]  Fady Alajaji,et al.  A lower bound on the probability of a finite union of events , 2000, Discret. Math..

[15]  J. Galambos,et al.  Bonferroni-type inequalities with applications , 1996 .

[16]  Fady Alajaji,et al.  Tight error bounds for nonuniform signaling over AWGN channels , 2000, IEEE Trans. Inf. Theory.

[17]  Shahram Yousefi,et al.  Information Theory Gallager bounds on the performance of maximum-likelihood decoded linear binary block codes in AWGN interference , 2007, Eur. Trans. Telecommun..

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

[19]  L. Comtet,et al.  Advanced Combinatorics: The Art of Finite and Infinite Expansions , 1974 .

[20]  E. Kounias.  Bounds for the Probability of a Union, with Applications , 1968 .

[21]  Fady Alajaji,et al.  Constellation mappings for two-dimensional signaling of nonuniform sources , 2003, IEEE Trans. Commun..