- Research
- Open Access

# A low-complexity user selection scheme in a multicell MIMO environment

- Doohee Kim
^{1}, - Oh-Soon Shin
^{2}and - Kwang Bok Lee
^{1}Email author

**2013**:154

https://doi.org/10.1186/1687-1499-2013-154

© Kim et al.; licensee Springer. 2013

**Received:**15 November 2012**Accepted:**9 May 2013**Published:**5 June 2013

## Abstract

An efficient user selection scheme for the downlink of multiuser MIMO systems is proposed in a multicell environment. In a multicell environment, the intercell interference is one of the most influential factors limiting the performance. Thus, a user selection scheme that considers intercell interference is essential to increase the sum rate. The proposed scheme is based on an interference-aware precoding. It sequentially selects users such that the sum rate is maximized. In particular, we develop a simple incremental metric for the sum rate. The use of the derived metric enables a significant reduction in the computational complexity of the user selection process, as compared to the optimal exhaustive search. Numerical results show that the proposed scheme provides near-optimal performance with substantially reduced complexity.

## Keywords

- Channel State Information
- Mobile Station
- Exhaustive Search
- Interference Channel
- User Selection

## 1 Introduction

Intercell interference is one of the most challenging issues limiting the performance of cellular systems, especially when the spectrum is highly reused across cells. In multiple-input multiple-output (MIMO) systems, in particular, it has been reported that in a multicell environment, the performance of spatial multiplexing is significantly degraded due to intercell interference [1]. Recently, there have been several works on multicell MIMO that attempt to mitigate the effect of intercell interference [1–5]. Most of the works have focused on precoding or beamforming strategies. For instance, centralized precoding schemes were proposed for a case in which the channel state information (CSI) is available at the transmitter [2] and for the case when it is not available [4]. In [5], a distributed precoding scheme was proposed by introducing a new precoding metric known as the signal-to-generated-interference-plus-noise ratio (SGINR).

Precoding schemes rely on the condition that the set of users to be served is given. In practice, an appropriate choice of users may have a substantial impact on the overall system performance in multiuser MIMO scenarios [6–8]. A general framework for user selection was developed in [6] based on convex utility functions. In [7], successive user selection schemes were proposed along with the optimization of transmit beamforming vectors. In [8], various low-complexity user selection schemes were proposed. However, these schemes may suffer from severe performance degradation in multicell MIMO systems, as they do not take the intercell interference into account. This motivates us to investigate a user selection scheme applicable to multicell MIMO systems.

In this article, we propose a user selection scheme that works jointly with the SGINR-based precoding scheme in [5] for a downlink multicell MIMO system. The SGINR precoding is also known as the SLNR (signal-to-leakage-and-noise ratio) precoding [3], which was discussed in 3GPP LTE-Advanced [9]. The proposed scheme is designed to select users in a successive manner such that the sum rate is maximized. We derive a simple incremental metric, which enables the system to determine whether adding a particular user would increase the sum rate or not. Owing to the derived metric, the proposed scheme requires considerably reduced computational complexity as compared to the optimal exhaustive search over all possible combinations of users. Numerical results will be presented to validate the performance of the proposed user selection scheme under various environments.

The rest of this article is organized as follows. Section 2 describes the system model. In Section 3, we develop an efficient user selection algorithm by deriving a simple increment metric for the sum rate. Numerical results are presented in Section 4, and conclusions are drawn in Section 5.

## 2 System model

*L*cells or sectors and

*K*users per cell or sector. Each base station (BS) and each mobile station (MS) are assumed to be equipped with

*N*

_{t}transmit antennas and

*N*

_{r}receive antennas, respectively. The

*L*cells or sectors are grouped into a cluster, as depicted in Figure 1 for the case of

*L*= 3. Each BS is assumed to serve only the users in its own cell using the interference-aware precoding scheme in [5]. The received signal vector ${\mathbf{y}}_{i}^{\left(k\right)}$ at the

*k*th MS of the

*i*th cell can be expressed as

*k*th MS in the

*i*th cell, ${\mathbf{W}}_{i}^{\left(k\right)}$ is the corresponding precoding matrix, ${\mathbf{H}}_{i,m}^{\left(k\right)}$ is an

*N*

_{r}×

*N*

_{t}channel matrix between the BS in the

*m*th cell and the

*k*th MS in the

*i*th cell. The entries of the channel matrix ${\mathbf{H}}_{i,m}^{\left(k\right)}$ are assumed to follow independent and identically distributed (i.i.d) complex Gaussian distribution with zero mean and unit variance. ${\mathbf{n}}_{i}^{\left(k\right)}$ denotes the additive white Gaussian noise (AWGN), ${\rho}_{i}^{\left(k\right)}$ denotes the signal-to-noise ratio (SNR) of the

*k*th MS in the

*i*th cell, and ${\eta}_{i,m}^{\left(k\right)}$ denotes the interference-to-noise ratio (INR) for the interference that the BS in the

*m*th cell causes at the

*k*th MS in the

*i*th cell. The transmit symbols and noise are assumed to be normalized to have unit power. We assume that every BS has the same transmit power

*P*and that each BS allocates equal transmit power to the selected users in the corresponding cell; when

*M*users are selected from a BS, each user is allocated to the power of

*P*/

*M*. The first term in (1) corresponds to desired signal, and the second and third terms represent the intracell interference and intercell interference, respectively, within a cluster. Note that both the intracell interference and intercell interference constitute the intracluster interference, and the intercluster interference is not considered.

*k*th MS in the

*i*th cell is defined as

*k*th MS in the

*i*th cell may cause to other users, (·)

^{ H }denotes the conjugate transpose, and (·)

^{ T }denotes the transpose of a matrix. Each submatrix of ${\mathbf{G}}_{i}^{\left(k\right)}$ is defined as

where ${{\mathbf{D}}_{\mathbf{\text{GI}}}}_{i}^{\left(k\right)}$ and ${{\mathbf{V}}_{\mathbf{\text{GI}}}}_{i}^{\left(k\right)}$ denote the diagonal matrix composed of eigenvalues and unit-norm eigenvector matrix of ${{\mathbf{K}}_{\mathbf{\text{GI}}}}_{i}^{\left(k\right)}$, respectively. Then, ${{\mathbf{V}}_{\mathbf{\text{GI}}}}_{i}^{\left(k\right)}$ corresponds to a beamforming matrix ${\mathbf{W}}_{i}^{\left(k\right)}={{\mathbf{V}}_{\mathbf{\text{GI}}}}_{i}^{\left(k\right)}$[5]. Thus, the precoding and user selection require centralized processing, i.e., CSI sharing among cells. As illustrated in Figure 1, each BS in a cluster collects information on both the desired channel and interference channels for each MS. For the *k* th MS in the *i* th cell, for example, ${\mathbf{H}}_{i,i}^{\left(K\right)}$ corresponds to the desired channel matrix, and ${{\mathbf{H}}_{\mathrm{G}}}_{j,i}^{\left(k\right)},j\ne i$ corresponds to interference channel matrices. It is assumed that the MS perfectly estimates both the desired and interference channels and feeds them back to the BS without error. The BS transports the CSI to a cluster coordinator, which then performs the beamforming and user selection and notifies the results back to the associated BSs.

*k*th MS in the

*i*th cell can be computed as

*k*th MS in the

*i*th cell [2]. It is given as

*L*cells is given by

## 3 Proposed user selection scheme

In this section, we propose a user selection scheme that works in a multicell environment. Because the achievable rate in (6) is affected by the intercell interference as well as by the intracell interference, it may not be optimal in terms of the sum rate that each BS serves all *K* users at the same time. Therefore, the proper selection of simultaneously served users will be important to optimize the overall performance. The greedy user selection algorithm in [11] is known to provide near-optimal sum rate performance in a single-cell scenario. However, the greedy algorithm does not consider the intercell interference, which may lead to inevitable performance degradation in a multicell environment. In [2], it was shown that the optimal solution approaches a single stream transmission scheme as the intercell interference becomes strong.

*U*

_{ i }≡ {(

*i*,1),(

*i*,2),⋯,(

*i*,

*K*)} represent the set of all users in the

*i*th cell, and let ${\ud61a}_{i}^{\ast}$ be the set of selected users in the

*i*th cell. The user selection problem can then be formulated as

where ${\ud61a}^{\ast}\equiv {\ud61a}_{1}^{\ast}\cup {\ud61a}_{2}^{\ast}\cup \cdots \cup {\ud61a}_{L}^{\ast}$ denotes the resulting set of all selected users. The solution of (10) will require an exhaustive search over all possible combinations of users, which may cause high computational complexity. As a more practical solution to (10), we propose a suboptimal successive user selection scheme based on the SGINR precoding. We explain the details of the user selection criterion and the selection algorithm in the following subsections.

### 3.1 User selection criterion

*n*- 1) (

*n*≥ 2) users are already selected and they are represented by a set of the user indices, ${\ud61a}^{\ast}(n-1)\equiv \left\{\right({i}_{1},{k}_{1}),({i}_{2},{k}_{2}),\cdots \phantom{\rule{0.3em}{0ex}},({i}_{n-1},{k}_{n-1}\left)\right\}$, where

*i*

_{ j }and

*k*

_{ j }represent the BS index and MS index of the

*j*th selected user, respectively. Let Δ

*R*(

*n*) be the increment in the sum rate when user (

*i*

_{ n },

*k*

_{ n }) is added to the set ${\ud61a}^{\ast}(n-1)$ to form ${\ud61a}^{\ast}\left(n\right)={\ud61a}^{\ast}(n-1)\cup \left\{\right({i}_{n},{k}_{n}\left)\right\}$. Then, Δ

*R*(

*n*) can be expressed as

*n*(

*i*,

*k*) pairs associated with the user indices in ${\ud61a}^{\ast}\left(n\right)$ when the

*n*users in ${\ud61a}^{\ast}\left(n\right)$ are simultaneously served. We approximate Δ

*R*(

*n*) in (11) as

which follows from the assumption that the selected users have high SINR^{a}[5].

*R*(

*n*) in (12) can be rewritten and upper bounded as

*S*

_{ ℓ }(

*n*) and

*I*

_{ ℓ }(

*n*), respectively, represent the received signal component and the noise plus interference component for the

*ℓ*th selected user, when the

*n*users in ${\ud61a}^{\ast}\left(n\right)$ are served simultaneously. These can be expressed as

**R**

_{ I }

_{ ℓ }(

*n*) denotes the noise plus received interference matrix, when the

*n*users in ${\ud61a}^{\ast}\left(n\right)$ are served. The notation

*i*

_{ ℓ }indicates the

*ℓ*selected user associated to the BS in the

*i*cell. The matrix

**R**

_{ I }

_{ ℓ }(

*n*) can be expressed as

and ${\mathbf{W}}_{i}^{\left(k\right)}$ denotes the SGINR precoding matrix when *n* users in ${\ud61a}^{\ast}\left(n\right)$ are simultaneously served. Note that the inequality in (13) is due to $\prod _{\ell =1}^{n-1}{S}_{\ell}\left(n\right)\le \prod _{\ell =1}^{n-1}{S}_{\ell}(n-1)$, which follows from the term-by-term inequalities *S*_{
ℓ
}(*n*) ≤ *S*_{
ℓ
}(*n* - 1),*ℓ* = 1,2,⋯,*n* - 1. The term-by-term inequalities are valid due to the following reasons. First, when the *n* th user is added up, *n* - 1 users that are already selected should be allocated to transmit power equal to or less than the value for the case when only *n* - 1 users are selected, owing to the assumption of transmit power in Section 2. Moreover, when the *n* th user is added, it generates additional interference to the other *n* - 1 users, and thus will decrease the received signal power of each MS.

*I*

_{ G }(

*n*) denotes the noise plus generated interference component of the

*n*th selected user

*n*-2)

*I*

_{ G }(

*n*) ratio and the $\sum _{\ell =1}^{n}{I}_{\ell}\left(n\right)$ to

*n*

*I*

_{ G }(

*n*) ratio are less than unity in the typical SNR range. Using the inequality of the arithmetic and geometric means with the two assumptions, we can derive the following two inequalities:

*R*(

*n*) as

*R*(

*n*) as

It is observed that the metric Δ*R*(*n*) in (19) corresponds to a weighted SGINR. For a specific case of *n* = 1, it is obvious that selecting the user associated with the maximum SNR is optimal in terms of the sum rate. Hence, we define$\mathrm{\Delta}R\left(1\right)\equiv \text{det}\left({\rho}_{i}^{\left(k\right)}({\mathbf{H}}_{i,i}^{\left(k\right)}){({\mathbf{H}}_{i,i}^{\left(k\right)})}^{H}\right)$. Note that Δ*R*(*n*), which is the proposed criterion for user selection, depends on the transmit beamforming vector for *n* ≥ 2.

### 3.2 User selection algorithm

In this section, we propose a user selection algorithm with the objective of sum rate maximization. In the previous subsection, we have defined Δ*R*(*n*) as a criterion for user selection. In order to maximize the sum rate, BSs select users by using Δ*R*(*n*). If Δ*R*(*n*) is larger than 1, which means that sum rate is increased by selecting the *n* th user, and the *n* th user is selected and added to${\ud61a}^{\ast}$. Otherwise, the *n* th user are not selected and the user selection procedure is terminated. Specifically, the proposed algorithm is described as the following three steps:

Step 1. Initialize as${\ud61a}^{\ast}\left(0\right)=\varphi $ and *n* = 1.

*i*

_{ n },

*k*

_{ n }) such that

where$\mathrm{\Delta}{r}_{i}^{\left(k\right)}\left(n\right)$ denotes the Δ*R*(*n*) corresponding to the *k* th MS in the *i* th cell. where$\mathrm{\Delta}{r}_{i}^{\left(k\right)}\left(n\right)$ denotes the Δ*R*(*n*) corresponding to the *k* th MS in the *i* th cell.

Step 3. If$\mathrm{\Delta}{r}_{{i}_{n}}^{\left({k}_{n}\right)}\left(n\right)>1$, then set${\ud61a}^{\ast}\left(n\right)={\ud61a}^{\ast}(n-1)$ ∪{*i*_{
n
},*k*_{
n
}}, *n* = *n* + 1 and go back to step 2; otherwise, terminate the algorithm.

In step 1, the set of selected users${\ud61a}^{\ast}\left(0\right)$ is initialized as an empty set. In step 2, a user associated with the maximum Δ*R*(*n*) is chosen from among the users not in${\ud61a}^{\ast}(n\phantom{\rule{0.3em}{0ex}}-\phantom{\rule{0.3em}{0ex}}1)$. In step 3, if the value of Δ*R*(*n*) is greater than 1, the corresponding user index is added to${\ud61a}^{\ast}\left(n\right)$ and the algorithm is repeated from step 2. Otherwise, the algorithm terminates and the final set of selected user is determined as${\ud61a}^{\ast}(n-1)$.

*L*(

*N*

_{t}/

*N*

_{ r }) iterations and one user is selected at each iteration. Correspondingly, the complexity of the proposed scheme can be found to be$\sum _{i=1}^{{N}_{\mathrm{t}}/{N}_{\mathrm{r}}}(\mathit{\text{LK}}-i+1)$. The exhaustive search needs to compute precoding matrices for all possible sets of users, and the max-user exhaustive search also needs to compute precoding matrices for all possible sets of (

*N*

_{t}/

*N*

_{r}) users. Based on these computations, the overall computational complexity of each scheme is tabulated in Table 1. It can be seen that the complexity of the proposed scheme is much lower than that of the exhaustive search and max-user exhaustive search. When

*L*= 3,

*K*= 10,

*N*

_{t}= 4, and

*N*

_{r}= 2, for instance, the overall computational complexity of the proposed scheme is 165, whereas that of the exhaustive search and max-user exhaustive search is 4,397,880 and 3,562,650, respectively.

**Comparison of computational complexity**

Proposed scheme | Exhaustive search | Max-user exhaustive search | |
---|---|---|---|

| $\sum _{i=1}^{L({N}_{\mathrm{t}}/{N}_{\mathrm{r}})}(\mathit{\text{LK}}-i+1)$ | $\sum _{i=1}^{L({N}_{\mathrm{t}}/{N}_{\mathrm{r}})}\left(i{\times}_{\mathit{\text{LK}}}{C}_{i}\right)$ | $L({N}_{\mathrm{t}}/{N}_{\mathrm{r}}){\times}_{\mathit{\text{LK}}}{C}_{L({N}_{\mathrm{t}}/{N}_{\mathrm{r}})}$ |

## 4 Numerical results

In this section, we evaluate the performance of the proposed user selection scheme. We consider a cluster composed of three cells (*L* = 3), each of which corresponds to a sector of sectored cells, as depicted in Figure 1. The average channel gain between the BS in the *i* th cell and the *k* th MS in the cell is defined as$E\left[{\u2225{\mathbf{H}}_{i,i}^{\left(k\right)}\u2225}^{2}\right]={\rho}_{0}{\left({d}_{i,k}/{d}_{\mathrm{r}}\right)}^{-\alpha}$, where *d*_{i,k} denotes the distance between a BS in the *i* th cell and *k* th MS, and *ρ*_{0} denotes the SNR at a distance *d*_{r} from the base station. The reference distance *d*_{r} can be regarded as the cell radius. The values of *d*_{r}, *ρ*_{0}, and the pathloss exponent *α* are set to 500 m, 8 dB, and 3.7, respectively. The performance of the proposed scheme is compared with that of the exhaustive search, the max-user exhaustive search, and the single-cell greedy selection in [11]. In addition, a joint processing scheme based on the dirty paper coding (DPC) is used to provide an upper bound as in [12, 13]. However, it should be noted that the joint processing requires sharing of data as well as the CSI among cells in each cluster, while the other schemes require sharing of only the CSI. In the exhaustive search, all the BSs in the cluster selects optimal user set that maximizes sum rate. The max-user exhaustive search is a modified version of the optimal exhaustive search, in which each BS always selects a set of *N*_{t}/*N*_{r} users that maximizes the sum rate differently from the exhaustive search. The max-user exhaustive search can be considered as a form of coordinated greedy selection. In the single-cell greedy selection, each BS independently selects users associated with the maximum SINR without considering the intercell interference.

*R*and

*R*, scenario 2 corresponds to the case where all the users are located in between 0.5

*R*and

*R*, where

*R*denotes the cell radius, and scenario 3 corresponds to the case where all the users are located uniformly over the entire cell. The reason why we consider scenarios 1 and 2 is that users around cell center can be served separately by each cell without coordination, since the impact of the intercell interference will be limited [10, 14]. Figures 3, 4, 5 depict the achievable sum rate and Figures 6, 7, 8 illustrate the average number of selected users vs. SNR under these three scenarios, respectively, when

*K*= 10,

*N*

_{t}= 4, and

*N*

_{r}= 2. From Figures 3, 4, 5, the proposed scheme is shown to significantly outperform the single-cell greedy selection and the max-user exhaustive search. Moreover, the performance degradation as compared to the exhaustive search seems not that much considering the substantial reduction in the complexity. For instance, when

*L*= 3,

*K*= 10,

*N*

_{t}= 4, and

*N*

_{r}= 2, the proposed scheme achieves about 94% of the sum rate of the exhaustive search, while the reduction in computational complexity amounts to about 26,600-fold. As expected, the performance of the joint processing is better than the other schemes at the cost of the backhaul overhead for data sharing among cells. From Figures 6, 7, 8, it can be observed that not all the degrees of freedoms at the BS are used to transmit as many streams as possible. This suggests that using all the degrees of freedoms is not always optimal for sum rate. Some degrees of freedoms need to be used for interference mitigation, in such a way that the average sum rate is maximized. As an extreme case, when the SNR is sufficiently high, the proposed solution is shown to approach the single-user scheme, as discussed in [2]. The results in Figure 5 also verify that the performance gain of the proposed scheme is substantial even when users are uniformly distributed throughout the cell.

## 5 Conclusions

In this article, we have proposed a successive user selection scheme for the downlink of MIMO cellular systems in a multicell environment. The proposed scheme works jointly with SGINR beamforming and attempts to maximize the sum rate over all of the users in a cluster of cells. As compared to the optimal exhaustive search, the proposed scheme is much less complex due to the derivation of a simple incremental metric for the sum rate. Numerical results confirm that the proposed user selection scheme achieves a sum rate close to that of the exhaustive search. In a particular case, the proposed scheme has been shown to achieve 94% of the sum rate of the exhaustive search, while reduction in computational complexity amounts to about 26,600-fold.

## Endnote

^{a}It should be noted that the approximation is used just to simplify the incremental metric for user selection. The high SINR assumption should not restrict the derived metric to being used only at high SINR. In Section 4, we will consider a situation in which all the MSs are distributed over the cell edge area where the SINR is generally low.

## Declarations

### Acknowledgements

This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MEST) (no. 20110020262).

## Authors’ Affiliations

## References

- Catreux S, Driessen PF, Greenstein LJ: Simulation results for an interference-limited multiple-input multiple-output cellular system.
*IEEE Commun. Lett*2000, 4(11):334-336.View ArticleGoogle Scholar - Ye S, Blum RS: Optimized signaling for MIMO interference systems with feedback.
*IEEE Trans. Signal Process*2003, 51(11):2839-2848. 10.1109/TSP.2003.818339View ArticleGoogle Scholar - Sadek M, Tarighat A, Sayed AH: A leakage-based precoding scheme for downlink multi-user MIMO channels.
*IEEE Trans. Wireless Commun*2007, 6(5):1711-1721.View ArticleGoogle Scholar - Blum RS: MIMO capacity with interference.
*IEEE J. Select. Areas Commun*2003, 21(5):793-801. 10.1109/JSAC.2003.810345View ArticleGoogle Scholar - Lee BO, Je HW, Shin OS, Lee KB: A novel uplink MIMO transmission scheme in a multicell environment.
*IEEE Trans. Wireless Commun*2009, 8(10):4981-4987.View ArticleGoogle Scholar - Lau KN: Analytical framework for multiuser uplink MIMO spacetime scheduling design with convex utility functions.
*IEEE Trans. Wireless Commun*2004, 3(5):1832-1843. 10.1109/TWC.2004.834684View ArticleGoogle Scholar - Hara Y, Brunel L, Oshima K: Uplink spatial scheduling with adaptive transmit beamforming in multiuser MIMO systems. In
*Proceedings of the IEEE International Symposium on Personal, Indoor & Mobile Radio Communications*. Helsinki Finland; 11–14 September 2006.Google Scholar - Serbetli S, Yener A: Beamforming and scheduling strategies for time slotted multiuser MIMO systems. In
*Proceedings of the Asilomar Conference on Signals, Systems & Computers*. Pacific Grove, CA, USA; 7-10 November 2004.Google Scholar - 3GPP: Leakage-based precoding for CoMP in LTE-A.
*3GPP R1–090028*2009. http://www.3gpp.org/ftp/tsg_ran/wg1_rl1/TSGR1_55b/Docs/R1-090028.zipGoogle Scholar - 3GPP: Coordinated multi-point operation for LTE physical layer aspects (release 11).
*3GPP TR 36.819, V11.1.0*2011. http://www.3gpp.org/ftp/Specs/archive/36_series/36.819/36819-110.zipGoogle Scholar - Dimic G, Sidiropoulos ND: On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm.
*IEEE Trans. Signal Process*2005, 53(10):3857-3868.MathSciNetView ArticleGoogle Scholar - Patcharamaneepakorn P, Doufexi A, Armour S: Reduced complexity joint user and receive antenna selection algorithms for SLNR-based precoding in MU-MIMO systems. In
*Proceedings of the IEEE Vehicular Technology Conference*. Yokohama; 6–9 May 2012.Google Scholar - Yoo T, Goldsmith A: On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming.
*IEEE J. Select. Areas Commun*2006, 24(3):528-541.View ArticleGoogle Scholar - 3GPP: Further consideration on enhanced SRS for CoMP/non-CoMP user group.
*3GPP R1–095087*2009. http://www.3gpp.org/ftp/tsg_ran/wg1_rl1/TSGR1_59/Docs/R1-095087.zipGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.