Research

# Multiuser diversity in correlated Rayleigh-fading channels

Behrooz Makki* and Thomas Eriksson

Author Affiliations

Chalmers University of Technology, Gothenburg, Sweden

For all author emails, please log on.

EURASIP Journal on Wireless Communications and Networking 2012, 2012:38  doi:10.1186/1687-1499-2012-38

The electronic version of this article is the complete one and can be found online at: http://jwcn.eurasipjournals.com/content/2012/1/38

 Received: 8 July 2011 Accepted: 8 February 2012 Published: 8 February 2012

© 2012 Makki and Eriksson; licensee Springer.

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.

### Abstract

This article studies the effect of scheduling and multiuser diversity on the performance of correlated Rayleigh-fading channels. More specifically, the power-limited channel average rate is obtained for quasi-static correlated fading channels. The results are obtained in the cases where there is perfect or imperfect channel state information available at the transmitter. Simulation results show that the average rate reduction due to channels dependencies is ignorable in low correlation conditions. However, the effect of scheduling and multiuser diversity on the average rate reduces substantially as the fading channels dependency increases. Also, for different channels correlation conditions, considerable performance improvement is achieved via very limited number of feedback bits.

### 1. Introduction

Employment of adaptive modulation and scheduling leads to substantial performance improvement in multiuser systems, normally called multiuser diversity [1-12]. This is the main motivation for the current scheduling-based systems and this article as well. In these methods, the transmitter is provided with some information about the channel quality of different users. This information is then utilized by a scheduler to select the appropriate users, coding, and modulation such that an objective function is optimized. System throughput and fairness between the users are two objective functions mainly considered in the literature. Furthermore, depending on the number of users, channels characteristics and the feedback load resources, the transmitter information about the channels quality can be perfect or imperfect.

Assuming different levels of channel state information (CSI), a large number of scientific reports can be found that have tackled the multiuser diversity problem in different theoretical and practical aspects. For instance, [6-12] investigated the performance of multiuser networks under perfect CSI assumption. These works were later extended by, e.g., [13-19] where the system performance was analyzed in the presence of imperfect CSI available at the scheduler. Furthermore, among different research projects involving in this topic the WINNER+ [20] and the 3rd Generation Partnership Project (3GPP) [21] can be mentioned where multiuser diversity is one of the most important issues.

References [6-19] are all based on the assumption that the fading channels are mutually independent. That is, the network performance is investigated in the case where there is no correlation between the fading channels of different transmission end-points. However, based on the environmental properties, realistic channels may not be independent [3-5], [22-24]. Therefore, it is important to study the channel performance under correlated channels condition.

In this perspective, this article studies the average rate of correlated Rayleigh-fading multiuser networks. The results are obtained for quasi-static channels in the cases where there is perfect or imperfect CSI available at the transmitter. It is mainly focused on a system with a single transmitter and two receivers, which allows us to find closed-form solutions for the average rate and power allocation criteria. However, some discussions about extending the results to arbitrary number of receivers are also presented and the final conclusions are valid independent of the number of receivers. Assuming imperfect CSI, we evaluate the effect of optimal channel quantization on the system performance. The results show that substantial performance improvement is achieved with a limited number of feedback bits per user. Moreover, the effect of scheduling and multiuser diversity reduces with the channels correlation, although the rate reduction is ignorable in low correlation conditions. The arguments would be interesting for people involved in WINNER+, 3GPP or the ones working on scheduling between close users, for instance scheduling in single-cell networks, e.g., [25-28].

### 2. System model

In this part, we consider a network with a single transmitter and two receivers equipped with a single antenna. In time slot t, a max-rate scheduler selects one of the receivers, e.g., the k-th receiver. Then, the length-Lc codeword {Xt[i] |i = 1,..., Lc} multiplied by the random variable Hk,t is summed with independent and identically distributed (i.i.d) complex Gaussian noisea samples Z k , t i | i =  1, .   .   .   , L c Z k , t i ~ C N ( 0 , σ k 2 ) resulting in

Y k , t [ i ] = H k , t X t [ i ] + Z k , t [ i ] , i = 1 , . . . , L c . (1)

For simplicity of notation, the time slot index t is dropped. A quasi-static correlated Rayleigh-fading channel model is consideredb; The channel gains G k | H k | 2 , k = 1 , 2 , remain constant for a long time and then change according to their corresponding joint fading probability density function (pdf) f G 1 , G 2 ( x , y ) . Also, the gains are supposed to have identical marginal pdfs f G k ( x ) = 1 μ e - - x μ , x 0 , k = 1 , 2 , and the relation between the fading variables is modeled by

H 1 = β H 2 + 1 - β 2 ε , ε : C N ( 0 , μ ) . (2)

Here, μ denotes the exponential pdf parameter determined by the path loss and shadowing between the terminals and β is a known correlation factor modeling the two variables dependencies. This is a well-established model considered in the literature for different phenomena such as CSI imperfection, estimation error and channels/signals correlation [29-32]. In this way, the joint pdf of the gains is found as

f G 1 , G 2 ( x , y ) = 1 ( 1 - β 2 ) μ 2 e - λ x + y ( 1 - β 2 ) μ I 0 2 β x y 1 - β 2 μ (3)

where I0(.) is the zeroth-order modified Bessel function of the first kind [33]. Finally, note that as the channels have identical pdfs, the max-rate scheduler which transmits to the user with the strongest channel at any given time slot not only optimizes the system total performance but also maintains the long-term fairness between the users. Moreover, although it is the simplest to assume a network with two users, as seen in the following, the results provide valuable insights for the more general cases with arbitrary number of users. Also, extension of the results to arbitrary number of receivers experiencing different fading distributions can be found in the Appendix.

It is assumed that each receiver has perfect CSI about its corresponding channel gain which is an acceptable assumption in quasi-static condition, e.g., [17,18,34-38]. However, the transmitter may be provided with imperfect (Section 3) or perfect (Section 4) CSI about the fading channels. Further, all results are presented in natural logarithm basis, the channel average rate is presented in nats-per-channel-use (npcu) and, as stated in the following, the arguments are restricted to Gaussian input distributions. Finally, note that Rayleigh-fading channels are good models for tropospheric and ionospheric signal propagation as well as the effect of heavily built-up urban environments on radio signals [39,40]. Also, it is most applicable when there is no dominant propagation along a line of sight between the transmitters and the receivers.

#### 2.1. Average rate with no CSI at the transmitter

As a system performance lower bound, it is interesting to study the channel average rate with no CSI at the transmitter. In this case, the channel average rate is simplified to the one for a single user network, as one of the users is selected by the scheduler randomly. Also, with no CSI at the transmitter, the data is transmitted at a fixed rate R which is decoded if the channel realization supports the rate, i.e., R ≤ log(1 + gT) where T is the transmission power.c Therefore, representing the gains cumulative distribution function (cdf) by FG (g), the no-CSI channel average rate is obtained by

R ̄ no = max R R 1 - F G e R - 1 T (4)

which for Rayleigh-fading gain distribution results in

R ̄ no = W ( μ T ) e - e W ( μ T ) - 1 T . (5)

Here, W ( x ) is the standard Lambert W function defined as

x e x = y x = W ( y ) .

### 3. Average rate in the presence of imperfect CSI at the transmitter

This section studies the channel average rate in the case where the scheduler is provided with quantized CSI about the fading channels. In this way, considering N quantization regions, the quantization encoder function

C ( g k ) = i if  g k S i = [ g ̃ i - 1 , g ̃ i ) , g ̃ 0 = 0 , g ̃ N = (6)

is implemented by each receiver. Here, g ̃ i 's denote the quantization boundaries and Si is the i-th quantization region. The quantization indices are sent back to the scheduler which selects the user with the higher quantization index (max-rate scheduler). Also, if the channel gains are in the same quantization regions, one of them is selected randomly.

Remark 1: The optimal max-rate scheduler should select the users with the highest SNR. However, as stated in the following, the water-filling properties imply that higher powers are allocated to the higher quantization regions (see, e.g., (14), (19) and [34-38]). Therefore, the SNR increases with the quantization index and scheduling based on the quantization indices works the same as scheduling based on the SNRs.

Provided that the scheduled user channel gain is in the region Si, a fixed gain g i ^ [ g ̃ i - 1 , g ̃ i ) is considered by the transmitter and the data is sent with power Ti and rate Ri = log(1 + ĝiTi). The data is successfully decoded at the corresponding receiver if Gk ĝi where k represents the selected user index. Therefore, considering all quantization regions, the channel average rate is found as

R ̄ = 2 i = 2 N P i R i + i = 1 N Q i R i . (7)

Here,

P i = Pr { G 1 [ ĝ i , g ̃ i ) & G 2 [ 0 , g ̃ i - 1 ) } = ĝ i g ̃ i 0 g ̃ i - 1 f G 1 , G 2 ( x , y ) d x d y (8)

is the probability that (1) for instance, channel G1 is in the i-th quantization region, (2) its corresponding channel gain is higher than the considered value ĝi, that is, G 1 [ g i ^ , g i ̃ ) and (3) the second user channel gain is in one of the quantization regions Sj, j < i, such that the first user is selected by the scheduler. Then, the first summation term is multiplied by two, as the same thing can happen for the other user. Furthermore, Qi is found as

Q i = Pr { G 1 [ ĝ i , g ̃ i ) & G 2 [ g ̃ i - 1 , g ̃ i ) } = ĝ i g ̃ i g ̃ i - 1 g ̃ i f G 1 , G 2 ( x , y ) d x d y (9)

which is the probability that (1) both users are in the i-th quantization region and (2) the channel gain of the selected user supports the rate, e.g., G 1 [ g i ^ , g ̃ i ) if the first user is selected by the scheduler. Note that in this case one of the users is scheduled randomly with probability 1 2 . Therefore, the second summation term in (7) is not multiplied by two. Correspondingly, the average transmission power is obtained by

T ̄ = 2 i = 2 N P i T i + i = 1 N Q i T i (10)

where

P i = Pr { G 1 S i & G 2 S j , j < i } = g ̃ i - 1 g ̃ i 0 g ̃ i - 1 f G 1 , G 2 ( x , y ) d x d y (11)

denotes the probability that, for instance, channel G1 is in the i-th quantization region while the second user channel gain is in one of the lower regions. Also,

Q i = Pr { G 1 S i & G 2 S i } = g ̃ i - 1 g ̃ i g ̃ i - 1 g ̃ i f G 1 , G 2 ( x , y ) d x d y (12)

is the probability that both channels are in the i-th quantization region where one of them is selected randomly.

Using (7), (10) and the power constraint T ̄ T , the power-limited average rate maximization problem can be stated as

max g ̃ i , ĝ i , T i 2 i = 2 N P i R i + i = 1 N Q i R i subject to 2 i = 2 N P i T i + i = 1 N Q i T i T (13)

which, as discussed in [34-38], [[41], Section 9.4], is a convex problem in terms of transmission powers Ti. Therefore, the optimal transmission powers can be determined based on the Lagrange multiplier function ϒ = R ̄ - λ T ̄ which leads to the water-filling equations

ϒ T i = 0 T 1 = Q 1 λ Q 1 - 1 ĝ 1 + , i = 1 T i = 2 P i + Q i λ ( 2 P i + Q i ) - 1 ĝ 1 + , i > 1 . (14)

Here, λ is the Lagrange multiplier satisfying T ̄ T and x + max ( 0 , x ) . Intuitively, using optimal power allocation the power is not wasted on weak channel realization and the saved power is spent on strong gain realizations. Therefore, there will be a quantization index i where Ti = 0 if i < i and T i > 0 if i i . This point is helpful for simplifying the water-filling power allocation algorithm.

Considering (13), the main problem is to find the probability terms in (7) and (10) which can be found according to the following procedure

u v w z f G 1 , G 2 ( x , y ) d x d y ( a ) ¯ ¯ u v 1 μ e x r ( 2 w r 2 z r θ e θ 2 2 I 0 ( s x θ ) d θ ) d x ( b ) ¯ ¯ u v 1 μ e x μ { ξ ( s x , 2 w r ) ξ ( s x , 2 z r ) } d x ( c ) ¯ ¯ ( 1 β 2 ) e w μ { ξ ( 2 w r β , 2 u r ) ξ ( 2 w r β , 2 v r ) } ( 1 β 2 ) e z μ { ξ ( 2 z r β , 2 u r ) ξ ( 2 z r β , 2 v r ) } + 1 μ u v e x μ { ξ ( 2 z r , s x ) ξ ( 2 w r , s x ) } d x ( d ) ¯ ¯ e w μ { ϕ ( w β 2 , u ) ϕ ( w β 2 , v ) } e z μ { ϕ ( z β 2 , u ) ϕ ( z β 2 , v ) } + e v μ ϕ ( w , v β 2 ) e u μ ϕ ( w , u β 2 ) e v μ ϕ ( z , v β 2 ) + e u μ ϕ ( z , u β 2 ) . (15)

Here, (a) is obtained by defining r ( 1 - β 2 ) μ , s 2 / r β and using variable transform θ = 2 y / r . Then, (b) is directly obtained from the definition of the Marcum Q-function

ξ ( x , y ) = y t e - t 2 + x 2 2 I 0 ( x t ) d t . (16)

Also, (c) is based on the fact that

ξ ( x , y ) = 1 + e - ( x 2 + y 2 ) / 2 I 0 ( x y ) - ξ ( y , x ) (17)

and finally, (d) is derived by using variable transform t = x , partial integration, defining ϕ ( x , y ) ξ 2 x r , 2 y r and some calculations.

A simple average rate optimization algorithm: In contrast to transmission power parameters, the power-limited average rate optimization problem of quantized CSI-based systems, e.g., (13), is not a convex optimization problem in terms of quantization parameters ĝ i , g ̃ i i[34-38]. Therefore, although implementable, gradient-based algorithms are not efficient in determining the optimal quantization parameters. In order to tackle this problem, we propose an iterative algorithm, illustrated in Algorithm 1.

Remark 2: Similar to other techniques for solving non-convex optimization problems, it can not be guaranteed that the algorithm leads to the globally optimal solution for all channel conditions. However, by extensive testing, it is observed that for many different initial parameter settings and vector generation procedures, the algorithm leads to unique solutions. Furthermore, our experiments show that the algorithm is much more efficient than using greedy search scheme which requires a large number of initial random seeds due to the non-convexity of (13). Finally, although it may be time-consuming when the number of optimization parameters increases, the proposed algorithm has been shown to be efficient in many complex optimization problems dealing with local minima issues [42].

In the following, the channel average rate in the presence of perfect CSI available at the transmitter is studied and then the simulation results are presented in Section 5.

### 4. Average rate in the presence of perfect CSI at the transmitter

Assuming perfect CSI at the transmitter, the data is always transmitted to the user with higher instantaneous channel gain. Therefore, the channel average rate is rephrased as

R ̄ = 0 f Z ( z ) log ( 1 + z T ( z ) ) d z (18)

where Z max ( G 1 , G 2 ) is an auxiliary variable with pdf f Z ( z ) and T(z) is the transmission power considered for the instantaneous variable realization Z = z. Then, the average transmission power is obtained by T ̄ = 0 T ( z ) f Z ( z ) d z . Therefore, using the Lagrange multiplier function ϒ = R ̄ - λ T ̄ , the optimal power allocation is found as

ϒ T ( z ) = 0 T ( z ) = 1 λ * - 1 z , z λ * 0 , z < λ * . (19)

Here, the water-filling threshold λ* determined according to

λ * = arg λ { λ ( 1 λ 1 z ) f Z ( z ) d z = T } ( e ) ¯ ¯ arg λ { λ 1 F Z ( z ) z 2 d z = T } (20)

where FZ (z) is the cdf of the variable Z and (e) is obtained by partial integration. Finally, from (18) and (19), the channel average rate can be rephrased as

R ̄ = λ * f Z ( z ) log ( 1 + z T ( z ) ) d z = λ * f Z ( z ) log z λ * d z ( f ) λ * 1 - F Z ( z ) z d z (21)

where (f) is again based on partial integration. Therefore, the main problem would be to determine the cdf FZ (z), (20) and then (21).

Considering (15), the auxiliary variable cdf is found as

F Z ( z ) = Pr { max ( G 1 , G 2 ) z } = Pr { G 1 z & G 2 z } = 0 z 0 z f G 1 , G 2 ( x , y ) d x d y ( g ) ¯ ¯ 1 e z μ { 1 ξ ( 2 z r β , 2 z r ) + ξ ( 2 z r , 2 z r β ) } (22)

where (g) is based on the fact that ξ ( x , 0 ) = 1 , ξ ( 0 , x ) = e - x 2 2 and r = ( 1 - β 2 ) μ . Moreover, it can be written

J ( z ) = 1 F Z ( z ) ( h ) ¯ ¯ e z μ { 1 + 2 ξ ( 2 z r , 2 z r β ) e z r ( 1 + β 2 ) I 0 ( 2 z r β ) } ( i ) ¯ ¯ 2 e z μ 2 e 2 z r k = 0 ( 1 β ) k I k ( 2 z r β ) e 2 z r I 0 ( 2 z r β ) ( j ) ¯ ¯ 2 e z μ 2 e 2 z r k = 0 ( 1 β ) k m = 0 1 m ! Γ ( m + k + 1 ) ( z r β ) 2 m + k e 2 z r m = 0 1 m ! Γ ( m + 1 ) ( z r β ) 2 m (23)

Where, (h) follows from (17). Then, (i) and (j) are obtained according to

ξ ( x , y ) = 1 - e - x 2 + y 2 2 k = 0 x y k I k ( x y ) (24)

and the definition of the modified Bessel function of the k-th order I k ( x ) = m = 0 1 m ! Γ ( m + k + 1 ) x 2 2 m + k . Also, Γ ( x ) = 0 t x - 1 e - t d t denotes the Gamma function. In this way, using (23), it can be written

λ * 1 F Z ( z ) z n d z ( k ) ¯ ¯ 2 λ * z n e z μ d z 2 m = 0 k = 0 1 m ! ( m + k ) ! β 2 m r ( 2 m + k ) λ * z 2 m + k n e 2 z r d z m = 0 1 ( m ! ) 2 ( β r ) 2 m λ z 2 m n e 2 z r d z ( l ) ¯ ¯ 2 Γ ( 1 n , λ * μ ) 2 m = 0 k = 0 β 2 m r ( 2 m + k ) m ! ( m + k ) ! ( r 2 ) 2 m + k + 1 n Γ ( 2 m + k + 1 n , 2 λ * r ) m = 0 1 ( m ! ) 2 ( β r ) 2 m ( r 2 ) 2 m + 1 n Γ ( 2 m + 1 n , 2 λ * r ) (25)

where (k) follows from the fact that Γ ( x ) = ( x - 1 ) ! if x is a positive integer value and (l) is obtained by the definition of the incomplete Gamma function Γ ( a , x ) = x t a - 1 e - t d t . Finally, setting n = 2 and 1 in (25) the Equations (20) and (21) are found, respectively.

Here, there are some interesting points to be noted:

• Using (20), it can be easily shown that the water-filling threshold λ* is a decreasing function of the average transmission power constraint T . That is, more realizations of the variable Z, and correspondingly the channel gains, receive powers as the average transmission power constraint increases. Particularly, λ*→ 0 as T → ∞.

• Assuming independent fading channels, i.e., setting β = 0 in (3), the auxiliary variable cdf is simplified to

F Z ( z ) = 0 z 0 z f G 1 ( x ) f G 2 ( y ) d x d y = 1 - e - z μ 2 . (26)

Therefore, from (20), the Lagrange multiplier λ* is obtained by

λ * = arg λ 2 λ Ei ( - λ μ ) - 2 λ Ei ( - 2 λ μ ) - e - 2 λ μ μ - 2 μ e λ μ λ μ = T (27)

and the channel average rate, i.e., (21), is rephrased as

R ̄ = Ei - 2 λ * μ - 2 Ei - λ * μ (28)

where Ei(x) is the standard exponential integral function Ei ( x ) = x e - u u d u , x 0 .

Finally, extension of the results to arbitrary number of receivers can be found in the Appendix.

### 5. Simulation results

Considering different levels of CSI available at the transmitter, Figure 1 shows the channel average rate versus the average transmission power for different correlation conditions. Here, the results under no-CSI and with perfect CSI in uncorrelated channels condition have been plotted as two lower and upper bounds, respectively. Also, the effect of the channels dependencies on the system data transmission efficiency can be further studied in Figure 2. Here, the correlation gain defined as

Figure 1. Average rate vs. the average transmission power, correlated Rayleigh-fading channel, μ = 1.

Figure 2. Correlation gain K vs. the correlation factor β, correlated Rayleigh-fading channel, T = 1, μ = 1.

K R ̄ R ̄ | β = 0 , (29)

which is the ratio of the channel average rate, e.g., (21), and the one for uncorrelated channels, e.g. (28), is demonstrated as a function of the channels correlation.

Assuming N = 4 quantization regions, i.e., 2-bits feedback per user, Figure 3 investigates the effect of channels correlation on the optimal quantization boundaries. Here, the average transmission power is set to T = 1. Also, Table 1 demonstrates the average rate for different correlation coefficients and number of quantization regions. Finally, Figure 4a,b demonstrate the water-filling threshold, i.e., (20), as a function of the average transmission power T and the correlation factor β, respectively. Note that the summation terms in (25) converge to zero very fast. Therefore, the water-filling threshold and the average rate can be found accurately with the truncated versions of (25). Also, in all simulations we set the exponential pdfs parameter μ = 1.

Figure 3. Optimal quantization boundaries for different correlation factors, correlated Rayleigh-fading channel, T = 1,μ = 1.

Table 1. Channel average rate for different number of quantization regions and correlation coefficients

Figure 4. Optimal water-filling threshold as a function of (a) average transmission power constraint T and (b) correlation coefficient β, correlated Rayleigh-fading channel, μ = 1.

#### 5.1. Discussions

Theoretical and simulation results emphasize a number of interesting points that can be listed as follows:

• For different correlation conditions, considerable performance improvement is achieved via very limited number of feedback bits per user. This point is useful particularly in networks with a large number of users where the feedback load is an important issue. Moreover, the transmitter CSI is more effective when the channels dependency decreases (Figures 1, 2, and Table 1).

• The effect of scheduling and multiuser diversity reduces with the channels correlation, although the rate reduction is ignorable in low correlation conditions (Figures 1 and 2). There is an interesting intuition behind this point; In a system with a number of users experiencing independent fading conditions it is more likely that, at any time instant, one of the users experiences good channel quality. Therefore, the data transmission efficiency can be improved by always communicating the best users (multiuser diversity). However, if the channels are not independent, the probability that one of the users has good channel quality while the others experience bad channels, and correspondingly the effect of multiuser diversity, decreases. Therefore, it is expected that for users close to each other, for instance the users in a single cell, e.g., [25-28]], the practical gain due to multiuser diversity would be less than the one theoretically obtained under independent channels assumptions. Note that the conclusion is valid for any number of users. Also, it is interesting to mention that, although channels correlation reduces the forward channel data transmission efficiency, it is very helpful for feedback compression of multiuser channels, as discussed in, e.g., [3-5].

• Increasing the channels dependencies, the quantization boundaries converge together (Figure 3). Furthermore, with full correlation between the channels, the results are simplified to the ones obtained for single-user networks.

• The water-filling threshold reduces as the average transmission power or the channels correlation increases (Figure 4). This is intuitively correct because with higher correlations the probability that lower channels gains realizations have the chance of data transmission increases. Therefore, they should receive more power as they have more contribution on the average rate.

Finally, note that the conclusions are valid independent of the fading distributions and the number of receivers.

### 6. Conclusion

This article studies the average rate of multiuser Rayleigh-fading channels when there is correlation between the users fading channels. The channel average rate is obtained in both perfect and imperfect transmitter CSI conditions under quasi-static channel assumption. Theoretical and simulation results show that substantial performance improvement is achieved with a limited number of feedback bits per user. On the other hand, while average rate reduction due to channels dependencies is ignorable in low correlation conditions, the effect of scheduling and multiuser diversity on the average rate reduces substantially as the fading channels dependency increases. The results are helpful for scheduling in the cases where the users are close to each other, for instance in single-cell networks. Finally, extending the results to the case of cellular networks is an interesting topic which is left for the future.

### Appendix 1: Extension of the results to arbitrary number of receivers

With the same procedure as in Section 3, the system average rate in the presence of M users experiencing symmetric correlated fading distributions and using quantization function (6) is obtained as

R ̄ = i = 1 N Ω ( M , i ) log ( 1 + ĝ i T i ) , Ω ( M , i ) = j 1 . . . j i w = 1 i j w = M - 1 M 1 M - 1 j 1 . . . j i P j 1 j i j i + 1 , P j 1 j i = S 1 S 1 j 1 times S 2 S 2 j 2 times S i S i j i times ĝ i g ̃ i f G 1 G M ( x 1 , . . . , x M ) d x 1 . . . d x M . (30)

Here, M 1 is the "n choose k" operator, M - 1 j 1 . . . j i = ( M - 1 ) ! j 1 ! . . . j i ! and f G 1 . . . G M is the correlated channels fading pdf. Moreover, Ω(M,i) is the probability that, j w , w = 1 , . . . , i , of the M-1 unscheduled users are in the quantization region Sw, the scheduled user which can be any of the M users is in the quantization region Si, one of the (ji + 1) users in the region Si is selected randomly (with probability 1 j i + 1 ) and the selected user channel gain supports the rate, e.g., G 1 [ ĝ i , g ̃ i ) . Also, the average transmission power, i.e., (10), is rephrased as

T ¯ = i = 1 N Ω ( M , i ) T i , Ω ( M , i ) = Ω ( M , i ) P j 1 ... j i P j 1 ... j i P j 1 ... j i = S 1 ... S 1 j 1 times S 2 ... S 2 ... j 2 times S i ... S i f G 1 ... G M ( x 1 , ... , x M ) ( j i + 1 )times d x 1 ... d x M (31)

where P j 1 . . . j i is the probability that there are jw, w = 1,..., i - 1, gains in the quantization region Sw and (ji + 1) gains in the region Si. Replacing (30) and (31) in (13) the power-limited average rate optimization problem can be solved based on the channels distributions. Assuming perfect CSI available at the transmitter, on the other hand, the average rate is obtained by (18) in which the auxiliary parameter Z is redefined as Z = max(G1,...,GM).

### Competing interests

The authors declare that they have no competing interests.

### Endnotes

aThe noise parameter Zk,t represents the Gaussian interferences received from the other users/cells as well. bAs discussed in [43], the information theoretic results of quasi-static fading channels match the results of actual codes for practical code lengths, e.g., Lc100 channel uses. cIn an AWGN channel with constant gain g and transmission power T , the maximum rate is obtained by log(1 + gT) [41]. This is particularly because, as there is perfect CSI at the receiver, likelihood decoding can be successfully implemented at the receiver.

### Algorithm 1 Average rate optimization

I. For a given power constraint T, consider J, e.g. J = 20, randomly generated vectors Λ j = [ ĝ 1 , . . . , ĝ N , g ̃ 0 , g ̃ 1 , . . . , g ̃ N ] such that g ̃ i - 1 ĝ i < g ̃ i , g ̃ 0 = 0 , ĝ N = .

II. For each vector, do the following procedures

1) Determine the the probability terms of (7) and (10) based on (15).

2) Determine the average rate according to (7) and (14).

III. Find the vector which results in the highest average rate, i.e., Λi where R ̄ j R ̄ i , j = 1 , . . . , J .

IV. Λ 1 Λ i .

V. Generate b J , e.g., b = 5, vectors Δ j , new , j = 1 , . . . , b around Λ 1 . These vectors should also satisfy the constraints introduced in I.

VI. Λ j + 1 Λ j , new , j = 1 , . . . , b .

VII. Regenerate the remaining vectors Λ j , j = b + 2 , . . . , J randomly such that Λ j = [ ĝ 1 , . . . , ĝ N , g ̃ 0 , g ̃ 1 , . . . , g ̃ N ] and g ̃ i - 1 ĝ i < g ̃ i , g ̃ 0 = 0 , ĝ N = .

VII. Go to II and continue until convergence.

### References

1. M Torabi, D Haccoun, Performance analysis of joint user scheduling and antenna selection over MIMO fading channels. IEEE Signal Process Lett 18(4), 235–238 (2011)

2. L Jin, X Gu, Z Hu, Low-complexity scheduling strategy for wireless multiuser multiple-input multiple-output downlink system. IET Commun 5(7), 990–995 (2011). Publisher Full Text

3. B Makki, T Eriksson, Efficient channel quality feedback signaling using transform coding and bit allocation. Vehicular Technology Conference, VTC (Ottawa, ON, 2010), pp. 1–5

4. T Eriksson, T Ottosson, Compression of feedback for adaptive transmission and scheduling. Proc IEEE 95(12), 2314–2321 (2007)

5. T Eriksson, T Ottosson, Compression of feedback in adaptive OFDM-based systems using scheduling. IEEE Commun Lett 11(11), 859–861 (2007)

6. P Viswanath, DNC Tse, R Laroia, Opportunistic beamforming using dumb antennas. IEEE Trans Inf Theory 48(6), 1277–1294 (2002). Publisher Full Text

7. G Dimic, ND Sidiropoulos, On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm. IEEE Trans Signal Process 53(10), 3857–3868 (2005)

8. VKN Lau, Proportional fair space-time scheduling for wireless communications. IEEE Trans Commun 53(8), 1353–1360 (2005). Publisher Full Text

9. M Sharif, B Hassibi, On the capacity of MIMO broadcast channels with partial side information. IEEE Trans Inf Theory 51(2), 506–522 (2005). Publisher Full Text

10. F Boccardi, F Tosato, G Caire, Precoding schemes for the MIMO-GBC. Int Zurich Seminar on Commun, Zurich, 10–13 (2006)

11. W Yu, T Lan, Transmitter optimization for the multi-antenna downlink with per-antenna power constraints. IEEE Trans Signal Process 55(6), 2646–2660 (2007)

12. A Wiesel, YC Eldar, S Shamai, Zero-forcing precoding and generalized inverses. IEEE Trans Signal Process 56(9), 4409–4418 (2008)

13. S Sanayei, A Nosratinia, Exploiting multiuser diversity with only 1-bit feedback. WCNC (New Orleans, LA, 2005) 2, pp. 978–983

14. K-K Wong, J Chen, Near-optimal power allocation and multiuser scheduling with outage capacity constraints exploiting only channel statistics. IEEE Trans Wirel Commun 7(3), 812–818 (2008)

15. YS Al-Harthi, AH Tewfik, MS Alouini, Multiuser diversity with quantized feedback. IEEE Trans Wirel Commun 6(1), 330–337 (2007)

16. M Kountouris, T SSlzer, D Gesbert, Scheduling for multiuser MIMO downlink channels with ranking-based feedback. Eur J Adv in Signal Process 2008, 854120 (2008). Publisher Full Text

17. H Shirani-Mehr, G Caire, MJ Neely, MIMO downlink scheduling with non-perfect channel state knowledge. IEEE Trans Commun 58(7), 2055–2066 (2010)

18. H Nam, M-S Alouini, Multiuser switched diversity scheduling systems with per-user threshold. IEEE Trans Commun 58(5), 1321–1326 (2010)

19. H Shirani-Mehr, H Papadopoulos, SA Ramprashad, G Caire, Joint scheduling and ARQ for MU-MIMO downlink in the presence of inter-cell interference. IEEE Trans Commun 59(2), 578–589 (2011)

21. 3GPP [http://www.3gpp.org]

22. K Huang, R Heath, J Andrews, Limited feedback beamforming over temporally-correlated channels. IEEE Trans Signal Process 57(5), 1959–1975 (2009)

23. R1-051334, CQI feedback scheme for EUTRA, Motorola, RAN1 meeting 43, Seoul, Republic of Korea

24. R1-062772, Compressed CQI reporting scheme, NEC, RAN WG1 meeting 46, Seoul, Republic of Korea

25. N Damji, T Le-Ngoc, Dynamic resource allocation for delay-tolerant services in downlink OFDM wireless cellular systems. ICC, Beijing, China 5, 3095–3099 (2005)

26. F Sun, M You, J Liu, Z Shi, P Wen, J Liu, Genetic algorithm based multiuser scheduling for single- and multi-cell systems with successive interference cancellation. PIMRC, Istanbul, Turkey, 1230–1235 (2010)

27. AG Gotsis, NT Koutsokeras, P Constantinou, Radio resource allocation and packet scheduling strategies for single-cell OFDMA packet networks. VTC, Baltimore, MD, 1847–1851 (2007)

28. P Marbach, Y Lu, Active queue management and scheduling for wireless networks: the single-cell case. CISS, Princeton, NJ, 1560–1565 (2006)

29. HA Suraweera, PJ Smith, M Shafi, Capacity limits and performance analysis of cognitive radio with imperfect channel knowledge. IEEE Trans Veh Technol 59(4), 1811–1822 (2010)

30. KS Ahn, RW Heath, Performance analysis of maximum ratio combining with imperfect channel estimation in the presence of cochannel interferences. IEEE Trans Wirel Commun 8(3), 1080–1085 (2009)

31. Q Sun, DC Cox, HC Huang, A Lozano, Estimation of continuous flat fading MIMO channels. IEEE Trans Wirel Commun 1(4), 549–553 (2002). Publisher Full Text

32. TL Marzetta, BLAST training: estimating channel characteristics for high capacity space-time wireless. 37th Annual Allerton Conference on Communication, Control and Computing (Allerton House, Monticello, IL, 1999) 1(4), pp. 958–966

33. C Tellambura, ADS Jayalath, Generation of bivariate rayleigh and nakagami-M fading envelopes. IEEE Commun Lett 4(5), 170–172 (2000). Publisher Full Text

34. B Makki, T Eriksson, Data transmission in the presence of noisy channel state feedback and outage probability constraint. International Symposium on Information Theory and its Applications, ISITA (Taichung, Taiwan, 2010), pp. 458–463

35. B Makki, T Eriksson, On the average rate of quasi-static fading channels with ARQ and CSI feedback. IEEE Commun Lett 14(9), 806–808 (2010)

36. TT Kim, M Skoglund, On the expected rate of slowly fading channels with quantized side information. IEEE Trans Commun 55(4), 820–829 (2007)

37. S Ekbatani, F Etemadi, H Jafarkhani, Throughput maximization over slowly fading channels using quantized and erroneous feedback. IEEE Trans Commun 57(9), 2528–2533 (2009)

38. S Ekbatani, F Etemadi, H Jafarkhani, Outage behavior of slow fading channels with power control using partial and erroneous CSIT. IEEE Trans Inf Theory 56(12), 6097–6102 (2010)

39. JG Proakis, Digital Communications, 4th edn. (McGraw Hill, New York, 2001)

40. B Sklar, Rayleigh fading channels in mobile digital communication systems. I characterization IEEE Commun Mag 35(7), 90–100 (1997)

41. TM Cover, JA Thomas, Elements of Information Theory (Wiley, New York, 1992)

42. B Makki, M Noori Hosseini, SA Seyyedsalehi, N Sadati, Unaligned training for voice conversion based on a local nonlinear principal component analysis approach. Neural Comput Appl 19(3), 437–444 (2009)

43. G Caire, G Taricco, E Biglieri, Optimum power control over fading channels. IEEE Trans Inf Theory 45(5), 1468–1489 (1999). Publisher Full Text