References of "Tran, L.-N"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailOn the optimality of beamformer design for zero-forcing DPC with QR decomposition
Tran, L.-N.; Juntti, M.; Bengtsson, M. et al

in IEEE International Conference on Communications (2012)

We consider the beamformer design for zero-forcing dirty paper coding (ZF-DPC), a suboptimal transmission technique for MISO broadcast channels (MISO BCs). Beamformers for ZF-DPC are designed to maximize ... [more ▼]

We consider the beamformer design for zero-forcing dirty paper coding (ZF-DPC), a suboptimal transmission technique for MISO broadcast channels (MISO BCs). Beamformers for ZF-DPC are designed to maximize a performance measure, subject to some power constraints and zero-interference constraints. For the sum rate maximization problem under a total power constraint, the existing beamformer designs in the literature are based on the QR decomposition (QRD), which is used to satisfy the ZF constraints. However, the optimality of the QRD-based design is still unknown. First, we prove that the QRD-based design is indeed optimal for ZF-DPC for any performance measure under a sum power constraint. For the per-antenna power constraints, the QRD-based designs become suboptimal, and we propose an optimal design, using a convex optimization framework. Low-complexity suboptimal designs are also presented. © 2012 IEEE. [less ▲]

Detailed reference viewed: 78 (0 UL)
Full Text
Peer Reviewed
See detailSuccessive zero-forcing DPC with sum power constraint: Low-complexity optimal designs
Tran, L.-N.; Juntti, M.; Bengtsson, M. et al

in 2012 IEEE International Conference on Communications, ICC 2012 (2012)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 90 (0 UL)
Full Text
Peer Reviewed
See detailSuccessive zero-forcing DPC with per-antenna power constraint: Optimal and suboptimal designs
Tran, L.-N.; Juntti, M.; Bengtsson, M. et al

in Proceedings of the 2012 IEEE International Conference on Communications (2012)

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 125 (0 UL)