Joint Optimization of Bit and Power Loading for Multicarrier Systems

TL;DR

This paper introduces a low complexity joint bit and power loading algorithm for multicarrier systems that optimizes throughput and power consumption while satisfying BER and power constraints, outperforming existing methods.

Contribution

A novel joint optimization algorithm using Lagrangian and bisection methods with closed-form solutions, improving efficiency and near-optimal performance in multicarrier systems.

Findings

Algorithm outperforms existing allocation methods.

Performance approaches that of exhaustive search.

Achieves a balance between throughput and power consumption.

Abstract

In this letter, a novel low complexity bit and power loading algorithm is formulated for multicarrier communication systems. The proposed algorithm jointly maximizes the throughput and minimizes the transmit power through a weighting coefficient $\alpha$, while meeting constraints on the target bit error rate (BER) per subcarrier and on the total transmit power. The optimization problem is solved by the Lagrangian multiplier method if the initial $\alpha$ causes the transmit power not to violate the power constraint; otherwise, a bisection search is used to find the appropriate $\alpha$. Closed-form expressions are derived for the close-to-optimal bit and power allocations per subcarrier, average throughput, and average transmit power. Simulation results illustrate the performance of the proposed algorithm and demonstrate its superiority with respect to existing allocation algorithms. Furthermore, the results show that the performance of the proposed algorithm approaches that of the exhaustive search for the discrete optimal allocations.