Optimum Transmission Through the Multiple-Antenna Gaussian Multiple Access Channel
[EN] This paper studies the optimal points in the capacity region of Gaussian multiple access channels (GMACs) with constant fading, multiple antennas, and various power constraints. The points of interest maximize general rate objectives that arise in practical communication scenarios. Achieving th...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2016 |
| País: | España |
| Recursos: | Universitat Politècnica de València (UPV) |
| Repositório: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglês |
| OAI Identifier: | oai:riunet.upv.es:10251/82024 |
| Acesso em linha: | https://riunet.upv.es/handle/10251/82024 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Multiuser channels Optimization Convergence |
| Resumo: | [EN] This paper studies the optimal points in the capacity region of Gaussian multiple access channels (GMACs) with constant fading, multiple antennas, and various power constraints. The points of interest maximize general rate objectives that arise in practical communication scenarios. Achieving these points constitutes the task of jointly optimizing the timesharing parameters, the input covariance matrices, and the order of decoding used by the successive interference cancellation receiver. To approach this problem, Carathéodory s theorem is invoked to represent time-sharing and decoding orders jointly as a finite-dimensional matrix variable. This variable enables us to use variational inequalities to extend results pertaining to problems with linear rate objectives to more general, potentially nonconvex, problems, and to obtain a necessary and sufficient condition for the optimality of the transmission parameters in a wide range of problems. Using the insights gained from this condition, we develop and analyze the convergence of an algorithm for solving, otherwise daunting, GMAC-based optimization problems. |
|---|