For a multiuser multi-input multi-output (MU-MIMO) multicell network, the Han-Kobayashi strategy aims to improve the achievable rate region by splitting the data information intended to a serviced user (UE) into a common message and a private message. The common message is decodable by this UE and another UE from an adjacent cell so that the corresponding intercell interference is cancelled off. This work aims to design optimal precoders for both common and private messages to maximize the network sum-rate, which is a highly nonlinear and nonsmooth function in the precoder matrix variables. Existing approaches are unable to address this difficult problem. In this paper, we develop a successive convex quadratic programming algorithm that generates a sequence of improved points. We prove that the proposed algorithm converges to at least a local optimum of the considered problem. Numerical results confirm the advantages of our proposed algorithm over conventional coordinated precoding approaches where the intercell interference is treated as noise.
Ho Huu Minh TAM
University of Technology
Hoang Duong TUAN
University of Technology
Duy Trong NGO
The University of Newcastle
Ha Hoang NGUYEN
University of Saskatchewan
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ho Huu Minh TAM, Hoang Duong TUAN, Duy Trong NGO, Ha Hoang NGUYEN, "Precoding Design for Han-Kobayashi's Signal Splitting in MIMO Interference Networks" in IEICE TRANSACTIONS on Communications,
vol. E100-B, no. 6, pp. 1010-1016, June 2017, doi: 10.1587/transcom.2016EBP3209.
Abstract: For a multiuser multi-input multi-output (MU-MIMO) multicell network, the Han-Kobayashi strategy aims to improve the achievable rate region by splitting the data information intended to a serviced user (UE) into a common message and a private message. The common message is decodable by this UE and another UE from an adjacent cell so that the corresponding intercell interference is cancelled off. This work aims to design optimal precoders for both common and private messages to maximize the network sum-rate, which is a highly nonlinear and nonsmooth function in the precoder matrix variables. Existing approaches are unable to address this difficult problem. In this paper, we develop a successive convex quadratic programming algorithm that generates a sequence of improved points. We prove that the proposed algorithm converges to at least a local optimum of the considered problem. Numerical results confirm the advantages of our proposed algorithm over conventional coordinated precoding approaches where the intercell interference is treated as noise.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2016EBP3209/_p
Copy
@ARTICLE{e100-b_6_1010,
author={Ho Huu Minh TAM, Hoang Duong TUAN, Duy Trong NGO, Ha Hoang NGUYEN, },
journal={IEICE TRANSACTIONS on Communications},
title={Precoding Design for Han-Kobayashi's Signal Splitting in MIMO Interference Networks},
year={2017},
volume={E100-B},
number={6},
pages={1010-1016},
abstract={For a multiuser multi-input multi-output (MU-MIMO) multicell network, the Han-Kobayashi strategy aims to improve the achievable rate region by splitting the data information intended to a serviced user (UE) into a common message and a private message. The common message is decodable by this UE and another UE from an adjacent cell so that the corresponding intercell interference is cancelled off. This work aims to design optimal precoders for both common and private messages to maximize the network sum-rate, which is a highly nonlinear and nonsmooth function in the precoder matrix variables. Existing approaches are unable to address this difficult problem. In this paper, we develop a successive convex quadratic programming algorithm that generates a sequence of improved points. We prove that the proposed algorithm converges to at least a local optimum of the considered problem. Numerical results confirm the advantages of our proposed algorithm over conventional coordinated precoding approaches where the intercell interference is treated as noise.},
keywords={},
doi={10.1587/transcom.2016EBP3209},
ISSN={1745-1345},
month={June},}
Copy
TY - JOUR
TI - Precoding Design for Han-Kobayashi's Signal Splitting in MIMO Interference Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1010
EP - 1016
AU - Ho Huu Minh TAM
AU - Hoang Duong TUAN
AU - Duy Trong NGO
AU - Ha Hoang NGUYEN
PY - 2017
DO - 10.1587/transcom.2016EBP3209
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E100-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2017
AB - For a multiuser multi-input multi-output (MU-MIMO) multicell network, the Han-Kobayashi strategy aims to improve the achievable rate region by splitting the data information intended to a serviced user (UE) into a common message and a private message. The common message is decodable by this UE and another UE from an adjacent cell so that the corresponding intercell interference is cancelled off. This work aims to design optimal precoders for both common and private messages to maximize the network sum-rate, which is a highly nonlinear and nonsmooth function in the precoder matrix variables. Existing approaches are unable to address this difficult problem. In this paper, we develop a successive convex quadratic programming algorithm that generates a sequence of improved points. We prove that the proposed algorithm converges to at least a local optimum of the considered problem. Numerical results confirm the advantages of our proposed algorithm over conventional coordinated precoding approaches where the intercell interference is treated as noise.
ER -