TY - GEN
T1 - On gaussian MIMO BC-MAC duality with multiple transmit covariance constraints
AU - Zhang, Lan
AU - Zhang, Rui
AU - Liang, Ying Chang
AU - Van, Xintt
AU - Poor, H. Vincent
PY - 2009
Y1 - 2009
N2 - The conventional Gaussian multiple-input multipleoutput (MIMO) broadcast channel (BC)- multiple-access channel (MAC) duality has previously been applied to solve non-convex BC capacity computation problems. However, this conventional duality approach is applicable only to the case in which the base station (BS) of the BC is subject to a single sum-power constraint. An alternative approach is the minimax duality, established by Yu in the framework of Lagrange duality, which can be applied to solve the per-antenna power constraint case. This paper first extends the conventional BC-MAC duality to the general linear transmit covariance constraint (LTCC) case, and thereby establishes a general BC-MAC duality. This new duality is then applied to solve the BC capacity computation problem with multiple LTCCs. Moreover, the relationship between this new general BC-MAC duality and the minimax duality is also presented, and it is shown that the general BC-MAC duality has a simpler form. Numerical results are provided to illustrate the effectiveness of the proposed algorithm.
AB - The conventional Gaussian multiple-input multipleoutput (MIMO) broadcast channel (BC)- multiple-access channel (MAC) duality has previously been applied to solve non-convex BC capacity computation problems. However, this conventional duality approach is applicable only to the case in which the base station (BS) of the BC is subject to a single sum-power constraint. An alternative approach is the minimax duality, established by Yu in the framework of Lagrange duality, which can be applied to solve the per-antenna power constraint case. This paper first extends the conventional BC-MAC duality to the general linear transmit covariance constraint (LTCC) case, and thereby establishes a general BC-MAC duality. This new duality is then applied to solve the BC capacity computation problem with multiple LTCCs. Moreover, the relationship between this new general BC-MAC duality and the minimax duality is also presented, and it is shown that the general BC-MAC duality has a simpler form. Numerical results are provided to illustrate the effectiveness of the proposed algorithm.
UR - http://www.scopus.com/inward/record.url?scp=70449514534&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449514534&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2009.5206059
DO - 10.1109/ISIT.2009.5206059
M3 - Conference contribution
AN - SCOPUS:70449514534
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2502
EP - 2506
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -