Error exponents for the two-user Poisson multiple-access channel

Author

Bross, Shraga I. ; Burnashev, Marat V. ; Shamai, Shlomo

Author_Institution

Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel

Volume

47

Issue

5

fYear

2001

fDate

7/1/2001 12:00:00 AM

Firstpage

1999

Lastpage

2016

Abstract

The error exponent of the two-user Poisson multiple-access channel under peak and average power constraints, but unlimited in bandwidth, is considered. First, a random coding lower bound on the error exponent is obtained, and an extension of Wyner´s (1988) single-user codes is shown to be exponentially optimum for this case as well. Second, the sphere-packing bounding technique suggested by Burnashev and Kutoyants (see Probl. Inform. Transm., vol.35, no.2, p.3-22, 1999) is generalized to the case at hand and an upper bound on the error exponent, which coincides with the lower bound, is derived. Thus, this channel joins its single-user partner as one of very few for which the reliability function is known

Keywords

channel capacity; coding errors; maximum likelihood decoding; multi-access systems; multiuser channels; random codes; stochastic processes; average power constraint; bandwidth; channel capacity; error exponents; lower bound; maximum-likelihood decoding; peak power constraint; random coding; reliability function; single-user codes; sphere-packing bounding technique; two-user Poisson multiple-access channel; upper bound; Bandwidth; Dark current; Error probability; Helium; Integrated optics; Multiaccess communication; P-i-n diodes; Stochastic processes; Time division multiple access; Upper bound;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.930933

Filename

930933