Browse ORBi

- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?

ORBi

Energy-efficient joint unicast and multicast beamforming with multi-antenna user terminals ; ; Chatzinotas, Symeon et al in 2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) (2017) Detailed reference viewed: 68 (1 UL)Multi-cell interference coordination for multigroup multicast transmission ; ; Chatzinotas, Symeon et al in 2017 European Conference on Networks and Communications (EuCNC) (2017) Detailed reference viewed: 63 (0 UL)Energy-efficient coordinated multi-cell multi-group multicast beamforming with antenna selection ; ; et al in 2017 IEEE International Conference on Communications Workshops (ICC) (2017) Detailed reference viewed: 78 (0 UL)Beamformer designs for MISO broadcast channels with zero-forcing dirty paper coding ; ; et al in IEEE Transactions on Wireless Communications (2013), 3(12), 1173-1185 We consider the beamformer design for multiple-input multiple-output (MISO) broadcast channels (MISO BCs) using zero-forcing dirty paper coding (ZF-DPC). Assuming a sum power constraint (SPC), most ... [more ▼] We consider the beamformer design for multiple-input multiple-output (MISO) broadcast channels (MISO BCs) using zero-forcing dirty paper coding (ZF-DPC). Assuming a sum power constraint (SPC), most previously proposed beamformer designs are based on the QR decomposition (QRD), which is a natural choice to satisfy the ZF constraints. However, the optimality of the QRD-based design for ZF-DPC has remained unknown. In this paper, first, we analytically establish that the QRD-based design is indeed optimal for any performance measure under a SPC. Then, we propose an optimal beamformer design method for ZF-DPC with per-antenna power constraints (PAPCs), using a convex optimization framework. The beamformer design is first formulated as a rank-1-constrained optimization problem. Exploiting the special structure of the ZF-DPC scheme, we prove that the rank constraint can be relaxed and still provide the same solution. In addition, we propose a fast converging algorithm to the beamformer design problem, under the duality framework between the BCs and multiple access channels (MACs). More specifically, we show that a BC with ZF-DPC has the dual MAC with ZF-based successive interference cancellation (ZF-SIC). In this way, the beamformer design for ZF-DPC is transformed into a power allocation problem for ZF-SIC, which can be solved more efficiently. [less ▲] Detailed reference viewed: 149 (1 UL)Weighted sum rate maximization for MIMO broadcast channels using dirty paper coding and zero-forcing methods ; ; et al in IEEE Transactions on Communications (2013), 6(61), 2362-2373 We consider precoder design for maximizing the weighted sum rate (WSR) of successive zero-forcing dirty paper coding (SZF-DPC). For this problem, the existing precoder designs often assume a sum power ... [more ▼] We consider precoder design for maximizing the weighted sum rate (WSR) of successive zero-forcing dirty paper coding (SZF-DPC). For this problem, the existing precoder designs often assume a sum power constraint (SPC) and rely on the singular value decomposition (SVD). The SVD-based designs are known to be optimal but require high complexity. We first propose a low-complexity optimal precoder design for SZF-DPC under SPC, using the QR decomposition. Then, we propose an efficient numerical algorithm to find the optimal precoders subject to per-antenna power constraints (PAPCs). To this end, the precoder design for PAPCs is formulated as an optimization problem with a rank constraint on the covariance matrices. A well-known approach to solve this problem is to relax the rank constraints and solve the relaxed problem. Interestingly, for SZF-DPC, we are able to prove that the rank relaxation is tight. Consequently, the optimal precoder design for PAPCs is computed by solving the relaxed problem, for which we propose a customized interior-point method that exhibits a superlinear convergence rate. Two suboptimal precoder designs are also presented and compared to the optimal ones. We also show that the proposed numerical method is applicable for finding the optimal precoders for block diagonalization scheme. [less ▲] Detailed reference viewed: 129 (0 UL)On the optimality of beamformer design for zero-forcing DPC with QR decomposition ; ; 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: 90 (0 UL)Successive zero-forcing DPC with sum power constraint: Low-complexity optimal designs ; ; 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: 104 (0 UL)Successive zero-forcing DPC with per-antenna power constraint: Optimal and suboptimal designs ; ; 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: 140 (0 UL) |
||