Bit and power allocation remains a challenge inmultiuser multicarrier systems though optimal and suboptimal algorithms have been proposed. In this paper, we optimize the multiuser bit removal greedy algorithm by allowing removing bits in parallel, so reducing the computation time of the algorithm and making it attractive for real implementations. It has been proved that the proposed algorithm converges faster than both the traditional multiuser greedy algorithm and the multiuser bit removal greedy algorithm. This is another approach in comparison to other centralized and distributed algorithms like Optimum Spectrum Balancing (OSB) and Convex Approximation Distributed Spectrum Balancing (CA-DSB).
|Title of host publication||PIMRC 2011 - The 22nd Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Toronto, Canada, September 11-14, 2011|
|Publication status||Published - 11 Sep 2011|
|Event||Unknown - |
Duration: 11 Sep 2011 → …
|Period||11/09/11 → …|
- bit removal greedy
- power allocation