A Fast Bit Removal Greedy Algorithm for Multiuser DMT-Based Systems

Adaptive bit allocation for DMT-based systems is critical for preventing performance degradation due to poor allocation of bits given challenging channel conditions. In this paper, we extend the bit removal greedy algorithm to a multi-user environment. It has been proved that the proposed algorithm converges faster than the traditional multiuser greedy algorithm.