Abstract:
A multiple-user multiple input-multiple output wireless communication system uses a set of multiple subcarriers arranged in plural subsets or resource blocks. Precoding of signals transmitted from a base station to user terminals involves acquiring channel state information on the connection channel between the base station and user terminals in the plurality. Channel quality indicators are detected with user terminals for respective subsets of resource blocks to produce user/resource block pairs having associated channel quality indicators. The user/resource block pairs are subjected to selection as a function of the channel quality indicators associated therewith so that precoding is performed by acquiring channel state information exclusively for the user/resource block pairs surviving the selection as a function of the channel quality indicators and, possibly, other selection steps as a function of other parameters, such as, speed, maximum bit rate, and direction of arrival or angular spread in a multiple-stage selection process.

Description:
FIELD OF THE INVENTION 
       [0001]    This disclosure relates to wireless (e.g. radio) communications. 
         [0002]    This disclosure was devised by paying attention to its possible use in transmission systems employing a so-called Multi-User Multiple Input-Multiple Output (MU-MIMO) technique. 
       DESCRIPTION OF THE RELATED ART 
       [0003]    The MU-MIMO technique is a multi-user transmission technique which can be adopted in multi-carrier radio communication systems like OFDM, where the bandwith of the communication channel is divided in a plurality of sub-bands called subcarriers. In cellular systems like 3GPP LTE-A (3rd Generation Partnership Project Long Term Evolution-Advanced), subcarriers are arranged in plural sub-sets (called Physical Resource Blocks—PRBs, or, briefly, RBs) of the set of subcarriers. In MU-MIMO systems, a given frequency resource is re-used multiple times at a given instant for transmitting multiple streams of information pertaining to different users. Multiple streams are separated thanks to the different spatial propagation paths seen by signals transmitted and received by spatially separated antennas. 
         [0004]    In the downlink (DL) transmission direction—that is from a base station towards the user equipments—an MU-MIMO system operates such that multiple transmit antennas belonging to the base station (or Node B) are used to transmit on the same frequency resources to multiple users. 
         [0005]      FIG. 1  of the annexed representations is schematically representative of various possible topologies of MU-MIMO DL connection. In all representations, BS denotes a base station (Node B), while user equipments (UEs) are denoted UE 1 , UE 2 , UE 3 , . . . . 
         [0006]    Specifically, part a) of  FIG. 1  shows co-located BS transmitters and single stream per user. 
         [0007]    Part b) shows co-located BS transmitters and single or multiple stream per user. 
         [0008]    Part c) shows distributed coordinated BS transmitters and a single stream per user. 
         [0009]    In all of the above configurations, each user receives a mixture of the signals intended for all the users, such experiencing interference. Interference can be largely limited by precoding operated at the transmitter. 
         [0010]    In contrast to Single-User MIMO (SU-MIMO) systems, in a MU-MIMO system DL receive antennas do not belong all to the same terminal. This fact makes a difference in the way reception is achieved: in SU-MIMO all spatial streams are adapted to be decoded jointly (or sequentially), improving transmission performance. For that reason, operating MU-MIMO precoding at the base station may be important in MU-MIMO systems. MU-MIMO precoding usually has the purpose to alleviate interference between the streams directed to different users. 
         [0011]    MU-MIMO precoding can be classified according to a number of characteristics, such as:
       the type of operations performed at the transmitter, e.g. linear or non-linear. Articles such “Generalized Design of Multi-User MIMO Precoding Matrices” by Veljko Stankovic and Martin Haardt, IEEE 2008 and “On the Achievable Throughput of a Multiantenna Gaussian Broadcast Channel” by Giuseppe Caire, and Shlomo Shamai, IEEE 2003 provide basic reference information on linear and non-linear precoding, respectively;   the type of channel state information (CSI) available at the transmitter, e.g. be short-term or long-term. Short term precoding takes into account fast fading, while long-term precoding takes into account only relatively slow variations in the channel;   the spatial correlation of transmit antennas: precoding can be implemented as a beamforming technique or as a classical MIMO transmission. Beamforming may be performed with half-wavelength, strongly correlated transmit antenna arrays, and is more often implemented as a long-term technique. A precoding operating like a classical MIMO transmission usually happens with far spaced, largely uncorrelated transmit antennas, and is based on short-term channel state information.       
 
         [0015]    While the focus of this disclosure is not on the type of precoding adopted and its characteristics, for the purposes herein it will be sufficient to recall that a MU-MIMO system may include a base station having M T  transmit antennas and serving K users. For simplicity one may assume that each user is equipped with a constant number of M R  receive antennas each, with M R ≦M T /2. One may similarly assume that the base station divides the frequency resources into Ψ blocks (Resource Blocks, RBs), with e.g. Ψ&lt;K, and that each served user which is actually scheduled utilizes exactly one RB. 
         [0016]    Optimal precoding would require that all possible user groupings are considered for each RB, that precoding is actually computed for each possible grouping, and that, finally, a selection of groups maximizing a given objective function to be chosen for scheduling. In other words, for each RB, a total of 
         [0000]    
       
         
           
               
             
               ( 
               
                 
                   
                     K 
                   
                 
                 
                   
                     
                       ⌈ 
                       
                         
                           M 
                           T 
                         
                         / 
                         
                           M 
                           R 
                         
                       
                       ⌉ 
                     
                   
                 
               
               ) 
             
           
         
       
     
         [0000]    possible precoding schemes have to be computed. 
         [0017]    Since channel state information is supposed different for each RB, any type of precoding that is dependent on the channel state (which usually is true) will lead to a total of 
         [0000]    
       
         
           
             Ψ 
              
             
                 
               
                 ( 
                 
                   
                     
                       K 
                     
                   
                   
                     
                       
                         ⌈ 
                         
                           
                             M 
                             T 
                           
                           / 
                           
                             M 
                             R 
                           
                         
                         ⌉ 
                       
                     
                   
                 
                 ) 
               
             
           
         
       
     
         [0000]    precoding schemes to be computed. This can easily lead to impractical figures (e.g. M T =4, K=60, M R =2, Ψ=50 gives a total of 
         [0000]    
       
         
           
             
               Ψ 
                
               
                   
                 
                   
                     ( 
                     
                       
                         
                           K 
                         
                       
                       
                         
                           
                             ⌈ 
                             
                               
                                 M 
                                 T 
                               
                               / 
                               
                                 M 
                                 R 
                               
                             
                             ⌉ 
                           
                         
                       
                     
                     ) 
                   
                   = 
                   
                     88 
                     , 
                     500 
                   
                 
                 ) 
               
             
             , 
           
         
       
     
         [0000]    especially when sophisticated and computationally heavy precoding needs to be computed in real-time. 
         [0018]    Concerning channel knowledge at the transmit side, one may consider first a frequency division duplexing (FDD) system, where DL channel estimation is carried out via pilot signals with a density of ξ pilots per RB. Channel knowledge at the transmitter may be assumed to mean that those pilots need to be sent in the uplink (UL) direction. Then for each time interval a total of M R ·M T ·Ψ·K·ξ complex numbers would need to be transmitted. With the same numbers of the example considered above, and for ξ=2, time interval of 1 ms, and 16 bits needed to quantize a single complex number, a total of 768 Mbit/s would be required in UL signalling, which is likely much more than the total UL capacity itself. 
         [0019]    In a time division duplexing (TDD) system DL and UL reciprocity can help in acquiring information on the channel, provided that a proper compensation or tuning of RF parts is present. However, the knowledge of the channel seen by all users requires that all users transmit in the UL over the whole bandwidth and with all of their transmit antennas. This might be difficult to achieve in practice, especially for a high number of users. 
         [0020]    These issues have been tackled to some extent in the patent literature. 
         [0021]    For instance, US-A-2008/0117815 discloses a method to reduce feedback quantity and scheduling complexity, while WO-A-2009/38509 discloses an arrangement to adapt the modulation chosen for each user between SU-MIMO modes and MU-MIMO modes based on user velocity, which is a useful parameter. 
         [0022]    A somewhat similar disclosure is provided in WO-A-2007/109630. 
         [0023]    Document US-A-2008/0242309 addresses the issue of reducing signalling in the UL channel by selecting user terminals based on the magnitude of their channel only. 
       OBJECT AND SUMMARY OF THE INVENTION 
       [0024]    The inventor has thus noted that conventional precoding schemes (especially of the short-term type) for MU-MIMO systems based on an estimate of the connection channel between the base station and user equipments present two types of challenges: they require full channel knowledge for every user at the transmitter and imply a computationally heavy scheduling phase. 
         [0025]    The inventor has similarly noted that various reasons prevent these issues from being solved by the prior art patent documents considered in the foregoing. 
         [0026]    A first reason may be excessive latency, e.g. because users are selected sequentially with a very complex process of sending several times a so-called partial information feedback. Excessive latency could limit the minimum acceptable channel coherence time. A related problem may lie in the fact that, because partial information feedback is sent several times in the uplink (UL) direction, so that the total amount of feedback information may turn out be too large. 
         [0027]    Another reason may lie in the difficulty in limiting to reasonable amounts the feedback quantity in the uplink direction: if e.g. a high number of users exhibit low mobility, many candidates for MU-MIMO will be present, and so both signalling load in the UL and computation complexity for scheduling at the base station will be excessive. 
         [0028]    Still another reason is the impact on scheduling complexity, e.g. because (irrespective of the type of feedback possibly adopted) UL signalling of the magnitude of all channels becomes very heavy, which make a realistic implementation of a MU-MIMO precoder very critical. 
         [0029]    The object of the invention is thus to provide a solution exempt from the drawbacks highlighted in the foregoing. 
         [0030]    According to the present invention, that object is achieved by means of a method having the features set forth in the claims that follow. The invention also relates to a corresponding system, a related network as well as a related computer program product, loadable in the memory of at least one computer and including software code portions for performing the steps of the method of the invention when the product is run on a computer. As used herein, reference to such a computer program product is intended to be equivalent to reference to a computer-readable medium containing instructions for controlling a computer system to coordinate the performance of the method of the invention. Reference to “at least one computer” is evidently intended to highlight the possibility for the present invention to be implemented in a distributed/modular fashion. 
         [0031]    The claims are an integral part of the disclosure of the invention provided herein. 
         [0032]    Various embodiments relate to precoding signals transmitted from a base station to a plurality of user terminals in a MU-MIMO wireless communication system using a set of multiple subcarriers arranged in plural subsets (e.g. RBs) of said set of multiple subcarriers, wherein said precoding involves acquiring channel state information (e.g. CSI) on the connection channel between the base station and user terminals in said plurality. 
         [0033]    Various embodiments thus provide for detecting with the user terminals of said plurality channel quality indicators (e.g. CQIs or explicit SINR estimates) for respective subsets of said set of multiple subcarriers, by associating to each channel quality indicator a respective subset of said set of multiple subcarriers for which the channel quality indicator has been detected; user/subset pairs are thus created having associated channel quality indicators, and these user/subset pairs are subjected to selection as a function of the channel quality indicators associated therewith so that precoding is performed by acquiring channel state information (exclusively) for the user/subset pairs resulting from said selection as a function of the channel quality indicators (and, possibly, other selection steps as a function of other parameters such as speed, maximum bit rate, direction of arrival or angular spread in a multiple-stage selection process). 
         [0034]    Various embodiments overcome the drawbacks inherent in prior art solutions (e.g. the need for full channel knowledge for every user at the transmitter and/or a computationally heavy scheduling phase) by utilizing quantities that are otherwise already available as UL feedback to select the candidate users for MU-MIMO. 
         [0035]    Various embodiments relate to implementations of MU-MIMO precoding that are not specifically related to the type of precoding adopted. Various embodiments can be applied to both linear and non-linear MU-MIMO precoding schemes, while certain embodiments are particularly suited to short-term precoding. In various embodiments, user selection is RB-specific. In various embodiments, selection is multi-stage to limit inasmuch as possible the quantity of UL feedback. 
         [0036]    In various embodiments, user selection is based on a reported indicator of channel quality such as eg. indicator known as CQI (Channel Quality Indicator). 
         [0037]    In various embodiments, e.g. in case of wide-band CQI reporting, the user is considered a candidate for MU-MIMO on all available RBs only if the CQI exceeds a given threshold. 
         [0038]    In various embodiments, in case of RB-specific CQI reporting, the selection is operated on per-RB basis: if the CQI is signalled only for the best RBs (“best-M” mode), then a terminal is not considered a candidate for MU-MIMO for those RBs without a signalled CQI, and for those RBs with a CQI a threshold may be applied. 
         [0039]    In various embodiments, the indicator of channel quality may be represented by an explicit SINR estimate, which is signalled in the UL in the place of the CQI, and is processed in a similar way to a CQI. 
         [0040]    In various embodiments, those users requesting the maximum available per-user bit rate (e.g. requiring a high bit-rate service in a network with small load, or privileged “premium” users) are to be excluded from MU-MIMO (especially when operated with co-located antennas). 
         [0041]    In various embodiments, user selection may involve estimated user motion speed: for instance, MU-MIMO may be ruled out for users having an estimated speed exceeding a pre-determined speed threshold. 
         [0042]    In various embodiments, speed may be estimated at the base station based on the UL signal; it may also be estimated at the mobile terminal based on DL signal or an independent positioning system. In this latter case, the estimated speed is reported to the base station. 
         [0043]    In various embodiments, the feedback quantity can be reduced by using a single bit indicated if the speed is below or above the threshold. 
         [0044]    In various embodiments, where an estimated direction of arrival and angular spread is available at the base station, the selection of users may operate so that, for each RB, the candidates will not have similar directions of arrival and angular spread. 
         [0045]    In various embodiments, if the candidates are concentrated along given directions, only a small number of users inside a given angular spread is considered as candidates for MU-MIMO (some users may be excluded operating on a random basis inside the given angular spread). 
         [0046]    In various embodiments, the base station will then signal in the DL a request to the candidate user terminals to transmit their full Channel State Information (CSI) on the UL; the request will typically be limited to a few RBs per user terminal. 
         [0047]    In various embodiments wherein selection is based on best-M CQI signalling, it could be implied that if the base station requests the full CSI, then it is relative to all or the best M′ resources, where M′&lt;M, such saving DL signalling resources. 
         [0048]    In various embodiments, after the candidate users have signalled their full CSI on the uplink, a scheduling phase is provided where only candidate users will be considered for MU-MIMO scheduling; for scheduled users MU-MIMO precoded signal is then computed based on the full CSI information. 
         [0049]    Various embodiments apply to wireless systems using MU-MIMO transmission, and in particular those types of MU-MIMO featuring a precoding at the transmit side which needs a detailed channel state knowledge. 
     
    
     
       BRIEF DESCRIPTION OF THE ANNEXED REPRESENTATIONS 
         [0050]    The invention will now be described, by way of example only, with reference to the enclosed figures of drawing, wherein: 
           [0051]      FIG. 1  has been already described in the foregoing; 
           [0052]      FIG. 2  is flowchart representative of operation of various embodiments. 
       
    
    
     DETAILED DESCRIPTION OF EMBODIMENTS 
       [0053]    In the following description, numerous specific details are given to provide a thorough understanding of embodiments. The embodiments can be practiced without one or more of the specific details, or with other methods, components, materials, etc. In other instances, well-known structures, materials, or operations are not shown or described in detail to avoid obscuring aspects of the embodiments. 
         [0054]    Reference throughout this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment. Thus, the appearances of the phrases “in one embodiment” or “in an embodiment” in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. 
         [0055]    The headings provided herein are for convenience only and do not interpret the scope or meaning of the embodiments. 
         [0056]    This disclosure will refer to various exemplary embodiments applied to downlink (DL) connections in a system otherwise conforming to the 3GPP standard Release 10 and beyond (LTE-A, Long Term Evolution-Advanced). Various embodiments are applicable to other cellular and non-cellular wireless systems based multi-carrier transmission techniques (like OFDM), or on single carrier transmission. In the case of single-carrier based systems, the full bandwidth will be allocated to a group of MU-MIMO users at a time, but the concept of pre-selection remains applicable. 
         [0057]    The flowchart of  FIG. 2  is representative of an exemplary embodiment of a procedure for selection of user terminals to be considered for precoding purposes within a transmitter using MU-MIMO. It will otherwise be appreciated that certain steps of the exemplary procedure of  FIG. 2  may be omitted or their order may be altered. 
         [0058]    After a START step, the “intelligence” of the system (for the sake of simplicity this will be assumed to be located at the base station BS e.g. Node B, while a distributed arrangement is also possible) will start by considering the set Ω={ω i } of all active users, step  10 . 
         [0059]    As used herein, the term active user terminal will indicate those user terminals that have pending requests for DL transmission, that is those user terminals having their radio interface in the connected state, and waiting to be scheduled for DL transmission. 
         [0060]    Assuming that K is the number of active users so that Ω={ω i }, i=1 . . . K, one may similarly assume that, in a step  12 , the base station will be able to estimate for the i-th user the motion speed ν i  of the user itself, or the speed of the fastest scatters in the propagation channel (or the UL receiver in the case of a moving base station). Speed estimation techniques of the type considered herein are known in the art, which makes it unnecessary to provide a detailed description herein. 
         [0061]    If ν max  denotes the maximum motion speed tolerable for MU-MIMO scheduling, a new set of users can be defines as: 
         [0000]    
       
         
           
             
               
                 Ω 
                 1 
               
               = 
               
                 { 
                 
                   ω 
                   i 
                 
                 } 
               
             
             , 
             
               
 
             
              
             
               { 
               
                 
                   
                     
                       
                         ω 
                         i 
                       
                       ∈ 
                       Ω 
                     
                   
                 
                 
                   
                     
                       
                         v 
                         i 
                       
                       ≤ 
                       
                         
                           v 
                           max 
                         
                         . 
                       
                     
                   
                 
               
             
           
         
       
     
         [0062]    This first selection step (generally designated step  14  in  FIG. 2 ) will lead to partitioning the active users in two sets, namely:
       users with estimated speed below (and equal to) the threshold ν max ;   users with estimated speed above the threshold ν max .       
 
         [0065]    This selection step may be further refined into substeps when different orders of MU-MIMO are present in the system. 
         [0066]    By means of example, if 2×2 and 4×4 types of MU-MIMO are present, where the number of receive antennas per user are M R =1 in both cases, one may assume then that 2×2 will operate at somewhat higher speeds than 4×4. In that case, two maximum acceptable speeds ν max  will be present, namely a higher one (ν max2×2 ) for 2×2 and a lower one (ν max4×4 ) for 4×4. 
         [0067]    Users will then be divided in users that are not eligible for any type of MU-MIMO scheduling, users eligible for 2×2 only, and users eligible for both types of MU-MIMO scheduling. 
         [0068]    In any case, users not held to be eligible for any type of MU-MIMO scheduling (e.g. users with estimated speed above the threshold ν max ) will be forwarded to a scheduling process  40  (of a known type) for non-MU-MIMO user terminals. 
         [0069]    In a step  16 , the system will also exclude those users that are candidates for a connection with maximum bit-rate (for example premium users willing to pay a higher fare). As a result of the step  16 , a new selected set of user will thus be formed: 
         [0000]    
       
         
           
             
               
                 Ω 
                 2 
               
               = 
               
                 { 
                 
                   ω 
                   i 
                 
                 } 
               
             
             , 
             
               
 
             
              
             
               { 
               
                 
                   
                     
                       
                         ω 
                         i 
                       
                       ∈ 
                       
                         Ω 
                         1 
                       
                     
                   
                 
                 
                   
                     
                       
                         ω 
                         
                           
                               
                           
                           i 
                         
                       
                       ∉ 
                       Λ 
                     
                   
                 
               
             
           
         
       
     
         [0070]    where Λ is the set of users chosen as candidates for a maximum bit-rate connection by the scheduling policy. Again, these users, which may be better served with SU-MIMO allocation, are forwarded to the scheduling process  40  for non-MU-MIMO user terminals. 
         [0071]    In a step  18 , the system will then acquire channel quality indicators (the CQI parameter) for the elements included in Ω 2 . 
         [0072]    In a step  20 , the CQI values thus collected will be arranged in a bi-dimensional matrix Σ, where each row corresponds to a user terminal ω i εΩ 2 , and each column corresponds to a RB (i.e. one of the subsets of the set of multiple sub carriers used in the system). 
         [0073]    In various embodiments, the base station will then fill-in the elements σ ij  of the matrix with the values of the CQIs, where available, as follows. 
         [0074]    When the CQI is not available for a user terminal, all the RBs for that user terminal will be marked as not suitable for MU-MIMO (this can be set in practice to the lowest possible CQI value). 
         [0075]    For wide-band types of CQI, there are two choices:
       if that type of CQI is not held to be adapted for MU-MIMO, all the RBs for that user terminal will be marked as not suitable for MU-MIMO;   otherwise, all the RBs for that user terminal will be marked with the same value of CQI.       
 
         [0078]    For “best-M” type of CQI, the corresponding RBs will be marked with the corresponding value of the CQI, while other ones will be marked as not suitable for MU-MIMO. 
         [0079]    Further on, in a step  22 , the pairs (ω i , RB j ), ω i εΩ 2 , will be selected as suitable for MU-MIMO scheduling only if the corresponding CQI value in Σ is above a given threshold value λ. As such, we define a new set of selected pairs (user, RB) as follows: 
         [0000]    
       
         
           
             
               
                 Ω 
                 3 
               
               = 
               
                 { 
                 
                   ( 
                   
                     
                       ω 
                       i 
                     
                     , 
                     
                       RB 
                       j 
                     
                   
                   ) 
                 
                 } 
               
             
             , 
             
               
 
             
              
             
               { 
               
                 
                   
                     
                       
                         ω 
                         i 
                       
                       ∈ 
                       
                         Ω 
                         2 
                       
                     
                   
                 
                 
                   
                     
                       
                         σ 
                         ij 
                       
                       ≥ 
                       
                         λ 
                         . 
                       
                     
                   
                 
               
             
           
         
       
     
         [0080]    The value of λ does not need to be static, but can be dynamically adapted in time, to optimize different load situations. 
         [0081]    In the step  22 , the users corresponding to those (user, RB) pairs that exhibit a CQI below the threshold value λ or to those (user, RB) pairs for which no CQI is available (and are thus set to a lowest possible CQI value—lower than λ) are forwarded to the scheduling process  40  for non-MU-MIMO user terminals being thus discarded for the purposes of MU-MIMO precoding. 
         [0082]    A next, optional, selection phase assumes that the base station BS is capable of estimating the Direction of Arrival (DoA) of the waves transmitted by a given user terminal. Optionally, Angular Spread (AS) may (also) be estimated. 
         [0083]    The above quantities can be estimated in a step  24  e.g. by resorting to algorithms available in the literature (e.g. MUSIC and ESPRIT algorithms), and a successful estimate is easier when antennas at the base station are spatially correlated. 
         [0084]    In various embodiments, users having similar DoA should not be scheduled on the same RBs, especially when they have similar ASs. 
         [0085]    An exemplary algorithm using the DoA may be written in pseudo-code as follows: 
         [0000]    
       
         
               
             
           
               
                   
               
             
             
               
                  initialize Ω 4  = Ω 3   
               
               
                  for j = 1 to number of RBs 
               
               
                   store U = set of users selected for MU-MIMO on RB (j) 
               
               
                   set to zero a list of users for each direction of 
               
               
                 arrival (with a given angular step) 
               
               
                   while ( U not empty ) 
               
               
                    pick up the user (i) in U with highest CQI value 
               
               
                 on RB (j) 
               
               
                    store DoA = direction of arrival for user (i) 
               
               
                    if ( list of users for DoA has less than maximum 
               
               
                 number of users ) 
               
               
                     add to the list for DoA user (i) 
               
               
                    end if 
               
               
                    delete user (i) from set U 
               
               
                   end while 
               
               
                   store U = set of users selected for MU-MIMO on RB (j) 
               
               
                   for k = 1 to number of elements in U 
               
               
                    pick up the k-th element of U, which is user (i) 
               
               
                    if ( user (i) is member of any list of users for 
               
               
                 all the DoAs ) 
               
               
                     do nothing 
               
               
                    else 
               
               
                     remove the pair (ω i , RB j ) from Ω 4   
               
               
                    end if 
               
               
                   end for 
               
               
                  end for 
               
               
                   
               
             
          
         
       
     
         [0086]    As a result of the above algorithm (or an equivalent procedure) being implemented in a step  26 , excluded (user, RB) pairs are forwarded to the scheduling process  40 . 
         [0087]    Conversely, the selected (user, RB) pairs constitute a final set of candidate pairs (ω i , RB j ) in Ω 4  ready to be used for DL signalling. 
         [0088]    To that effect, in a step  28  the base station BS will request the detailed CSI for the pairs (ω i , RB j ) in Ω 4 , or a subset thereof, when the number of elements in Ω 4  exceeds a pre-determined threshold. 
         [0089]    In a step  30 , the candidate users {ω i }, ∃(ω i , RB j )εΩ 4  or a subset thereof will then transmit via UL signalling the detailed CSI to the base station. 
         [0090]    In various embodiments, DL signalling to request the detailed CSI and the associated UL signalling for the transmission of the CSI may be designed in various ways. 
         [0091]    In various embodiments the base station will send on the DL information corresponding to the unique identifiers of the ordered elements (ω i , RB j ) for each element in Ω 4  (or a subset). It will be appreciated that signalling may take place in various ways, including the transmission of the identifier of the/each selected terminal followed by the list of its related resource blocks, which could also be limited or fixed in number to limit complexity; the downlink signalling will trigger the uplink transmission of the requested CSI. 
         [0092]    In various embodiments, wherein selection may be based on a best-M CQI signalling strategy, with the DL signalling corresponding to step  28  operating as follows. The base station transmits in the DL just the identifiers {ω i } of the user terminals {ω i }, ∃(ω i , RB j )εΩ 4 , or a subset thereof. This could also correspond to a single bit per user terminal within a signalling word, where the bit is set or reset to enable or disable detailed CSI feedback. The user terminal identifier could also be transmitted together with a user-terminal specific resource block count indicating how many resource blocks are considered candidates after the selection for that user terminal. In this case every user terminal would transmit in the UL the detailed CSI corresponding to the all or a subset of the resource blocks it has previously signalled the CQI value for. 
         [0093]    In the following, one exemplary practical design for the feedback is considered, by assuming that selection is based on best-M CQI signalling with M=4. The base station during step  28  transmits two bits (b 1i b 2i ) for every active user terminal, where: 
         [0000]    
       
         
           
             { 
             
               
                 
                   
                     
                       
                         b 
                         
                           1 
                            
                           i 
                         
                       
                       = 
                       1 
                     
                   
                   
                     
                       
                         ⇔ 
                         
                           { 
                           
                             ω 
                             i 
                           
                           } 
                         
                       
                       , 
                       
                         ∃ 
                         
                           
                             ( 
                             
                               
                                 ω 
                                 i 
                               
                               , 
                               
                                 RB 
                                 j 
                               
                             
                             ) 
                           
                           ∈ 
                           
                             Ω 
                             4 
                           
                         
                       
                     
                   
                 
                 
                   
                     
                       
                         b 
                         
                           1 
                            
                           i 
                         
                       
                       = 
                       0 
                     
                   
                   
                     otherwise 
                   
                 
               
                
               
                 
 
               
                
               
                 { 
                 
                   
                     
                       
                         
                           b 
                           
                             2 
                              
                             i 
                           
                         
                         = 
                         1 
                       
                     
                     
                       
                         
                           ⇒ 
                           
                               
                           
                            
                           
                             θ 
                             i 
                           
                         
                         = 
                         1 
                       
                     
                   
                   
                     
                       
                         
                           b 
                           
                             2 
                              
                             i 
                           
                         
                         = 
                         0 
                       
                     
                     
                       
                         
                           ⇒ 
                           
                               
                           
                            
                           
                             θ 
                             i 
                           
                         
                         = 
                         2 
                       
                     
                   
                 
               
             
           
         
       
     
         [0094]    Then each user terminal ω i  will implement the UL signalling step  30  by transmitting the CSI for the θ i  resource blocks that it associates with the best CSI values. 
         [0095]    Once reconstructed the detailed CSI for the candidate pairs (ω i , RB j ), i.e. the “surviving” pairs resulting from the selection, in a step  32 , the base station will proceed with scheduling and computation of the final MU-MIMO precoded signal for DL transmission. 
         [0096]    As indicated, this may occur by resorting to a known precoding technique/arrangement, possibly involving mutual co-operation of the scheduling processes  32  and  40 . 
         [0097]    For instance, the scheduling process  32  may “dump” certain users (or pairs) towards the process  40 . Co-operation of the scheduling processes  32  and  40  may involve cross-scheduler optimization. 
         [0098]    As indicated, the order of certain steps in the exemplary procedure of  FIG. 2  may be optionally changed. 
         [0099]    For instance, by altering the order of the pre-selection steps we can imagine the following embodiments: 
         [0100]    (speed—step  14 )-&gt;(max bit rate—step  16 )-&gt;(DoA and AS—step  26 )-&gt;(per-RB CQI—step  22 ) 
         [0101]    (max bit rate—step  16 )-&gt;(speed—step  14 )-&gt;(per-RB CQI—step  22 )-&gt;(DoA and AS—step  26 ) 
         [0102]    leading to several possible combinations. 
         [0103]    In various embodiments, the pre-selection step  22  based on per-RB CQI is always present, while the other selection steps  14 ,  16  and  26  are optional. 
         [0104]    Consequently, without prejudice to the underlying principles of the invention, the details and the embodiments may vary, even appreciably, with respect to what has been described by way of example only, without departing from the scope of the invention as defined by the annexed claims.