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

被引:43
|
作者
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
相关论文
共 50 条
  • [41] Dirty paper coding vs. linear precoding for MIMO broadcast channels
    Lee, Juyul
    Jindal, Nihar
    2006 FORTIETH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS AND COMPUTERS, VOLS 1-5, 2006, : 779 - +
  • [42] On Estimating Maximum Sum Rate of MIMO Systems with Successive Zero-Forcing Dirty Paper Coding and Per-antenna Power Constraint
    Pham, Thuy M.
    Farrell, Ronan
    Le-Nam Tran
    2019 IEEE 30TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2019, : 1150 - 1155
  • [43] Carrier Cooperation Can Reduce the Transmit Power in Parallel MIMO Broadcast Channels With Zero-Forcing
    Hellings, Christoph
    Herrmann, Stephan
    Utschick, Wolfgang
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (12) : 3021 - 3027
  • [44] Modulus Zero-Forcing Detection for MIMO Channels
    Hu, Sha
    Rusek, Fredrik
    2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2018,
  • [45] Unitary Beamformer Designs for MIMO Interference Broadcast Channels
    Razavi, S. Morteza
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2016, 64 (08) : 2090 - 2102
  • [46] Relaxed zero-forcing beamformer under temporally-correlated interference
    Kono, Takehiro
    Yukawa, Masahiro
    Piotrowski, Tomasz
    SIGNAL PROCESSING, 2022, 190
  • [47] A reduced complexity zero-forcing beamformer design for multiuser MIMO systems
    Li, Bin
    Feng, Zhi Guo
    Dam, Hai Huyen
    Cantoni, Antonio
    OPTIMIZATION LETTERS, 2018, 12 (06) : 1373 - 1386
  • [48] A reduced complexity zero-forcing beamformer design for multiuser MIMO systems
    Bin Li
    Zhi Guo Feng
    Hai Huyen Dam
    Antonio Cantoni
    Optimization Letters, 2018, 12 : 1373 - 1386
  • [49] On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming
    Yoo, T
    Goldsmith, A
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (03) : 528 - 541