An efficient algorithm for optimal discrete bit-loading in multicarrier systems

  • Authors:
  • Asad Mahmood;J. C. Belfiore

  • Affiliations:
  • ENSTA,, Paris, France;ENST, Paris, France

  • Venue:
  • IEEE Transactions on Communications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 [1] solution along with another recently proposed optimal bit-loading algorithm [2]. Simulation results verify the significant complexity advantage of our algorithm with no loss in performance.