Skip to main content

Feedback channel designs for fair scheduling in MISO–OFDMA systems


In the next generation of wireless communication, adaptive resource allocation techniques will play an important role to improve quality of service and spectral efficiency. In order to employ adaptive fairness scheduling for multiple-input single-output (MISO) orthogonal frequency-division multiple access (OFDMA), the channel state information (CSI) belonging to all users is required at the base station. However, the amount of feedback increases with the number of users, transmit antennas and subchannels. Therefore, it is important to perform a user selection at the receiver side without cooperation among the users and to quantize the CSI. In this article, the reduced feedback channel designs are examined for MISO–OFDMA systems while providing fairness between the users. In order to reduce the feedback rate, we choose the users considering their norm and orthogonality properties as well as their location in the cell. In order to limit the feedback rate, channel direction information is quantized by designing a specific codebook thanks to the proposed criterion. We obtain an expression to determine the amount of required feedback information for MISO–OFDMA systems to support more than one beam per subchannel for a given number of users, subchannels and transmit antennas. The performance results of the reduced feedback channel designs are evaluated for fair scheduling in wireless channels.


In future wireless radio networks, adaptive resource allocation can have a significant role to improve the spectral efficiency for multiuser orthogonal frequency division multiplexing (OFDM) systems with multiple transmit and/or receive antennas by exploiting a large number of degrees of freedom in space, frequency, and time. OFDM inherits its superiority of mitigating multipath fading to maximize throughput. Besides, in a multiple-antenna system with the help of precoding techniques, it is possible to increase the spectral efficiency by multiplexing multiple users on the same subchannel. For orthogonal frequency-division multiple access (OFDMA) systems, the sum rate can be maximized by assigning each subcarrier to the user having the best channel gain. However, for multiuser multiple-input single-output (MISO)–OFDM systems, the sum rate is maximized by choosing the optimal set of co-channel users for each subchannels[1, 2]. It is also important to satisfy all users’ requirements even if the users are far from the base station (BS) by allocating the clusters and beams fairly. Therefore, not only the optimal set but also the fairness issue is considered by employing proportional fair scheduling algorithms (PFS) for MISO–OFDMA systems[3].

In order to achieve the gain of MISO–OFDMA systems, the channel state information (CSI) of all subchannels from all users for all antennas is required at the transmitter side. This causes a high feedback load and a sophisticated resource allocation algorithm at the BS. In order to design an efficient MISO–OFDMA system, the selection of users and the quantization of their CSI using efficient codebooks at the receiver side is needed to fed back the users’ CSI to the BS through a reduced rate feedback channel.

In order to design reduced feedback channels, user selection algorithms at the receiver side are performed by deciding the number of users that are fed back their quantized CSI by using codebooks known at both the transmitter and the receiver sides[4]. For multiuser MISO single-carrier systems with linear precoding, the semi-orthogonal user selection algorithm to reduce the feedback load by combining the classical norm criterion and with a criterion based on the orthogonality between the co-channel users has been presented in[5, 6]. The codebook design for narrowband single user communication system has been well studied in[7]. The extension to the OFDM case has been considered in[8, 9]. For multiuser multiple-input multiple output (MIMO) with zero-forcing (ZF) beamforming, the codebook design and quantization algorithm have been proposed in[10] to enable high resolution quantization. In[11], an adaptive limited feedback linear precoding technique for temporally correlated MIMO channels has been presented by performing a differential feedback where a perturbation added to the previous precoder for adaptation to the time correlation structure. Limited feedback using a polar-cap differential codebook which utilizes the temporal correlation in MISO channels has been presented in[12].

A two-stage feedback scheme has been presented in[13] where in the first step a coarse estimates of all user channels are feedback to the BS then in the second step only N t users are selected to feed back more accurate channel quantization. In[14], it has been underscored the tradeoff between getting coarse channel feedback from large number of users and providing multiuser diversity gain versus getting high-quality channel feedback from a low number of users. In[15], two stages for scheduling process based on partial probing of the users has been presented, in order to reduce the feedback, at the second stage the probing process stops and only the remaining users are requested to feedback their channel quality.

A scheduler at the BS usually does not schedule users on their weakest clusters. Hence, the amount of feedback information can be reduced by letting each user feed back information only about its strongest clusters. Following this phenomenon, in order to achieve reduction on the feedback load without sacrificing performance too much, the so-called clustered S-best criterion has been proposed for OFDMA systems in[16]. This criterion is based on the clusters where adjacent subcarriers are grouped and only the CSI related to the strongest S clusters of each user are fed back to the transmitter. In[17], a quantization method for OFDMA systems has been proposed to reduce the amount of feedback bits by determining subchannel block size and feedback periodicity according to users’ channel conditions. This scheme has been extended to MISO–OFDMA systems in[18] by using space-frequency matrix. For OFDMA systems, a feedback reduction algorithm that considers feedback efficiency as a feedback decision metric instead of the received signal-to-noise ratio (SNR) has been examined in[19] to increase the fairness between the users.

In this article, we propose reduced feedback channel designs for fair scheduling where the users are uniformly distributed in the cell for MISO–OFDMA systems. Both user selection and quantization algorithms dedicated to the selected users are applied to solve the major problem which arises from the fact that the total feedback load increases with the number of users, subchannels and antennas. The clustered S-best and the combined user selection algorithms with a codebook design thanks to the semi-orthogonal criterion are presented by choosing adaptively the number of feedback clusters depending on the location of the users and/or the number of users in the cell. These algorithms allow a precoding scheme creating more than one beam to schedule more than one user for each cluster by providing fairness between the users. We also provide the amount of required feedback information to create more than one beam for a given number of users, subchannels and transmit antennas.

This article is organized as follows: In Section “System model”, the system model for MISO–OFDMA over wireless channels is described. Then, the reduced feedback channel designs are presented for fair scheduling in Section “The proposed designs”. The performance results are demonstrated in Section “Performance results” considering perfect and quantized CSI in wireless channels. Section “Conclusion” draws the conclusion of the article.

System model

A MISO–OFDMA system with N t transmit antennas, Q clusters and K users is considered. A cluster structure where the correlation is high among the subcarriers is employed so that the feedback of only one value is sufficient. For this model, the frequency channel vector between the BS and the k th user for the q th cluster at frame n is described by,

H k , q n = H k , q , 1 n H k , q , 2 n H k , q , t n H k , q , N t n

where H k , q , t n is the channel coefficient from the t th transmit antenna to the k th user for the q th cluster at frame n.

In order to prevent the outage, we have set the value of cluster as the CSI that has the minimum channel vector gain belonging to the subcarriers in the cluster. Then, the channel coefficient of a cluster is determined by,

H k , q n = H ̄ k , m n

where H ̄ k , m n is the N t × 1 channel vector associated to the k th user and the m th subcarrier and m is:

m = ( q 1 ) N Q + arg min 1 i N Q { | | H ̄ k , ( q 1 ) N q + i n | | 2 } , q = 1 , 2 , , Q

where N Q is the number of subcarriers in one cluster and calculated as N Q =M/Q with M is the total number of subcarriers in a OFDM symbol.

The time channel vector consists of multipath components for each antenna t and each user k is described as,

h k , t n = h k , 1 , t n h k , 2 , t n h k , L t , t n

where h k , , t n is channel coefficient in time domain belonging to k th user, t th antenna and th path and L t is the number of multipath components.

The channel coefficients belonging to subcarriers for each user and each antenna are obtained by applying the Fourier Transform to the channel vector in Equation (4).

For a system where N t K, let S q be the set of assigned users that scheduled to cluster q:

S q = { A k , q , b n | A k , q , b n = 1 ; k , b }

where A k , q , b n is a binary variable that indicates cluster q is allocated to user k for beam b.

The total number of scheduled users for each cluster is N t and H n ( S q ) denotes the matrix consisting of N t channel vectors of these scheduled users for cluster q. Then, the associated users’ data is transmitted after performing ZF precoding[20, 21]. The ZF transmit beamforming matrix is calculated by,

W n ( S q )=β ( H n ( S q ) ) H [ ( H n ( S q ) ) H n ( S q ) H ] 1

which includes N t elements as W n ( S q )= W 1 n ( S q ) W 2 n ( S q ) W N t n ( S q ) T where W b n ( S q ) is the precoding vector for b th beam and q th cluster with the dimension of N t ×1.

In order to keep the short term power constraint, we determine β as,

β= 1 tr [ ( ( H n ( S q ) ) H n ( S q ) H ) 1 ]

For the k th user and the q th cluster at n th frame, the relation between the data vector S n ( S q ) and the received vector can be written as:

Y n ( S q ) = H n ( S q ) X n ( S q ) + N n ( S q ) = H n ( S q ) W n ( S q ) P q S n ( S q ) + N n ( S q )

where P q =diag P T / ( Q N t ) , , P T / ( Q N t ) denoting that the total transmit power P T is equally shared between the clusters and beams and X n ( S q ) C N t × 1 is the transmitted vector from the BS.

Our objective is to maximize the average sum rate while keeping fairness between the users by optimizing both the cluster and beam allocation[3, 22], A n =[ A 1 n , A 2 n ,, A Q n ]. In order to construct A q n , all vectors of A k , q n = [ A k , q , 1 n , A k , q , 2 n , , A k , q , N t n ] T are stacked column by column.

In order to perform the user allocation, the ZF precoding is performed under the total power constraint equally shared between the clusters and the beams considering a proportional fairness scheduling (α PFS). Mathematically, the optimization problem is formulated as,

( A n ) =arg max A n k = 1 K R k n ( T ́ k n ¯ ) α

subject to

k = 1 K A k , q , b n 1 ; q , b
A k , q , b n { 0 , 1 } ; k , q , b

The instantaneous data rate R k n is calculated as,

R k n = q = 1 Q b = 1 N t A k , q , b n log 2 (1+ SINR k , q , b n )

where the signal-to-interference-plus-noise-ratio (SINR) is:

SINR k , q , b n = P T N t H k , q n W k , q , b n 2 N 0 B + P T N t j = 1 ; j b N t H k , q n W k , q , j n 2

where N0 is the power spectral density of additive white Gaussian noise (AWGN) and B is the total available bandwidth.

The weighted average data rate in Equation (8) is calculated by,

T ́ k n + 1 ¯ = 1 1 t c T ́ k n ¯ + 1 t c R k n

where t c is the average window size.

To simplify the optimization problem, it is possible to perform the user allocation at a cluster level as,

( A q n ) =arg max A q n k = 1 K R k , q n ( T k n ¯ ) α ,q

The instantaneous user rate for each cluster is:

R k , q n = b = 1 N t A k , q , b n log 2 ( 1 + SINR k , q , b n )

The weighted average rate of each user is updated after allocating each cluster as,

T k n + 1 ¯ = 1 1 t c T k n ¯ + 1 t c R k , q n

The proposed designs

In order to exploit the multiuser diversity, the users need to feedback their CSI to the BS. The feedback rate can be reduced by letting each user send their CSI associated only to a subset of clusters after applying quantization. We present four different algorithms to perform user selection at the receiver side and a quantization method thanks to the properties of the semi-orthogonal criterion.

P1: The clustered S-best criterion

For the clustered S-best criterion, each user selects independently a set of S k n composed of the S clusters with the highest channel norm H k , q n . Then, each user fed backs only its CSI associated to the selected clusters to the BS.

Let T q n be the set of users that feedback their CSI associated to the cluster q as,

T q n ={k{1,2,,K}:q S k n }

Then, for each cluster q, the BS selects the set S q n from the set T q n to maximize the sum rate in Equation (14).

Since the total feedback rate is proportional to KS, it is reasonable to adjust S in function of K according to a desired function S=f(K).

The objective is defined in terms of a fraction of all clusters, η, which for N t users send their CSI to the BS. η can be adjusted to guaranty ηQ clusters can allocate at least N t users with a probability higher than 1−Pobj as follows.

Pr q = 1 Q I q N t ηQ | S , K P obj


I q N t = 1 if | T q n | N t 0 else

The case of N t =1 has been examined in[16] for OFDMA systems with single antenna. In this article, we extend it to the MISO–OFDMA systems considering the case of N t =2 to allocate more than one beam for each cluster.

In order to achieve Pobj with the parameters v=ηQ and V K = q = 1 Q I q N t that is the number of clusters having CSI of more than one user, the probability that v or less different clusters are fed back with less than two users is obtained by,

Pr( V K v)= i = 0 ( Q + 1 ) ( v + 1 ) P K (i)

The calculation of P K (i) in Equation (18) is given in the Appendix.

P2: The combined criterion

The clusters can be selected based not only on channel norm/quality but also on channel direction information (CDI)[23]. Therefore, for each cluster, N t random orthonormal vectors ϕb,q(N t ×1), b=1,…,N t are generated.

The users measure the orthogonality between their channels and the random vectors ϕb,q for each cluster using the chordal distance as:

d 2 H ~ k , q n , ϕ b , q =1| ( H ~ k , q n ) H ϕ b , q | 2

where H ~ k , q n = H k , q n H k , q n is the normalized channel vector of the user k and cluster q.

Let O N t be the unit sphere lying in C N t and centered at the origin. Using the chordal distance metric, for any 0< ϵ <1, we can define a spherical cap on O N t with center o and square radius ϵ as the open set:

ϵ (o)={g O N t : d 2 (g,o)ϵ}

Following the definition of spherical cap with the center ϕb,q and square radius ϵ, the constructed open set corresponds to semi-orthogonal neighborhood set of any orthonormal vector. Then, it is possible to calculate that the normalized channel vector is in the open set or not according to chordal distance metric.

Then, the semi-orthogonal criterion is defined as:

T q n = k { 1 , 2 , , K } : H ~ k , q n b = 1 N t ϵ ( ϕ b , q )

where T q n is the set of semi-orthogonal users for cluster q.

The set of the selected clusters by user k is given by,

T k n ={q{1,2,,Q}:k T q n }

According to Mukkavilli et al.[24], the number of clusters which satisfy ϵ criterion for each user is calculated approximately as N t ϵ th N t 1 . Therefore, the choice of ϵ is critical since it is directly relative to the total number of clusters per user. Consequently, it should be guaranteed that at least S clusters which satisfy the semi-orthogonal criterion for each user are selected by adjusting the ϵ parameter properly.

Then, each user selects S best clusters in terms of channel quality/norm from the set T k n and constructs a set S k n . From this set, for each q, we can obtain the set T q n using Equation (16).

Adaptive P1: Adaptive clustered S-best criterion

In order to further reduce the feedback rate, the number of feedback clusters,| S k n |= S k n , is adjusted adaptively according to the location of the users in the cell. Since the users that are far from BS have lowest rate per cluster, they require more clusters for fair scheduling. Therefore, the purpose of the adaptive feedback algorithm is to give more scheduling opportunities to the users far from the BS by providing more feedback clusters.

Let’s define a variable

p k n = e Z k n Q 1 +

where [ . ] 1 + denotes the orthogonal projection onto interval [0,1], e is a fixed spectral efficiency parameter that adjust to rate of the feedback channel and Z k n is the instantaneous number of allocated clusters for the k th user.

Z k n = b = 1 N t q = 1 Q A k , q , b n

Z k n is proportionally changed according to the location of the users where the farthest user will required more clusters than the nearest user for proportionally fair scheduling. Since p k n is proportionally to Z k n , the farthest user will feedback more clusters than the nearest user.

After that, each user generates a binomial random variable with parameters Q and p k n to determine the number of feedback clusters, S k n . Then, as described in P1 algorithm, the set S k n which includes the best S k n clusters of user k is constructed.

Adaptive P2: adaptive combined criterion

The adaptive combined criterion is described as follows:

For each user k:

  • As described in Adaptive P1 algorithm, the required number of feedback clusters, S k n , is calculated depending on the instantaneous number of allocated clusters.

  • Choose the corresponding epsilon value, ϵ k n as well as the number of feedback cluster, S k n .

  • The set of the predefined number of clusters and the corresponding epsilon values are given, respectively:

    C = { C 1 , C 2 , , C T } E = { e 1 , e 2 , , e T }

where T is the number of codebooks for different epsilon values.

  • Find the index of the closest value:

    t =argmin| C t S k n |,t=1,2,,T
  • Set the parameters:

    S k n = C t ϵ k n = e t
  • According to these parameters, the semi-orthogonal criterion described in P2 algorithm is performed and the set S k n which includes S k n best clusters for user k is obtained.

The codebook design

In order to transmit the CSI of the selected users to the BS, a classical solution is to quantize the CDI and the channel quality information (CQI) before transmission over the finite rate feedback link. In contrast to the CDI which is identically independent distributed (i.i.d) in O N t isotropically, since we are employing the semi-orthogonal criterion in the combined user selection algorithms, the clusters are selected according to a spherical cap region[6]. In order to reduce the error quantization, it is important to build a codebook using a quantization of the localized region or local packing[8]. A local Grassmannian packing with parameters N t o, ϵ is a set of N c vectors, where N c is the codebook size, g i , i = 1,…,N c , constrained to a spherical cap ϵ (o) in O N t such that

min 1 i < j N c d 2 ( g i , g j )

is maximized. As in the i.i.d., case for CDI, we use a practical vector quantization scheme, namely the generalized Lloyd-Max algorithm to design these local packings.

For the semi-orthogonal criterion, the codebook must be adapted according to the orthogonal vectors ϕb,q. From the local packing associated to the spherical cap ϵ (o), it is possible to compute the local packing, ϵ ( ϕ b , q ), using the rotation matrix as,

ϕ b , q = U rot o

where Urot is the unitary rotation matrix.

The users selected by the combined criterion feed back log2(N c ) bits corresponding to the codebook index. In addition to that, it is necessary to feedback log2(N t ) bits for the index of the vector ϕb,q. Consequently, for a codebook size of N c , log2(N c ×N t ) bits are necessary to quantify the CDI for P2 algorithm while log2(N c ) bits are required for P1 algorithm for each cluster. In terms of complexity, predefined tables can be used for generation of N t random orthogonal vectors in practical systems.

PFS algorithm

Since it is assumed that the users are distributed heterogeneously, the proportional fairness (α PF) algorithm is used to allocate users by adding a set of nonlinear constraints. This scheduler brings a compromise between the sum rate and the fairness. The fairness index (FI) is calculated by using the Jain index[25] given as:

FI= ( n = 1 N k = 1 K R k n ) 2 K n = 1 N k = 1 K ( R k n ) 2

The FI ranges between 0 (no fairness) and 1 (perfect fairness) in which all users would achieve the same data rate.

After applying user selection algorithms and quantization at the receiver side as presented in the previous sections, the CSI of the selected users is feedback through the feedback channel. Then, the users’ CDI and CQI are available at the BS to perform PFS by choosing the user set for each cluster. Since the search space becomes 2 | T q | instead of 2Kwith the advantage of the user selection algorithms, the complexity of the resource allocation is significantly reduced at the BS.

  • For each cluster q:

  • Set A k , q , b n =0 for k = 1,2,…,K and b=1,2,…,N t .

  • Construct | T q | N t sets as S q b , i ;b=1,2,, N t from the set of T q .For i=1,2,…|T q |:

  • Calculate the user rate for k S q b , i ; k =1,2,,K;b=1,2,, N t :

    [ R k , q n ] b , i = log 2 (1+ SINR k , q , b n )
  • Choose the allocation pattern that maximizes the sum weighted rate as:

    i =arg max i b = 1 N t [ R k , q n ] b , i [ T k n ¯ ] α
  • Update A k , q , b n =1 for k S q b , i ; b =1,2,, N t .

  • Update the weighted average data rate according to Equation (15).

  • End.

Performance results

We obtain the performance results to illustrate the benefits of the reduced rate feedback channels in a single-cell MISO–OFDMA system with two transmit and one receive antennas through wireless channels. The users are uniformly distributed in a cell with a diameter of 750 m. The transmitted power and the noise density power are set at 43.10 dBm and −174 dBm/Hz, respectively. The path loss model is L p = 128.1 + 37.6log10(d(km)) dB and the wireless channel is modeled using 3GPP-TU. The bandwidth, the carrier frequency and the number of clusters are selected 10 MHz, 2.4 GHz and 48 with a velocity of 30 km/h. The clusters are grouped into 18 subcarriers. Assuming the slot duration is 100 ms, the feedback information is provided every 1 ms. The parameter α is chosen as 2 with t c =100 for the PFS algorithm.

Firstly, we choose the reduced rate feedback channel parameters of S and ϵ as a function of K,Pobj and N t with the help of calculation in Appendix. In order to increase the multiuser diversity, the ϵ values are adjusted to have 1.3S clusters after performing the semi-orthogonal criterion and the proper spectral efficiency parameter to achieve approximately the same sum capacity, e, is chosen for adaptive schemes. In Table1, the parameters are listed for a given target according to the number of users in the cell. The spectral efficiency parameter in adaptive schemes is also adaptively changed according to the number of users in the cell as indicated in Table1.

Table 1 The parameters for the case of L=N t =2, η=0.95, Pobj=0.1 at the spectral usage=0.99

Figure1 shows the effect of the user selection algorithms on the fairness assuming the CSI of the selected clusters is perfectly available at the BS. It is observed that both adaptive and fixed feedback rate user selection algorithms achieve almost the full fairness by providing almost the same sum rate performance as shown in Figure2. The fixed rate schemes are reduced the feedback load about 70% compared to full feedback load. Moreover, in terms of fairness performance, the PFS algorithm significantly outperforms the maximization sum rate (MaxSR) algorithm.

Figure 1
figure 1

Fairness performance of the user selection algorithms.

Figure 2
figure 2

Sum capacity performance for the user selection algorithms without quantization.

As illustrated in Table2, the proposed fixed rate schemes are reduced the feedback load with the scale of 35% for low number of users and 90% for high number of users compared to full feedback schemes. It is possible to further reduce the feedback load with the help of adaptive algorithms while achieving almost the same capacity and fairness performances. The feedback load can be reduced up to 35% when the number of users in the cell is low and up to 25% when the number of users is moderate compared to fixed rate schemes by employing adaptive rate algorithms.

Table 2 The average number of feedback users per cluster

Since it is not practical to assume that perfect CSI of the selected clusters is available at the BS, we consider a quantized feedback link. Since the impact of the quantization and/or estimation of the channel norm on the performances are negligibly small as shown in the Figure3, we focus on the quantization error on CDI assuming the CQI is perfectly available at the transmitter. In order to show the performance of the proposed codebook design, the CDI of the selected users and clusters is quantized by using different codebooks. The simulation results for different reduced feedback algorithms and different codebook sizes are illustrated in Figures4 and5. It is observed that the adaptive schemes give almost the same performance as the fixed algorithms. When the number of feedback bits for CDI is increased, the performance of the sum rate is improved significantly. As illustrated in Figure6, the combined user selection algorithms outperform the clustered S-best criterion by reducing the quantization error of the CDI with the usage of the proposed codebook design. The reason is that since the MISO–OFDMA systems are more sensitive to interference, it is important to minimize the CDI quantization error. Consequently, the sum rate performance of the proposed combined algorithms is much higher than the clustered S-best algorithm especially when the number of CDI quantization bits is quite limited.

Figure 3
figure 3

Sum capacity performance of PFS for the P1 and P2 algorithms with quantized CSI.

Figure 4
figure 4

Sum capacity performance of PFS for the P1 and adaptive P1 algorithms with quantized CDI.

Figure 5
figure 5

Sum capacity performance of PFS for the P2 and adaptive P2 algorithms with quantized CDI.

Figure 6
figure 6

Comparison results of PFS for the P1 and P2 algorithms with quantized CDI.


In this article, we have examined efficient algorithms to design reduced rate feedback channel for MISO–OFDMA systems. We have presented fixed and adaptive cluster S-best and the combined semi-orthogonal criterion by employing more than one user for each cluster. According to the number of active users in cell and a given target, we have obtained the calculations of the number of feedback clusters for OFDMA with multiple antennas. The quantization error on the channel direction has been reduced since the CDI codebooks are designed using a local packing by taking into account the users’ direction. It has been illustrated that the proposed algorithms in a quantized reduced feedback link improve sum capacity significantly while providing fairness among the users in wireless channels. It has been also shown that the adaptive algorithm adjusts the number of selected clusters according to the location of the users and achieve the same fairness performance while further reducing the feedback link load. The proposed reduced feedback designs will be extent to multicell MISO–OFDMA networks as a future work.


We define respectively U k and V k as the number of clusters having CSI of only one user and more than one user when k users are fed back their CSI to the BS. For the case N t = 2, we compute the probability that v different clusters are sending back less than N t users. It is assumed that each user feds back S clusters among the Q clusters. The fraction of clusters that have at least N t users’ CSI isŪ=( U /Q) where U =| q = 1 Q S q |.

Following[16], the probability Pr(U k = A;V k = C) can be stacked in a column vector P k of size (Q + 1)2and computed recursively:

P k = Pr ( U k = 0 ; V k = 0 ) Pr ( U k = 0 ; V k = 1 ) Pr ( U k = Q ; V k = Q 1 ) Pr ( U k = Q ; V k = Q ) =B P k 1


B = Pr ( U k = 0 ; V k = 0 | U k 1 = 0 ; V k 1 = 0 ) Pr ( U k = 0 ; V k = 0 | U k 1 = Q ; V k 1 = Q ) Pr ( U k = 0 ; V k = 1 ) | U k 1 = 0 ; V k 1 = 0 ) Pr ( U k = 0 ; V k = 1 | U k 1 = Q ; V k 1 = Q ) Pr ( U k = Q ; V k = Q 1 | U k 1 = 0 ; V k 1 = 0 ) Pr ( U k = Q ; V k = Q | U k 1 = 0 ; V k 1 = 0 ) Pr ( U k = Q ; V k = Q | U k 1 = Q ; V k 1 = Q )

If the following constraints:

D S ( A B ) 2 ( C D ) S ( A B ) 2 ( C D ) 0 B C D C D 0 Q B D C + A D B C + A D B 0 Q B D 0

are satisfied, the elements of B are calculated as follows:

Pr ( U k = A ; V k = C | U k 1 = B ; V k 1 = D ) = D S 2 C + 2 D + B A B C D Q B D C + A D B Q S

Otherwise, Pr(U k = A;V k = C|Uk−1 = B;Vk−1= D) =0.

Since the first user (k = 1) picks S clusters, all the elements of P1are zero except Pr(U1 = S;V1 =0) = 1. Then, P K can be computed as follows:

P K = B K P 1

The probability that v or less different clusters are fed back with less than 2 users is obtained by,

Pr( V K v)= i = 0 ( Q + 1 ) ( v + 1 ) P K (i)

where P K (i) denotes the i th element of P K .


  1. Zhang YJ, Letaif KB: An efficient resource allocation scheme for spatial multiuser access in MIMO/OFDM system. IEEE Trans. Commun 2005, 53: 107-116. 10.1109/TCOMM.2004.840666

    Article  Google Scholar 

  2. Maciel TF, Klein A: A resource allocation strategy for SDMA/OFDMA systems. Proc. of 16th IST Mobile and Wireless Communications Summit 2007.

    Google Scholar 

  3. Maciel TF, Klein A: On the performance, complexity and fairness of suboptimal resource allocation for multiuser MIMO-OFDMA systems. IEEE Trans. Veh. Technol 2010, 59: 406-419.

    Article  Google Scholar 

  4. Love DJ, Heath RW, Lau VKN, Gesbert D, Rao BD, Andrews M: An overview of limited feedback in wireless communication systems. IEEE J. Sel. Areas Commun. (JSAC) 2008, 26: 1341-1365.

    Article  Google Scholar 

  5. Swannack C, Uysal-Biyikoglu E, Wornell GW: Finding NEMO: near mutually orthogonal sets and applications to MIMO broadcast scheduling. Proc. of Int. Conf. Wireless Networks, Communnications, Mobile Computing (WIRELESSCOM) 2005.

    Google Scholar 

  6. Le Ruyet D, Khanfir H, Ozbek B: Performance of semi-orthogonal user selection for multiuser MISO systems. Proc. of IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) 2008.

    Google Scholar 

  7. Zhou S, Wang Z, Giannakis G: Performance analysis for transmit-beamforming with finite-rate feedback. Proc. of 38th Conf. on Info. Sciences and Systems 2004.

    Google Scholar 

  8. Choi J, Heath RW: Interpolation based transmit beamforming for MIMO-OFDM with limited feedback. IEEE Trans. Signal Process 2005, 53: 4125-4135.

    Article  MathSciNet  Google Scholar 

  9. Pande T, Love DJ, Krogmeier JV: Reduced feedback MIMO–OFDM precoding and antenna selection. IEEE Trans. Signal Process 2007, 55: 2284-2293.

    Article  MathSciNet  Google Scholar 

  10. Heath RW, Wu T, Soong ACK: Progressive refinement of beamforming vectors for high-resolution limited feedback. EURASIP J. Adv. Signal Process 2009, 2009: 13 (Article ID 463823).

    Google Scholar 

  11. Kim T, Love DJ, Clerckx B: MIMO systems with limited rate differential feedback in slowly varying channels. IEEE Trans. Commun 2011, 59: 1175-1189.

    Article  MathSciNet  Google Scholar 

  12. Choi J, Clerckx B, Lee N, Kim G: A new design of polar-cap differential codebook for temporally/spatially correlated MISO channels. IEEE Trans. Commun 2012, 11: 703-711.

    Google Scholar 

  13. Zakhour R, Gesbert D: A two-stage approach to feedback design in MU-MIMO channels with limited channel state information. Proc. IEEE Personal, Indoor and Mobile Radio Commun. Symp (PIMRC) 2008.

    Google Scholar 

  14. Ravindran N, Jindal N: Multi-user diversity vs. accurate channel feedback for MIMO broadcast channels. Proc. IEEE Personal, Indoor and Mobile Radio Commun. Symp (PIMRC) 2008.

    Google Scholar 

  15. Al-Harthi Y: Opportunistic multiuser scheduling with reduced feedback load. Eur. Trans. Telecommun 2010, 21: 299-311. 10.1002/ett.1403

    Article  Google Scholar 

  16. Svedman P, Wilson Sk, Cimini LJ, Ottersten B: Opportunistic beamforming and scheduling for OFDMA systems. IEEE Trans. Commun 2007, 55: 941-952.

    Article  Google Scholar 

  17. Majjigi V, Agarwal R, Cioffi J: User profiling: a method for limited feedback in OFDMA systems. Proc. of IEEE International Communications Conference (ICC) 2009.

    Google Scholar 

  18. Trivellato M, Tomasin S, Benvenuto N: On channel quantization and feedback strategies for multiuser MIMO-OFDM downlink systems. IEEE Trans. Commun 2009, 57: 2645-2654.

    Article  Google Scholar 

  19. Jeon J, Son K, Lee HW, Chong S: IEEE Trans. Veh. Technol. 2010, 59: 160-169.

    Google Scholar 

  20. Spencer QH, Swindlehurst AL, Haardt M: Zero-forcing methods for downlink spatial multiplexing in multiuser MIMO channels. IEEE Trans. Signal Process 2004, 52: 461-471. 10.1109/TSP.2003.821107

    Article  MathSciNet  Google Scholar 

  21. Yoo T, Goldsmith A: On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming. IEEE J. Sel. Areas Commun. (JSAC) 2006, 24: 528-541.

    Article  Google Scholar 

  22. Papoutsis VD, Fraimis IG, Kotsopoulos SA: Fairness-aware user selection and resource allocation in MISO-OFDMA. Eur. Trans. Telecommun 2010, 21: 568-574.

    Article  Google Scholar 

  23. Ozbek B, LeRuyet D: Reduced feedback designs for SDMA-OFDMA systems. Proc. of IEEE International Communication Conference (ICC) 2010.

    Google Scholar 

  24. Mukkavilli KK, Sabharwal A, Erkip E, Aazhang B: On beamforming with finite rate feedback in multiple antenna systems. IEEE Trans. Inf. Theory 2003, 49: 2562-2579. 10.1109/TIT.2003.817433

    Article  MathSciNet  Google Scholar 

  25. Jain R, Chiu DM, Hawe WR: A quantitative measure of fairness and discrimination for resource allocation shared computer systems. Digital Equipment Corporation technical report TR-301 1984.

    Google Scholar 

Download references


This research was supported by the Marie Curie Intra European Fellowship within the 7th European Community Framework Programme as a part of the INTERCELL project under the contract number PIEF-GA-2009-255128.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Berna Özbek.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ original submitted files for images

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Özbek, B., Ruyet, D.L. Feedback channel designs for fair scheduling in MISO–OFDMA systems. J Wireless Com Network 2012, 220 (2012).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: