Mismatched multi-letter successive decoding for the multiple-access channel
This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is considered, and achievable rate regions and error exponents are de...
| Authors: | ; ; |
|---|---|
| Format: | Article |
| Status: | Accepted version |
| Publication date: | 2018 |
| Country: | España |
| Institution: | Universitat Pompeu Fabra |
| Repository: | Repositorio Digital de la UPF |
| OAI Identifier: | oai:repositori.upf.edu:10230/47999 |
| Online Access: | http://hdl.handle.net/10230/47999 http://dx.doi.org/10.1109/TIT.2017.2781363 |
| Access Level: | Open access |
| Keyword: | Mismatched decoding Multiple-access channel Successive decoding Channel capacity Error exponents |
| Summary: | This paper studies channel coding for the discrete memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. A multi-letter successive decoding rule depending on an arbitrary non-negative decoding metric is considered, and achievable rate regions and error exponents are derived both for the standard MAC (independent codebooks), and for the cognitive MAC (one user knows both messages) with superposition coding. In the cognitive case, the rate region and error exponent are shown to be tight with respect to the ensemble average. The rate regions are compared with those of the commonly considered decoder that chooses the message pair maximizing the decoding metric, and numerical examples are given for which successive decoding yields a strictly higher sum rate for a given pair of input distributions. |
|---|