1. Successive zero-forcing DPC with per-antenna power constraint: Optimal and suboptimal designs
- Author
-
Mats Bengtsson, Markku Juntti, Bjorn Ottersten, and Le-Nam Tran
- Subjects
Mathematical optimization ,Design ,Optimization problem ,Computer science ,MIMO ,Precoder design ,050801 communication & media studies ,Telecommunication links ,Data_CODINGANDINFORMATIONTHEORY ,02 engineering and technology ,Precoding ,Relaxed problem ,Electrical & electronics engineering [C06] [Engineering, computing & technology] ,0508 media and communications ,Fast convergence rate ,Control theory ,0202 electrical engineering, electronic engineering, information engineering ,Constrained optimization ,Power constraints ,Computer Science::Information Theory ,Ingénierie électrique & électronique [C06] [Ingénierie, informatique & technologie] ,Problem solving ,Channel code ,Sub-optimal designs ,05 social sciences ,Optimal systems ,020206 networking & telecommunications ,Radio broadcasting ,MIMO broadcast channels ,Computational complexity ,Dirty paper coding ,Rate of convergence ,Achievable sum rates ,Per-antenna power constraints ,Antennas ,Relaxation (approximation) ,Optimal solutions ,Transmission techniques ,Zero-forcing ,Optimization problems ,Algorithms - Abstract
This paper considers the precoder designs for successive zero-forcing dirty paper coding (SZF-DPC), a suboptimal transmission technique for MIMO broadcast channels (MIMO BCs). Existing precoder designs for SZF-DPC often consider a sum power constraint. In this paper, we address the precoder design for SZF-DPC with per-antenna power constraints (PAPCs), which has not been well studied. First, we formulate the precoder design as a rank-constrained optimization problem, which is generally difficult to handle. To solve this problem, we follow a relaxation approach, and prove that the optimal solution of the relaxed problem is also optimal for the original problem. Considering the relaxed problem, we propose a numerically efficient algorithm to find the optimal solution, which exhibits a fast convergence rate. Suboptimal precoder designs, with lower computational complexity, are also presented, and compared with the optimal ones in terms of achievable sum rate and computational complexity. © 2012 IEEE.
- Published
- 2012