Please use this identifier to cite or link to this item:
|dc.title||Achieving global optimality for weighted sum-rate maximization in the K-user Gaussian interference channel with multiple antennas|
|dc.identifier.citation||Liu, L., Zhang, R., Chua, K.-C. (2012-05). Achieving global optimality for weighted sum-rate maximization in the K-user Gaussian interference channel with multiple antennas. IEEE Transactions on Wireless Communications 11 (5) : 1933-1945. ScholarBank@NUS Repository. https://doi.org/10.1109/TWC.2012.031212.111585|
|dc.description.abstract||Characterizing the global maximum of weighted sum-rate (WSR) for the K-user Gaussian interference channel (GIC), with the interference treated as Gaussian noise, is a key problem in wireless communication. However, due to the users' mutual interference, this problem is in general non-convex and thus cannot be solved directly by conventional convex optimization techniques. In this paper, by jointly utilizing the monotonic optimization and rate profile techniques, we develop a new framework to obtain the globally optimal power control and/or beamforming solutions to WSR maximization problems for the GICs with single-antenna transmitters and single-antenna receivers (SISO), single-antenna transmitters and multi-antenna receivers (SIMO), or multi-antenna transmitters and single-antenna receivers (MISO). Different from prior work, this paper proposes to maximize the WSR in the achievable rate region of the GIC directly by exploiting the facts that the achievable rate region is a "normal" set and the users' WSR is a strictly increasing function over the rate region. Consequently, the WSR maximization is shown to be in the form of monotonic optimization over a normal set and thus can be solved globally optimally by the existing outer polyblock approximation algorithm. However, an essential step in the algorithm hinges on how to efficiently characterize the intersection point on the Pareto boundary of the achievable rate region with any prescribed "rate profile" vector. This paper shows that such a problem can be transformed into a sequence of signal-to-interference-plus-noise ratio (SINR) feasibility problems, which can be solved efficiently by applying existing techniques. Numerical results validate that the proposed algorithms can achieve the global WSR maximum for the SISO, SIMO or MISO GIC, which serves as a performance benchmark for other heuristic algorithms. © 2002-2012 IEEE.|
|dc.subject||weighted sum-rate maximization|
|dc.contributor.department||ELECTRICAL & COMPUTER ENGINEERING|
|dc.description.sourcetitle||IEEE Transactions on Wireless Communications|
|Appears in Collections:||Staff Publications|
Show simple item record
Files in This Item:
There are no files associated with this item.
checked on Jan 15, 2020
WEB OF SCIENCETM
checked on Jan 7, 2020
checked on Dec 30, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.