Efficient Zero-Forcing Precoder Design for Weighted Sum-Rate Maximization with Per-Antenna Power Constraint
- Publication Type:
- Journal Article
- Citation:
- IEEE Transactions on Vehicular Technology, 2018, 67 (4), pp. 3640 - 3645
- Issue Date:
- 2018-04-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 08118138.pdf | Published Version | 426.52 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 1967-2012 IEEE. This paper proposes an efficient (semi-closed-form) zero-forcing (ZF) precoder design for the weighted sum-rate maximization problem under per-antenna power constraint (PAPC). Existing approaches for this problem are based on either interior-point methods that do not favorably scale with the problem size or subgradient methods that are widely known to converge slowly. To address these shortcomings, our proposed method is derived from three elements: minimax duality, alternating optimization (AO), and successive convex approximation (SCA). Specifically, the minimax duality is invoked to transform the considered problem into an equivalent minimax problem, for which we then recruit AO and SCA to find a saddle point, which enables us to take advantages of closed-form expressions and hence achieve fast convergence rate. Moreover, the complexity of the proposed method scales linearly with the number of users, compared to cubically for the standard interior-point methods. We provide an analytical proof for the convergence of the proposed method and numerical results to demonstrate its superior performance over existing approaches. Our proposed method offers a powerful tool to characterize the achievable rate region of ZF schemes under PAPC for massive multiple-input multiple-output.
Please use this identifier to cite or link to this item: