Abstract:
A space division multiple access transmission method of a statistical characteristic mode is provided by the present invention. The method includes that: multiple receiving and transmitting antennae of a base station side are configured to one or more antenna arrays, and multiple space resource divisions are executed by each antenna array by using multiple unitary matrixes; by using a relevant matrix with long time statistics for each user channel on the base station side, the space resource division matching with the characteristic mode of each user and the space direction occupied by each user in the condition of the division are determined; a characteristic mode clustering is performed to the users by using the space resource division to which each user belongs; the users of the same characteristic mode are grouped into a space division user group by using the space direction occupied by each user; the space division multiple access transmission is executed by the users of the same space division user group by using the space resource divisions to which the users belong, and the characteristic mode transmission with long time statistics is executed by each user by using one or more column vectors of the corresponding unitary matrix; in the course of movement of each user, all of the user characteristic mode clustering, the space division user grouping, and the space division multiple access transmission in a characteristic mode, are dynamically executed with the variety of channel long time statistics characteristic.

Description:
TECHNICAL FIELD 
       [0001]    The present invention relates to a multi-subscriber wireless communication system that employs multiple transmitting antennae and multiple receiving antennae, in particular to a multi-subscriber and multi-antenna Space Division Multiple Access (SDMA) wireless communication system that utilizes long-time statistical channel status information. 
       BACKGROUND ART 
       [0002]    To meet the demand of future development, mobile communication systems must support high-speed grouped data transmission at a data rate as high as tens to thousands of millions bits per second. In the increasingly difficult situation of managing radio resources, it is a key research objective of the new generation mobile communication standards 3GPP LTE-Advanced (3rd Generation Partnership Project Long Term Evolution) to employ multi-input and multi-output (MIMO) wireless transmission techniques, to fully exploit and utilize space resources, and to maximize spectrum utilization and power efficiency. 
         [0003]    In recent years, the research on the multi-subscriber MIMO wireless transmission technique has received extensive attention both in theory circles and in industrial circles. Owing to the asymmetry between uplink and downlink, multi-subscriber MIMO channels are classified into uplink multi-access channels (MAC) and downlink broadcast channels (BC). The research work is carried out in these two classifications, with focus set on the downlink broadcast channels (BC). The research on the multi-subscriber MIMO wireless transmission technique mainly centers on the scenarios in which the transient/short-time channel status information in the base station is known. Most research performed is only applicable to the scenarios of fixed and low-speed mobile communication, however some research is performed on multi-subscriber MIMO wireless transmission in middle-speed and high-speed mobile communication environments. In addition, only multi-subscriber MIMO uplink MAC transmission is considered in the research, while few reports are seen regarding the research on multi-subscriber MIMO wireless transmission methods that utilize long-time statistical channel status information. SDMA transmission that utilizes transient/short-time channel status information is not only unfit for middle-speed and high-speed mobile communication environments, but also involves complex resource scheduling at the control layer, complex implementation of the physical layer, higher cost of channel information acquisition and exchange, and higher inter-subscriber interference, and therefore it is hard to effectively improve the spectrum utilization, power utilization, and transmission reliability of the wireless communication system. For this purpose, the present invention provides a multi-subscriber SDMA technique that utilizes long-time statistical channel status information. 
       CONTENTS OF THE INVENTION 
     Technical Problem 
       [0004]    The object of the present invention is to provide a multi-subscriber SDMA transmission method based on a statistical characteristic pattern that utilizes long-time statistical channel status information, and can perform subscriber characteristic pattern clustering, space division subscriber grouping, and SDMA transmission, according to the long-time statistical status information of subscriber channels. 
       Technical Solution 
       [0005]    The object of the present invention is to provide a multi-subscriber SDMA transmission method based on statistical characteristic pattern that utilizes long-time statistical channel status information, the method comprising:
       a) configuring the receiving and transmitting multi-antenna at the base station side into one or more antenna arrays, and dividing multiple space resources for each antenna array by way of multiple unitary matrixes;   b) comparing the diagonalization performance among the unitary matrixes for the correlation matrix of subscriber channels, with the long-time statistical correlation matrix of the subscriber channels at the base station side, in order to determine the unitary matrix that matches the characteristic pattern of the long-time statistical correlation matrix, then calculating the optimal diagonalized correlation matrix, so as to determine the space resource divisions for the subscribers and the space directions occupied by the subscribers in the divisions, and then performing characteristic pattern clustering for the subscribers in the cell with the space resource divisions of the subscribers;   c) grouping the subscribers that belong to the same characteristic pattern cluster into space division subscriber groups, on the basis of the space directions occupied by each subscriber, to create one or more space division subscriber groups that can share the same time-frequency resource by way of the SDMA technique, wherein, different subscribers in each space division subscriber group occupy specific space directions different from the directions occupied by other subscribers in the group;   d) carrying out SDMA transmission, by the subscribers in the same space division subscriber group, with their space resource divisions, wherein, each subscriber performs SDMA transmission in the long-time statistical characteristic pattern transmission by way of one or more column vectors in the corresponding unitary matrix, and wherein the signals transmitted by each subscriber in the long-time statistical characteristic pattern comprise special pilot signals and data signals, and the data signals can be signals generated by short time pre-coding with the short-time channel information;   e) dynamically performing, subscriber characteristic pattern clustering and space division subscriber grouping as described above, performed dynamically as the long-time statistical characteristics of the channels between the base station and the subscribers change with the movement of the subscribers, to generate updated characteristic pattern clusters for the subscribers and updated space division subscriber groups, and to thereby carry out the SDMA transmission in the characteristic pattern described above.       
 
         [0011]    In the antenna arrays, the interval between antennae in the antenna array is smaller than the carrier wavelength; if the antennae are omni-directional antennae, sector antennae with 120 degree angles, or sector antennae with 60 degree angles, then the interval between antennae is ½ wavelength, 1/√{square root over (3)} wavelength, or 1 wavelength, respectively; each antenna is a mono-polar antenna or multi-polar antenna; the interval between antenna arrays is greater than the carrier wavelength; and the directional diagrams of all antennae in all antenna arrays are aligned to each other. 
         [0012]    In the unitary matrix, each column vector corresponds to a space direction, and can be used as a weighted vector for transmitting/receiving information for the antennae, so as to implement transmitting/receiving in the corresponding space direction; the vectors in each unitary matrix can implement transmitting/receiving in space directions orthogonal to each other on the same time-frequency resource, so as to implement division and utilization of space resources; different unitary matrixes correspond to different space resource divisions; and the unitary matrixes for the space resource division are generated by pre-multiplying the Discrete Fourier Transform matrix with a diagonal matrix. 
         [0013]    The diagonalization performance is compared among the unitary matrixes for the correlation matrix of subscriber channels, and the space resource division corresponding to the unitary matrix with the optimal diagonalization performance is the space resource division that matches the characteristic pattern of the subscribers. The space directions corresponding to one or more diagonal elements greater than a predefined threshold in the correlation matrix after optimal diagonalization, are the space directions occupied by the subscriber. Subscribers that belong to the same space resource division are clustered into the same subscriber characteristic pattern cluster, and thereby multiple subscriber clusters are formed in the corresponding long-time statistical time window for all subscribers in the cell. 
         [0014]    The determination of space resource divisions for the subscribers and space directions occupied by the subscribers are implemented either at the base station side or at the subscriber terminal side. In the case of implementation at the base station side, the required long-time statistical correlation matrix of the subscriber channels at the base station side is either calculated and obtained by way of estimation of the corresponding uplink channel, or estimated by the subscriber terminal by way of estimation of the common pilot channel, and is then fed back to the base station directly through the feedback link. In the case of implementation at the subscriber terminal side, the subscriber calculates the long-time statistical correlation matrix of the channels at the base station side by way of estimation of the common pilot channel, and thereby calculates the space resource division for the subscriber and the space directions occupied by the subscriber, and then feeds back the information to the base station through the feedback link. 
         [0015]    The space division subscriber grouping is carried out with a greedy algorithm, according to the space directions occupied by each subscriber. For each space division subscriber group, subscribers that occupy more space directions are grouped in precedence, and then other subscribers that can be grouped are searched for according to the number of space directions occupied, in a more-to-less order. If the space directions occupied by the subscriber that is searched for, currently have no overlap with the space directions occupied by any existing subscriber in the group, then that subscriber will be included into the group. The searching then continues until all space directions in the group are occupied, or all subscribers have been searched through. 
         [0016]    The special pilot signals of the subscribers can be transmitted directly in the long-time characteristic pattern, while the data signals of the subscribers can be further generated by short-time pre-coding with short-time channel information. For downlink transmission, the transmitted signals of the subscribers at the base station side are long-time pre-coded with one or more corresponding column vectors to generate transmitted signals in the antenna domain, and the signals of the same space division subscriber group in the antenna domain is the sum of the signals of the subscribers in the antenna domain. For uplink transmission, the subscriber performs matching operation for the received signals in the antenna domain at the base station side with one or more corresponding column vectors to abstract the received signals of the subscriber, and then carry out subsequent receiving operations. 
         [0017]    The signal transmission for each subscriber in the long-time statistical characteristic pattern can be carried out in all space directions occupied by the subscriber, or carried out in some space directions occupied by the subscriber. The space directions are selected from higher diagonal elements in a quantity not higher than a predefined number from the diagonal elements in the channel correlation matrix after optimal diagonalization. Then, the space directions corresponding to the selected diagonal elements can be used as the space directions for signal transmission in the long-time statistical characteristic pattern. The space directions can be selected at the base station side, or selected at the subscriber terminal side, and then notified to the base station through the feedback link. 
       Beneficial Effects 
       [0018]    The SDMA transmission method based on the statistical characteristic pattern provided in the present invention has the following advantages: 
         [0019]    A specific uneven-interval multi-antenna configuration and an appropriate space resource division are employed, favorable for acquiring the performance gain of the multi-subscriber SDMA technique and the performance gain of multi-antenna transmission for the subscribers. 
         [0020]    SDMA is implemented by utilizing the long-time statistical channel status information of each subscriber channel, and the subscribers can determine the space resources to use and then notify the information to the base station by themselves, thus the complexity in resource scheduling at the control layer and the complexity in implementation of the physical layer can be reduced greatly. 
         [0021]    The required long-time statistical channel status information of the subscriber channels can be obtained by way of sparse pilot signals and a low-speed feedback channel, thus the cost of channel information acquisition and exchange can be reduced greatly. 
         [0022]    In the SDMA transmission mode, the subscribers can further use short-time channel status information for transmission, so as to improve the transmission performance, consequently the spending of required special pilot channel is low. 
         [0023]    The method in the present invention is helpful for suppressing the inter-subscriber interference effectively, and can overcome the drawback of sensitivity to time-related channel variations in existing multi-subscriber wireless transmission systems that are based on short-time channel status information, therefore the method is highly adaptive to various mobile environments. 
         [0024]    The method provided in the present invention effectively improves the spectrum utilization, power utilization, and transmission reliability of wireless communication systems. 
     
    
     
       DESCRIPTION OF THE DRAWINGS 
         [0025]    In order to more clearly explain the technical solution in the embodiments of the present invention, provided below are drawings used in the description of the embodiments or of the prior art. As will become apparent, the drawings described below only illustrate some embodiments of the present invention. Those skilled in the art can obtain drawings of other embodiments on the basis of these drawings without creative labor. 
           [0026]      FIG. 1  is a schematic diagram of a multi-antenna configuration and a space resource division in a base station; 
           [0027]      FIG. 2  is a schematic diagram of generation of transmitted signals in an SDMA downlink in a base station; 
           [0028]      FIG. 3  is a schematic diagram of processing of received signals in an SDMA uplink in a base station. 
       
    
    
     DETAILED DESCRIPTION OF THE EMBODIMENTS 
       [0029]    For better understanding of the technical solution of the present invention, hereunder the technical solution in the embodiments of the present invention will be described clearly and completely with reference to the accompanying drawings. As will become apparent, the embodiments described below contain some, but not all embodiments of the present invention. Those skilled in the art can obtain other embodiments without creative labor, on the basis of the embodiments provided here; however, all these embodiments shall be deemed as falling into the protection scope of the present invention. 
       (1) Multi-Antenna Configuration and Space Resources Division in Base Station: 
       [0030]      FIG. 1  is a schematic diagram of a multi-antenna configuration and a space resource division in a base station, wherein, the multi-antenna configuration is shown in the upper part. The receiving and transmitting multiple-antennae at the base station side are configured into one or more antenna arrays; here, an antenna array specially refers to a group of antennae arranged at a small interval. The antennae shown in  FIG. 1  are configured into two antenna arrays, each of which has four antennae. The interval between the antennae in each antenna array in the Figure is denoted as d 1 , which is smaller than the carrier wavelength. The carrier wavelength is denoted as λ, for omnidirectional antennae, sector antennae with 120 degree angles, and sector antennae with 60 degree angles, the value of d 1  is ½λ×wavelength, 1/√{square root over (3)}λ×wavelength, and λ×wavelength, respectively. The interval between the two antenna arrays shown in the Figure is denoted as d 2 , which is greater than carrier wavelength λ, i.e., d 2 =cλ, and c&gt;1. Typically, the antennae are aligned into linear arrays, and the directional diagrams of all antennae are aligned. Each antenna can be a mono-polar antenna or multi-polar antenna; when multi-polar antennae are used, the number of antenna arrays is considered as a multiple of the number of polarization directions, for the purpose of convenience. The number of antenna arrays is denoted as M 1 , and the number of antennae in each antenna array is denoted as M 2 , and the total number of antennae deployed in the base station is M=M 1 M 2 . 
         [0031]    To implement SDMA, the space resources must be divided effectively, and multiple space directions must be resolved, so that they can be used. To that end, for each antenna array, transmitted signals in the antenna domain are generated by way of multiple unitary matrixes, or received signals in antenna domain are received and pretreated in the present invention, to form multiple space resource divisions. For example, in the case of sector antennae with 120 degree angles, the space directions in a typical space resource division are shown in the lower part of  FIG. 1 . 
         [0032]    A given set of unitary matrixes is denoted as U={U v , v=0, 1, . . . V−1}, where, U v  is the unitary matrix v, and V is the number of unitary matrixes. A sub-matrix composed of one or more column vectors within U v  is denoted as U v   α , where, the labels of the columns are defined by the values of elements in the set α. The column vector l in the unitary matrix v is denoted as u v   l . Each column vector in a unitary matrix corresponds to a space direction, and can be used as a weight vector for transmitting/receiving information for the antenna, in order to implement transmitting/receiving in the corresponding space direction. The signals transmitted from the antenna array m 1  in the base station via the column vector l in the unitary matrix v is denoted as s v,l   m     1   (n), where, n represents the n th  time-frequency resource, which can be a single sub-carrier for either a single OFDM symbol in an Orthogonal Frequency Division Multiplexing (OFDM) system, or a single transmission symbol in a single-carrier system. The signal vector in antenna domain transmitted from antenna array m 1  is: 
         [0000]        x   m     1   ( n )= u   v   l   s   v,l   m     1   ( n )  (1)
 
         [0033]    Where, m 1 =1, 2, . . . M 1 , and the number of dimensions of x m     1   (n) is M 2 . The signal vector in the antenna domain received by the antenna array m 1  in the base station is denoted as y m     1   (n), then, the signals obtained from the antenna array m 1  in the base station via the column vector l in the unitary matrix v is: 
         [0000]        ŝ   v,l   m     1   ( n )=( u   v   l ) H   y   m     1   ( n )  (2)
 
         [0034]    Where, superscript H represents conjugate transposition. The vectors in each unitary matrix can be used to implement transmitting/receiving in space directions that are orthogonal to each other on the same time-frequency resource, and can thereby implement division and utilization of space resources. Different unitary matrixes correspond to different space resource divisions. For example, in the case of space resource division v, if a group of space directions {l 1 , l 2 , . . . , l M′     2   } is utilized at the same time for transmission on the same time-frequency resource (where, M′ 2 ≦M 2 ), then the signal vector in the antenna domain transmitted in the base station and the signals in the space directions received and obtained in the base station can be denoted as: 
         [0000]        x   m     1   ( n )= U   v   α   s   v   m     1   ( n )  (3)
 
         [0000]        ŝ   v   m     1   ( n )=( U   v   α ) H   y   m     1   ( n )  (4)
 
         [0000]    where, 
         [0000]      α={l 1 , l 2 , . . . l M′     2   }
 
         [0000]      s v   m     1   (n)=[s v,l     1     m     1   (n) s v,l     2     m     1   (n) . . . s v,l     M′2     m     1   (n)] T   
         [0000]      ŝ v   m     1   (n)[ŝ v,l     1     m     1   (n) ŝ v,l     2     m     1   (n) . . . ŝ v,l     M′2     m     1   (n)] T   o 
 
         [0035]    In formulas (3) and (4), if M′ 2 =M, then U v   α =U. 
         [0036]    In the case when the antennae are aligned into linear arrays and the intervals between the antennae meet the requirement described above, the unitary matrixes for space resource division can be generated by left-multiplying the Discrete Fourier Transformation (DFT) matrix with a diagonal matrix. A DFT matrix with M 2  points is denoted as F, then, the element (k,l) in F is [F] k,l =e −j2πkl/M     2   /√{square root over (M 2 )}, and the v th  unitary matrix U v  can be selected as: 
         [0000]        U   v =Γ v   F   (5)
 
         [0037]    Where, Γ v  is a diagonal matrix, in which the l th  diagonal element is e −j2πvl/M     2     /V . 
       (2) Subscriber Characteristic Pattern Clustering: 
       [0038]    The number of subscribers in the cell is denoted as K, the number of antennae configured for subscriber k is denoted as N k , and the channel matrix between the base station and the subscriber k on the time-frequency resource n is denoted as H k (n), which is in size of N k ×M, then, the statistical correlation matrix of the subscriber channels at the base station side is R k =E{H k   H (n)H k (n)}, where, E{.} represents expectation operation. Since the subscribers are mobile ones, R k  varies with the time; however, the time scale of variation is large, and can be estimated with selected channel samples within a specific time window. The set of labels of time-frequency resources for selected channel samples with a specific time window is denoted as N c , then, R k  can be estimated with the following formula or an improved variant of the formula: 
         [0000]    
       
         
           
             
               
                 
                   
                     R 
                     k 
                   
                   ≈ 
                   
                     
                       ∑ 
                       
                         n 
                         ∈ 
                         
                           N 
                           c 
                         
                       
                     
                      
                     
                       
                         
                           H 
                           k 
                           H 
                         
                          
                         
                           ( 
                           n 
                           ) 
                         
                       
                        
                       
                         
                           H 
                           k 
                         
                          
                         
                           ( 
                           n 
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
     
         [0039]    The characteristic matrix of R k  is denoted as V k , the characteristic value i of R k  is denoted as λ k,i , i.e., R k =V k Λ k V k   H , where, Λ k  is a diagonal matrix, with diagonal element i as λ k,i . The column vectors of V k  represent the characteristic directions of subscriber channel k at the base station side, and are referred to as characteristic patterns; whereas λ k,i  represents the channel intensity in characteristic pattern i. Since the antenna arrays are arranged at a large interval or are different from each other in terms of polarization direction, and the directional diagrams are aligned to each other, the correlation matrix R k  can be approximately modeled as a block diagonal matrix with block matrixes in the diagonal line identical to each other, and can be denoted as  R   k , in size of M 2 ×M 2 .  R   k  can be estimated with the following formula: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       R 
                       _ 
                     
                     k 
                   
                   ≈ 
                   
                     
                       1 
                       
                         M 
                         1 
                       
                     
                      
                     
                       
                         ∑ 
                         
                           l 
                           = 
                           0 
                         
                         
                           
                             M 
                             1 
                           
                           - 
                           1 
                         
                       
                        
                       
                         R 
                         k 
                         
                           ( 
                           l 
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   7 
                   ) 
                 
               
             
           
         
       
     
         [0000]    Where, R k   (l)  represents the diagonal sub-matrix l of matrix R k , in size of M 2 ×M 2 . 
         [0040]    With the long-time statistical correlation matrix of subscriber channels at the base station side, both the space resource division that matches the characteristic pattern best and the space directions occupied in the division can be determined. To that end, for the subscribers, first, V matrixes A k,v  are calculated with the following formula: 
         [0000]        A   k,v   =U   v   H     R     k   U   v   (8)
 
         [0000]    Then, v* k  is calculated with the following formula: 
         [0000]    
       
         
           
             
               
                 
                   
                     v 
                     k 
                     * 
                   
                   = 
                   
                     
                       
                         arg 
                          
                         
                             
                         
                          
                         min 
                       
                       v 
                     
                      
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           0 
                         
                         
                           
                             M 
                             2 
                           
                           - 
                           1 
                         
                       
                        
                       
                         
                           ∑ 
                           
                             
                               j 
                               = 
                               0 
                             
                             
                               j 
                               ≠ 
                               i 
                             
                           
                           
                             
                               M 
                               2 
                             
                             - 
                             1 
                           
                         
                          
                         
                           
                              
                             
                               
                                 [ 
                                 
                                   A 
                                   
                                     k 
                                     , 
                                     v 
                                   
                                 
                                 ] 
                               
                               
                                 i 
                                 , 
                                 j 
                               
                             
                              
                           
                           2 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   9 
                   ) 
                 
               
             
           
         
       
     
         [0000]    Wherein, [A k,v ] i,j  represents element (i,j) in A k,v , and 
         [0000]    
       
         
           
             
               
                 arg 
                  
                 
                     
                 
                  
                 min 
               
               v 
             
              
             
                 
             
              
             
               f 
                
               
                 ( 
                 v 
                 ) 
               
             
           
         
       
     
         [0000]    represents the v that makes f(v) minimal. Based on these formulas, it can be determined that within the V unitary matrixes, the v* k   th  unitary matrix U v     k    has the best diagonalization performance for the correlation matrix of subscriber channel k; accordingly, the space resource division v* k  is the space resource division that matches the subscriber characteristic pattern k. Finally, the values of the diagonal elements in A k,v*     k    are compared to see if they are greater than a predefined threshold ε; if the value of diagonal element i is greater than ε, it can be judged that the space direction i in the space resource division v* k  is occupied by subscriber k, and can represent the set of space directions occupied by k with I k . 
         [0041]    The v* k  and I k  described above can be implemented at the base station or at the subscriber terminal. In the case when they are implemented at the base station side, the required  R   k  can be either calculated and obtained by way of estimation of corresponding uplink channels, or estimated by the subscriber terminals by way of estimation of common pilot channel, and is then fed back to the base station directly through the feedback link. In the case when they are implemented at the subscriber terminal side, the subscriber calculates the long-time statistical correlation matrix at the base station side by way of estimation of the common pilot channel, and thereby calculates v* k  and I k , and feeds back them to the base station through the feedback link. 
         [0042]    Characteristic pattern clustering is performed for the subscribers in the cell, with the space resource divisions of the subscribers. Subscribers that belong to the same space resource division are clustered into the same characteristic pattern cluster, i.e., if v* k =v, the subscriber k will be included into cluster v. The V subscriber clusters are formed for all subscribers in the cell in the corresponding long-time statistical time window. 
       (3) Space Division Subscriber Grouping: 
       [0043]    The subscribers that are of the same characteristic pattern cluster are organized into space division subscriber groups, with the space directions occupied by each subscriber, in order to create one or more space division subscriber groups that can share the same time-frequency resource by way of the SDMA technique, wherein, different subscribers in each space division subscriber group occupy specific space directions different from the directions occupied by other subscribers in the group. 
         [0044]    Space division subscriber grouping is carried out on the basis of the set I k  of space directions occupied by the subscribers, and can be implemented with a greedy algorithm. For each space division subscriber group, subscribers that occupy more space directions are grouped in precedence, and then other subscribers that can be grouped are searched for according to the number of space directions occupied, in a more-to-less order. If the space directions occupied by the subscriber that is searched for, currently have no overlap with the space directions occupied by any existing subscriber in the group, then that subscriber will be included into the group. The searching then continues until all space directions in the group are occupied, or all subscribers have been searched through. 
         [0045]    In the characteristic pattern v, for example, the set of subscribers that are of the characteristic pattern cluster is denoted as K v ={ v,1 , k v,2 , . . . , k v,N     v   }, where, N v  is the number of subscribers that are of the cluster, k v,n  represents the subscriber label, and I k     v,n    is the set of corresponding space directions occupied by the subscriber. The set K v  is divided into M 2  subsets according to the number of space directions (i.e., length of I k     v,n   ) occupied by the subscribers, and the subset m is denoted as K v,m , K v,m ={k v,m,1  . . . k v,m,N     v,m   }, where, N v,m  is the number of subscribers in the subset, 
         [0000]    
       
         
           
             
               
                 
                   ∑ 
                   
                     m 
                     = 
                     1 
                   
                   
                     M 
                     2 
                   
                 
                  
                 
                   N 
                   
                     v 
                     , 
                     m 
                   
                 
               
               = 
               
                 N 
                 v 
               
             
             , 
             
               
                 and 
                  
                 
                   
                     ⋃ 
                     
                       m 
                       = 
                       1 
                     
                   
                   
                     M 
                     2 
                   
                 
                  
                 
                   K 
                   
                     v 
                     , 
                     m 
                   
                 
               
               = 
               
                 
                   K 
                   v 
                 
                 . 
               
             
           
         
       
     
         [0000]    All subscriber groups in the space resource division after grouping is denoted as K v   (g) ={K v,j   (g) , j=1 . . . N groups }, where, N groups  is the number of subscriber groups, and K v,j   (g)  is the set of subscriber labels in subscriber group j. The set of all space direction IDs is denoted as S={1, 2, . . . , M 2 }. In that characteristic pattern cluster, the space division subscriber grouping can be accomplished through the following steps:
 
Step 1: Group the subscribers that belong to the subset K v,M     2    into a separate group, i.e., K v,j   (g) ={k v,M     2     ,j }, and j=1, 2, . . . N v,M     2   . Initialize: K v   (g) ={K v,j   (g) , j=1, 2, . . . , N v,M     2   },and J=N v,M     2   +1.
 
Step 2: Search for and find a non-empty set K v,m , from m=(M 2 −1) to 1, and select subscriber k v,m,1  from the non-empty set as the first subscriber to be included into a group. Initialize intermediate set variables I temp =I k,v,m,1 , K v,J   (g) ={k v,m,1 }, and delete subscriber k v,m,1  from K v,m .
 
Step 3: Denote the number of space directions in I temp  as m temp . If m temp ≧M 2 /2, then initialize m′=M 2 −m temp ; if m temp &lt;M 2 /2, then initialize m′=m temp . Where, m′ is the label of subset to be searched for.
 
Step 4: Select subscribers from K v,m′  and add them into K v,J   (g)  in descending order of m′. If ∃k v,m′,i εK v,m′ , set I k     v,m′j   ∩I temp =Ø, update I temp =I k     v,m′,i   ∪I temp , K temp   (g) =K temp   (g) ∪{k v,m′,i }, and delete subscriber k v,m′,i  from K v,m′ ; otherwise go to Step 6.
 
Step 5: If I temp =S, then go to Step 6; otherwise update m′=min (m′, M 2 −m temp ) and return to Step 4 and repeat the cycle.
 
Step 6: Set K v   (g) =K v   (g) ∩{K v,J   (g) }. If all subscribers in K v  are grouped, then terminate the grouping cycle; otherwise set J=J+1, and return to Step 2 and repeat the cycle.
 
       (4) SDMA Transmission: 
       [0046]    The subscribers in the same space division subscriber group utilize their space resource divisions to carry out SDMA transmission, and the subscribers carry out signal transmission in the long-time statistical characteristic pattern by way of one or more column vectors in the corresponding unitary matrix. The signal transmission in the long-time statistical characteristic pattern for each subscriber can be implemented in all space directions or in some selected space directions occupied by the subscribers. 
         [0047]    The set of subscribers in a space division subscriber group is denoted as K={k 1 , k 2 , . . . , k G }, where, G represents the number of subscribers, and k g  represents the subscriber label. Since the space directions occupied by the subscribers have no overlap with each other, 
         [0000]    
       
         
           
             
               ⋂ 
               
                 k 
                 ∈ 
                 K 
               
             
              
             
               I 
               k 
             
           
         
       
     
         [0000]    is an empty set. Suppose the subscriber group belongs to space resource division v, i.e., v* k =v for kεK. For subscriber k, suppose the selected transmission directions as α k ⊂I k . Diagonal elements in a quantity not greater than a predefined threshold can be selected from A k,v*     k   , and the set of corresponding space directions is α k . The set α k  can be selected at the base station side, or selected at the subscriber terminal side and then can be notified to the base station through the feedback link. 
         [0048]      FIG. 2  is a schematic diagram of generation of transmitted signals in SDMA downlink in base station. The transmitted signals in the antenna domain in the base station are the sum of transmitted signals in the antenna domain of the SDMA subscribers, i.e.: 
         [0000]    
       
         
           
             
               
                 
                   
                     x 
                      
                     
                       ( 
                       n 
                       ) 
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         k 
                         ∈ 
                         K 
                       
                     
                      
                     
                       
                         x 
                         k 
                       
                        
                       
                         ( 
                         n 
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   10 
                   ) 
                 
               
             
           
         
       
     
         [0000]    Where, x k (n) represents the transmitted signals in antenna domain of subscriber k, and can be generated by long-time pre-coding with U v   α     k    and with the following formula: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           
                             x 
                             k 
                           
                            
                           
                             ( 
                             n 
                             ) 
                           
                         
                         = 
                           
                          
                         
                           
                             [ 
                             
                               
                                 
                                   ( 
                                   
                                     
                                       x 
                                       k 
                                       0 
                                     
                                      
                                     
                                       ( 
                                       n 
                                       ) 
                                     
                                   
                                   ) 
                                 
                                 T 
                               
                                
                               
                                 
                                   ( 
                                   
                                     
                                       x 
                                       k 
                                       1 
                                     
                                      
                                     
                                       ( 
                                       n 
                                       ) 
                                     
                                   
                                   ) 
                                 
                                 T 
                               
                                
                               
                                   
                               
                                
                               … 
                                
                               
                                   
                               
                                
                               
                                 
                                   ( 
                                   
                                     
                                       x 
                                       k 
                                       
                                         
                                           M 
                                           1 
                                         
                                         - 
                                         1 
                                       
                                     
                                      
                                     
                                       ( 
                                       n 
                                       ) 
                                     
                                   
                                   ) 
                                 
                                 T 
                               
                             
                             ] 
                           
                           T 
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             ( 
                             
                               
                                 I 
                                 
                                   M 
                                   1 
                                 
                               
                               ⊗ 
                               
                                 U 
                                 v 
                                 
                                   α 
                                   k 
                                 
                               
                             
                             ) 
                           
                            
                           
                             
                               s 
                               k 
                             
                              
                             
                               ( 
                               n 
                               ) 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   11 
                   ) 
                 
               
             
           
         
       
     
         [0000]    Where, s k (n) is the transmitted signal vector of subscriber k,           represents direct product operation, and I M     1    represents the identical matrix of M 1 ×M 1 . The transmitted signal vector s k (n) contains special pilot signals and data signals of subscriber k, and the data signals can be further generated by short-time pre-coding with short-time channel information. 
         [0049]      FIG. 3  is a schematic diagram of the processing of received signals in the SDMA uplink in the base station. The received signals y(n) in the antenna domain in the base station are demultiplexed by an SDMA demultiplexer into the signals ŝ k (n), kεK of the subscribers in corresponding space directions. The calculation formula is: 
         [0000]        ŝ   k ( n )=( I   M     1               U   v   α     k   ) H   y ( n )  (12)
 
         [0050]    The signals ŝ k (n) can contain special pilot signals and data signals, and therefore subsequent receiving treatments, such as channel estimation, detection, and decoding, etc., can be performed. 
       (5) Subscriber Scheduling and Dynamic Adjustment of Multiple Access Transmission: 
       [0051]    Subscriber scheduling operations described above, including subscriber characteristic pattern clustering for the subscribers and space division subscriber grouping, can then be performed as the long-time statistical characteristics R k  of the channels between the base station and the subscribers change with the movement of the subscribers. These operations are performed in order to generate updated subscriber classes of characteristic pattern and updated space division subscriber groups, and thereby carry out the SDMA transmission in the characteristic pattern described above. The long-time statistical characteristics vary, depending on the application scenario. Typically, the statistical time window for the long-time pre-coding technique is several to tens of times of the time window for transmission with short time pre-coding technique, and both the acquisition and exchange of relevant channel statistical information is carried out in a large time span. 
         [0052]    In the embodiments of the present invention, it should be appreciated that the method disclosed can be implemented in other ways, without departing from the spirit and scope of the present invention. The embodiments provided here are only exemplary, and shall not be deemed as constituting any limitation to the present invention, and the content described shall not be deemed as constituting any limitation to the object of the patent application. For example, a plurality of units or components can be combined or integrated into another system, or some features can be omitted, or excluded from the execution. 
         [0053]    While the present invention has been illustrated and described with reference to some preferred embodiments, the present invention is not limited to these. Those skilled in the art should recognize that various variations and modifications can be made without departing from the spirit and scope of the present invention as defined by the accompanying claims.