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.
Original language | English |
---|---|
Pages (from-to) | 873-890 |
Number of pages | 18 |
Journal | IEEE Transactions on Information Theory |
Volume | 47 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2001 |
Externally published | Yes |
Keywords
- Interference cancellation
- Multiple access
- Rate splitting
- Stripping
- Successive decoding