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

被引：17

作者：

Bross, SI ^{[1
]}

Burnashev, MV

Shamai, S

机构：

[1] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel

[2] Russian Acad Sci, Inst Problems Informat Transmiss, Moscow 101447, Russia

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2001年 / 47卷 / 05期

关键词：

error exponents; multiple-access channels; optical code division multiple access (CDMA); Poisson channels;

D O I：

10.1109/18.930933

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1999 / 2016

页数：18