This letter deals with a new cell clustering problem subject to signal-to-interference-plus-noise-ratio (SINR) constraints in uplink network MIMO systems, where multiple base stations (BSs) cooperate for joint processing as forming a cluster. We first prove that the SINRs of users in a certain cluster always increase monotonically as the cluster size increases when the receiver filter that maximizes the SINR is used. Using this result, we propose an efficient clustering algorithm to minimize the maximum number of cooperative BSs in a cluster. Simulation results show that the maximum number of cooperative BSs minimized by the proposed method is close to that minimized by the exhaustive search and the proposed scheme outperforms the conventional one in terms of the outage probability.
Sang-Uk PARK
KAIST
Jung-Hyun PARK
Samsung Electronics
Dong-Jo PARK
KAIST
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
Sang-Uk PARK, Jung-Hyun PARK, Dong-Jo PARK, "Cell Clustering Algorithm in Uplink Network MIMO Systems with Individual SINR Constraints" in IEICE TRANSACTIONS on Fundamentals,
vol. E97-A, no. 2, pp. 698-703, February 2014, doi: 10.1587/transfun.E97.A.698.
Abstract: This letter deals with a new cell clustering problem subject to signal-to-interference-plus-noise-ratio (SINR) constraints in uplink network MIMO systems, where multiple base stations (BSs) cooperate for joint processing as forming a cluster. We first prove that the SINRs of users in a certain cluster always increase monotonically as the cluster size increases when the receiver filter that maximizes the SINR is used. Using this result, we propose an efficient clustering algorithm to minimize the maximum number of cooperative BSs in a cluster. Simulation results show that the maximum number of cooperative BSs minimized by the proposed method is close to that minimized by the exhaustive search and the proposed scheme outperforms the conventional one in terms of the outage probability.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.698/_p
Copy
@ARTICLE{e97-a_2_698,
author={Sang-Uk PARK, Jung-Hyun PARK, Dong-Jo PARK, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Cell Clustering Algorithm in Uplink Network MIMO Systems with Individual SINR Constraints},
year={2014},
volume={E97-A},
number={2},
pages={698-703},
abstract={This letter deals with a new cell clustering problem subject to signal-to-interference-plus-noise-ratio (SINR) constraints in uplink network MIMO systems, where multiple base stations (BSs) cooperate for joint processing as forming a cluster. We first prove that the SINRs of users in a certain cluster always increase monotonically as the cluster size increases when the receiver filter that maximizes the SINR is used. Using this result, we propose an efficient clustering algorithm to minimize the maximum number of cooperative BSs in a cluster. Simulation results show that the maximum number of cooperative BSs minimized by the proposed method is close to that minimized by the exhaustive search and the proposed scheme outperforms the conventional one in terms of the outage probability.},
keywords={},
doi={10.1587/transfun.E97.A.698},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Cell Clustering Algorithm in Uplink Network MIMO Systems with Individual SINR Constraints
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 698
EP - 703
AU - Sang-Uk PARK
AU - Jung-Hyun PARK
AU - Dong-Jo PARK
PY - 2014
DO - 10.1587/transfun.E97.A.698
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2014
AB - This letter deals with a new cell clustering problem subject to signal-to-interference-plus-noise-ratio (SINR) constraints in uplink network MIMO systems, where multiple base stations (BSs) cooperate for joint processing as forming a cluster. We first prove that the SINRs of users in a certain cluster always increase monotonically as the cluster size increases when the receiver filter that maximizes the SINR is used. Using this result, we propose an efficient clustering algorithm to minimize the maximum number of cooperative BSs in a cluster. Simulation results show that the maximum number of cooperative BSs minimized by the proposed method is close to that minimized by the exhaustive search and the proposed scheme outperforms the conventional one in terms of the outage probability.
ER -