# Patent

## Title
Multiuser scheduling for MIMO broadcast channels with finite rate feedback

## Abstract

System and methodologies are provided herein for multiuser scheduling in a multiple-input multiple-output (MIMO) communication system. Various aspects described herein facilitate full feedback scheduling, wherein multiuser scheduling is performed based on an antenna selection and signal quality feedback, such as signal-to-interference-plus-noise ratio (SINR) feedback, from respective users. Based on information received from respective users, independent information streams can be transmitted from respective transmit antennas to respective users with the highest signal quality. Receive antenna selection can also be employed to allow respective users to select a single receive antenna on which information is to be received. Additional aspects described herein facilitate quantized feedback scheduling, wherein scheduling is performed based on signal quality feedback that is quantized into a finite number of bits by respective users.

## Background
CROSS-REFERENCE
This application is a continuation of U.S. patent application Ser. No. 12/108,485, filed on Apr. 23, 2008, entitled “MULTIUSER SCHEDULING FOR MIMO BROADCAST CHANNELS WITH FINITE RATE FEEDBACK”, which claims the benefit of U.S. Provisional Patent Application Ser. No. 60/914,810, filed on Apr. 30, 2007, entitled “MULTIUSER SCHEDULING FOR MIMO BROADCAST CHANNELS WITH FINITE RATE FEEDBACK”, the entireties of which are herein incorporated by reference.


TECHNICAL FIELD
The present disclosure relates generally to wireless communications systems, and more particularly to techniques for multi-user scheduling in a wireless communication system.
BACKGROUND
Multiuser diversity is a form of selection diversity among users in a wireless communication system that arises from independent fading channels between a base station and multiple users. A variety of multiuser scheduling algorithms have been proposed that take advantage of multiuser diversity for downlink transmissions in multiple-input multiple-output (MIMO) systems. Most of these existing approaches are based on time division multiple access (TDMA). However, due at least in part to the fact that a base station using TDMA can transmit to only one user at a time, the maximum sum-rate achievable by such approaches for MIMO broadcast channels is only a small fraction of the total sum-rate capacity of MIMO broadcast channels.
Other existing scheduling algorithms, such as dirty paper coding (DPC), can achieve MIMO broadcast channel capacity by serving multiple users simultaneously. However, achieving an optimum transmission policy using a scheduling algorithm such as DPC is computationally complex. Further, while low-complexity DPC algorithms have been proposed, such algorithms require perfect knowledge of channel state information (CSI) at the transmitter. However, perfect knowledge of CSI at the transmitter is generally impossible to obtain in practice due to system limitations. Instead, a limited CSI feedback load is generally provided to a base station from users at a finite rate. As the available feedback load of a system decreases, traditional multiuser scheduling algorithms experience a significant reduction of throughput and/or a significant increase in complexity. Accordingly, there exists a need for a low-complexity, high-throughput scheduling algorithm for MIMO broadcast channels with finite rate feedback.
SUMMARY
The following presents a simplified summary of the claimed subject matter in order to provide a basic understanding of some aspects of the claimed subject matter. This summary is not an extensive overview of the claimed subject matter. It is intended to neither identify key or critical elements of the claimed subject matter nor delineate the scope of the claimed subject matter. Its sole purpose is to present some concepts of the claimed subject matter in a simplified form as a prelude to the more detailed description that is presented later.
The following disclosure provides systems and methodologies for multiuser scheduling in a MIMO communication system. In accordance with various aspects described herein, full feedback scheduling is provided, wherein multiuser scheduling is accomplished via a MIMO broadcast scheduling algorithm that utilizes signal quality feedback from all users. In one example, a base station in a wireless communication system can receive an antenna selection and signal quality feedback, such as SINR feedback, from each user in the system. Based on this information, the base station can transmit independent information streams from respective transmit antennas at the base station to respective users with the highest signal quality. In another example, receive antenna selection can be employed to allow respective users to select a single receive antenna on which information is to be received from the base station. Accordingly, optimal multiuser scheduling can be achieved for a MIMO communications system while requiring less complexity and power than traditional multiuser scheduling approaches, such as those that employ every receive antenna in the system as a virtual user.
Other aspects described herein provide quantized feedback scheduling, wherein signal quality feedback, such as SINR feedback, is quantized into a finite number of bits by respective users and sent back as feedback to a base station. Such an approach can be used, for example, in a MIMO communications system with finite rate CSI feedback. In one example, the achievable sum-rate throughput of a MIMO communications system increases as the number of users increases by using quantized feedback scheduling as described herein, even in cases where only 1 bit is allotted for quantized CSI feedback.
To the accomplishment of the foregoing and related ends, certain illustrative aspects of the claimed subject matter are described herein in connection with the following description and the annexed drawings. These aspects are indicative, however, of but a few of the various ways in which the principles of the claimed subject matter can be employed. The claimed subject matter is intended to include all such aspects and their equivalents. Other advantages and novel features of the claimed subject matter can become apparent from the following detailed description when considered in conjunction with the drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a high-level block diagram of a wireless communication system in accordance with various aspects.
FIG. 2 is a block diagram of a system for generating and providing feedback to a base station in accordance with various aspects.
FIG. 3 is a block diagram of a component that schedules respective users for communication based on user feedback in accordance with various aspects.
FIG. 4 is a block diagram of a system for transmitting information to respective users based on a communication schedule in accordance with various aspects.
FIG. 5 is a block diagram of a system for generating and providing limited feedback to an access point in accordance with various aspects.
FIG. 6 is a block diagram of a component that schedules respective users for communication based on quantized user feedback in accordance with various aspects.
FIG. 7 is a flowchart of a method for multiuser scheduling in a wireless communication system.
FIG. 8 is a flowchart of a method for scheduling users for communication in a wireless communication system based on quantized user feedback.
FIG. 9 is a block diagram of an example operating environment in which various aspects described herein can function.
FIG. 10 illustrates an overview of a wireless network environment suitable for service by various aspects described herein.



DETAILED DESCRIPTION
The claimed subject matter is now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the claimed subject matter. It may be evident, however, that the claimed subject matter may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing the claimed subject matter.
As used in this application, the terms “component,” “system,” and the like are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a server and the server can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers. Also, the methods and apparatus of the claimed subject matter, or certain aspects or portions thereof, may take the form of program code (i.e., instructions) embodied in tangible media, such as floppy diskettes, CD-ROMs, hard drives, or any other machine-readable storage medium, wherein, when the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the claimed subject matter. The components may communicate via local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems via the signal).
Referring to FIG. 1, a high-level block diagram of a wireless communication system 100 in accordance with various aspects presented herein is illustrated. In accordance with one aspect, system 100 can include one or more base stations 110 that can communicate data, control signaling, and/or other information on a forward link or “downlink” to one or more receiving users 120 and 130. While not illustrated in FIG. 1, it should be appreciated that one or more receiving users 120 and/or 130 can additionally transmit information on a reverse link or “uplink” to a base station 110. Further, system 100 can include any number of base stations 110 and receiving users 120 and 130.
It should additionally be appreciated that receiving users 120 and/or 130 can comprise and/or provide the functionality of a wireless terminal, which can be connected to a computing device such as a laptop computer or desktop computer and/or a self-contained device such as a cellular telephone, a personal digital assistant (PDA), or another suitable device. A wireless terminal can also be called a system, subscriber unit, subscriber station, mobile station, mobile, remote station, remote terminal, access terminal, user terminal, user agent, user device, user equipment, etc. Additionally and/or alternatively, one or more base stations 110 in the system 100 can comprise and/or provide the functionality of a wireless access point or Node B, for example, serving as a router between one or more other stations and a wireless access network associated with the access point.
In accordance with one aspect, system 100 can comprise a single-cell wireless system, wherein base station 110 has M transmit (Tx) antennas 112 that can communicate with K geographically dispersed users 120 and/or 130, each having N receive (Rx) antennas 122 and/or 132. In one example, the number of users 120 and/or 130 can outnumber the number of transmit antennas 112 at the base station 110, and the base station 110 can have at least as many available transmit antennas 112 as the users 120 and/or 130 have receive antennas. In another example, only J of the K users 120 and/or 130 are allowed to communicate with the base station 110 simultaneously at any time slot t. In such an example, the set of users 120 and/or 130 which are assigned a non-zero rate of communication with the base station 110 at time slot t can be represented as A(t). The cardinality of A(t) can be expressed as |A(t)|=J, with 1≦J≦K. If the k-th of the users 120 and/or 130 is an active user at time slot t, then the signal received by said user can be given by:

Ykt=√{square root over (αk)}HktXt+Wkt,kεA(t),  (1)

where Xt is an M×1 vector of the transmitted signals in time slot t, Ykt is an N×1 vector of the received signal at the k-th user 120 and/or 130 in time slot t, and Wkt is an N×1 vector of additive noise whose entries are independent and identically distributed (i.i.d.) complex Gaussians with zero mean and variance N0. As further used in Equation (1), Hkt is an N×M channel matrix constructed such that the (n,m)-th entry hkt(n,m) CN (0,1) is an i.i.d. complex Gaussian with zero mean and unit variance, where the scalar hkt(n,m) represents the complex channel gain from the m-th transmit antenna 112 at the base station 110 to the n-th receive antenna 122 and/or 132 of the k-th user 120 and/or 130 at time slot t. The scalar αk used in Equation (1) denotes the power attenuation coefficient on the path from the base station 110 to the k-th user 120 and/or 130. In one example, the attenuation coefficient αk is equal to dk−c, where dk denotes the distance from the base station 110 to the k-th user 120 and c is a constant between 2 and 4.

In accordance with another aspect, the total transmitted power of the system 100 can be equal to 1, e.g., Tr(Xt[Xt]H)=1, where Tr(•) represents the trace of a matrix. Thus, the total transmitted power of the system 100 can be independent of the number of transmit antennas 112 at the base station 110. In one example, the system 100 can utilize a block-fading channel model, in which the channel hkt(n,m)∀m,n,k is quasi-static and frequency non-selective in time slot t but varies independently in different time slots. Additionally and/or alternatively, the channel hkt(n,m) can be modeled as uncorrelated in time slot t with other channels hk′t(n′,m′) for any (m′,n′,k′)≠(m,n,k). In accordance with one aspect, system 100 can operate under an assumption that the MIMO channels are perfectly known at the receiving users 120 and 130 but are unknown at the transmitting base station 110.
In one example, a signal x(m) can be transmitted through an m-th transmit antenna 112 at a given time slot. Further, for all transmit antennas m 112 where m=1, . . . , M, independent signals x(m) can be transmitted by the respective transmit antennas. In such an example, the average transmit power per transmit antenna 112 can be




  
    1
    M
  
  ,




e.g.,





  
    
      E
      ⁡
      
        [
        
          
            
            
              x
              ⁡
              
                (
                m
                )
              
            
            
          
          2
        
        ]
      
    
    =
    
      1
      M
    
  
  ,




thereby ensuring that the combined transmit power of the transmit antennas 112 is 1. In this example, a signal received by the n-th antenna 122 and/or 132 of a k-th receiving user 120 and/or 130 from the m-th transmit antenna 112 of the base station 110 can then be expressed as follows:





  
    
      
        
          
            y
            k
          
          ⁡
          
            (
            n
            )
          
        
        =
        
          
            
              
                α
                k
              
            
            ⁢
            
              
                ∑
                
                  m
                  =
                  1
                
                M
              
              ⁢
              
                
                  
                    h
                    k
                  
                  ⁡
                  
                    (
                    
                      n
                      ,
                      m
                    
                    )
                  
                
                ⁢
                
                  x
                  ⁡
                  
                    (
                    m
                    )
                  
                
              
            
          
          +
          
            
              
                w
                k
              
              ⁡
              
                (
                n
                )
              
            
            .
          
        
      
    
    
      
        (
        2
        )
      
    
  




By assuming that the signal x(m) is the desired signal for the k-th receiving user 120 and/or 130 and regarding other signals x(m′),m′≠m as interference, the instantaneous SINR of the received signal yk(n) can be expressed as follows:





  
    
      
        
          
            SINR
            
              m
              ,
              n
            
            
              (
              k
              )
            
          
          ⁢
          
            
              
                
                
                  
                    h
                    k
                  
                  ⁡
                  
                    (
                    
                      n
                      ,
                      m
                    
                    )
                  
                
                
              
              2
            
            
              
                M
                
                  
                    γ
                    _
                  
                  k
                
              
              +
              
                
                  ∑
                  
                    
                      m
                      ′
                    
                    ≠
                    m
                  
                
                ⁢
                
                  
                    
                    
                      
                        h
                        k
                      
                      ⁡
                      
                        (
                        
                          n
                          ,
                          
                            m
                            ′
                          
                        
                        )
                      
                    
                    
                  
                  2
                
              
            
          
        
        ,
      
    
    
      
        (
        3
        )
      
    
  




where γk=αk/N0 is the downlink signal-to-noise ratio (SNR) of the k-th receiving user 120 and/or 130.

Existing approaches to downlink scheduling based on SINR feedback in MIMO networks generally regard each receive antenna 122 and/or 132 at each receiver 120 and/or 130 as a separate virtual user. Thus, for a MIMO system having K users with N receive antennas each, such approaches effectively treat the system as having NK single-antenna receivers. Based upon feedback of the maximum SINR of each of these virtual users along with the index m of a transmit antenna that achieves the maximum SINR for each virtual user, a base station can then transmit M independent signals to M virtual users with the highest SINR simultaneously. The maximum throughput R achieved through such an approach can be bounded by the following:




  
    
      
        
          R
          ≤
          
            E
            ⁡
            
              [
              
                
                  ∑
                  
                    m
                    =
                    1
                  
                  M
                
                ⁢
                
                  
                    log
                    2
                  
                  ⁡
                  
                    (
                    
                      1
                      +
                      
                        
                          max
                          
                            
                              n
                              ∈
                              
                                S
                                r
                              
                            
                            ,
                            
                              k
                              ∈
                              
                                S
                                u
                              
                            
                          
                        
                        ⁢
                        
                          SINR
                          
                            m
                            ,
                            n
                          
                          
                            (
                            k
                            )
                          
                        
                      
                    
                    )
                  
                
              
              ]
            
          
        
        ,
      
    
    
      
        (
        4
        )
      
    
  




where St={1, . . . , M}, Sr={1, . . . , N} and Su={1, . . . , K}. This asymptotic analysis provided shows that the achievable throughput of such an approach is M log log(NK) when K goes to infinity. However, these and/or other similar existing approaches require feedback of KN SINR values, and the feedback load increases as the number of receive antennas increases.

In contrast to these existing approaches, the system 100 can include a scheduling component 114 that can facilitate MIMO downlink scheduling based on feedback of only K real SINR values. In one example, the scheduling component 114 can facilitate downlink MIMO scheduling for a system with finite rate feedback without inducing a loss of throughput typically associated with existing limited feedback scheduling algorithms. In accordance with one aspect, the scheduling component can schedule transmission of one or more signals at the transmit antennas 112 to respective receiving users 120 and/or 130 based at least in part upon feedback received by the users 120 and/or 130. While the scheduling component 114 is illustrated in FIG. 1 as located within the base station 110, it should be appreciated that the scheduling component 114 can be located anywhere within the communications system 100 that would enable the scheduling component 114 to be operatively associated with the transmit antennas 112 and receive feedback from users 120 and/or 130.
In accordance with one aspect, the scheduling component 114 can be operable to implement a multiuser scheduling algorithm for MIMO downlink transmission based on full SINR feedback from one or more users 120 and/or 130. In one example, a full feedback scheduling algorithm implementable by system 100 can be implemented as a two step process, wherein feedback is generated and communicated by users 120 and/or 130 in a first step, followed by scheduling at the base station 110 in a second step.
Feedback generation and transmission conducted in the first step of the above algorithm is illustrated in the context of an example system 200 in FIG. 2. As system 200 illustrates, users 220 in the system 200, represented by k(k=1, . . . , K), can firstly select their respective most favorable transmit antennas 222, represented by Txk(TxkεSt), and their respective most favorable receive antennas 224, represented by Rxk(RxkεSr), for achieving a maximum SINR Bk 226. In one example, the maximum SINR 226 for a user 220 can be expressed as follows:




  
    
      
        
          B
          k
        
        =
        
          
            
              max
              
                
                  m
                  ∈
                  
                    S
                    t
                  
                
                ,
                
                  n
                  ∈
                  
                    S
                    r
                  
                
              
            
            ⁢
            
              SINR
              
                m
                ,
                n
              
              
                (
                k
                )
              
            
          
          ..
        
      
    
    
      
        (
        5
        )
      
    
  




Once a user 220 has generated parameters 222-226, the maximum SINR Bk 226 and most favorable transmit antenna index Txk 222 can be sent by the user 220 to a serving base station 210 for scheduling. While system 200 illustrates generation and communication of parameters 222-226 at a single user 220 for brevity, it should be appreciated that the operations illustrated by FIG. 2 can be performed by any number of users in an associated communication system.

Once transmit antenna indices and SINR values have been received at a base station from one or more users, FIG. 3 illustrates scheduling conducted in the second step of the above algorithm in the context of an example scheduling component 300. It should be appreciated that the example scheduling component 300 can be implemented, for example, at a base station (e.g., base station 110), at another appropriate network entity, and/or as a stand-alone component in an associated communication system. In one example, for each transmit antenna scheduled by the scheduling component 300, the scheduling component 300 can employ a grouping component 310 and/or another suitable component to cluster respective users that provided the index of each transmit antenna into corresponding groups 315. For example, the grouping component 310 can group users providing indices Txk=m, (m=1, . . . , M) into sets Im such that:

Im={k|Txk=m,k=1, . . . ,K}.  (6)

Based on the generated groups 315, a selection component 320 and/or another suitable component of the scheduling component 300 can then select the most favorable M users 325, which can be represented as k*m(m=1, . . . , M), based on the following constraint:





  
    
      
        
          
            k
            m
            *
          
          =
          
            arg
            ⁢
            
              
            
            ⁢
            
              
                max
                
                  k
                  ∈
                  
                    I
                    m
                  
                
              
              ⁢
              
                B
                k
              
            
          
        
        ,
        
          m
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          M
          .
        
      
    
    
      
        (
        7
        )
      
    
  




Once scheduling has been performed by selecting the most favorable users k*m for all m=1, . . . , M, transmission can be conducted based on the determined schedule as illustrated by system 400 in FIG. 4. As system 400 illustrates, a scheduling component 412 at a base station 410 can provide the determined most favorable users k*m for respective transmit antennas 414. Based on this information, the transmit antennas 412 can be used to communicate signals x(m) to respective selected users 420 and/or 430. At the users 420 and/or 430, signals transmitted by the base station 410 can then be received at most favorable receive antennas Rxk*m 422 and/or 432. The most favorable receive antennas Rxk*m 422 and/or 432 for respective users 420 and/or 430 can be determined, for example, as described supra with regard to FIG. 2. In such an example, since receive antenna selection is performed at each of the users 420 and/or 430, the total feedback load at each time slot can be regarded as K real values {B1, . . . , BK} plus K┌ log2 M┐ bits of Txk, ∀k , where ┌x┐ denotes the smallest integer larger than x.
In accordance with one aspect, the average achievable throughput of the full feedback scheduling algorithm illustrated by FIGS. 2-4 over Rayleigh fading channels can be derived as follows. Under Gaussian codes and minimum distance decoding at a receiver, the instantaneous sum-rate of scheduling with SINR feedback can be expressed by the following:




  
    
      
        
          R
          =
          
            
              
                ∑
                
                  m
                  =
                  1
                
                M
              
              ⁢
              
                R
                m
              
            
            =
            
              
                ∑
                
                  m
                  =
                  1
                
                M
              
              ⁢
              
                
                  log
                  2
                
                ⁡
                
                  (
                  
                    1
                    +
                    
                      SINR
                      
                        m
                        ,
                        
                          Rx
                          
                            k
                            m
                            *
                          
                        
                      
                      
                        (
                        
                          k
                          m
                          *
                        
                        )
                      
                    
                  
                  )
                
              
            
          
        
        ,
      
    
    
      
        (
        8
        )
      
    
  




where SINRm,Rxk*m(k*m) is the SINR of a user k*m scheduled by an m-th transmit antenna and Rxk*m is the receive antenna selected by the user k*m. Based on this expression, the following can be observed:





  
    
      
        
          
            
              
                SINR
                
                  m
                  ,
                  
                    R
                    
                      k
                      m
                      *
                    
                  
                
                
                  (
                  
                    k
                    m
                    *
                  
                  )
                
              
              =
              
              ⁢
              
                
                  max
                  
                    k
                    ∈
                    
                      I
                      m
                    
                  
                
                ⁢
                
                  B
                  k
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  max
                  
                    k
                    ∈
                    
                      I
                      m
                    
                  
                
                ⁢
                
                  
                    max
                    
                      
                        m
                        ∈
                        
                          S
                          t
                        
                      
                      ,
                      
                        n
                        ∈
                        
                          S
                          r
                        
                      
                    
                  
                  ⁢
                  
                    SINR
                    
                      m
                      ,
                      n
                    
                    
                      (
                      k
                      )
                    
                  
                
              
            
          
        
        
          
            
              
                ≈
                
                ⁢
                
                  
                    max
                    
                      l
                      ∈
                      
                        {
                        
                          1
                          ,
                          ...
                          ⁢
                          
                            
                          
                          ,
                          NK
                        
                        }
                      
                    
                  
                  ⁢
                  
                    Z
                    l
                  
                
              
              ,
            
          
        
      
    
    
      
        (
        9
        )
      
    
  
  
    
      
        
          Z
          l
        
        ⁢
        
          
            
              
              
                g
                l
              
              
            
            2
          
          
            
              M
              
                
                  γ
                  _
                
                l
              
            
            +
            
              
                ∑
                
                  j
                  =
                  1
                
                
                  M
                  -
                  1
                
              
              ⁢
              
                
                  
                  
                    
                      g
                      ~
                    
                    
                      l
                      ,
                      j
                    
                  
                  
                
                2
              
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




where

with gl,{tilde over (g)}l,j CN (0,1) for all l=1, . . . , NK and j=1, . . . , M−1. Since Prob{Txk=m}=1/M for any k and m for i.i.d. parameters hk(n,m)∀n,m and k, it can be seen that E|Im| approaches K|M. Thus, it can be assumed that the SINR of a scheduled user is selected from E|Im|·|St|·|Sr|=NK candidates as shown in the last step of Equation (9).

Further, it can be appreciated that since the parameters Zl are i.i.d., Equation (10) can be rewritten as Z=X/(M/ γ+Y) for all identical γ2, where X X2(2) and Y X2 (2M−2). Thus, the probability density function (PDF) and cumulative distribution function (CDF) of Z can be given by the following:




  
    
      
        
          
            
              f
              Z
            
            ⁡
            
              (
              t
              )
            
          
          =
          
            
              
                e
                
                  
                    -
                    Mt
                  
                  /
                  
                    γ
                    _
                  
                
              
              
                
                  (
                  
                    1
                    +
                    t
                  
                  )
                
                M
              
            
            ⁢
            
              (
              
                
                  
                    M
                    
                      γ
                      _
                    
                  
                  ⁢
                  
                    (
                    
                      1
                      +
                      t
                    
                    )
                  
                
                +
                M
                -
                1
              
              )
            
          
        
        ,
        
          t
          ≥
          0
        
        ,
      
    
    
      
        (
        11
        )
      
    
  
  
    
      
        
          
            
              F
              Z
            
            ⁡
            
              (
              t
              )
            
          
          =
          
            1
            -
            
              
                e
                
                  
                    -
                    Mt
                  
                  /
                  
                    γ
                    _
                  
                
              
              
                
                  (
                  
                    1
                    +
                    t
                  
                  )
                
                
                  M
                  -
                  1
                
              
            
          
        
        ,
        
          t
          ≥
          0.
        
      
    
    
      
        (
        12
        )
      
    
  




Next, the following denotations can be made:




  
    
      
        
          P
          ⁢
          
            
          
          ⁢
          
            
              max
              
                k
                ∈
                
                  I
                  m
                
              
            
            ⁢
            
              
                max
                
                  
                    m
                    ∈
                    
                      S
                      t
                    
                  
                  ,
                  
                    n
                    ∈
                    
                      S
                      r
                    
                  
                
              
              ⁢
              
                SINR
                
                  m
                  ,
                  n
                
                
                  (
                  k
                  )
                
              
            
          
        
        ,
      
    
    
      
        (
        13
        )
      
    
  
  
    
      
        U
        ⁢
        
          
        
        ⁢
        
          
            max
            
              l
              ∈
              
                {
                
                  1
                  ,
                  ...
                  ⁢
                  
                    
                  
                  ,
                  NK
                
                }
              
            
          
          ⁢
          
            
              Z
              l
            
            .
          
        
      
    
    
      
        (
        14
        )
      
    
  




Based on these denotations and by using Equations (8) and (9), system throughput pursuant to the scheduling algorithm illustrated by FIGS. 2-4 averaged over Rayleigh fading channels can be given by the following:





  
    
      
        
          
            
              
                E
                ⁡
                
                  (
                  R
                  )
                
              
              =
              
              ⁢
              
                
                  ∑
                  
                    m
                    =
                    1
                  
                  M
                
                ⁢
                
                  E
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      log
                      2
                    
                    ⁡
                    
                      (
                      
                        1
                        +
                        
                          SINR
                          
                            m
                            ,
                            
                              Rx
                              
                                k
                                m
                                *
                              
                            
                          
                          
                            (
                            
                              k
                              m
                              *
                            
                            )
                          
                        
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                M
                ⁢
                
                  
                    ∫
                    0
                    ∞
                  
                  ⁢
                  
                    
                      
                        log
                        2
                      
                      ⁡
                      
                        (
                        
                          1
                          +
                          t
                        
                        )
                      
                    
                    ⁢
                    
                      
                        f
                        P
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      d
                      t
                    
                  
                
              
            
          
        
        
          
            
              
                ≈
                
                ⁢
                
                  M
                  ⁢
                  
                    
                      ∫
                      0
                      ∞
                    
                    ⁢
                    
                      
                        
                          log
                          2
                        
                        ⁡
                        
                          (
                          
                            1
                            +
                            t
                          
                          )
                        
                      
                      ⁢
                      
                        
                          f
                          U
                        
                        ⁡
                        
                          (
                          t
                          )
                        
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        d
                        t
                      
                    
                  
                
              
              ,
            
          
        
      
    
    
      
        (
        15
        )
      
    
  




where fU(t) is the PDF of U. Using order statistics, the following can be derived from Equation (14):

fU(t)=NKfZ(t)[FZ(t)]NK-1  (16)

for all identical γl. Therefore, it can be observed that the achievable throughput of the MIMO downlink scheduling illustrated by FIGS. 2-4 averaged over fading channels can be expressed as follows:

E(R)≈KMN∫0∞ log2(1+t)fZ(t)(FZ(t))NK-1dt.  (17)

It can be further appreciated that a numerical approximation for system throughput can be obtained by substituting Equations (11) and (12) into Equation (17).

Under conventional scheduling approaches, each receive antenna is viewed as an individual user when N>1. By doing so, a K-user M×N system is effectively converted to a K′-user M×N′ system, where K′=NK and N′=1. In the case where each user has only a single receive antenna, Equation (15) can also be used to evaluate the performance of these and/or similar conventional approaches for K′=NK and N′=1. By doing so, the following can be derived:




  
    
      
        
          
            E
            ⁡
            
              (
              R
              )
            
          
          ≈
          
            
              K
              ′
            
            ⁢
            MN
            ⁢
            
              
                ∫
                0
                ∞
              
              ⁢
              
                
                  
                    log
                    2
                  
                  ⁡
                  
                    (
                    
                      1
                      +
                      t
                    
                    )
                  
                
                ⁢
                
                  
                    f
                    Z
                  
                  ⁡
                  
                    (
                    t
                    )
                  
                
                ⁢
                
                  
                    (
                    
                      
                        F
                        Z
                      
                      ⁡
                      
                        (
                        t
                        )
                      
                    
                    )
                  
                  
                    
                      
                        N
                        ′
                      
                      ⁢
                      
                        K
                        ′
                      
                    
                    -
                    1
                  
                
                ⁢
                
                  
                
                ⁢
                
                  d
                  t
                
              
            
          
        
        =
        
          NKM
          ⁢
          
            
              ∫
              0
              ∞
            
            ⁢
            
              
                
                  log
                  2
                
                ⁡
                
                  (
                  
                    1
                    +
                    t
                  
                  )
                
              
              ⁢
              
                
                  f
                  Z
                
                ⁡
                
                  (
                  t
                  )
                
              
              ⁢
              
                
                  (
                  
                    
                      F
                      Z
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                  )
                
                
                  NK
                  -
                  1
                
              
              ⁢
              
                
              
              ⁢
              
                
                  d
                  t
                
                .
              
            
          
        
      
    
    
      
        (
        18
        )
      
    
  




By observing the right hand side of Equation (17) compared to the right hand side of Equation (18), it can be observed that both equations are identical. Thus, it can be appreciated that the scheduling algorithm illustrated by FIGS. 2-4 does not induce performance loss compared with conventional scheduling approaches.

In accordance with another aspect, the scheduling component 114 in system 100 can utilize a scheduling algorithm based on quantized SINR feedback from one or more users 120 and/or 130. In one example, a quantized feedback scheduling algorithm implementable by system 100 can be implemented as a two step process, wherein quantized feedback is generated and communicated by users 120 and/or 130 in a first step, followed by scheduling at the base station 110 in a second step.
Generation and transmission of quantized feedback in the first step of the above quantized feedback algorithm is illustrated in the context of an example system 500 in FIG. 5. As system 500 illustrates, user terminals 520 in the system 500, represented by k(k=1, . . . , K), can firstly select respective indices 522 of most favorable transmit antennas Txk(TxkεSt) and respective indices 524 of most favorable receive antennas Rxk(RxkεSr) for achieving a maximum SINR Bk 526. In one example, the maximum SINR 526 for a user 520 can be expressed by Equation (5) supra. Following identification of a real-valued maximum SINR Bk 526, a user terminal can employ a quantization component 530 and/or another suitable component to quantize Bk into one of a predetermined number of levels qk=Q(Bk), thereby generating a quantized maximum SINR 532. In one example, the quantization levels utilized by the quantization component 530 can be expressed as follows:




  
    
      
        
          Q
          ⁡
          
            (
            
              B
              k
            
            )
          
        
        =
        
          {
          
            
              
                
                  
                    0
                    ,
                  
                
                
                  
                    0
                    ≤
                    
                      B
                      k
                    
                    <
                    
                      λ
                      1
                    
                  
                
              
              
                
                  
                    i
                    ,
                  
                
                
                  
                    
                      λ
                      i
                    
                    ≤
                    
                      B
                      k
                    
                    <
                    
                      λ
                      
                        i
                        +
                        1
                      
                    
                  
                
              
              
                
                  
                    
                      L
                      -
                      1
                    
                    ,
                  
                
                
                  
                    
                      B
                      k
                    
                    ≥
                    
                      λ
                      
                        L
                        -
                        1
                      
                    
                  
                
              
            
            ,
            
              i
              =
              1
            
            ,
            ...
            ⁢
            
              
            
            ,
            
              L
              -
              2.
            
          
        
      
    
    
      
        (
        19
        )
      
    
  




In one example, the number of levels L used for Q(Bk) can be determined at least in part by the number of bits b required to represent a value Bk, e.g., based on L=2b. Once a user 520 has generated a Tx antenna index 522 and a quantized maximum SINR 532, these and/or other parameters can be communicated to a base station or access point 510 for scheduling. While system 500 illustrates generation and communication of feedback parameters at a single user 520 for brevity, it should be appreciated that the operations illustrated by FIG. 5 can be performed by any number of users in an associated communication system.

Once transmit antenna indices and quantized SINR values have been received at a base station from one or more users, FIG. 6 illustrates example scheduling that can be conducted by a scheduling component 600 in the second step of the above quantized feedback algorithm. It should be appreciated that the example scheduling component 600 can be implemented, for example, at a base station (e.g., base station 110), at another appropriate network entity, and/or as a stand-alone component in an associated communication system. In one example, for each transmit antenna scheduled by the scheduling component 600, the scheduling component 600 can employ a grouping component 610 and/or another suitable component to cluster respective users providing the index of each transmit antenna into corresponding user sets 615. For example, the grouping component 610 can group users providing index Txk=m into a set Im as provided by Equation (6) above. From these generated user sets 615, a set refining component 620 and/or another suitable component at the scheduling component 600 can further cluster users in user sets 615 for each respective transmit antenna that achieve a maximum of qk for all kεIm into optimal user sets Jm 625. These optimal sets Jm can be expressed as follows:




  
    
      
        
          J
          m
        
        =
        
          arg
          ⁢
          
            
          
          ⁢
          
            
              max
              
                k
                ∈
                
                  I
                  m
                
              
            
            ⁢
            
              
                q
                k
              
              .
            
          
        
      
    
    
      
        (
        20
        )
      
    
  




From Equation (20), it can be appreciated that Jm⊂Im as Jm={k|k=arg max(qk),kεIm}. From the optimal user sets 625, a random selection component 630 and/or another suitable component can allocate an m-th transmit antenna to a user k*m by randomly selecting users from a set Jm as follows:

km*=rand{Jm}.  (21)

Once scheduling has been performed by selecting the most favorable users k*m for all m=1, . . . , M, transmission can be conducted based on the determined schedule in a similar manner to that described above for full feedback scheduling as illustrated by system 400 in FIG. 4.

In accordance with one aspect, the achievable throughput of the quantized feedback scheduling algorithm illustrated by FIGS. 5-6 can be derived as follows. Initially, it can be observed that the instantaneous sum-rate achieved by the quantized feedback scheduling technique illustrated by FIGS. 5-6 can be given by the following:




  
    
      
        
          
            
              R
              =
              
                
                  ∑
                  
                    m
                    =
                    1
                  
                  M
                
                ⁢
                
                  
                    log
                    2
                  
                  ⁡
                  
                    (
                    
                      1
                      +
                      
                        SINR
                        
                          m
                          ,
                          
                            Rx
                            
                              k
                              m
                              *
                            
                          
                        
                        
                          (
                          
                            k
                            m
                            *
                          
                          )
                        
                      
                    
                    )
                  
                
              
            
          
        
        
          
            
              
                =
                
                  
                    ∑
                    
                      m
                      =
                      1
                    
                    M
                  
                  ⁢
                  
                    
                      log
                      2
                    
                    ⁡
                    
                      (
                      
                        1
                        +
                        
                          rand
                          ⁢
                          
                            
                              {
                              
                                B
                                k
                              
                              }
                            
                            
                              k
                              ∈
                              
                                J
                                m
                              
                            
                          
                        
                      
                      )
                    
                  
                
              
              ,
            
          
        
      
    
    
      
        (
        22
        )
      
    
  




where rand{Bk}kεJm denotes the random selection of an element from the set {Bk}kεJm and Bk corresponds to the expression for SINR given by Equation (5). To simplify calculation, rand{Bk}kεJm can be expressed simply as V. Accordingly, the average total throughput achieved by quantized feedback scheduling can be given by the following:

E(R)=M∫0∞ log2(1+v)fV(v)dv,  (23)

where fV(v) denotes the PDF of V.

Next, if FV(v) is used to denote the CDF of V and




  
    
      K
      ′
    
    =
    
      K
      M
    
  
  ,




it can be appreciated that, for a large number of users, the cardinality of the set Im is equal to K′ for all m because





  
    Prob
    ⁢
    
      {
      
        
          Tx
          k
        
        =
        m
      
      }
    
  
  =
  
    1
    M
  




for any k and m. By using Ai to denote the range [λi,λi+1) for i=0, 1, . . . , L−1, where λ0=0 and λL=∞, the CDF FV can be derived for at least two cases as follows.

In one example, the first such case can hold when 0≦V<λ1. In such a case, it can be appreciated that the maximum SINR Bk of a scheduled user is in range A0. Thus, it can be further appreciated that Bk for all kεIm are also in range A0. As result, the CDF of V can be expressed as follows:

FV(v)=FB(v)[FB(λ1)]K′-1,0≦v<λ1,  (24)

where FB(v) denotes the CDF of B.

Additionally and/or alternatively, the second case can hold when λi≦V<λi+1 for i=1, . . . , L−1. In such a case, it can be appreciated that the maximum SINR Bk of a scheduled user is in range Ai. Additionally, for any given 1≦r≦K′ in such a case, it can be assumed that there exist (r−1) other users having a Bk in region Ai. In accordance with one aspect, a scheduled user is selected because it maximizes the value of Bk for a set of users. Accordingly, it can be assumed that the Bk of the remaining (K′−r) users must be smaller than λi. In view of this observation, the CDF of V can be expressed as follows:




  
    
      
        
          
            
              F
              V
            
            ⁡
            
              (
              v
              )
            
          
          =
          
            
              
                [
                
                  
                    F
                    B
                  
                  ⁡
                  
                    (
                    
                      λ
                      i
                    
                    )
                  
                
                ]
              
              
                K
                ′
              
            
            +
            
              
                ∑
                
                  r
                  =
                  1
                
                
                  K
                  ′
                
              
              ⁢
              
                
                  
                    (
                    
                      
                        
                          
                            K
                            ′
                          
                        
                      
                      
                        
                          r
                        
                      
                    
                    )
                  
                  ⁡
                  
                    [
                    
                      
                        
                          F
                          B
                        
                        ⁡
                        
                          (
                          v
                          )
                        
                      
                      -
                      
                        
                          F
                          B
                        
                        ⁡
                        
                          (
                          
                            λ
                            i
                          
                          )
                        
                      
                    
                    ]
                  
                
                ×
                
                  
                    
                      
                        [
                        
                          
                            F
                            B
                          
                          ⁡
                          
                            (
                            
                              λ
                              i
                            
                            )
                          
                        
                        ]
                      
                      
                        
                          K
                          ′
                        
                        -
                        r
                      
                    
                    ⁡
                    
                      [
                      
                        
                          
                            F
                            B
                          
                          ⁡
                          
                            (
                            
                              λ
                              
                                i
                                +
                                1
                              
                            
                            )
                          
                        
                        -
                        
                          
                            F
                            B
                          
                          ⁡
                          
                            (
                            
                              λ
                              i
                            
                            )
                          
                        
                      
                      ]
                    
                  
                  
                    r
                    -
                    1
                  
                
              
            
          
        
        ,
      
    
    
      
        (
        25
        )
      
    
  




for λi≦v<λi+1. Consequently, the corresponding PDF fV(v) can be given by the following:





  
    
      
        
          
            f
            V
          
          ⁡
          
            (
            v
            )
          
        
        =
        
          {
          
            
              
                
                  
                    
                      
                        
                          f
                          B
                        
                        ⁡
                        
                          (
                          v
                          )
                        
                      
                      ⁡
                      
                        [
                        
                          
                            F
                            B
                          
                          ⁡
                          
                            (
                            
                              λ
                              1
                            
                            )
                          
                        
                        ]
                      
                    
                    
                      
                        K
                        ′
                      
                      -
                      1
                    
                  
                  ,
                  
                    
                      for
                      ⁢
                      
                        
                      
                      ⁢
                      0
                    
                    ≤
                    v
                    <
                    
                      λ
                      1
                    
                  
                
              
            
            
              
                
                  
                    
                      ∑
                      
                        r
                        =
                        1
                      
                      
                        K
                        ′
                      
                    
                    ⁢
                    
                      
                        
                          
                            (
                            
                              
                                
                                  
                                    K
                                    ′
                                  
                                
                              
                              
                                
                                  r
                                
                              
                            
                            )
                          
                          ⁡
                          
                            [
                            
                              
                                F
                                B
                              
                              ⁡
                              
                                (
                                
                                  λ
                                  i
                                
                                )
                              
                            
                            ]
                          
                        
                        
                          
                            K
                            ′
                          
                          -
                          r
                        
                      
                      ×
                      
                        
                          [
                          
                            
                              
                                F
                                B
                              
                              ⁡
                              
                                (
                                
                                  λ
                                  
                                    i
                                    +
                                    1
                                  
                                
                                )
                              
                            
                            -
                            
                              
                                F
                                B
                              
                              ⁡
                              
                                (
                                
                                  λ
                                  i
                                
                                )
                              
                            
                          
                          ]
                        
                        
                          r
                          -
                          1
                        
                      
                      ⁢
                      
                        
                          f
                          B
                        
                        ⁡
                        
                          (
                          v
                          )
                        
                      
                    
                  
                  ,
                
              
            
            
              
                
                  
                    
                      for
                      ⁢
                      
                        
                      
                      ⁢
                      
                        λ
                        i
                      
                    
                    ≤
                    v
                    <
                    
                      λ
                      
                        i
                        +
                        1
                      
                    
                  
                  ,
                  
                    i
                    =
                    1
                  
                  ,
                  ...
                  ⁢
                  
                    
                  
                  ,
                  
                    L
                    -
                    1
                  
                  ,
                
              
            
          
        
      
    
    
      
        (
        26
        )
      
    
  




where FB(v)≈[FZ(v)]MN and fB(v)≈MNfZ(v)FZ(v)MN-1. In one example, the PDF fZ(v) and the CDF FZ(v) are respectively given by Equations (11) and (12). Further, by substituting Equation (26) into Equation (23), a numerical approximation for the achievable throughput of quantized feedback scheduling as illustrated by FIGS. 5-6 can be obtained.

By way of a specific, non-limiting example, quantized feedback scheduling as illustrated by FIGS. 5-6 can be based on 1-bit quantization. In this 1-bit quantization example, one or more users can provide a quantized value of 0 or 1 to a scheduling component according to a threshold λ1, thereby obtaining a minimal feedback load. By way of example, for 1-bit quantization, Equation (26) can be rewritten as follows:




  
    
      
        
          
            f
            V
          
          ⁡
          
            (
            v
            )
          
        
        =
        
          {
          
            
              
                
                  
                    
                      
                        [
                        
                          
                            F
                            B
                          
                          ⁡
                          
                            (
                            
                              λ
                              1
                            
                            )
                          
                        
                        ]
                      
                      
                        
                          K
                          ′
                        
                        -
                        1
                      
                    
                    ⁢
                    
                      
                        f
                        B
                      
                      ⁡
                      
                        (
                        v
                        )
                      
                    
                  
                  ,
                
              
              
                
                  0
                  ≤
                  v
                  <
                  
                    λ
                    1
                  
                
              
            
            
              
                
                  
                    
                      
                        1
                        -
                        
                          
                            [
                            
                              
                                F
                                B
                              
                              ⁡
                              
                                (
                                
                                  λ
                                  1
                                
                                )
                              
                            
                            ]
                          
                          
                            K
                            ′
                          
                        
                      
                      
                        1
                        -
                        
                          
                            F
                            B
                          
                          ⁡
                          
                            (
                            
                              λ
                              1
                            
                            )
                          
                        
                      
                    
                    ⁢
                    
                      
                        f
                        B
                      
                      ⁡
                      
                        (
                        v
                        )
                      
                    
                  
                  ,
                
              
              
                
                  
                    λ
                    1
                  
                  ≤
                  
                    v
                    .
                  
                
              
            
          
        
      
    
    
      
        (
        27
        )
      
    
  




As a result, average achievable system throughput can be computed by applying Equation (23) as follows:





  
    
      
        
          E
          ⁡
          
            (
            R
            )
          
        
        =
        
          
            
              
                M
                ⁡
                
                  [
                  
                    
                      F
                      B
                    
                    ⁡
                    
                      (
                      
                        λ
                        1
                      
                      )
                    
                  
                  ]
                
              
              
                
                  K
                  ′
                
                -
                1
              
            
            ⁢
            
              
                ∫
                0
                
                  λ
                  1
                
              
              ⁢
              
                
                  
                    log
                    2
                  
                  ⁡
                  
                    (
                    
                      1
                      +
                      v
                    
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    f
                    B
                  
                  ⁡
                  
                    (
                    v
                    )
                  
                
                ⁢
                
                  d
                  v
                
              
            
          
          +
          
            M
            ⁢
            
              
                1
                -
                
                  
                    [
                    
                      
                        F
                        B
                      
                      ⁡
                      
                        (
                        
                          λ
                          1
                        
                        )
                      
                    
                    ]
                  
                  
                    K
                    ′
                  
                
              
              
                1
                -
                
                  
                    F
                    B
                  
                  ⁡
                  
                    (
                    
                      λ
                      1
                    
                    )
                  
                
              
            
            ⁢
            
              
                ∫
                
                  λ
                  1
                
                ∞
              
              ⁢
              
                
                  
                    log
                    2
                  
                  ⁡
                  
                    (
                    
                      1
                      +
                      v
                    
                    )
                  
                
                ⁢
                
                  
                    f
                    B
                  
                  ⁡
                  
                    (
                    v
                    )
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    d
                    v
                  
                  .
                
              
            
          
        
      
    
    
      
        (
        28
        )
      
    
  




In one example, Equation (28) can leverage approximation obtained from FB(v)≈[FZ(v)]MN and fB(v)≈MNfZ(v)FZ(v)MN-1 with K′=K/M. Based on Equation (28), the PDF fZ(v) and the CDF FZ(v) are respectively given by Equations (11) and (12).

It can be observed from the above that as K goes to infinity (e.g., while K′→∞), [FZ(λ1)]K′MN→0 for a fixed value λ1<∞. Accordingly, the throughput of Equation (28) can be derived as follows:




  
    
      
        
          
            lim
            
              K
              →
              ∞
            
          
          ⁢
          
            E
            ⁡
            
              (
              R
              )
            
          
        
        ≈
        
          
            
              
                M
                2
              
              ⁢
              N
            
            
              1
              -
              
                
                  [
                  
                    
                      F
                      Z
                    
                    ⁡
                    
                      (
                      
                        λ
                        1
                      
                      )
                    
                  
                  ]
                
                MN
              
            
          
          ×
          
            
              ∫
              
                λ
                1
              
              ∞
            
            ⁢
            
              
                
                  log
                  2
                
                ⁡
                
                  (
                  
                    1
                    +
                    v
                  
                  )
                
              
              ⁢
              
                
                  
                    
                      f
                      Z
                    
                    ⁡
                    
                      (
                      v
                      )
                    
                  
                  ⁡
                  
                    [
                    
                      
                        F
                        Z
                      
                      ⁡
                      
                        (
                        v
                        )
                      
                    
                    ]
                  
                
                
                  MN
                  -
                  1
                
              
              ⁢
              
                
              
              ⁢
              
                
                  d
                  v
                
                .
              
            
          
        
      
    
    
      
        (
        29
        )
      
    
  




As shown by Equation (29), multiuser diversity can be lost for any fixed λ1 as the total rate does not depend on the number of users K when K goes to infinity.

Further, it can be appreciated that when λ1=0, the quantized feedback scheduling illustrated by FIGS. 5-6 can be regarded as equivalent to Round-Robin scheduling, in which either a single user is scheduled randomly from all users or multiple users are scheduled one by one in a loop. In one example, the throughput of such a case can be derived from Equation (28) as follows:

E(R)≈M2N∫0∞ log2(1+v)fZ(v)[FZ(v)]MN-1dv.  (30)

As Equation (30) demonstrates, multiuser diversity can be lost in the case of λ1=0 in a similar manner to Round-Robin scheduling.

Referring now to FIGS. 7-8, methodologies that can be implemented in accordance with various aspects described herein are illustrated. While, for purposes of simplicity of explanation, the methodologies are shown and described as a series of blocks, it is to be understood and appreciated that the claimed subject matter is not limited by the order of the blocks, as some blocks may, in accordance with the claimed subject matter, occur in different orders and/or concurrently with other blocks from that shown and described herein. Moreover, not all illustrated blocks may be required to implement the methodologies in accordance with the claimed subject matter.
Furthermore, the claimed subject matter may be described in the general context of computer-executable instructions, such as program modules, executed by one or more components. Generally, program modules include routines, programs, objects, data structures, etc., that perform particular tasks or implement particular abstract data types. Typically the functionality of the program modules may be combined or distributed as desired in various embodiments. Furthermore, as will be appreciated various portions of the disclosed systems above and methods below may include or consist of artificial intelligence or knowledge or rule based components, sub-components, processes, means, methodologies, or mechanisms (e.g., support vector machines, neural networks, expert systems, Bayesian belief networks, fuzzy logic, data fusion engines, classifiers . . . ). Such components, inter alia, can automate certain mechanisms or processes performed thereby to make portions of the systems and methods more adaptive as well as efficient and intelligent.
Referring to FIG. 7, a method 700 for multiuser scheduling in a wireless communication system (e.g., system 100) is illustrated. At 702, transmit antenna indices (e.g., most favorable Tx antenna indices 222) and maximum signal quality indicators (e.g., maximum SINR values 226) provided by respective user terminals (e.g., users 220) are identified (e.g., at a base station 210). At 704, the user terminals from which transmit antenna indices and maximum signal quality indicators are identified at 702 are grouped (e.g., by a grouping component 310 at a scheduling component 300) into respective sets (e.g., sets 315) by transmit antenna index. At 706, user terminals in respective sets created at 704 having a highest indicated maximum signal quality among the user terminals in their respective sets (e.g., most favorable users 325) are selected (e.g., by a selection component 320). At 708, information is transmitted to the user terminals selected at 706 via the transmit antennas (e.g., Tx antennas 414) given as indices by the user terminals.
FIG. 8 illustrates a method 800 for scheduling users for communication in a wireless communication system based on quantized user feedback. At 802, transmit antenna indices (e.g., Tx antenna indices 522) and quantized signal quality indicators (e.g., quantized maximum SINR values 532) provided by respective users (e.g., user terminals 520) are identified (e.g., at an access point 510). At 804, the users from which transmit antenna indices and quantized signal quality indicators are identified at 802 are grouped (e.g., by a grouping component 610 at a scheduling component 600) into respective sets (e.g., user sets 615) by transmit antenna index. At 806, users are randomly selected (e.g., by a random selection component 630) from among the users in respective sets created at 804 that have a highest quantized signal quality indicator in their respective sets (e.g., from among users provided in optimal user lists 625 provided by a set refining component 620). At 708, information is transmitted to the users selected at 706 via the transmit antennas given as indices by the selected users.
Turning to FIG. 9, an exemplary non-limiting computing system or operating environment in which various aspects described herein can be implemented is illustrated. One of ordinary skill in the art can appreciate that handheld, portable and other computing devices and computing objects of all kinds are contemplated for use in connection with the claimed subject matter, e.g., anywhere that a communications system may be desirably configured. Accordingly, the below general purpose remote computer described below in FIG. 9 is but one example of a computing system in which the claimed subject matter can be implemented.
Although not required, the claimed subject matter can partly be implemented via an operating system, for use by a developer of services for a device or object, and/or included within application software that operates in connection with one or more components of the claimed subject matter. Software may be described in the general context of computer-executable instructions, such as program modules, being executed by one or more computers, such as client workstations, servers or other devices. Those skilled in the art will appreciate that the claimed subject matter can also be practiced with other computer system configurations and protocols.
FIG. 9 thus illustrates an example of a suitable computing system environment 900 in which the claimed subject matter can be implemented, although as made clear above, the computing system environment 900 is only one example of a suitable computing environment for a media device and is not intended to suggest any limitation as to the scope of use or functionality of the claimed subject matter. Further, the computing environment 900 is not intended to suggest any dependency or requirement relating to the claimed subject matter and any one or combination of components illustrated in the example operating environment 900.
With reference to FIG. 9, an example of a remote device for implementing various aspects described herein includes a general purpose computing device in the form of a computer 910. Components of computer 910 can include, but are not limited to, a processing unit 920, a system memory 930, and a system bus 921 that couples various system components including the system memory to the processing unit 920. The system bus 921 can be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures.
Computer 910 can include a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 910. By way of example, and not limitation, computer readable media can comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile as well as removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CDROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computer 910. Communication media can embody computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and can include any suitable information delivery media.
The system memory 930 can include computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) and/or random access memory (RAM). A basic input/output system (BIOS), containing the basic routines that help to transfer information between elements within computer 910, such as during start-up, can be stored in memory 930. Memory 930 can also contain data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 920. By way of non-limiting example, memory 930 can also include an operating system, application programs, other program modules, and program data.
The computer 910 can also include other removable/non-removable, volatile/nonvolatile computer storage media. For example, computer 910 can include a hard disk drive that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive that reads from or writes to a removable, nonvolatile magnetic disk, and/or an optical disk drive that reads from or writes to a removable, nonvolatile optical disk, such as a CD-ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM and the like. A hard disk drive can be connected to the system bus 921 through a non-removable memory interface such as an interface, and a magnetic disk drive or optical disk drive can be connected to the system bus 921 by a removable memory interface, such as an interface.
A user can enter commands and information into the computer 910 through input devices such as a keyboard or a pointing device such as a mouse, trackball, touch pad, and/or other pointing device. Other input devices can include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and/or other input devices can be connected to the processing unit 920 through user input 940 and associated interface(s) that are coupled to the system bus 921, but can be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A graphics subsystem can also be connected to the system bus 921. In addition, a monitor or other type of display device can be connected to the system bus 921 via an interface, such as output interface 950, which can in turn communicate with video memory. In addition to a monitor, computers can also include other peripheral output devices, such as speakers and/or a printer, which can also be connected through output interface 950.
The computer 910 can operate in a networked or distributed environment using logical connections to one or more other remote computers, such as remote computer 970, which can in turn have media capabilities different from device 910. The remote computer 970 can be a personal computer, a server, a router, a network PC, a peer device or other common network node, and/or any other remote media consumption or transmission device, and can include any or all of the elements described above relative to the computer 910. The logical connections depicted in FIG. 9 include a network 971, such local area network (LAN) or a wide area network (WAN), but can also include other networks/buses. Such networking environments are commonplace in homes, offices, enterprise-wide computer networks, intranets and the Internet.
When used in a LAN networking environment, the computer 910 is connected to the LAN 971 through a network interface or adapter. When used in a WAN networking environment, the computer 910 can include a communications component, such as a modem, or other means for establishing communications over the WAN, such as the Internet. A communications component, such as a modem, which can be internal or external, can be connected to the system bus 921 via the user input interface at input 940 and/or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 910, or portions thereof, can be stored in a remote memory storage device. It should be appreciated that the network connections shown and described are exemplary and other means of establishing a communications link between the computers can be used.
Turning now to FIG. 10, an overview of a network environment in which the claimed subject matter can be implemented is illustrated. The above-described systems and methodologies can be applied to any wireless communication network; however, the following description sets forth an exemplary, non-limiting operating environment for said systems and methodologies. The below-described operating environment should be considered non-exhaustive, and thus the below-described network architecture is merely an example of a network architecture into which the claimed subject matter can be incorporated. It is to be appreciated that the claimed subject matter can be incorporated into any now existing or future alternative communication network architectures as well.
Referring back to FIG. 10, various aspects of the global system for mobile communication (GSM) are illustrated. GSM is one of the most widely utilized wireless access systems in today's fast growing communications systems. GSM provides circuit-switched data services to subscribers, such as mobile telephone or computer users. General Packet Radio Service (“GPRS”), which is an extension to GSM technology, introduces packet switching to GSM networks. GPRS uses a packet-based wireless communication technology to transfer high and low speed data and signaling in an efficient manner. GPRS optimizes the use of network and radio resources, thus enabling the cost effective and efficient use of GSM network resources for packet mode applications.
As one of ordinary skill in the art can appreciate, the exemplary GSM/GPRS environment and services described herein can also be extended to 3G services, such as Universal Mobile Telephone System (“UMTS”), Frequency Division Duplexing (“FDD”) and Time Division Duplexing (“TDD”), High Speed Packet Data Access (“HSPDA”), cdma2000 1x Evolution Data Optimized (“EVDO”), Code Division Multiple Access-2000 (“cdma2000 3x”), Time Division Synchronous Code Division Multiple Access (“TD-SCDMA”), Wideband Code Division Multiple Access (“WCDMA”), Enhanced Data GSM Environment (“EDGE”), International Mobile Telecommunications-2000 (“IMT-2000”), Digital Enhanced Cordless Telecommunications (“DECT”), etc., as well as to other network services that shall become available in time. In this regard, the timing synchronization techniques described herein may be applied independently of the method of data transport, and does not depend on any particular network architecture or underlying protocols.
FIG. 10 depicts an overall block diagram of an exemplary packet-based mobile cellular network environment, such as a GPRS network, in which the claimed subject matter can be practiced. Such an environment can include a plurality of Base Station Subsystems (BSS) 1000 (only one is shown), each of which can comprise a Base Station Controller (BSC) 1002 serving one or more Base Transceiver Stations (BTS) such as BTS 1004. BTS 1004 can serve as an access point where mobile subscriber devices 1050 become connected to the wireless network. In establishing a connection between a mobile subscriber device 1050 and a BTS 1004, one or more timing synchronization techniques as described supra can be utilized.
In one example, packet traffic originating from mobile subscriber 1050 is transported over the air interface to a BTS 1004, and from the BTS 1004 to the BSC 1002. Base station subsystems, such as BSS 1000, are a part of internal frame relay network 1010 that can include Service GPRS Support Nodes (“SGSN”) such as SGSN 1012 and 1014. Each SGSN is in turn connected to an internal packet network 1020 through which a SGSN 1012, 1014, etc., can route data packets to and from a plurality of gateway GPRS support nodes (GGSN) 1022, 1024, 1026, etc. As illustrated, SGSN 1014 and GGSNs 1022, 1024, and 1026 are part of internal packet network 1020. Gateway GPRS serving nodes 1022, 1024 and 1026 can provide an interface to external Internet Protocol (“IP”) networks such as Public Land Mobile Network (“PLMN”) 1045, corporate intranets 1040, or Fixed-End System (“FES”) or the public Internet 1030. As illustrated, subscriber corporate network 1040 can be connected to GGSN 1022 via firewall 1032; and PLMN 1045 can be connected to GGSN 1024 via boarder gateway router 1034. The Remote Authentication Dial-In User Service (“RADIUS”) server 1042 may also be used for caller authentication when a user of a mobile subscriber device 1050 calls corporate network 1040.
Generally, there can be four different cell sizes in a GSM network—macro, micro, pico, and umbrella cells. The coverage area of each cell is different in different environments. Macro cells can be regarded as cells where the base station antenna is installed in a mast or a building above average roof top level. Micro cells are cells whose antenna height is under average roof top level; they are typically used in urban areas. Pico cells are small cells having a diameter is a few dozen meters; they are mainly used indoors. On the other hand, umbrella cells are used to cover shadowed regions of smaller cells and fill in gaps in coverage between those cells.
The claimed subject matter has been described herein by way of examples. For the avoidance of doubt, the subject matter disclosed herein is not limited by such examples. In addition, any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs, nor is it meant to preclude equivalent exemplary structures and techniques known to those of ordinary skill in the art. Furthermore, to the extent that the terms “includes,” “has,” “contains,” and other similar words are used in either the detailed description or the claims, for the avoidance of doubt, such terms are intended to be inclusive in a manner similar to the term “comprising” as an open transition word without precluding any additional or other elements.
Additionally, the disclosed subject matter can be implemented as a system, method, apparatus, or article of manufacture using standard programming and/or engineering techniques to produce software, firmware, hardware, or any combination thereof to control a computer or processor based device to implement aspects detailed herein. The terms “article of manufacture,” “computer program product” or similar terms, where used herein, are intended to encompass a computer program accessible from any computer-readable device, carrier, or media. For example, computer readable media can include but are not limited to magnetic storage devices (e.g., hard disk, floppy disk, magnetic strips . . . ), optical disks (e.g., compact disk (CD), digital versatile disk (DVD) . . . ), smart cards, and flash memory devices (e.g., card, stick). Additionally, it is known that a carrier wave can be employed to carry computer-readable electronic data such as those used in transmitting and receiving electronic mail or in accessing a network such as the Internet or a local area network (LAN).
The aforementioned systems have been described with respect to interaction between several components. It can be appreciated that such systems and components can include those components or specified sub-components, some of the specified components or sub-components, and/or additional components, according to various permutations and combinations of the foregoing. Sub-components can also be implemented as components communicatively coupled to other components rather than included within parent components, e.g., according to a hierarchical arrangement. Additionally, it should be noted that one or more components can be combined into a single component providing aggregate functionality or divided into several separate sub-components, and any one or more middle layers, such as a management layer, can be provided to communicatively couple to such sub-components in order to provide integrated functionality. Any components described herein can also interact with one or more other components not specifically described herein but generally known by those of skill in the art.

## Claims

1. A system, comprising:
transmit antennas of a base station configured to transmit information to terminals via a MIMO communication link; and
a scheduling component configured to
group the terminals into sets corresponding to respective transmit antenna indices received via feedback data from the terminals,
for a set of the sets, identify a subset of the terminals that report a highest one-bit quantized signal quality indication, and
assign a transmit antenna, of the transmit antennas, for transmission of information to a terminal selected from the subset of the terminals in a substantially random manner, wherein the transmit antenna assigned by the scheduling component corresponds to a transmit antenna index received via the feedback data from the terminal selected from the subset of the terminals.

2. The system of claim 1, wherein the transmit antenna is configured to transmit the information to the terminal via a receive antenna selected by the terminal from a plurality of available receive antennas.

3. The system of claim 1, wherein the scheduling component is further configured to receive the transmit antenna indices and one-bit quantized signal quality indications, including the defined one-bit quantized signal quality indication, from the terminals over a feedback channel.

4. The system of claim 3, wherein the one-bit quantized signals quality indications comprise one-bit quantized signal-to-interference-plus-noise ratios respectively corresponding to the terminals.

5. The system of claim 3, wherein the one-bit quantized maximum signal quality indication comprises a value of one highest of the quantized signal quality indications.

6. The system of claim 3, wherein the one-bit quantized signal quality indications comprise one-bit quantized values corresponding to maximum signal qualities achievable at the respective terminals.

7. The system of claim 6, wherein at least one of the one-bit quantized values is a 1-bit value having a value of 1 in response to a maximum signal quality achievable by a corresponding terminal satisfying a function of a defined threshold, or a value of 0 in response to the maximum signal quality achievable by the corresponding terminal failing to satisfy the function of the defined value.

8. A method, comprising:
receiving transmit antenna index data and single bit quantized signal quality indicator data from a plurality of terminals;
clustering the plurality of terminals into at least two groups respectively corresponding to at least two transmit antenna indices indicated by the transmit antenna index data;
identifying a subset of terminals comprising a first group of the at least two groups that correspond to a highest single bit quantized signal quality indicator indicated by the single bit quantized signal quality indicator data; and
scheduling a transmit antenna for transmission of information to a terminal selected from the subset of terminals in a substantially random manner, wherein the scheduling comprises selecting the transmit antenna corresponding to a transmit antenna index received from the terminal via the transmit antenna index data.

9. The method of claim 8, wherein the receiving the single bit quantized signal quality indicator data comprises receiving single bit quantized signal-to-interference-plus-noise ratio data.

10. The method of claim 8, further comprising transmitting information from the transmit antenna to the terminal via a receive antenna selected by the terminal.

11. The method of claim 8, wherein the receiving comprises receiving the transmit antenna index data and the single bit quantized signal quality indicator data over a feedback channel.

12. The method of claim 8, wherein the transmit antenna corresponds to a first transmit antenna index, of the at least two transmit antenna indices, corresponding to the first group.

13. The method of claim 8, wherein the receiving the single bit quantized signal quality indicator data from the plurality of terminals comprises receiving single bit quantized values corresponding to respective maximum achievable signal qualities for the plurality of terminals.

14. A system, comprising:
means for determining transmit antenna indices and single bit quantized signal quality indicators provided by respective receivers;
means for grouping a subset of the receivers associated with a common transmit antenna index, of the transmit antenna indices, into a first set of receivers;
means for identifying a second set of receivers comprising a subset of the first set of receivers that are associated with a highest quantized signal quality indicator based on the single bit quantized signal quality indicators; and
means for transmitting information to a receiver selected in a substantially random manner from the second set via a transmit antenna corresponding to the common transmit antenna index.

15. The system of claim 14, wherein the means for determining the transmit antenna indices and the single bit quantized signal quality indicators comprises means for determining single bit quantized signal-to-interference-plus-noise ratio indicators.

16. The system of claim 14, further comprising means for receiving the transmit antenna indices and single bit quantized signal quality indicators over a feedback channel.

17. The system of claim 14, wherein the single bit quantized signal quality indicators comprise single bit quantized values corresponding to maximum signal qualities achievable at the respective receivers.

18. A computer-readable storage device having stored thereon computer-executable instructions that, in response to execution, cause a computing system comprising a processor to perform operations, comprising:
receiving feedback data reporting transmit antenna indices and one-bit quantized signal quality indicators from respective terminals;
grouping the terminals into sets of terminals respectively corresponding to a same transmit antenna index of the transmit antenna indices;
for at least one set of the sets of terminals, selecting a terminal substantially randomly from a group of terminals comprising the set, wherein the group of terminals correspond to a defined highest one-bit quantized signal quality indicator based on the feedback data; and
scheduling a transmit antenna corresponding to the same transmit antenna index for transmission of information to the selected terminal.

19. The computer-readable storage device of claim 18, wherein the receiving comprises receiving one-bit quantized signal-to-interference-plus-noise ratio values corresponding to the respective terminals.

20. The computer-readable storage device of claim 18, wherein the receiving comprises receiving one-bit quantized values representing maximum signal qualities achievable at the respective terminals.