# Average minimum transmit power to achieve SINR targets: performance comparison of various user selection algorithms

- Umer Salim
^{1}Email author and - Dirk Slock
^{2}

**2011**:127

https://doi.org/10.1186/1687-1499-2011-127

© Salim and Slock; licensee Springer. 2011

**Received: **1 December 2010

**Accepted: **11 October 2011

**Published: **11 October 2011

## Abstract

In multi-user communication from one base station (BS) to multiple users, the problem of minimizing the transmit power to achieve some target-guaranteed performance (rates) at users has been well investigated in the literature. Similarly, various user selection algorithms have been proposed and analyzed when the BS has to transmit to a subset of the users in the system, mostly for the objective of sum rate maximization. We study the joint problem of minimizing the transmit power at the BS to achieve specific signal-to-interference-and-noise ratio (SINR) targets at users in conjunction with user scheduling. The general analytical results for the average transmit power required to meet guaranteed performance at the users' side are difficult to obtain even without user selection due to joint optimization required over beamforming vectors and power allocation scalars. We study the transmit power minimization problem employing non-linear dirty paper coding (DPC) technique and with various user selection algorithms, namely semi-orthogonal user selection (SUS), norm-based user selection (NUS), and angle-based user selection (AUS). Starting from the derivation of a transmit power upper bound (that becomes tight for large SINR targets), the average minimum transmit power is derived for NUS and SUS, for any number of users. For the special case when only two users are selected, we further derive a similar expression for AUS and a power lower bound, which may serve to benchmark the performance of any selection scheme. Simulation results performed under various settings indicate that SUS is by far the better user selection criterion.

## Keywords

## 1. Introduction

### A. Motivation

In multi-antenna downlink (DL) systems, the characterization of the capacity (rate) regions and the maximization of the sum rate have been among the most widely studied subjects. The capacity region of DL single-antenna systems was first studied by Cover in [1]. After the discovery of spatial multiple antenna gains for single-user (SU) systems in [2, 3], the focus of research shifted to multiple antenna multi-user (MU) systems. Conditioned upon the availability of perfect channel state information (CSI), the capacity region of multi-antenna DL channel is known [4–7], and hence the optimal (dirty paper coding (DPC), first proposed in [8] was shown to be the optimal strategy in [4]) and a wide variety of suboptimal (but less complicated) transmission strategies have been proposed and analyzed. In many practical wireless systems, maximizing the throughput may not be the primary objective. A very important design objective for multi-antenna MU systems is to achieve a particular link quality over all links with minimum transmission power, which is equivalent to achieving certain signal-to-interference-and-noise ratios (SINR) or data rates over corresponding links. This problem, in some sense, is the dual problem of the sum rate maximization under a fixed power constraint. Certainly, from an operator's perspective, the minimization of average transmit power to achieve these SINR targets is of prime importance.

Combined MU transmission with user scheduling has been widely analyzed in the sum rate maximization perspective (see [9–12] and the references therein), but very rarely for the objective of the transmit power minimization. Very pertinent questions in this area include how does the minimum average transmit power decay with the number of users or the number of BS transmit antennas. Similarly, the optimal user selection scheme for transmit power minimization has never been investigated. In the context of the sum rate maximization, the semi-orthogonal user selection (SUS) has been shown to behave asymptotically optimal [11] and is widely believed to be the best greedy user selection strategy [9, 10, 12], but no such study has been conducted for the transmit power optimization problem with hard SINR targets, and no analytical results for average transmit power are known. Hence, the characterization of the average minimum transmit power for various user selection mechanisms and relative performance comparisons are very relevant research objectives.

### B. The state of the art

The problem of minimizing the DL transmit power required to meet users' SINR constraints by joint optimization of transmit beamforming (BF) vectors and power allocation scalars was first solved in [13] and was later treated in [14, 15] with feasibility issues. These solutions are based upon the duality of uplink (UL) and DL channels. Exploiting this UL-DL duality, iterative algorithms were proposed to find the optimal BF vectors and the optimal power assignments to the users, and the convergence of these algorithms was shown to the optimal solution. For MU channels (either UL or DL) with Gaussian signalling, [15] showed that the problem of minimizing the transmit power to achieve specific SINR targets bears a relatively simple solution due to the added structure that may be exploited by successive interference cancellation (SIC) in the UL and by DPC-based encoding for known interference in the DL channels, and the results were presented in [15–17]. The optimal BF strategy turns out to be the minimum-mean-square-error (MMSE) solution, where each user will see no interference from the already encoded users, due to DPC-based encoding and each BF treats the interference of unencoded users as extra noise, and power allocation for each user is done to raise its SINR level to the target SINR. Actually, the DL problem is solved by first solving the dual UL problem, due to its relatively simple structure.

There is a line of work by Karipidis et al., where they studied QoS and Max-Min fair transmit BF for multiple multicast groups [18, 19], showing the original problem to be NP-hard and proposing solutions for relaxed versions. This work essentially differs from our work as we stick to the DL channel, but investigate the performance of user selection algorithms with the criterion of average transmit power fulfilling hard SINR targets.

The performance of different user selection algorithms for transmit power minimization was studied in [20] ([21] is the journal version). The Gaussian MU systems were analyzed without exploiting the extra system structure through SIC or DPC, when SINR targets are large. They obtained analytical expressions for the average minimum transmit power required for guaranteed rates with norm-based user selection (NUS) and angle-based user selection (AUS) in the limiting case, when only two users are selected. For the same scenario of two selected users, the expressions for average minimum transmit power were derived for NUS, AUS, and SUS employing SIC (in UL) or DPC (in DL) in [22].

### C. Contribution

We study the problem of average transmit power minimization to meet users' SINR constraints in conjunction with user scheduling. In this MU system with Gaussian signalling, we make use of DPC-based encoding in the DL channel. As the channel information is already required at the BS for BF and power assignments, this additional processing does not require any extra information. This problem formulation gives twofold advantage over [20]: first, no iterations are required to compute the optimal BF vectors and power allocation scalars and second, less average power is required at the transmitter to satisfy the same SINR constraints. On the negative side, DPC encoding is computationally cumbersome [11], and practical DPC code design is still an active area of research (see [23, 24] and references therein). We first derive an upper bound of the transmit power required to satisfy users' SINR targets that is shown to be tight for large SINR targets. Based upon this bound, the average minimum transmit power expressions are derived for any number of users selected through SUS, NUS, or random user selection (RUS). For the case of two active users, we derive similar analytical expression with AUS. A lower bound of the average minimum transmit power is also derived for the two-user case, which may serve to benchmark any user selection mechanism. Detailed performance comparison is provided for these user selection schemes with derived results and Monte Carlo simulations. It turns out that NUS and AUS are strictly suboptimal when compared with SUS.

For the objective of the minimization of transmit power to achieve hard SINR targets, the optimal DPC encoding order is an open problem, although numerical simulations indicate that a good choice of encoding order is such that the weaker user gets decoded with least interference [15]. The optimization of encoding order is out of the scope of this paper, and we stick to the above-defined encoding strategy.

Some may argue that in a scenario with SINR requirements for all users, all these users need to be scheduled. In that case, the problem of user scheduling becomes in fact a problem of user permutation to determine which users are going to be scheduled together within a certain (time-frequency in OFDMA) resource block, with all users being scheduled on one or another resource block. The optimization of such a user assignment can only be attained by a computationally exhaustive search, which calls for greedy suboptimal approaches. In one such greedy approach, the user selection gets performed per resource block, sequentially treating the various resource blocks. This means that for a given resource block, the user selection gets performed from a pool of users, the size of which is decreasing as we progress through the list of resource blocks. The selection process for each resource block is then of the form considered here. But as the size *K* of the pool of users to choose from is varying, we analyze the user selection process for varying *K*.

### D. Organization

This contribution is organized as follows. Section 2 describes the system model. Section 3 gives a brief overview of the problem of transmit power minimization without user selection. In Section 4, certain user selection algorithms are reviewed, for which later we analyze the performance. The main results of the paper, the analytical expressions for the average minimum transmit power for different user selection schemes, are presented in Section 5. The proof details have been relegated to appendices to keep the subject material simple and clear. The performances of these user selection algorithms are compared in Section 6 followed by the concluding remarks in Section 7.

NOTATION: Lowercase letters represent scalars, boldface lowercase letters represent vectors, and boldface uppercase letters denote matrices. **A**^{†} denotes the Hermitian transpose of matrix **A**. The identity matrix of *n* dimensions is denoted by **I**_{n}. $\mathbb{E}$ denotes statistical expectation. For a random variable *x* having the cumulative distribution function (CDF) of *F*, its expected value is denoted as ${\mathbb{E}}_{F}\left[x\right]$.

## 2. System model

*M*transmit antennas and

*K*single-antenna user terminals. In the DL, the signal received by

*k*th user can be expressed as

where ${\mathbf{h}}_{1}^{\u2020},{\mathbf{h}}_{2}^{\u2020},\dots ,{\mathbf{h}}_{\mathbf{K}}^{\u2020}$ are the channel vectors of users 1 through user *K* with **h**_{
k
} ∈ ℂ^{M × 1}and **x** ∈ ℂ^{M × 1}denotes the signal transmitted by the BS. The terms *z*_{1}, *z*_{2}, ..., *z*_{
K
} represent independent zero-mean complex Gaussian additive noise terms. The system parameters have been normalized such that every user suffers from the unit variance noise. We denote the concatenation of the channels by ${\mathbf{h}}_{\mathbf{F}}^{\u2020}=\left[{\mathbf{h}}_{1},{\mathbf{h}}_{2},\dots ,{\mathbf{h}}_{\mathbf{K}}\right]$, so **H**_{
F
} is *K* × *M* forward channel matrix with *k* th row equal to the channel of *k* th user $\left({\mathbf{h}}_{\mathbf{k}}^{\u2020}\right)$. The channel is assumed to be block fading, staying constant for its coherence length and then changing to an independent state. The entries of the forward channel matrix **H**_{
F
} are i.i.d. complex Gaussian with zero mean and unit variance. We make the simplifying assumption of the presence of perfect CSI at the transmitter (CSIT), so as to focus completely on the performance of different user selection algorithms.

The SINR constraints of the users are denoted by *γ*_{1}, *γ*_{2}, ..., *γ*_{
K
}. As SINR is a direct measure of the successful signal decoding capability at a receiver (user), these constraints can be easily translated to rate constraints. If *K*_{
s
} out of *K* users (implying *K*_{
s
} < *K*) are selected for transmission during each coherence interval, the channel input × can be written as $\mathbf{x}=\overline{\mathbf{V}}{\mathbf{P}}^{1\u22152}\mathbf{u}$, where $\overline{\mathbf{V}}\in {\u2102}^{M\times {K}_{s}}$ denotes the beamforming matrix with normalized columns, **P** is *K*_{
s
} × *K*_{
s
} diagonal power allocation matrix with positive real entries, and $\mathbf{u}\in {\u2102}^{{K}_{s}\times 1}$ is the vector of zero-mean unit-variance Gaussian information symbols. Hence, $\mathbb{E}\left[\mathsf{\text{Tr}}\left(\mathbf{P}\right)\right]$ is the average transmit power that can be minimized by optimizing over the beamforming matrix $\overline{\mathbf{V}}$, and the power allocation matrix **P** to achieve the SINR targets. We select this average minimum transmit power as the performance metric and study the performance of various user selection algorithms when users' SINR targets need to be satisfied.

## 3. Overview of transmit power minimization problem

*k*th user can be written as

*p*

_{ k }represents the power allocated to the stream of

*k*th user. The second term in the expression represents the interference contribution at

*k*th user, due to the beams meant for other selected users. Based upon this received signal, the SINR of

*k*th user can be written as

Implicit in this SINR expression is the fact that the users are equipped with simple receivers that do not try to decode the signal of other users, and hence the interference present in the received signal is treated as noise. Such receivers are commonly known in the literature as SU receivers [25, 26]. Without user selection, the problem of optimization of beamforming vectors and power allocation was solved in [14, 15] using the UL-DL duality for a fixed encoding/decoding order (see Section 4.3 and 5.2 in [15] for details). They gave iterative algorithms to obtain the optimal beamforming vectors and the optimal power allocation for each user. The optimal beamforming vectors corresponding to a particular (suboptimal) power allocation are obtained, then power allocations are updated corresponding to these beamforming vectors. This process is repeated till both converge to their optimal values. Unfortunately, general closed-form expressions for the transmit power required to achieve SINR targets do not exist, due to intricate inter-dependence of beamforming vectors and power allocations, as is evident from Equation (3).

*K*

_{ s }to 1, then

*k*th user will only receive the interference of those users, which are encoded after its own data encoding. The signal of already encoded users falls in the paradigm of known interference and can be treated without any power penalty [4, 8]. Hence, the effective signal received at

*k*th user will be

*k*th user can be written as

**Z**

_{ i }make a subspace gathering the contributions from the channels of those users, which will produce interference for

*i*th user and is given by the following expression

## 4. Review of user selection algorithms

There is a plethora of user selection algorithms in the literature, and hence a comprehensive review is out of the scope of this paper. In this section, we briefly give the overview of three most famous user selection algorithms for which we later study the problem of transmit power minimization and derive the corresponding average power expressions.

### A. Greedy semi-orthogonal user selection (SUS)

- (1)
Let

*S*be an empty space and label all channel vectors unprocessed. From*i*= 1 to*K*_{ s } - (2)
Project all unprocessed channels onto the null space of $\mathcal{S}$.

- (3)
Select the user,

*π*^{ S }(*i*), with largest 2-norm projection and label it processed. - (4)
Set

*S*to be the span of all processed channel vectors.

This scheduling algorithm was first proposed in [9] and was used in conjunction with DPC, similar to our setting. Later, it was analyzed with linear zero-forcing in [10], and also appears in [11, 12] with an additional user-removal step. All these references have shown that it performs very well for sum rate maximization, but it requires complete CSI of all the users.

### B. Norm-based user selection (NUS)

This simplified scheme does not require full CSI, and the users are selected based only upon their channel norms, one scalar value per user. Hence, *K* users are sorted in descending order of their channel norm values, and the first *K*_{
s
} (strongest) users are selected for transmission in each scheduling interval. Thus, NUS index, *π*^{
N
}(*i*), corresponds to *i* th user in the sorted list. This user selection has been studied in [27–29] is an extension of single-user selection from [30] to MU scenarios and is reminiscent of selection diversity based processing [31].

### C. Angle-based user selection (AUS)

- (1)
The first selected user

*π*^{ A }(1) is the user with the largest norm. The space $\mathcal{A}$ contains*π*^{ A }(1). - (2)
Normalize all other channel vectors by their norms and label them unprocessed. From

*i*= 2 to*K*_{ s } - (3)
Project all unprocessed channels onto the null space of $\mathcal{A}$.

- (4)
Select the user,

*π*^{ A }(*i*), with largest 2-norm projection and label it processed. - (5)
Set $\mathcal{A}$ to be the span of all processed channel vectors.

The second normalization step, after the selection of first strongest user, makes the channel-norm effect go away completely, and the selection criterion becomes the mutual orthogonality of users' channel vectors. AUS has been analyzed in [21, 32].

### D. Random user selection (RUS)

The RUS selects the active users independent of their channel realizations. The active users can be selected following a round-robin algorithm for fairness in terms of being in the active pool or based upon users' subscription conditions (the users paying more rates to service providers could be given some kind of priority over other users). RUS may serve more the purpose of judging the performance of other selection schemes than itself being used as a selection scheme.

## 5. Transmit power with user selection: main results

In this section, we give the main results of this paper. We start with the following lemma, which gives an upper bound of the minimum transmit power, given in Equation (6).

*Lemma 1 (Minimum Transmit Power to achieve SINR Targets):*The minimum transmit power to achieve SINR targets ${\gamma}_{1},{\gamma}_{2},...,{\gamma}_{{K}_{s}}$ for

*K*

_{ s }users is given by the following expression:

where *θ*_{(i-1)}is the angle which **h**_{
i
} subtends with the (*i* - 1)-dimensional subspace spanned by **h**_{
1
}, **h**_{
2
}, ..., **h**_{
i-1
}for *i* > 1 and ${\theta}_{0}=\frac{\pi}{2}$, and this inequality becomes tight with large SINR targets.

*Proof:* The proof details for this lemma appear in Appendix A. ■

This lemma about the required transmit power to achieve SINR targets bears a very nice intuitive explanation. It says that the effective channel strength of each user is the energy in the projection of this user's channel when it is projected on the null space of its interference subspace, the subspace spanned by the channels of those users who create interference for this user as a function of encoding order. In our setting, where encoding order is *K*_{
s
} to 1, the interference subspace for user *i* is the subspace spanned by the channels of users 1, 2, ..., *i* - 1. Then each user is allocated the minimal power corresponding to its effective channel energy such that it achieves its SINR target. The sum of these powers gives the minimum transmit power required to achieve SINR targets at *K*_{
s
} active users.

Another very important remark about this lemma is that the term appearing in the denominator ||**h**_{
i
}||^{
2
}sin^{2} *θ*_{(i-1)}is the orthogonalized squared norm--the metric of greedy SUS algorithm proposed in 4-A. The greedy selection algorithm selects one user in each iteration having the maximum orthogonal norm, thus requiring the minimum power to get its SINR target satisfied. This makes the SUS algorithm the greedy algorithm for power minimization objective.

Now we present further results, the analytical expressions for the average minimum transmit power required to achieve SINR targets at users when these users are selected obeying different user selection algorithms as detailed in Section 4. For these selected users, the optimal beam-forming vectors and the power assignments are computed as outlined in Section 3. We restrict the users to have the same SINR targets *γ*. Otherwise, the users with smaller SINR targets become relatively better candidates compared to those with higher targets for the objective of transmit power minimization.

*Theorem 1 (Average Minimum Transmit Power for NUS):*Consider a DL system having a BS equipped with

*M*transmit antennas and

*K*single-antenna users, each having an SINR constraint of

*γ*, and

*K*

_{ s }active users are selected for simultaneous transmission from the pool of

*K*users in each coherence block. If the active users are chosen through NUS, then the average minimum transmit power, denoted as

*p*

_{N}(

*K*

_{ s }

*, K*), is bounded as:

where ${F}_{\parallel \mathbf{h}{\parallel}^{2}}\left(M,r,K;x\right)$ denotes the cumulative distribution function (CDF) of *r* th order statistic of squared norm among *K*-independent *M*-dimensional complex Gaussian vectors, and ${F}_{{sin}^{2}{\theta}_{j}}\left(M;x\right)$ denotes the CDF of sin^{2}*θ*_{
j
} where *θ*_{
j
} is the angle that an *M*-dimensional vector subtends with an independent *j*-dimensional subspace. Further, this bound becomes tight for large SINR targets.

*Proof:* The proof details for Theorem 1 and its associated Corollaries 2 and 3 appear in Appendix C. ■

*Corollary 2 (NUS for*2

*Users):*When

*K*

_{ s }= 2 active users are selected through NUS in each coherence block, the average minimum transmit power to achieve SINR target

*γ*is bounded as:

*α*

_{M,K}is a constant solely governed by

*M*and

*K*and is defined to be

where Γ(*M*) and *G*(*M, x*) denote the Gamma function and the regularized Gamma function [33], respectively.

*Corollary 3 (NUS for*4

*Users):*When

*K*

_{ s }= 4 active users are selected through NUS in each coherence block, the average minimum transmit power to achieve SINR target

*γ*is given by:

*Theorem 4 (Average Minimum Transmit Power for SUS):*For an

*M*-transmit antenna BS and

*K*single-antenna users, if

*K*

_{ s }active users are selected through SUS for simultaneous transmission, each having an SINR constraint of

*γ*, the average minimum transmit power, denoted by

*p*

_{ S }(

*K*

_{ s }

*, K*), is bounded as:

*Proof:* The proof details for Theorem 4 and Corollaries 5 and 6 appear in Appendix D. ■

*Corollary 5 (SUS for*2

*Users):*When

*K*

_{ s }= 2 active users are selected through SUS in each block, the upper bound of average minimum transmit power to achieve SINR target is given by:

*Corollary 6 (SUS for*4

*Users):*When

*K*

_{ s }= 4 active users are selected through SUS in each coherence block, the average minimum transmit power to achieve the SINR targets is:

*Theorem 7 (Average Minimum Transmit Power for RUS):*For an

*M*-antenna BS having

*K*single- antenna users in the pool, when

*K*

_{ s }active users are selected randomly for simultaneous transmission, the average minimum transmit power required, denoted by

*p*

_{R}(

*K*

_{ s }

*, K*), so that each of

*K*

_{ s }users achieves its SINR target

*γ*is given by:

*Proof:* As RUS is independent of channel realizations, the selected users show the same statistics as if there is no user selection. This behavior can be obtained when the pool of available users to NUS is of size *K*_{
s
}, hence there is no user selection and we get the average power required for RUS. ■

*Theorem 8 (Average Minimum Transmit Power for AUS):*Consider a DL system having a BS equipped with

*M*-transmit antennas and

*K*single-antenna users, each having an SINR constraint of

*γ*, and

*K*

_{ s }= 2 users are selected for simultaneous transmission in each coherence block. If the user selection is done through AUS, the average minimum transmit power is bounded as:

*Proof:* The proof sketch appears in Appendix E. ■

*Theorem 9 (Performance Benchmark for*2

*Selected Users):*For a system with an

*M*-antenna BS and

*K*single-antenna users having large SINR targets, a lower bound on the average minimum transmit power, in case of

*K*

_{ s }= 2 active users, required to achieve SINR targets is given by:

*Proof:* The proof is outlined in Appendix F. ■

It is worth noting that this lower bound is for transmit power averaged over channel realizations, as there could be certain realizations that may require lesser power to meet users' SINR targets.

## 6. Performance comparison

- (i)
upper bounds of the power using the analytical results derived in previous section and

- (ii)
Monte Carlo simulation curves representing the true average minimum power.

The curves show that upper bound results are reasonably close to the true powers.

For all the simulation setups, optimal user selection and its average minimum power have been determined through exhaustive search over all possible user combinations. These curves are represented as "OPT" in the following figures. Furthermore, for the case of two selected users, the lower bound of the average minimum power has been plotted using Theorem 9.

For all the scenarios studied, SUS simulation curves fully overlap the OPT curves highlighting the fact that SUS is indeed the greedy selection algorithm for power minimization objective, as indicated in the discussion following Lemma 1.

### A. The case of *K*_{
s
}= 2 selected users

*γ*versus the number of antennas at the BS appears in Figure 1 for the considered user selection algorithms. A minor gap is visible between the SUS simulation curve (true SUS power) and the SUS analytical upper bound as the orthogonalized norm distributions were bounded in the proof (see Appendix D for details). We remark that SUS performs better than other user selection schemes, but with the increase in the number of transmit antennas, NUS also performs very well. The similar behavior was observed in [20], and the reason comes from the fact that with the increase in the number of transmit antennas, users' channels start becoming (close to) spatially orthogonal (this is clearly visible through the angle distributions such as ${F}_{{sin}^{2}{\theta}_{i}}\left(M;x\right)$ in Appendix B). Furthermore increase in

*M*causes to increase the dimensions of the transmit signal space that provides the BS more flexibility to choose appropriate BF vectors for any fixed

*K*

_{ s }.

*K*.

### B. The case of *K*_{
s
}= 4 selected users

On the other hand, for a fixed number of transmit antennas at the BS, when the number of users present in the system increases, NUS shows an increasing performance degradation. The reason is that NUS captures the raw aspect of multi-user diversity, which governs only the self-signal power, but pays no attention to the inter-user spatial separation, which might have a larger impact on the interference power. The worst performance of AUS is expected, as it pays no attention to the strength of the selected users, which is quite important for power minimization objective. Again, Figure 4 shows SUS giving the performance of exhaustive OPT curve when all other selection schemes are getting worse.

### C. Power minimization and power efficiency

*K*

_{ s }, we plot the average minimum power per user versus the number of users

*K*

_{ s }in Figure 5. To get the power per user averaged in each scheduling group, the average minimum power per user values have been obtained by dividing the total minimum BS power to satisfy SINR targets of

*K*

_{ s }users by

*K*

_{ s }. As expected, even for this power per user metric, SUS shows much better performance than NUS or AUS. AUS shows very bad performance and is highly power inefficient even for small number of simultaneously scheduled users. We remark a large increase in per-user power for a fixed SINR target with increase in number of simultaneously scheduled users. This shows that communication is power efficient when

*K*

_{ s }is much smaller than

*M*and becomes quite power inefficient when the number of scheduled users is close to the number of BS antennas.

## 7. Conclusions

In this paper, we have studied the performance of various user selection algorithms in terms of the average minimum transmit power required to satisfy specific SINR targets at users' side. General closed-form expressions of the average minimum transmit power for the three user selection algorithms, namely SUS, NUS, and RUS, were derived when any number of users are selected for simultaneous transmission. Furthermore, for the special case when only two users are selected for simultaneous transmission, similar expressions are derived for AUS and a power lower bound, which serves to benchmark other selection algorithms. SUS, which has been shown to behave close to optimal for the sum rate maximization objective under fixed power constraint, shows equally attractive performance in this dual problem setting of transmit power minimization to achieve hard SINR targets. An interesting observation is the fact that SUS is the greedy algorithm for power minimization objective. For a fixed number of users and increasing number of transmit antennas, NUS performs close to SUS. In the complementary setting of fixed number of BS transmit antennas, the performance of NUS degrades with an increase in the number of system users. Furthermore, power efficiency curves provided in this study may help the network operators decide how many users should be scheduled for simultaneous transmission per resource block.

## Appendix A

### Proof of Lemma 1: minimum instantaneous transmit power

The instantaneous transmit power required to achieve the SINR targets at *K*_{
s
} active users

**Z**

_{ i }is given by the following expression

*γ*

_{1}is

*γ*

_{2}is

**A**and

**B**,

**A**>

**B**implies that

**A**-

**B**is positive definite [34]. As

*p*

_{1}||

**h**

_{ 1 }||

^{2}=

*γ*

_{1}from Equation (19), this inequality will become tight when the SINR target

*γ*

_{1}is large. ${\mathbf{Z}}_{2}^{-1}$ becomes

*θ*

_{1}denotes the angle that

**h**

_{ 2 }subtends with the 1-dimensional subspace spanned by

**h**

_{ 1 }. Hence, the power allocation was done over the stream of 2nd user, so that it achieves its SINR target

*γ*

_{2}that would be

**I**

_{ 2 }matrix adds 1 to the diagonal elements of ${\mathbf{h}}_{12}^{\u2020}{\mathbf{h}}_{12}$, which are

*p*

_{1}||

**h**

_{ 1 }||

^{2}, and

*p*

_{2}||

**h**

_{ 2 }||

^{2}, respectively. As

*p*

_{1}||

**h**

_{ 1 }||

^{2}=

*γ*

_{1}, and ${p}_{2}\parallel {\mathbf{h}}_{2}{\parallel}^{2}=\frac{{\gamma}_{2}}{{sin}^{2}{\theta}_{1}}>{\gamma}_{2}$, the above inequality will be tight for large SINR targets. As ${\mathbf{h}}_{12}{\left({\mathbf{h}}_{12}^{\u2020}{\mathbf{h}}_{12}\right)}^{-1}{\mathbf{h}}_{12}^{\u2020}$ is the projection matrix over the column space of

**H**

_{ 12 }, i.e., over the space spanned by

**h**

_{ 1 }and

**h**

_{ 2 }, the product ${\mathbf{h}}_{3}^{\u2020}{\mathbf{Z}}_{3}^{-1}{\mathbf{h}}_{3}$ gives the energy of the channel

**h**

_{ 3 }projected over the subspace orthogonal to that spanned by

**h**

_{ 1 }and

**h**

_{ 2 }.

*θ*

_{2}is the angle subtended by

**h**

_{ 3 }with the 2-dimensional subspace spanned by

**h**

_{ 1 }and

**h**

_{ 2 }. Hence, the power allocated to the stream of 3rd user to raise its SINR to

*γ*

_{3}is given by

*i*th active user is given by

*θ*

_{(i-1)}is the angle that

**h**

_{ i }makes with the (

*i*- 1)-dimensional subspace spanned by

**h**

_{ 1 },

**h**

_{ 2 }, ...,

**h**

_{ i-1 }as a function of encoding order. Summing the powers allocated to all active users, the minimum transmit power to achieve SINR targets at

*K*

_{ s }users is given by:

## Appendix B

### Some useful distributions

In this appendix, we give some useful cumulative distribution functions (CDF), for which probability density functions (PDF) can be computed by simple differentiation.

#### A. Channel norm distributions

*M*- dimensional spatially i.i.d. complex Gaussian channels, the squared channel norm, ||

**h**

_{ i }||

^{2}for any

*i*, is

*χ*

^{2}distributed with 2

*M*degrees of freedom. This CDF can be represented as [33]

*r*th largest squared channel norm among K independent channel vectors. The CDF of the

*r*th largest order statistic among

*K*i.i.d. variables, each of which has the CDF of ${F}_{\parallel \mathbf{h}{\parallel}^{2}}\left(M;x\right)$, is given by [35]

*r*. The distribution of any random user among

*K*users that does not have the largest norm can be specified as (from [20])

where $\stackrel{\u0301}{1}$ stands for a random user which is not the first order statistic.

#### B. Channel direction distributions

^{2}and cos

^{2}of the angle between a vector and a subspace. If we have

*K*i.i.d.

*M*-dimensional Gaussian distributed vectors, i.e.,

**h**

_{ i }∈ ℂ

^{ M }for user

*i*, we can compute the distribution of the sin

^{2}and cos

^{2}of the angle between one vector and the subspace spanned by a subset of the other vectors. This angle is defined as the (sole) principal angle of vector

**h**

_{ i }with the subspace [36]. For a channel vector

**h**

_{ j }and a subspace spanned by

*i*independent Gaussian vectors

**h**

_{ 1 },

**h**

_{ 2 }, ...,

**h**

_{ i }, if

*θ*

_{ i }denotes the angle

**h**

_{ j }subtends with this

*i*-dimensional subspace, the projection of

**h**

_{ j }on this subspace cos

^{2}

*θ*

_{ i }has a

*β*distribution with parameters

*i*and

*M*-

*i*(see [37, 38] for details). sin

^{2}

*θ*

_{ i }= 1 - cos

^{2}

*θ*

_{ i }also has the beta distributions with shift of parameters

*β*(

*M*-

*i, i*). The CDF of sin

^{2}

*θ*

_{ i }, denoted as ${F}_{{sin}^{2}{\theta}_{i}}\left(M;x\right)$ is given by

*B*and

*B*

_{ x }denote the beta function and the regularized beta function, respectively [33, 38]. If

*θ*

_{1}denotes the angle that an

*M*-dimensional vector

**h**

_{ j }makes with an independent vector

**h**

_{ 1 }(one-dimensional subspace), the distribution of sin

^{2}

*θ*

_{1}is given by

The CDFs of projection with larger subspaces can be obtained by putting the appropriate value for the dimension of the subspace in Equation (38), w.r.t. which orthogonalization is performed.

*K*such projections (each having the CDF of ${F}_{{sin}^{2}{\theta}_{1}}\left(M;x\right)$), the CDF of the largest (1st order) projection is given by

## Appendix C

### Proof of Theorem 1: norm-based user selection

In the proof of the theorem for NUS and the rest of the appendices, we make extensive use of the useful CDFs that have been grouped together in Appendix B, so we highly encourage the readers to go through the previous appendix for proper understanding of these proofs and the notation associated to those CDFs.

*i*th selected user

*π*

^{ N }(

*i*) is the

*i*th largest among

*K*users, and hence is distributed as ${F}_{\parallel \mathbf{h}{\parallel}^{2}}\left(M,i,K;x\right)$. We reproduce the expression for minimum transmit power below

As NUS is solely based upon users' channel norms and the Gaussian distributed vectors have independent norms and directions, the directional properties of these vectors are as if they are randomly selected. Hence, sin^{2} *θ*_{
i
} , where *θ*_{
i
} is the angle a vector makes with an independent *i*-dimensional subspace, is distributed as ${F}_{{sin}^{2}{\theta}_{i}}\left(M;x\right)$ as detailed in Appendix B.

*K*

_{ s }to 1. In terms of NUS indices, this encoding order is from

*π*

^{ N }(1) to

*π*

^{ N }(

*K*

_{ s }), i.e., the strongest user

*π*

^{ N }(1) will face the interference of all other users who get encoded later. For the user whose signal gets decoded with (

*i*-1) interference streams would be the one encoded at (

*K*

_{ s }-

*i*+ 1)-th order. Hence, its NUS index would be

*π*

^{ N }(

*K*

_{ s }-

*i*+ 1), and its squared norm would be distributed as ${F}_{\parallel \mathbf{h}{\parallel}^{2}}\left(M,{K}_{s}+1-i,K;x\right)$. As its interference subspace is (

*i*- 1)-dimensional, the sin

^{2}of its angle with this subspace is distributed as ${F}_{{sin}^{2}{\theta}_{\left(i-1\right)}}\left(M;x\right)$. If we denote the average transmit power, required to satisfy target SINRs at

*K*

_{ s }users selected through NUS from a pool of

*K*users, by

*p*

_{N}(

*K*

_{ s }

*, K*), this can be obtained by computing the expectations in the following expression:

Like Lemma 1, this bound will be tight for large SINR targets.

### A. NUS for 2 users

*α*

_{M,K}, defined in Equation (11), which only depends upon the specific values of

*M*and

*K*. Similarly, it can be shown that

Combining the results of these expectations in Equation (43) and doing some rearrangements gives the result of Corollary 2. The average transmit power when 4 users are selected through NUS (Corollary 3) can be computed, similarly, by taking the first four terms from the general NUS average transmit power expression.

## Appendix D

### Proof of Theorem 4: semi-orthogonal user selection

*i*th iteration

*π*

^{ S }(

*i*) is the one with the largest channel norm on the null space of the subspace spanned by the channel vectors of

*i*- 1 earlier selected users. The

*K*

_{ s }selected users through SUS need to be DPC encoded. The encoding order in the above expression is

*K*

_{ s }to 1. The optimal encoding order in terms of SUS indices would be

*π*

^{ S }(1) to

*π*

^{ S }(

*K*

_{ s }), so that the weaker user gets the least interference [25]. Unfortunately, it is not possible to determine the resulting CDFs with this encoding order, so we use the suboptimal encoding order from

*π*

^{ S }(

*K*

_{ s }) to

*π*

^{ S }(1), where

*π*

^{ S }(

*i*) will receive the interference of

*i*- 1 users, indexed from

*π*

^{ S }(

*i*- 1) to

*π*

^{ S }(1). This encoding order aligns the SUS metric, orthogonalized squared norm ||

**h**

_{ i }||

^{2}sin

^{2}

*θ*

_{(i-1)}, with the denominator of above expression. The average power computation requires the CDF of ||

**h**

_{ i }||

^{2}sin

^{2}

*θ*

_{(i-1)}. Statistically, this represents the largest norm among

*K*- (

*i*- 1) norms in

*M*- (

*i*- 1)-dimensional subspace, which is the null space of the subspace spanned by the channel vectors of

*i*- 1 earlier selected users in previous SUS iterations. Unfortunately, this CDF is hard to compute, so we ease the computation using [[39], Lemma 3], which was also used in [[11], Appendix III]. Following [39], we orthogonalize all the channel vectors w.r.t.

*i*- 1 arbitrary vectors, so for each of them, the squared norm is χ

^{2}distributed with 2(

*M*-

*i*+ 1) degrees of freedom, denoted as ${F}_{\parallel \mathbf{h}{\parallel}^{2}}\left(M-i+1;x\right)$. Let us denote the projection of

**h**

_{ j }on the null space of those

*i*- 1 arbitrary vectors by ${\stackrel{\u0303}{\mathbf{h}}}_{\mathbf{j}}$, then

*i*th largest norm of these orthogonalized vectors will be

**ĥ**

_{ i }||

^{2}is given by ${F}_{\parallel \mathbf{h}{\parallel}^{2}}\left(M-i+1,i,K;x\right)$, the

*i*th largest of

*K*instances in (

*M*-

*i*+ 1)-dimensional space. Lemma 3 in [39] shows that statistically ||

**ĥ**

_{ i }||

^{2}is smaller than ||

**h**

_{ i }||

^{2}sin

^{2}

*θ*

_{(i-1)}. Thus, the average power required to satisfy target SINRs at

*K*

_{ s }users selected from a pool of

*K*users through SUS is given by:

**ĥ**

_{ i }||

^{2}is known, we get the final result

The average transmit power expressions when 2 or 4 users are selected through SUS (Corol-laries 5 and 6) can be obtained by taking the first two or four terms, respectively, from the general SUS average power expression and computing the integrals.

## Appendix E

### Proof of Theorem 8: angle-based user selection

*π*

^{ A }(1) is the strongest user among

*K*users, whose squared norm is distributed as ${{F}_{\parallel \mathbf{h}\parallel}}_{{}^{2}}\left(M,1,K;x\right)$. As norms and directions are independent, the distribution of sin

^{2}of the angle that other

*K*- 1 vectors individually make with the first selected vector (1-dimensional subspace) all follow the distribution of ${F}_{{sin}^{2}{\theta}_{1}}\left(M;x\right)$. The second selected user

*π*

^{ A }(2) among

*K*- 1 users is the one making the largest angle with the first user. Hence, statistically, sin

^{2}of this angle is the largest order statistic among

*K*- 1 instances and is distributed as ${F}_{{sin}^{2}{\theta}_{1}}\left(M,1,K-1;x\right)$ (see Appendix B for details). The squared norm of

*π*

^{ A }(2) is distributed as the squared norm of any random user which is not the user with the largest norm, and hence the CDF is ${F}_{\parallel \mathbf{h}{\parallel}^{2}}\left(M,\stackrel{\u0301}{1},K;x\right)$, (see Equation (37) in Appendix B). We keep the same user ordering as detailed in NUS proof such that weaker user's signal gets decoded with lesser interference. The average transmit power for this user selection is given by:

This will give the result for the case of two users. Unfortunately, we could not extend the average power required with AUS to the general case of *K*_{
s
} users due to added complexity.

## Appendix F

### Proof of Theorem 9: performance benchmark

*γ*, we assume that SINR targets are large and the inequality in Lemma 1 is tight. The two selected users are assumed to have the two largest norms, as in NUS having the CDFs of ${{F}_{\parallel \mathbf{h}\parallel}}_{{}^{2}}\left(M,1,K;x\right)$ and ${F}_{\parallel \mathbf{h}{\parallel}^{2}}\left(M,2,K;x\right)$. Further, the angle between their channel vectors is assumed to be the largest possible angle as in AUS, distributed as ${F}_{{sin}^{2}{\theta}_{1}}\left(M,1,K-1;x\right)$. The similar strategy was employed in [[21], Lemma 2] to obtain a bound in the non-DPC case. Hence, with optimal ordering (the weaker user gets decoded with no interference), the lower bound on the average transmit power can be obtained by computing the expectations in the following expression:

## Declarations

### Acknowledgements

The research work carried out at Intel Mobile Communications leading to these results has received funding from the European Community's Seventh Framework Program (FP7/2007-2013) SACRA project (grant agreement 249060).

EURECOM's research is partially supported by its industrial members: BMW Group, Swiss-com, Cisco, ORANGE, SFR, ST Ericsson, Thales, Symantec, SAP, Monaco Telecom. The research of EURECOM is also supported in part by the EU FP7 projects CROWN, SACRA, and WHERE2.

## Authors’ Affiliations

## References

- Cover T: Broadcast channels.
*IEEE Trans Inf Theory*1972, 18: 2-14. 10.1109/TIT.1972.1054727MATHMathSciNetView ArticleGoogle Scholar - Telatar IE: Capacity of multi-antenna Gaussian channels.
*Eur Trans Telecommun*1999, 10: 585-595. 10.1002/ett.4460100604View ArticleGoogle Scholar - Foschini GJ, Gans MJ: On limits of wireless communications in a fading environment when using multiple antennas.
*Wirel Pers Commun*1998, 6: 311-335. 10.1023/A:1008889222784View ArticleGoogle Scholar - Weingarten H, Steinberg Y, Shamai S: The capacity region of the Gaussian multiple-input multiple-output broadcast channel.
*IEEE Trans Inf Theory*2006, 52: 3936-3964.MATHMathSciNetView ArticleGoogle Scholar - Viswanath P, Tse D: Sum capacity of the multiple antenna Gaussian broadcast channel and uplink-downlink duality.
*IEEE Trans Inf Theory*2003, 49: 1912-1921. 10.1109/TIT.2003.814483MATHMathSciNetView ArticleGoogle Scholar - Caire G, Shamai (Shitz) S: On the achievable throughput of a multiantenna Gaussian broadcast channel.
*IEEE Trans Inf Theory*2003, 49: 1691-1706. 10.1109/TIT.2003.813523MATHView ArticleGoogle Scholar - Yu W, Cioffi JM: Sum capacity of Gaussian vector broadcast channels.
*IEEE Trans Inf Theory*2004, 50: 1875-1892. 10.1109/TIT.2004.833336MATHMathSciNetView ArticleGoogle Scholar - Costa M: Writing on dirty paper.
*IEEE Trans Inf Theory*1983, 29: 439-441. 10.1109/TIT.1983.1056659MATHView ArticleGoogle Scholar - Tu Z, Blum R: Multiuser diversity for a dirty paper approach.
*IEEE Commun Lett*2003, 7: 370-372. 10.1109/LCOMM.2003.815652View ArticleGoogle Scholar - Dimic G, Sidiropoulos N: On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm.
*IEEE Trans Signal Process*2005, 53: 3857-3868.MathSciNetView ArticleGoogle Scholar - Yoo T, Goldsmith A: On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming.
*IEEE J Sel Areas Commun*2006, 24: 528-541.View ArticleGoogle Scholar - Yoo T, Jindal N, Goldsmith A: Multi-antenna downlink channels with limited feedback and user selection.
*IEEE J Sel Areas Commun*2007, 25: 1478-1491.View ArticleGoogle Scholar - Rashid-Farrokhi F, Ray Liu KJ, Tassiulas L: Transmit beamforming and power control for cellular wireless systems.
*IEEE J Sel Areas Commun*1998, 16: 1437-1450. 10.1109/49.730452View ArticleGoogle Scholar - Schubert M, Boche H: Solution of the multi-user downlink beamforming problem with individual SINR constraints.
*IEEE Trans Veh Technol*2004, 53: 18-28. 10.1109/TVT.2003.819629View ArticleGoogle Scholar - Schubert M:
*Power-aware spatial multiplexing with unilateral antenna cooperation, PhD thesis. (TU Berlin)*. 2003.Google Scholar - Boche H, Schubert M: A general duality theory for uplink and downlink beamforming.
*Proceedings of IEEE Vehicular Technology Conference Fall*2002.Google Scholar - Schubert M, Boche H: Joint dirty paper pre-coding and downlink beamforming.
*Proceedings of ISSSTA*2002, 536-540.Google Scholar - Karipidis E, Sidiropoulos ND, Luo Z-Q: Quality of service and max-min fair transmit beamforming to multiple cochannel multicast groups.
*IEEE Trans Signal Process*2008, 56: 1268-1279.MathSciNetView ArticleGoogle Scholar - Karipidis E, Sidiropoulos ND, Tassiulas L: Joint QoS multicast power/admission control and base station assignment: A geometric programming approach.
*Proceedings of 5th IEEE Workshop on Sensor Array and Multi-Channel Signal Processing*2008.Google Scholar - Zhang X, Jorswieck E, Ottersten B, Paulraj A: User selection schemes in multiple antenna broadcast channels with guaranteed performance.
*Proceedings of IEEE Workshop on Signal Processing Advances in Wireless Communications*2007.Google Scholar - Zhang X, Jorswieck E, Ottersten B, Paulraj A: On the asymptotic optimality of opportunistic beamforming with hard SINR constraints.
*EURASIP J Adv Signal Process*2009, 2009: 1-12. Special issue on Multiuser MIMO Transmission with Limited Feedback, Cooperation, and CoordinationGoogle Scholar - Salim U, Slock D: Performance of different user selection algorithms for transmit power minimization. In
*Proceedings of Asilomar Conference on Signals, Systems and Computers*. Pacific Grove, CA, USA; 2009.Google Scholar - Zamir R, Shamai (Shitz) S, Erez U: Nested linear/lattice codes for structured multiterminal binning.
*IEEE Trans Inf Theory*2002, 48: 1250-1276. 10.1109/TIT.2002.1003821MATHView ArticleGoogle Scholar - Erez U, Brink ST: A close-to-capacity dirty paper coding scheme.
*IEEE Trans Inf Theory*2005, 51: 3417-3432. 10.1109/TIT.2005.855586MATHView ArticleGoogle Scholar - Tse D, Viswanath P:
*Fundamentals of Wireless Communications*. Cambridge University Press, Cambridge, UK; 2005.View ArticleGoogle Scholar - Cover TM, Thomas JA:
*Elements of Information Theory*. Wiley, New York; 1991.MATHView ArticleGoogle Scholar - Shen Z, Chen R, Andrews JG, Heath RW, Evans BL: Low complexity user selection algorithms for multiuser mimo systems with block diagonalization.
*IEEE Trans Signal Process*2006, 54: 3658-3663.View ArticleGoogle Scholar - Hammarwall D, Bengtsson M, Ottersten B: Utilizing the spatial information provided by channel norm feedback in SDMA systems.
*IEEE Trans Signal Process*2008, 56: 3278-3293.MathSciNetView ArticleGoogle Scholar - Han S, Yang C, Bengtsson M, Perez-Neira AI: Channel norm-based user scheduler in coordinated multi-point systems.
*Proceedings of IEEE Global Communications Conference (Honolulu, HI, USA)*2009.Google Scholar - Knopp R, Humblet PA: Information capacity and power control in single-cell multiuser communications.
*Proceedings of International Conference on Communications, Seattle, USA*1995, 331-335.Google Scholar - Paulraj A: Diversity Techniques in the Mobile Communications Handbook. Edited by: Gibson JD. CRC Press; 1999.Google Scholar
- Joung J, Sayed AH: User selection methods for multiuser two-way relay communications using space division multiple access.
*IEEE Trans Wirel Commun*2010, 9: 2130-2136.View ArticleGoogle Scholar - Abramowitz M, Stegun A:
*Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables*. Dover Publications; 1964.MATHGoogle Scholar - Horn RA, Johnson CR:
*Matrix Analysis*. Cambridge University Press, Cambridge, UK; 1985.MATHView ArticleGoogle Scholar - David HA:
*Order Statistics*. Wiley, New York; 1980.Google Scholar - Golub H, Van Loan CF:
*Matrix Computations*. John Hopkins Press; 1996.MATHGoogle Scholar - Jindal N: Antenna combining for the MIMO downlink channel.
*IEEE Trans Wirel Commun*2008, 10: 3834-3844.View ArticleGoogle Scholar - Gupta AK, Nadarajah S:
*Handbook of Beta Distribution and Its Applications*. CRC; 2004.MATHGoogle Scholar - Maddah-Ali MA, Sadrabadi MA, Khandani AK: Broadcast in MIMO systems based on a generalized QR decomposition: Signaling and performance analysis.
*IEEE Trans Inf Theory*2008, 54: 1124-1138.MathSciNetView ArticleGoogle 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.