Beamformer Designs for MISO Broadcast Channels with Zero-Forcing Dirty Paper Coding

被引:44
作者
Le-Nam Tran [1 ]
Juntti, Markku [2 ,3 ]
Bengtsson, Mats [1 ]
Ottersten, Bjoern [1 ,4 ]
机构
[1] KTH Royal Inst Technol, Signal Proc Lab, ACCESS Linnaeus Ctr, SE-10044 Stockholm, Sweden
[2] Univ Oulu, Ctr Wireless Commun, Oulu, Finland
[3] Univ Oulu, Dept Commun Engn, Oulu, Finland
[4] Univ Luxembourg, Interdisciplinary Ctr Secur Reliabil & Trust SnT, L-1359 Luxembourg, Luxembourg
基金
芬兰科学院; 欧洲研究理事会;
关键词
MISO; broadcast; beamforming; dirty paper coding; zero-forcing; TRANSMITTER OPTIMIZATION; PERFORMANCE ANALYSIS; MULTIUSER DIVERSITY; POWER CONSTRAINTS; SUM-CAPACITY; DOWNLINK; DUALITY; DECOMPOSITION; THROUGHPUT;
D O I
10.1109/TWC.2012.122212.120464
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We consider the beamformer design for multipleinput multiple-output (MISO) broadcast channels (MISO BCs) using zero-forcing dirty paper coding (ZF-DPC). Assuming a sum power constraint (SPC), most previously proposed beamformer designs are based on the QR decomposition (QRD), which is a natural choice to satisfy the ZF constraints. However, the optimality of the QRD-based design for ZF-DPC has remained unknown. In this paper, first, we analytically establish that the QRD-based design is indeed optimal for any performance measure under a SPC. Then, we propose an optimal beamformer design method for ZF-DPC with per-antenna power constraints (PAPCs), using a convex optimization framework. The beamformer design is first formulated as a rank-1-constrained optimization problem. Exploiting the special structure of the ZF-DPC scheme, we prove that the rank constraint can be relaxed and still provide the same solution. In addition, we propose a fast converging algorithm to the beamformer design problem, under the duality framework between the BCs and multiple access channels (MACs). More specifically, we show that a BC with ZF-DPC has the dual MAC with ZF-based successive interference cancellation (ZF-SIC). In this way, the beamformer design for ZF-DPC is transformed into a power allocation problem for ZF-SIC, which can be solved more efficiently.
引用
收藏
页码:1173 / 1185
页数:13
相关论文
共 27 条
[1]  
[Anonymous], 2011, CVX MATLAB SOFTWARE
[2]  
Bertsekas D., 2003, Convex Analysis and Optimization
[3]  
Boccardi F., P 2006 IEEE SPAWC, P1
[4]  
Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441
[5]   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
[6]  
Dattorro J., 2011, Convex Optimization & Euclidean Distance Geometry
[7]   Multiuser MISO Transmitter Optimization for Intercell Interference Mitigation [J].
Huh, Hoon ;
Papadopoulos, Haralabos C. ;
Caire, Giuseppe .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (08) :4272-4285
[8]   Greedy scheduling performance for a zero-forcing dirty-paper coded system [J].
Jiang, J ;
Buehrer, RM ;
Tranter, WH .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2006, 54 (05) :789-793
[9]   Sum power iterative water-filling for multi-antenna Gaussian broadcast channels [J].
Jindal, N ;
Rhee, W ;
Vishwanath, S ;
Jafar, SA ;
Goldsmith, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (04) :1570-1580
[10]   Applications of second-order cone programming [J].
Lobo, MS ;
Vandenberghe, L ;
Boyd, S ;
Lebret, H .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1998, 284 (1-3) :193-228