Iterative water-filling for Gaussian vector multiple-access channels

被引:624
作者
Yu, W [1 ]
Rhee, WJ
Boyd, S
Cioffi, JM
机构
[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 3G4, Canada
[2] ArryComm Inc, San Jose, CA 95131 USA
[3] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
基金
美国国家科学基金会;
关键词
channel capacity; convex optimization; Gaussian channels; multiuser channels; multiple-access channels; multiple-access communications; multiple-antenna systems; optimization methods; power control; water-filling;
D O I
10.1109/TIT.2003.821988
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This correspondence proposes an efficient numerical algorithm to compute the optimal input distribution that maximizes the sum capacity of a Gaussian multiple-access channel with vector inputs and a vector output. The numerical algorithm has an iterative water-filling interpretation. The algorithm converges from any starting point, and it reaches within 1/2 nats per user per output dimension from the sum capacity after just one iteration. The characterization of sum capacity also allows an upper bound and a lower bound for the entire capacity region to be derived.
引用
收藏
页码:145 / 152
页数:8
相关论文
共 19 条
[1]  
Ahlswede R., 1971, P 2 INT S INF THEOR, P103
[2]  
Boyd S., 2003, CONVEX OPTIMIZATION
[3]  
CHENG RS, 1993, IEEE T INFORM THEORY, V39, P773, DOI 10.1109/18.256487
[4]  
Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
[5]   A PERSPECTIVE ON MULTIACCESS CHANNELS [J].
GALLAGER, RG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (02) :124-142
[6]  
GALLAGER RG, 1988, PROCEEDINGS OF THE 22ND CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 & 2, P372
[7]  
Horn R. A., 1990, MATRIX ANAL
[8]  
KNOPP R, 1995, ICC '95 - 1995 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CONFERENCE RECORD, VOLS 1-3, P331, DOI 10.1109/ICC.1995.525188
[9]  
Liao H. H. J., 1972, THESIS U HAWAII HONO
[10]   The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel [J].
Médard, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (03) :933-946