期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 50, 期 1, 页码 145-152出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2003.821988
关键词
channel capacity; convex optimization; Gaussian channels; multiuser channels; multiple-access channels; multiple-access communications; multiple-antenna systems; optimization methods; power control; water-filling
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据