Practical bit loading for DMT

In a previous work by Campello (see International Symposium on Information Theory, p.193, p.12-16, 1998), necessary and sufficient conditions for a discrete bit assignment to be the solution to the discrete bit loading problems were derived. In the present work, we make use of these results to derive fast algorithms that can be efficiently implemented in practice.