< Back to previous page

Publication

A Fast Bit Removal Greedy Algorithm for Multiuser DMT-based systems

Book Contribution - Book Chapter Conference Contribution

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.
Book: 2011 IEEE International Conference on Communications (ICC)
ISBN:1550-3607
Publication year:2011
Keywords:greedy algorithms, multi-access systems
  • Scopus Id: 80052152665