By Topic

An efficient algorithm for optimal discrete bit-loading in multicarrier 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
$33 $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)
Asad Mahmood ; ENSTA, 32 Bd. Victor - 75739 Paris, France ; J. C. Belfiore

An efficient algorithm for bit-loading in multicarrier systems is proposed based upon an allocation rhythm/order underlying the classical optimal greedy bit-allocation procedure. An accurate complexity comparison in terms of the exact number of execution cycles over a processor is made with the classical Greedy solution along with another recently proposed optimal bit-loading algorithm. Simulation results verify the significant complexity advantage of our algorithm with no loss in performance.

Published in:

IEEE Transactions on Communications  (Volume:58 ,  Issue: 6 )