A Discrete Bit Loading Algorithm for FBMC/OQAM
In this letter the discrete rate maximization problem is investigated for FBMC/OQAM. The analysis reveals that if there is crosstalk certain bit allocations violate the power constraints. Aiming at ensuring the feasibility along with alleviating the complexity we have devised a novel iterative algor...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2012 |
| País: | España |
| Institución: | Centre Tecnològic de Telecomunicacions de Catalunya (CTTC) |
| Repositorio: | r-CTTC. Repositorio Institucional Producción Científica del Centre Tecnològic de Telecomunicacions de Catalunya (CTTC) |
| OAI Identifier: | oai:cttc.fundanetsuite.com:p1814 |
| Acceso en línea: | https://cttc.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=1814 |
| Access Level: | acceso abierto |
| Palabra clave: | Discrete rate maximization FBMC/OQAM |
| Sumario: | In this letter the discrete rate maximization problem is investigated for FBMC/OQAM. The analysis reveals that if there is crosstalk certain bit allocations violate the power constraints. Aiming at ensuring the feasibility along with alleviating the complexity we have devised a novel iterative algorithm, which always converges. Simulation-based results show that the proposed algorithm performs close to the upper bound for high-coherence bandwidth channels. Under highly frequency selective channels the existing algorithms are not able to guarantee the target SER whereas our approach guarantees the QoS. |
|---|