A Low Complexity Optimal Bit Allocation Algorithm

OWA Algorithm was proposed. OWA gave water filling bit allocation to each sub channel, adjusted bits´ number of each sub channel until satisfying efficient character, and used bit-filling or bit-removal procedure under constraint power until satisfying E-tight character, implementing rate maximization. Simulation shows this algorithm implements the same optimal performance as Greedy algorithm but largely decreases complexity and is of the same degree of complexity as Jang, Leke, Krongold algorithms but implements optimal performance.