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...

ver descrição completa

Detalhes bibliográficos
Autores: Scarlett, Jonathan; Martínez, Alfonso, 1973-; Guillén i Fábregas, A. (Albert)
Tipo de documento: Artigo
Estado:Accepted version
Data de publicação:2018
País:España
Recursos:Universitat Pompeu Fabra
Repositório:Repositorio Digital de la UPF
OAI Identifier:oai:repositori.upf.edu:10230/47999
Acesso em linha:http://hdl.handle.net/10230/47999
http://dx.doi.org/10.1109/TIT.2017.2781363
Nível de acesso:Acesso aberto
Palavra-chave:Mismatched decoding
Multiple-access channel
Successive decoding
Channel capacity
Error exponents
_version_ 1878740116210450432
author Scarlett, Jonathan
author2 Martínez, Alfonso, 1973-
Guillén i Fábregas, A. (Albert)
author2_role author
author
author_browse Guillén i Fábregas, A. (Albert)
Martínez, Alfonso, 1973-
Scarlett, Jonathan
author_facet Scarlett, Jonathan
Martínez, Alfonso, 1973-
Guillén i Fábregas, A. (Albert)
author_role author
collection Repositorio Digital de la UPF
description 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.
eu_rights_str_mv openAccess
format article
id ES_cda8b23cf0bf98d4384117533e8fdd9c
institution Universitat Pompeu Fabra
instname_str Universitat Pompeu Fabra
network_acronym_str ES
network_name_str España
oai_identifier_str oai:repositori.upf.edu:10230/47999
publishDate 2018
publishDateSort 2018
publisher Institute of Electrical and Electronics Engineers (IEEE)
publisherStr Institute of Electrical and Electronics Engineers (IEEE)
reponame_str Repositorio Digital de la UPF
spelling Mismatched multi-letter successive decoding for the multiple-access channel Scarlett, Jonathan Martínez, Alfonso, 1973- Guillén i Fábregas, A. (Albert) Mismatched decoding Multiple-access channel Successive decoding Channel capacity Error exponents 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. This work was supported in part by the European Research Council through ERC under Grant 259663 and Grant 725411, in part by the European Union’s 7th Framework Programme under Grant 303633, and in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150, Grant TEC2012-38800-C03-03, and Grant TEC2016-78434-C3-1-R Institute of Electrical and Electronics Engineers (IEEE) http://hdl.handle.net/10230/47999 http://dx.doi.org/10.1109/TIT.2017.2781363
spellingShingle Mismatched multi-letter successive decoding for the multiple-access channel
Scarlett, Jonathan
Mismatched decoding
Multiple-access channel
Successive decoding
Channel capacity
Error exponents
status_str acceptedVersion
title Mismatched multi-letter successive decoding for the multiple-access channel
title_full Mismatched multi-letter successive decoding for the multiple-access channel
title_fullStr Mismatched multi-letter successive decoding for the multiple-access channel
title_full_unstemmed Mismatched multi-letter successive decoding for the multiple-access channel
title_short Mismatched multi-letter successive decoding for the multiple-access channel
title_sort Mismatched multi-letter successive decoding for the multiple-access channel
topic Mismatched decoding
Multiple-access channel
Successive decoding
Channel capacity
Error exponents
topic_facet Mismatched decoding
Multiple-access channel
Successive decoding
Channel capacity
Error exponents
url http://hdl.handle.net/10230/47999
http://dx.doi.org/10.1109/TIT.2017.2781363