Precoding for multiple antenna Gaussian broadcast channels with successive, zero-forcing

被引:95
作者
Dabbagh, Arnir D. [1 ]
Love, David J. [1 ]
机构
[1] Purdue Univ, Sch Elect & Comp Engn, Ctr Wireless Syst & Applicat, W Lafayette, IN 47907 USA
基金
美国国家科学基金会;
关键词
controlled interference; dirty-paper coding; multiple-input multiple-output (MIMO) broadcast channels (BCs); precoding;
D O I
10.1109/TSP.2007.894285
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we consider the multiuser Gaussian broadcast channel with multiple transmit antennas at the base station and multiple receive antennas at each user. Assuming full knowledge of the channel state information at the transmitter and the different receivers, a new transmission scheme that employs partial interference cancellation at the transmitter with dirty-paper encoding and decoding is proposed. The maximal achievable throughput of this system is characterized, and it is shown that given any ordered set of users the proposed scheme is asymptotically optimal in the high signal-to-noise ratio (SNR) regime. In addition, with optimal user ordering, the proposed scheme is shown to be optimal in the low-SNR regime. We also consider a linear transmission scheme which employs only partial interuser interference cancellation at the base station without dirty-paper coding. Given a transmit power constraint at the base station, the sum-rate capacity of this scheme is characterize an a suboptimal precoding algorithm is proposed. In several cases, it is shown that, for all values of the SNR, the achievable throughput of this scheme is strictly larger than a system which employs full interference cancellation at the base station [21]. In. addition, it is shown that, in some cases, the linear transmission scheme can support simultaneously an increased number of users while achieving a larger system throughput.
引用
收藏
页码:3837 / 3850
页数:14
相关论文
共 30 条
[1]  
Boccardi F, 2006, INT ZUR SEM COMM ZUR
[2]   On the achievable throughput of a multiantenna Gaussian broadcast channel [J].
Caire, G ;
Shamai, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (07) :1691-1706
[3]  
CHEN R, 2005, IEEE T SIGNAL PROCES, V53, P1159
[4]   WRITING ON DIRTY PAPER [J].
COSTA, MHM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :439-441
[5]   On downlink beamforming with greedy user selection: Performance analysis and a simple new algorithm [J].
Dimic, G ;
Sidiropoulos, ND .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (10) :3857-3868
[6]   Capacity and lattice strategies for canceling known interference [J].
Erez, U ;
Shamai, S ;
Zamir, R .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (11) :3820-3833
[7]   A close-to-capacity dirty paper coding scheme [J].
Erez, U ;
ten Brink, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (10) :3417-3432
[8]  
Fischer RFH, 2003, 2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, P163
[9]   Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture [J].
Golden, GD ;
Foschini, CJ ;
Valenzuela, RA ;
Wolniansky, PW .
ELECTRONICS LETTERS, 1999, 35 (01) :14-16
[10]  
HE J, 2006, C INF SCI SYST HON H