Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cordova, H. ; V rije Univ. Brussels, Brussels, Belgium ; Van Biesen, L.

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.

Published in:
Communications (ICC), 2011 IEEE International Conference on

Date of Conference: 5-9 June 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.