In this paper, we investigate the problem of maximizing the weighted sum outage rate in multiuser multiple-input single-output (MISO) interference channels, where the transmitters have no knowledge of the exact values of channel coefficients, only the statistical information. Unfortunately, this problem is nonconvex and very difficult to deal with. We propose a new, provably convergent iterative algorithm where in each iteration, the original problem is approximated as second-order cone programming (SOCP) by introducing slack variables and using convex approximation. Simulation results show that the proposed SOCP algorithm converges in a few steps, and yields a better performance gain with a lower computational complexity than existing algorithms.
Jun WANG
Huazhong University of Science and Technology
Desheng WANG
Huazhong University of Science and Technology
Yingzhuang LIU
Huazhong University of Science and Technology
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
Jun WANG, Desheng WANG, Yingzhuang LIU, "A New Iterative Algorithm for Weighted Sum Outage Rate Maximization in MISO Interference Channels" in IEICE TRANSACTIONS on Communications,
vol. E100-B, no. 1, pp. 187-193, January 2017, doi: 10.1587/transcom.2016EBP3174.
Abstract: In this paper, we investigate the problem of maximizing the weighted sum outage rate in multiuser multiple-input single-output (MISO) interference channels, where the transmitters have no knowledge of the exact values of channel coefficients, only the statistical information. Unfortunately, this problem is nonconvex and very difficult to deal with. We propose a new, provably convergent iterative algorithm where in each iteration, the original problem is approximated as second-order cone programming (SOCP) by introducing slack variables and using convex approximation. Simulation results show that the proposed SOCP algorithm converges in a few steps, and yields a better performance gain with a lower computational complexity than existing algorithms.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2016EBP3174/_p
Copy
@ARTICLE{e100-b_1_187,
author={Jun WANG, Desheng WANG, Yingzhuang LIU, },
journal={IEICE TRANSACTIONS on Communications},
title={A New Iterative Algorithm for Weighted Sum Outage Rate Maximization in MISO Interference Channels},
year={2017},
volume={E100-B},
number={1},
pages={187-193},
abstract={In this paper, we investigate the problem of maximizing the weighted sum outage rate in multiuser multiple-input single-output (MISO) interference channels, where the transmitters have no knowledge of the exact values of channel coefficients, only the statistical information. Unfortunately, this problem is nonconvex and very difficult to deal with. We propose a new, provably convergent iterative algorithm where in each iteration, the original problem is approximated as second-order cone programming (SOCP) by introducing slack variables and using convex approximation. Simulation results show that the proposed SOCP algorithm converges in a few steps, and yields a better performance gain with a lower computational complexity than existing algorithms.},
keywords={},
doi={10.1587/transcom.2016EBP3174},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - A New Iterative Algorithm for Weighted Sum Outage Rate Maximization in MISO Interference Channels
T2 - IEICE TRANSACTIONS on Communications
SP - 187
EP - 193
AU - Jun WANG
AU - Desheng WANG
AU - Yingzhuang LIU
PY - 2017
DO - 10.1587/transcom.2016EBP3174
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E100-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2017
AB - In this paper, we investigate the problem of maximizing the weighted sum outage rate in multiuser multiple-input single-output (MISO) interference channels, where the transmitters have no knowledge of the exact values of channel coefficients, only the statistical information. Unfortunately, this problem is nonconvex and very difficult to deal with. We propose a new, provably convergent iterative algorithm where in each iteration, the original problem is approximated as second-order cone programming (SOCP) by introducing slack variables and using convex approximation. Simulation results show that the proposed SOCP algorithm converges in a few steps, and yields a better performance gain with a lower computational complexity than existing algorithms.
ER -