Reference : Successive zero-forcing DPC with sum power constraint: Low-complexity optimal designs
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Electrical & electronics engineering
http://hdl.handle.net/10993/25383
Successive zero-forcing DPC with sum power constraint: Low-complexity optimal designs
English
Tran, L.-N. [Centre for Wireless Communications and Dept. Commun. Eng., University of Oulu, Oulu, Finland]
Juntti, M. [Centre for Wireless Communications and Dept. Commun. Eng., University of Oulu, Oulu, Finland]
Bengtsson, M. [Centre for Wireless Communications, Dept. Commun. Eng., University of Oulu, Oulu, Finland]
Ottersten, Björn mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) >]
2012
2012 IEEE International Conference on Communications, ICC 2012
4857-4861
Yes
International
2012 IEEE International Conference on Communications, ICC 2012
10 June 2012 through 15 June 2012
Ottawa, ON
[en] Channel matrices ; Design method ; Dirty paper coding ; Iterative algorithm ; Low-complexity ; Lower complexity ; Maximization problem ; MIMO broadcast channels ; Null space ; Optimal design ; Orthonormal basis ; Power constraints ; Precoder design ; Precoders ; QR decomposition ; Recursive structure ; Residual interference ; Sum-rate ; Zero-forcing ; Algorithms ; Design ; Interference suppression ; Optimization ; Radio broadcasting ; Singular value decomposition ; Telecommunication links
[en] Successive zero-forcing dirty paper coding (SZF-DPC) is a simplified alternative to DPC for MIMO broadcast channels (MIMO BCs). In the SZF-DPC scheme, the noncausally-known interference is canceled by DPC, while the residual interference is suppressed by the ZF technique. Due to the ZF constraints, the precoders are constrained to lie in the null space of a matrix. For the sum rate maximization problem under a sum power constraint, the existing precoder designs naturally rely on the singular value decomposition (SVD). The SVD-based design is optimal but needs high computational complexity. Herein, we propose two low-complexity optimal precoder designs for SZF-DPC, all based on the QR decomposition (QRD), which requires lower complexity than SVD. The first design method is an iterative algorithm to find an orthonormal basis of the null space of a matrix that has a recursive structure. The second proposed method, which will be shown to require the lowest complexity, results from applying a single QRD to the matrix comprising all users' channel matrices. We analytically and numerically show that the two proposed precoder designs are optimal. © 2012 IEEE.
http://hdl.handle.net/10993/25383
10.1109/ICC.2012.6364080
94823
9781457720529

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
Succesive Zero-forcing DPC with Sum Power Constraint.pdfPublisher postprint185.05 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.