Tight error bounds for nonuniform signaling over AWGN channels

We consider a Bonferroni-type lower bound due to Kounias (1968) on the probability of a finite union. The bound is expressed in terms of only the individual and pairwise event probabilities; however, it suffers from requiring an exponentially complex search for its direct implementation. We address this problem by presenting a practical algorithm for its evaluation. This bound is applied together with two other bounds, a recent lower bound (the KAT bound) and a greedy algorithm implementation of an upper bound due to Hunter (1976), to examine the symbol error (P/sub a/) and bit error (P/sub b/) probabilities of an uncoded communication system used in conjunction with M-ary phase-shift keying (PSK)/quadrature amplitude (QAM) (PSK/QAM) modulations and maximum a posteriori (MAP) decoding over additive white Gaussian noise (AWGN) channels. It is shown that the bounds-which can be efficiently computed-provide an excellent estimate of the error probabilities over the entire range of the signal-to-noise ratio (SNR) E/sub b//N/sub 0/. The new algorithmic bound and the greedy bound are particularly impressive as they agree with the simulation results even during very severe channel conditions.

[1]  Mansour I. Irshid,et al.  Bit error probability for coherent M-ary PSK systems , 1991, IEEE Trans. Commun..

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

[3]  Mohamed-Slim Alouini,et al.  A unified approach for calculating error rates of linearly modulated signals over generalized fading channels , 1998, IEEE Trans. Commun..

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

[5]  T.E. Fuja,et al.  Channel codes that exploit the residual redundancy in CELP-encoded speech , 1996, IEEE Trans. Speech Audio Process..

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

[7]  Fady Alajaji,et al.  An error resilient scheme for image transmission over noisy channels with memory , 1998, IEEE Trans. Image Process..

[8]  J.E. Mazo,et al.  Digital communications , 1985, Proceedings of the IEEE.

[9]  David Sankoff,et al.  AN INEQUALITY FOR PROBABILITIES , 1967 .

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

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

[12]  Mohamed-Slim Alouini,et al.  A unified approach to the performance analysis of digital communication over generalized fading channels , 1998, Proc. IEEE.

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

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

[15]  Nam C. Phamdo,et al.  Source-channel optimized trellis codes for bitonal image transmission over AWGN channels , 1999, IEEE Trans. Image Process..

[16]  J. Craig.  A new, simple and exact result for calculating the probability of error for two-dimensional signal constellations , 1991, MILCOM 91 - Conference record.

[17]  Peter F. Swaszek.  A lower bound on the error probability for signals in white Gaussian noise , 1995, IEEE Trans. Inf. Theory.

[18]  Joachim Hagenauer,et al.  Joint source-channel decoding using the residual redundancy in compressed images , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[19]  M. Schervish.  Multivariate normal probabilities with error bound , 1984 .

[20]  Pil Lee.  Computation of the Bit Error Rate of Coherent M-ary PSK with Gray Code Bit Mapping , 1986, IEEE Trans. Commun..

[21]  J. R. Koehler,et al.  Modern Applied Statistics with S-Plus. , 1996 .

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

[23]  Xiaodai Dong,et al.  Error probabilities of two-dimensional M-ary signaling in fading , 1999, IEEE Trans. Commun..

[24]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[25]  Fady Alajaji,et al.  Detection of binary Markov sources over channels with additive Markov noise , 1996, IEEE Trans. Inf. Theory.

[26]  Nam C. Phamdo,et al.  Analysis and Design of Trellis Codes Optimized for a Binary Symmetric Markov Source with MAP Detection , 1998, IEEE Trans. Inf. Theory.

[27]  Jianhua Lu,et al.  M-PSK and M-QAM BER computation using signal-space concepts , 1999, IEEE Trans. Commun..