On the optimal discrete bit loading for multicarrier systems with constraints

In this paper optimal discrete bit loading algorithms for multicarrier systems employing DMT (discrete multitone) are proposed. The solutions are derived under the additional constraints on either the maximum allowable energy for each subchannel or the maximum cardinality of the QAM constellations that are used. The optimal loading is proved to be a greedy algorithm, which employs a bit-removal procedure. In many practical cases it is more effective from a computational point of view in comparison with the corresponding optimal greedy algorithm employing bit-filling. Conditions for the optimality of a greedy approach (in general suboptimal) in this context are also provided. The solutions are developed in the framework of matroid theory, resorting to some results concerning combinatorial optimization.

[1]  R. V. Sonalkar,et al.  An efficient bit-loading algorithm for DMT applications , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[2]  A. Fasano,et al.  Optimal discrete bit loading for DMT based constrained multicarrier systems , 2002, Proceedings IEEE International Symposium on Information Theory,.

[3]  J. Campello.  Optimal discrete bit loading for multicarrier modulation systems , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[4]  G. Di Blasio,et al.  Optimal discrete dynamic loading algorithms for multicarrier systems , 2003, 2003 4th IEEE Workshop on Signal Processing Advances in Wireless Communications - SPAWC 2003 (IEEE Cat. No.03EX689).