Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
2712 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 7, NOVEMBER 2000 Tight Error Bounds for Nonuniform Signaling over AWGN
 

Summary: 2712 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 7, NOVEMBER 2000
Tight Error Bounds for Nonuniform Signaling over AWGN
Channels
Hongyan Kuai, Fady Alajaji, Senior Member, IEEE, and
Glen Takahara, Member, IEEE
Abstract--We consider a Bonferroni-type lower bound due to Kounias
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 implemen-
tation. We address this problem by presenting a practical algorithm for
its evaluation. This bound is applied together with two other bounds, a re-
cent lower bound (the KAT bound) and a greedy algorithm implementa-
tion of an upper bound due to Hunter, to examine the symbol error ( )
and bit error ( ) probabilities of an uncoded communication system used
in conjunction with -ary phase-shift keying (PSK)/quadrature ampli-
tude (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) . The new algorithmic bound and the greedy

  

Source: Alajaji, Fady - Department of Mathematics and Statistics, Queen's University (Kingston)

 

Collections: Engineering