Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality

被引：830

作者：

Viswanath, P ^{[1
]}

Tse, DNC

机构：

[1] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA

[2] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2003年 / 49卷 / 08期

基金：

美国国家科学基金会;

关键词：

broadcast channels; downlink; multiple antennas; wireless system;

D O I：

10.1109/TIT.2003.814483

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We characterize the sum capacity of the vector Gaussian broadcast channel by showing that the existing inner bound of Marton and the existing upper bound of Sato are tight for this channel. We exploit an intimate four-way connection between the vector broadcast channel, the corresponding point-to-point channel (where the receivers can cooperate), the multiple-access channel (MAC) (where the role of transmitters and receivers are reversed), and the corresponding point-to-point channel (where the transmitters can cooperate).

引用

页码：1912 / 1921

页数：10

共 22 条

[1]

[Anonymous], IEEE J SEL AREA COMM

[2]

Boyd S., CONVEX OPTIMIZATION

[3]

CAIRE G, 2003, IEEE T INFOR THEORY, V49

[4] WRITING ON DIRTY PAPER [J].

COSTA, MHM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :439-441

[5]

DIGGAVI SN, P IEEE INT S INF THE, P278

[6]

GASTPAR M, 2001, UNPUB IEEE T INFORM

[7]

Gel'fand S. I., 1980, Problems of Control and Information Theory, V9, P19

[8]

HANLY S, 1999, AUTOMATICA, V35

[9]

JINDAL N, 2001, P ANN ALL C ALL

[10] CODING THEOREM FOR THE DISCRETE MEMORYLESS BROADCAST CHANNEL [J].

MARTON, K .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (03) :306-311

← 1 2 3 →