Reference : Successive zero-forcing DPC with per-antenna power constraint: Optimal and suboptimal...
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Electrical & electronics engineering
http://hdl.handle.net/10993/25027
Successive zero-forcing DPC with per-antenna power constraint: Optimal and suboptimal designs
English
Tran, L.-N. [Centre for Wireless Communications, Dept. Commun. Eng., University of Oulu, Oulu, Finland]
Juntti, M. [Centre for Wireless Communications, Dept. Commun. Eng., University of Oulu, Oulu, Finland]
Bengtsson, M. [ACCESS Linnaeus Center, Royal Institute of Technology (KTH), Stockholm, Sweden]
Ottersten, Björn mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) >]
2012
Proceedings of the 2012 IEEE International Conference on Communications
3746-3751
Yes
International
2012 IEEE International Conference on Communications, ICC 2012
10 June 2012 through 15 June 2012
Ottawa, ON
[en] Achievable sum rates ; Dirty paper coding ; Fast convergence rate ; MIMO broadcast channels ; Optimal solutions ; Optimization problems ; Per-antenna power constraints ; Power constraints ; Precoder design ; Relaxed problem ; Sub-optimal designs ; Transmission techniques ; Zero-forcing ; Algorithms ; Antennas ; Computational complexity ; Constrained optimization ; Design ; Optimal systems ; Radio broadcasting ; Telecommunication links ; Problem solving
[en] 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.
http://hdl.handle.net/10993/25027
10.1109/ICC.2012.6364222
94823
9781457720529

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
Successive Zero-forcing DPC with Per-Antenna.pdfPublisher postprint371.17 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.