Max-min fairness linear transceiver design for a multi-user MIMO interference channel

Ya Feng Liu; Yu Hong Dai; Zhi Quan Luo

doi:10.1109/icc.2011.5963039

Max-min fairness linear transceiver design for a multi-user MIMO interference channel

Ya Feng Liu, Yu Hong Dai, Zhi Quan Luo

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

27 Scopus citations

Abstract

Consider the max-min fairness linear transceiver design for a multi-user MIMO interference channel. Assuming perfect channel knowledge, this problem can be formulated as the maximization of minimum SINR utility, subject to individual power constraints at each transmitter. In this paper, it is shown that when the number of antennas at each transmitter (receiver) is at least two and at each receiver (transmitter) is at least three, the problem of checking whether the given target SINR is feasible is strongly NP-hard. A cyclic coordinate ascent algorithm is also proposed for this design problem. Monotonicity and global convergence to KKT solution of the proposed algorithm are proved.

Original language	English (US)
Title of host publication	2011 IEEE International Conference on Communications, ICC 2011
DOIs	https://doi.org/10.1109/icc.2011.5963039
State	Published - 2011
Event	2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan Duration: Jun 5 2011 → Jun 9 2011

Publication series

Name	IEEE International Conference on Communications
ISSN (Print)	0536-1486

Other

Other	2011 IEEE International Conference on Communications, ICC 2011
Country/Territory	Japan
City	Kyoto
Period	6/5/11 → 6/9/11

Publisher link

10.1109/icc.2011.5963039

Find It

Find It at U of M Libraries

Cite this

Liu, YF, Dai, YH & Luo, ZQ 2011, Max-min fairness linear transceiver design for a multi-user MIMO interference channel. in 2011 IEEE International Conference on Communications, ICC 2011., 5963039, IEEE International Conference on Communications, 2011 IEEE International Conference on Communications, ICC 2011, Kyoto, Japan, 6/5/11. https://doi.org/10.1109/icc.2011.5963039

@inproceedings{b3a420779e75475b89b4eaf7bac52e89,

title = "Max-min fairness linear transceiver design for a multi-user MIMO interference channel",

abstract = "Consider the max-min fairness linear transceiver design for a multi-user MIMO interference channel. Assuming perfect channel knowledge, this problem can be formulated as the maximization of minimum SINR utility, subject to individual power constraints at each transmitter. In this paper, it is shown that when the number of antennas at each transmitter (receiver) is at least two and at each receiver (transmitter) is at least three, the problem of checking whether the given target SINR is feasible is strongly NP-hard. A cyclic coordinate ascent algorithm is also proposed for this design problem. Monotonicity and global convergence to KKT solution of the proposed algorithm are proved.",

author = "Liu, {Ya Feng} and Dai, {Yu Hong} and Luo, {Zhi Quan}",

year = "2011",

doi = "10.1109/icc.2011.5963039",

language = "English (US)",

isbn = "9781612842332",

series = "IEEE International Conference on Communications",

booktitle = "2011 IEEE International Conference on Communications, ICC 2011",

note = "2011 IEEE International Conference on Communications, ICC 2011 ; Conference date: 05-06-2011 Through 09-06-2011",

}

TY - GEN

T1 - Max-min fairness linear transceiver design for a multi-user MIMO interference channel

AU - Liu, Ya Feng

AU - Dai, Yu Hong

AU - Luo, Zhi Quan

PY - 2011

Y1 - 2011

N2 - Consider the max-min fairness linear transceiver design for a multi-user MIMO interference channel. Assuming perfect channel knowledge, this problem can be formulated as the maximization of minimum SINR utility, subject to individual power constraints at each transmitter. In this paper, it is shown that when the number of antennas at each transmitter (receiver) is at least two and at each receiver (transmitter) is at least three, the problem of checking whether the given target SINR is feasible is strongly NP-hard. A cyclic coordinate ascent algorithm is also proposed for this design problem. Monotonicity and global convergence to KKT solution of the proposed algorithm are proved.

AB - Consider the max-min fairness linear transceiver design for a multi-user MIMO interference channel. Assuming perfect channel knowledge, this problem can be formulated as the maximization of minimum SINR utility, subject to individual power constraints at each transmitter. In this paper, it is shown that when the number of antennas at each transmitter (receiver) is at least two and at each receiver (transmitter) is at least three, the problem of checking whether the given target SINR is feasible is strongly NP-hard. A cyclic coordinate ascent algorithm is also proposed for this design problem. Monotonicity and global convergence to KKT solution of the proposed algorithm are proved.

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

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

U2 - 10.1109/icc.2011.5963039

DO - 10.1109/icc.2011.5963039

M3 - Conference contribution

AN - SCOPUS:80052142238

SN - 9781612842332

T3 - IEEE International Conference on Communications

BT - 2011 IEEE International Conference on Communications, ICC 2011

T2 - 2011 IEEE International Conference on Communications, ICC 2011

Y2 - 5 June 2011 through 9 June 2011

ER -

Max-min fairness linear transceiver design for a multi-user MIMO interference channel

Abstract

Publication series

Other

Publisher link

Find It

Other files and links

Fingerprint

Cite this