Rate-splitting multiple access for discrete memoryless channels
Grant, A.J.
Rimoldi, B.
Urbanke, R.L.
Whiting, P.A.
Inst. for Telecommun. Res., Univ. of South Australia, Mawson Lakes, SA;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Mar 2001
Volume: 47,
Issue: 3
On page(s): 873-890
ISSN: 0018-9448
References Cited: 30
CODEN: IETTAW
INSPEC Accession Number: 6908001
Digital Object Identifier: 10.1109/18.915637
Current Version Published: 2002-08-07
Abstract
It is shown that the encoding/decoding problem for any
asynchronous M-user discrete memoryless multiple-access channel can be
reduced to corresponding problems for at most 2M-1 single-user discrete
memoryless channels. This result, which extends a similar result for
Gaussian channels, reduces the seemingly hard task of finding good
multiple-access codes to the much better understood task of finding good
codes for single-user channels. As a by-product, some interesting
properties of the capacity region of M-user asynchronous discrete
memoryless channels are derived
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
