Suboptimal Greedy Power Allocation Schemes for Discrete Bit Loading

Table 1

Computational analysis for both GPA and g-GPA algorithms.

Algorithm	Number of operations (NoO)
GPA	𝐿1(2𝑁+7)+4𝑁+1
g-GPA (no order)	^𝐾−∑^1𝑘=0𝐿^𝑘2(2𝑁𝑘+4)+2𝑁𝑘+2≈𝐿22𝑁𝐾𝑁+4+2𝐾+2
g-GPA (order)	^𝐾−∑^1𝑘=0𝐿^𝑘2(𝑁𝑘+5)+2𝑁𝑘+2≈𝐿2𝑁𝐾𝑁+5+2𝐾+2