Optimum power allocation and bit loading for BICM systems
This paper introduces a joint bit loading and power allocation algorithm for systems combining bit-interleaved coded modulation (BICM) with multicarrier transmission. The proposed algorithm maximizes the mutual information, so it can be regarded as a generalization of mercury/waterfilling policy tha...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2010 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/12470 |
| Acceso en línea: | https://hdl.handle.net/2117/12470 https://dx.doi.org/10.1109/TCOMM.2010.062310.080128 |
| Access Level: | acceso abierto |
| Palabra clave: | Orthogonal frequency division multiplexing OFDM BICM Banda ampla, Sistemes de comunicació de Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors::Xarxes de banda ampla |
| Sumario: | This paper introduces a joint bit loading and power allocation algorithm for systems combining bit-interleaved coded modulation (BICM) with multicarrier transmission. The proposed algorithm maximizes the mutual information, so it can be regarded as a generalization of mercury/waterfilling policy that incorporates bit loading. The followed approach relies on irregular modulation and power to cast the problem in the framework of convex optimization. This allows to derive the optimum solution without resorting to greedy algorithms, embedding the bit loading in the definition of an equivalent constellation such that the complexity increase with respect to mercury/waterfilling is negligible. While irregular modulation plays a key role in algorithm definition, it is proved that only a few subcarriers employ it and it is shown that a practical low complexity algorithm can be obtained with minimal losses that does not use irregular modulation. |
|---|