The duality between margin maximization and rate maximization discrete loading problems
暂无分享,去创建一个
We consider discrete bit loading problems for multicarrier systems employing DMT (discrete multitone). In this context two problems are of practical interest, namely margin maximization (also known as margin-adaptive loading) and rate maximization (also known as rate-adaptive loading). In the current literature the two problems are regarded as different and different algorithms are usually provided in order to solve them. In this work we will be able to establish a duality between the two problems. That is, a tight connection between them such that, under certain hypotheses, the same solution solves both problems. This result is interesting both from the theoretical and the practical point of view. With regard to the former it provides a unifying framework for the analysis of two apparently different problems. With respect to the latter it allows an easy derivation of loading algorithms for one of the problems whenever the corresponding algorithms for the other are known. Examples of application of the duality are also provided.
[1] A. Fasano,et al. Optimal discrete bit loading for DMT based constrained multicarrier systems , 2002, Proceedings IEEE International Symposium on Information Theory,.
[2] J. Campello. Optimal discrete bit loading for multicarrier modulation systems , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[3] Antonio Fasano. On the optimal discrete bit loading for multicarrier systems with constraints , 2003, The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring..