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

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.