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

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

doi:10.1109/18.930933

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

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

Research output: Contribution to journal › Article › peer-review

17 Scopus citations

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 single-user codes 1 is shown to be exponentially optimum for this case as well. Second, the sphere-packing bounding technique suggested in 3 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.

Original language	English
Pages (from-to)	1999-2016
Number of pages	18
Journal	IEEE Transactions on Information Theory
Volume	47
Issue number	5
DOIs	https://doi.org/10.1109/18.930933
State	Published - Jul 2001
Externally published	Yes

Keywords

Error exponents
Multiple-access channels
Optical code division multiple access (CDMA)
Poisson channels

Access to Document

10.1109/18.930933

Cite this

@article{88e75598a4a64479859f4c14c7353dd0,

title = "Error exponents for the two-user poisson multiple-access channel",

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 single-user codes 1 is shown to be exponentially optimum for this case as well. Second, the sphere-packing bounding technique suggested in 3 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 = "Error exponents, Multiple-access channels, Optical code division multiple access (CDMA), Poisson channels",

author = "Bross, \{Shraga I.\} and Burnashev, \{Marat V.\} and Shlomo Shamai",

year = "2001",

month = jul,

doi = "10.1109/18.930933",

language = "אנגלית",

volume = "47",

pages = "1999--2016",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Error exponents for the two-user poisson multiple-access channel

AU - Bross, Shraga I.

AU - Burnashev, Marat V.

AU - Shamai, Shlomo

PY - 2001/7

Y1 - 2001/7

N2 - 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 single-user codes 1 is shown to be exponentially optimum for this case as well. Second, the sphere-packing bounding technique suggested in 3 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.

AB - 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 single-user codes 1 is shown to be exponentially optimum for this case as well. Second, the sphere-packing bounding technique suggested in 3 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.

KW - Error exponents

KW - Multiple-access channels

KW - Optical code division multiple access (CDMA)

KW - Poisson channels

UR - https://www.scopus.com/pages/publications/0035396898

U2 - 10.1109/18.930933

DO - 10.1109/18.930933

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0035396898

SN - 0018-9448

VL - 47

SP - 1999

EP - 2016

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this