TY - GEN

T1 - Spectrum management for interference-limited multiuser communication systems

AU - Hayashi, Shunsuke

AU - Luo, Zhi-Quan

PY - 2006/1/1

Y1 - 2006/1/1

N2 - In this paper, we study optimal spectrum sharing strategies for the maximization of sum-rate in a frequency selective multiuser communication system. We show that, if the normalized crosstalk coefficients are larger than a given threshold (roughly equal to 1/2), then the optimal spectrum sharing strategy is frequency division multiple access (FDMA). In case of arbitrary positive crosstalk coefficients, if each user's power budget exceeds a given threshold, then FDMA is again sum-rate optimal, at least in a local sense. In addition, we show that the problem of finding the optimal FDMA spectrum allocation is NP-hard, implying that the general problem of maximizing sum-rate is also NP-hard, even in the case of two users. We also propose several simple distributed spectrum allocation algorithms that can approximately maximize sum-rates. Numerical results indicate that these algorithms are efficient and can achieve substantially larger sum-rates than the existing Iterative Waterfilling solutions, either in an interference-rich environment or when the users' power budgets are sufficiently high.

AB - In this paper, we study optimal spectrum sharing strategies for the maximization of sum-rate in a frequency selective multiuser communication system. We show that, if the normalized crosstalk coefficients are larger than a given threshold (roughly equal to 1/2), then the optimal spectrum sharing strategy is frequency division multiple access (FDMA). In case of arbitrary positive crosstalk coefficients, if each user's power budget exceeds a given threshold, then FDMA is again sum-rate optimal, at least in a local sense. In addition, we show that the problem of finding the optimal FDMA spectrum allocation is NP-hard, implying that the general problem of maximizing sum-rate is also NP-hard, even in the case of two users. We also propose several simple distributed spectrum allocation algorithms that can approximately maximize sum-rates. Numerical results indicate that these algorithms are efficient and can achieve substantially larger sum-rates than the existing Iterative Waterfilling solutions, either in an interference-rich environment or when the users' power budgets are sufficiently high.

UR - http://www.scopus.com/inward/record.url?scp=84940666266&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940666266&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84940666266

T3 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

SP - 855

EP - 856

BT - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering

T2 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

Y2 - 27 September 2006 through 29 September 2006

ER -