# Patent

## Title
Fixed multiple access wireless communication

## Abstract

Disclosed is a user terminal for wireless communication with a remote access point. The user terminal may include a mapping module adapted to map one or more input data bits to an uplink symbol, a delay module adapted to apply a delay to the uplink symbol, a transmit module adapted to modulate the delayed symbol into a frequency channel, and an antenna being adapted to transmit the modulated symbol to the access point. The delay can be chosen such that the transmitted symbol arrives at the access point simultaneously with a further symbol modulated into the frequency channel and transmitted by a further user terminal.

## Background
CROSS-REFERENCES TO RELATED APPLICATIONS
This application is a continuation of U.S. patent application Ser. No. 14/163,575, filed Jan. 24, 2014, which is a divisional of U.S. patent application Ser. No. 12/746,911, filed Aug. 27, 2010 (now U.S. Pat. No. 8,675,512), which is the National Stage of International Application No. PCT/AU2009/001022 filed Aug. 10, 2009, and which claims the benefit of Australian Patent Application No. 2008904556, filed Sep. 2, 2008, the disclosures of which are all incorporated herein by reference.


FIELD OF THE INVENTION
The present invention relates generally to wireless communication and, in particular, to wireless communication between sparsely distributed fixed user stations and a fixed access point.
BACKGROUND
Providing an inexpensive high-capacity bidirectional data link to user terminals in remote areas poses many challenges. Because user terminals in remote areas are typically distributed sparsely over a large geographic area (e.g. tens of terminals over hundreds of square kilometres), the cost of deploying a wired network is prohibitive. Wireless communication networks, with a point-to-multipoint topology comprising a network hub or access point with which multiple user terminals communicate independently and bidirectionally, are a more promising technology to deploy.
In digital broadcasting a video stream of 20 MBits/sec can be delivered from an access point to any number of user terminals over a radius of tens of kilometres within a 7 MHz bandwidth in the VHF frequency band. However, in a broadcasting application the data is unidirectional and common to all user terminals, so the required capacity to service all users is independent of the number of user terminals.
Candidate wireless technologies for independent bidirectional data transmission such as WiMAX (IEEE 802.16), which typically operates at a carrier frequency above 2 GHz, suffer from two related problems:

    1. Inadequate coverage. The distance between an access point and a user terminal is limited to less than 10 kilometres at a carrier frequency above 2 GHz using an access point antenna height of less than 30 m in a point-to-multipoint topology.
    2. Inadequate capacity. Current WiMAX technology typically provides a spectral efficiency of 2 to 5 bits/sec/Hz (i.e. 20 to 50 MBits/sec per 10 MHz frequency channel). This capacity needs to be shared among, potentially, thousands of users. To provide simultaneous access at data rates of 1 to 20 MBits/s to this number of users from a single access point requires a prohibitively large bandwidth at the carrier frequency.


There is a tradeoff between these two problems in that capacity can be sacrificed for coverage, or vice versa, by decreasing or increasing the carrier frequency respectively. A possible way out of the tradeoff is to increase the transmit power from the access point and the user terminals. This however increases the cost of the system.
A satisfactory compromise providing acceptable bidirectional data rates to all users in a sufficiently wide coverage area at low enough power levels to yield acceptable cost is yet to be found with WiMAX or other conventional technologies.
SUMMARY
It is an object of the present invention to substantially overcome, or at least ameliorate, one or more disadvantages of existing arrangements.
Disclosed are arrangements which seek to address the above problems, for example, a wireless communication system in which multiple user terminals are accurately synchronised in time and frequency to allow the parallel uplink data streams from the user terminals to be effectively separated at the access point. Because the system relies predominantly on line-of-sight transmission, the user terminal antennas are directional, saving power on the uplink.
According to a first aspect of the present disclosure, there is provided a user terminal for wireless communication with a remote access point, the user terminal comprising a mapping module adapted to map one or more input data bits to an uplink symbol; a delay module adapted to apply a delay to the uplink symbol; a transmit module adapted to modulate the delayed symbol into a frequency channel; and a directional antenna oriented along a dominant path to the access point, the antenna being adapted to transmit the modulated symbol to the access point, wherein the delay is chosen such that the transmitted symbol arrives at the access point simultaneously with a further symbol modulated into the frequency channel and transmitted by a further user terminal.
According to a second aspect of the present disclosure, there is provided a system for wireless communication comprising an access point adapted to wirelessly communicate data symbols in at least one of two or more different frequency channels, and two or more different time slots of a frequency channel; and a plurality of user terminals, each user terminal being adapted to communicate the data symbols in one time slot of one frequency channel, wherein each user terminal with the same azimuthal ordering modulo the number of different frequency channels or time slots is adapted to communicate the data symbols in the same frequency channel and in the same time slot.
Other aspects are also disclosed.



BRIEF DESCRIPTION OF THE DRAWINGS
One or more embodiments of the present invention will now be described with reference to the drawings, in which:
FIG. 1a is an illustration of a wireless communication system in which the embodiments of the present invention may be practised;
FIG. 1b illustrates, in exaggerated scale, the access point and one of the user terminals of FIG. 1a in more detail;
FIG. 2 is a block diagram of the signal processing system for the downlink at the access point of FIG. 1b; 
FIG. 3 is a block diagram of the signal processing system for the downlink at the user terminal of FIG. 1b; 
FIG. 4 is a block diagram of the signal processing system for the uplink at the user terminal of FIG. 1b; 
FIG. 5 is a block diagram of the signal processing system for the uplink at the access point of FIG. 1b; 
FIG. 6 illustrates a network with 12 user terminals sparsely distributed around an access point within an annular region bounded by two concentric circles;
FIG. 7 shows an example of grouping user terminals to provide differentiated data rates;
FIG. 8 shows an example of an arrangement of access point antennas to reduce mutual coupling; and
FIG. 9 illustrates the operation of the Delay module in the user terminal uplink system of FIG. 4.



DETAILED DESCRIPTION
Where reference is made in any one or more of the accompanying drawings to steps and/or features, which have the same reference numerals, those steps and/or features have for the purposes of this description the same function(s) or operation(s), unless the contrary intention appears.
FIG. 1a is an illustration of a wireless communication system 100 in which the embodiments of the invention may be practised. The system 100 includes an access point 105 in bidirectional wireless communication in a single time slot of a single frequency channel with M user terminals, e.g. 115, at fixed locations sparsely distributed within a circular area 125, with a typical radius of tens of kilometres. In the illustration M=8, but any value of M is possible up to and including the number N of access point antennas. The access point is 105 typically connected to another network, for example the public-switched telephone network.
FIG. 1b illustrates, in exaggerated scale, the access point 105 and one of the user terminals 115 of the system 100 in more detail. The access point 105 includes an array 110 of N vertically polarised antennas uniformly arranged in a horizontal circle, elevated from the ground by mounting on a tower. The antenna array 110 is used for both transmitting and receiving data. The bidirectional communication is performed in a time division duplexing (TDD) manner. The circular array 110 is just one example of an arrangement of antennas at the access point 105; other possible arrangements are linear, square, and arc. The spacing of the antenna array 110 need not be uniform. The performance of the system 100, as described below, improves as the antenna spacing increases as a ratio of the carrier wavelength, but clearly there are practical limits on the spacing. The access point 105 antennas, illustrated as half-wave dipoles, may be of any omni-directional design. Directional antennas can also be used at the access point 105, provided that the number of simultaneous user terminals operating in the same frequency channel within any particular region does not exceed the number of access point directional antennas covering the region. In this case, each region may be treated independently as serviced by a single instance of the system 100.
Also shown in FIG. 1b is a user terminal 115, illustrated as a house with a directional antenna (illustrated as a Yagi antenna) 120 mounted thereon, used for both transmitting and receiving data. In the remote-area environment for which the system 100 is designed, the line-of-sight signal path 130 between the user terminal antenna 120 and the access point array 110 is usually the dominant path, with the only other signal path of significance being a ground reflection path 140. The main beam of the antenna 120 is therefore oriented along the direction of the access point 105. Alternatively, if it is known that at a particular user terminal location, the dominant path to the access point is not line-of-sight (e.g. reflection from a mountain), then the main beam of the user terminal antenna 120 can be oriented along the non-line-of-sight dominant path.
FIG. 2 is a block diagram of the signal processing system 200 for the downlink (i.e. transmission from the access point 105 to the user terminal 115) at the access point 105 of the system 100. Binary downlink data (DD) intended for the m-th user terminal (UT) 115 (m=1, 2, . . . , M), typically obtained from the network to which the access point 105 is connected, is routed through the UTm DD module 210-m. The downlink data is optionally coded by a forward error correction (FEC) encoder (not shown) at the cost of some data redundancy, i.e. a reduced data rate. The binary downlink data is then mapped onto a multi-level quadrature amplitude modulation (M-QAM) or a multi-level phase shift keying (M-PSK) symbol constellation, by the Map module 220-m to produce downlink data symbols sD,m to be transmitted to the m-th user terminal. The M-QAM or M-PSK transmitted symbols are allocated by the Map module 220-m to bit groupings with q bits per symbol.
Channel information, obtained from a channel estimation module 235, is used by a zero-forcing precoder (ZFP) module 230 to perform zero-forcing precoding on the downlink data symbols sD,m as described below. The downlink channel information is obtained from the uplink channel information using the principle of reciprocity as described below. The uplink channel information is estimated by sending training signals from the user terminals to the access point. The training signals are known both to the user terminals and the access point prior to the transmission. The training signal from one user terminal is orthogonal to the training signals from all other user terminals. For example, a training signal is sent from only one user terminal at one time so that the information for the uplink channels from the user terminal antenna to N access point antennas can be estimated without interference from the transmissions of the other users. In other embodiments, the training signals from different users can be made orthogonal in frequency or in code.
The resulting precoded symbols are scaled by a common factor, and the scaled precoded symbols xD,n (n=1, 2, . . . , N) are modulated onto a common carrier in the frequency channel by an access point transmit (APn Tx) module 240-n and transmitted via a corresponding transmit antenna 250-n which is part of the access point array 110.
FIG. 3 is a block diagram of the signal processing system 300 for the downlink at the m-th user terminal 115 (m=1, 2, . . . , M) of the system 100. The m-th user terminal receive (UTm Rx) module 310 receives and demodulates symbols rD,m from the antenna 305. Each received symbol rD,m is scaled by a scaling factor β, defined below, at the scaling module 320 to produce scaled symbols zD,m. The detection of downlink symbols ŝD,m from the scaled received symbols zD,m is performed by the DET module 330 as described below. The De-map module 340 performs de-mapping of detected data symbols ŝD,m to binary data according to the symbol constellation used by the map module 220-m. The binary downlink data is passed to the data sink (UTm DS) module 350. In the case of FEC coded transmission, the DET module 330 includes a soft decision estimator, the De-map module 340 includes a bit value probability estimator, and the UTm DS module 350 includes a FEC decoder (not shown).
The zero-forcing precoding allows the downlink portion of the system 100 to function like an SDMA (space-division-multiple-access) system whereby symbols sharing a single timeslot and a single frequency are transmitted to be received by corresponding user terminals at different locations.
FIG. 4 is a block diagram of the signal processing system 400 for the uplink (transmission from the user terminal 115 to the access point 105) at the m-th user terminal 115 (m=1, 2, . . . , M) of the system 100. The bidirectional communication is performed in a TDD manner. Input binary uplink data (UD) from the m-th user terminal is generated in the UTm UD module 410. The uplink data from the UTm UD module 410 is optionally coded by an FEC encoder (not shown). The binary uplink data from the UTm UD module 410 is then mapped by the Map module 420 onto a M-QAM or M-PSK symbol constellation to produce uplink data symbols sU,m. The time information from a Global Positioning System (GPS) receiver 440 is used by the Delay module 430 to synchronise the transmission of symbols from the user terminal 115 with the other user terminals. A commercially available GPS module that is capable of providing a timing accuracy of less than 15 ns and a frequency accuracy of less than 30 parts per billion (ppb) can be used for this purpose. The accurate time information available from the public data of the GPS allows user terminals to synchronise their transmission to within 15 ns, which is effectively simultaneous for equalisation purposes at the frequency channels in use. The function of the delay module 430 is to ensure that the transmitted symbols from all the user terminals are simultaneously (to symbol precision) received at the access point 105 regardless of the location of the user terminals. The propagation delay due to the distance from the access point 105 is determined, for example, from the location of the user terminal 115 given by the GPS receiver 440, or from the time of arrival computed with reference to the time information provided by the GPS receiver 440 of an accurate time signal sent from the access point 105 to the user terminal 115. The propagation delay is taken into account by the Delay module 430 to compute the delay that is applied by the Delay module 430.
The operation of the delay module 430 is described with reference to FIG. 9. Three sequences 910, 915, and 920 of uplink data symbols sU,m(i) from three user terminals (m=1, 2, 3) are shown against the time axis 905, starting from the instant 925 representing the beginning of the user terminals' time frame with reference to their respective GPS time information. If no delay is applied by Delay module 430, the symbol sequences 910, 915, and 920 become receive symbol sequences rU,n(i) 935, 940, and 945 on arrival at the access point antennas (n=1, 2, 3). Because the user terminals are at different distances from the access point, each received symbol sequence is delayed by a respective propagation delay 932, 937, or 942, and are therefore no longer synchronised with each other. If however each Delay module 430 applies a delay 957, 962, or 967 that is complementary to the corresponding propagation delay 932, 937, or 942 to form a delayed uplink symbol sequence xU,m(i) 955, 960, or 965 respectively, the combination of the applied delays and the propagation delays results in received symbol sequences rU,n(i) 975, 980, and 985 that are synchronised at the access point at the instant 990.
A conventional SDMA access point needs to perform symbol synchronisation (which determines the beginning of each symbol) and carrier offset correction (which determines the difference in frequency between the frequency reference used in a user terminal and the frequency reference used at the access point) for each user terminal. By taking into account the propagation delay at the transmission from the user terminals, and thereby synchronising the reception at the access point to symbol precision, the access point needs to perform symbol synchronisation only once for all user terminals. Similarly, by using the same frequency reference obtained from the GPS signal at every user terminal, the access point needs to perform carrier offset correction only once for all user terminals. If the access point also uses the same frequency reference obtained from the GPS signal, then no carrier offset correction is required. The effects of Doppler shift are small due to the existence of dominant line-of-sight path and the fixed access point and user terminals. This greatly simplifies the signal processing required to detect symbols from each user terminal received at the same time slot in the same frequency channel. Notably, conventional MIMO signal processing techniques, such as V-BLAST, can then be used within the system 100.
The delay module 430 also scales each uplink data symbol sU,m as described below. The scaled, delayed uplink symbol xU,m is modulated onto a common carrier in the frequency channel by the user terminal transmit (UTm Tx) module 450 and transmitted by the antenna 460. The directional nature of the antenna 460 (typically with an antenna gain of 10 to 20 dBi) enables the transmitted power for the uplink to be much lower than would be required if the antenna 460 were omni-directional to provide the same SNR at the access point 105.
The carrier frequency reference for the UTm Tx module 450 is given by the GPS receiver 440, so that the frequency reference of each user terminal 115 is synchronised with the access point 105 to an accuracy of, for example, 30 parts per billion. The time and frequency synchronisation of the multiple user terminals, together with the multiple antennas at the access point 105, gives the system 100 the characteristics of a multiple-input multiple-output (MIMO) system, which is normally employed to increase the capacity of a link between two terminals in conditions of severe multipath propagation. By contrast with the system herein disclosed, conventional MIMO systems utilise omni-directional antennas at both terminals to maximise the diversity order of the multipath channel.
FIG. 5 is a block diagram of the signal processing system 500 for the uplink at the access point 105 of the system 100. The n-th (n=1, 2, . . . , N) access point receive (APn Rx) module 520-n receives a signal from a corresponding antenna 510-n and demodulates symbols rU,n from the received signal. Zero-forcing equalisation is performed by the module 530 as described below to produce equalised symbols zU,m (m=1, 2, . . . , M). The detection of transmitted symbols ŝU,m from the equalised symbols zU,m is performed by the DET module 540-m as described below. The De-map module 550-m performs de-mapping of detected data symbols ŝU,m to binary uplink data, which is passed onto the m-th user terminal uplink data sink (UTm US) module 560-m. In the case of FEC coded transmission, the DET module 540-m includes soft decision estimation, the De-map module 550-m includes bit value probability estimation, and the UTm US module 560-m includes a FEC decoder (not shown).
The downlink channel, through which downlink transmit symbols xD,n from the n-th access point transmitter 240-n become received symbols rD,m at the m-th user terminal receive module 310, is modelled as a matrix multiplication:




  
    
      
        
          [
          
            
              
                
                  r
                  
                    D
                    ,
                    1
                  
                
              
            
            
              
                
                  r
                  
                    D
                    ,
                    2
                  
                
              
            
            
              
                ⋮
              
            
            
              
                
                  r
                  
                    D
                    ,
                    M
                  
                
              
            
          
          ]
        
        =
        
          
            
              [
              
                
                  
                    
                      g
                      
                        D
                        ,
                        1
                        ,
                        1
                      
                    
                  
                  
                    
                      g
                      
                        D
                        ,
                        1
                        ,
                        2
                      
                    
                  
                  
                    ...
                  
                  
                    
                      g
                      
                        D
                        ,
                        1
                        ,
                        M
                      
                    
                  
                
                
                  
                    
                      g
                      
                        D
                        ,
                        2
                        ,
                        1
                      
                    
                  
                  
                    
                      g
                      
                        D
                        ,
                        2
                        ,
                        2
                      
                    
                  
                  
                    ...
                  
                  
                    
                      g
                      
                        D
                        ,
                        2
                        ,
                        M
                      
                    
                  
                
                
                  
                    ⋮
                  
                  
                    ⋮
                  
                  
                    ⋱
                  
                  
                    ⋮
                  
                
                
                  
                    
                      g
                      
                        D
                        ,
                        M
                        ,
                        1
                      
                    
                  
                  
                    
                      g
                      
                        D
                        ,
                        M
                        ,
                        2
                      
                    
                  
                  
                    ...
                  
                  
                    
                      g
                      
                        D
                        ,
                        M
                        ,
                        N
                      
                    
                  
                
              
              ]
            
            ⁡
            
              [
              
                
                  
                    
                      x
                      
                        D
                        ,
                        1
                      
                    
                  
                
                
                  
                    
                      x
                      
                        D
                        ,
                        2
                      
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      x
                      
                        D
                        ,
                        N
                      
                    
                  
                
              
              ]
            
          
          +
          
            [
            
              
                
                  
                    n
                    
                      D
                      ,
                      1
                    
                  
                
              
              
                
                  
                    n
                    
                      D
                      ,
                      2
                    
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    n
                    
                      D
                      ,
                      M
                    
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        1
        )
      
    
  




where gD,m,n is the complex-valued (m, n)-th element of the downlink channel matrix GD (M rows by N columns), and nD,m is the additive noise at the m-th user terminal receive module 310.
Equation (1) may be rewritten as

rD=GDxD+nD  (2)

Define a pseudo-inverse, WD, of GD as follows:

WD=(GDHGD)−1GDH  (3)

where H indicates the Hermitian (complex conjugate transpose) of a matrix.
WD is a N×M matrix enumerated as




  
    
      
        
          W
          D
        
        =
        
          [
          
            
              
                
                  w
                  
                    D
                    ,
                    1
                    ,
                    1
                  
                
              
              
                
                  w
                  
                    D
                    ,
                    1
                    ,
                    2
                  
                
              
              
                ...
              
              
                
                  w
                  
                    D
                    ,
                    1
                    ,
                    M
                  
                
              
            
            
              
                
                  w
                  
                    D
                    ,
                    2
                    ,
                    1
                  
                
              
              
                
                  w
                  
                    D
                    ,
                    2
                    ,
                    2
                  
                
              
              
                
                  
                
              
              
                
                  w
                  
                    D
                    ,
                    2
                    ,
                    M
                  
                
              
            
            
              
                ⋮
              
              
                ⋮
              
              
                ⋱
              
              
                ⋮
              
            
            
              
                
                  w
                  
                    D
                    ,
                    N
                    ,
                    1
                  
                
              
              
                
                  w
                  
                    D
                    ,
                    N
                    ,
                    2
                  
                
              
              
                ...
              
              
                
                  w
                  
                    D
                    ,
                    N
                    ,
                    M
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        4
        )
      
    
  




that satisfies

WDGD=IN 

The zero-forcing pre-coding carried out at the access point 105 by the module 230 is defined as follows:




  
    
      
        
          
            x
            D
          
          =
          
            
              
                
                  NP
                  D
                
                
                  
                    
                    
                      W
                      D
                    
                    
                  
                  2
                
              
            
            ⁢
            
              W
              D
            
            ⁢
            
              s
              D
            
          
        
        ⁢
        
          

        
        ⁢
        where
      
    
    
      
        (
        5
        )
      
    
  
  
    
      
        
          s
          D
        
        =
        
          [
          
            
              
                
                  s
                  
                    D
                    ,
                    1
                  
                
              
            
            
              
                
                  s
                  
                    D
                    ,
                    2
                  
                
              
            
            
              
                ⋮
              
            
            
              
                
                  s
                  
                    D
                    ,
                    M
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        6
        )
      
    
  




is the vector of user terminal downlink symbols, PD is a time-averaged transmitting power from an access point transmit antenna 250-n, and




  
    
      
        
          
            
            
              W
              D
            
            
          
          2
        
        =
        
          
            ∑
            
              n
              =
              1
            
            N
          
          ⁢
          
            
              ∑
              
                m
                =
                1
              
              M
            
            ⁢
            
              
                
                
                  w
                  
                    D
                    ,
                    n
                    ,
                    m
                  
                
                
              
              2
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




The scaling by √{square root over (NPD/∥WD∥2)} if makes sure that the total transmitting power from the access point transmitters 240-n is constrained to NPD.
Substituting (5) into (2) gives




  
    
      
        
          r
          D
        
        =
        
          
            
              
                
                  
                    NP
                    D
                  
                  
                    
                      
                      
                        W
                        D
                      
                      
                    
                    2
                  
                
              
              ⁢
              
                G
                D
              
              ⁢
              
                W
                D
              
              ⁢
              
                s
                D
              
            
            +
            
              n
              D
            
          
          =
          
            
              
                
                  
                    NP
                    D
                  
                  
                    
                      
                      
                        W
                        D
                      
                      
                    
                    2
                  
                
              
              ⁢
              
                s
                D
              
            
            +
            
              n
              D
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




The scaling factor β used by the scaling module 320 at each user terminal before detection of downlink symbols is defined as √{square root over (∥WD∥2/(NPD))}, so that:




  
    
      
        
          z
          D
        
        =
        
          
            
              
                
                  
                    
                    
                      W
                      D
                    
                    
                  
                  2
                
                
                  NP
                  D
                
              
            
            ⁢
            
              r
              D
            
          
          =
          
            
              s
              D
            
            +
            
              
                
                  
                    
                      
                      
                        W
                        D
                      
                      
                    
                    2
                  
                  
                    NP
                    D
                  
                
              
              ⁢
              
                n
                D
              
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




or, at the user terminal m,




  
    
      
        
          z
          
            D
            ,
            m
          
        
        =
        
          
            s
            
              D
              ,
              m
            
          
          =
          
            
              
                
                  
                    
                    
                      W
                      D
                    
                    
                  
                  2
                
                
                  NP
                  D
                
              
            
            ⁢
            
              n
              
                D
                ,
                m
              
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




The value of β is provided at each user terminal 115 prior to the reception of data symbols. This can be achieved, for example, by sending a known reference signal from the access point 105. While an accurate value of β at the user terminal 115 improves the accuracy of the de-mapping, the scaling factor β can also be estimated at the user terminal 115 from, for example, the variance of the received symbols, provided that the variance of the noise component is smaller than that of the signal component.
The detection of transmitted symbols is performed by the DET module 330 as a “hard decision”:




  
    
      
        
          
            s
            ^
          
          
            D
            ,
            m
          
        
        =
        
          arg
          ⁢
          
            
          
          ⁢
          
            
              min
              
                
                  s
                  i
                
                ∈
                Q
              
            
            ⁢
            
              
              
                
                  z
                  
                    D
                    ,
                    m
                  
                
                -
                
                  s
                  i
                
              
              
            
          
        
      
    
    
      
        (
        11
        )
      
    
  




where si, i=1, 2, . . . , 2q, is the i-th symbol in the chosen M-QAM or M-PSK constellation Q.
Like the downlink channel, the uplink channel is modelled as a matrix multiplication:




  
    
      
        
          [
          
            
              
                
                  r
                  
                    U
                    ,
                    1
                  
                
              
            
            
              
                
                  r
                  
                    U
                    ,
                    2
                  
                
              
            
            
              
                ⋮
              
            
            
              
                
                  r
                  
                    U
                    ,
                    N
                  
                
              
            
          
          ]
        
        =
        
          
            
              [
              
                
                  
                    
                      g
                      
                        U
                        ,
                        1
                        ,
                        1
                      
                    
                  
                  
                    
                      g
                      
                        U
                        ,
                        1
                        ,
                        2
                      
                    
                  
                  
                    ...
                  
                  
                    
                      g
                      
                        U
                        ,
                        1
                        ,
                        M
                      
                    
                  
                
                
                  
                    
                      g
                      
                        U
                        ,
                        2
                        ,
                        1
                      
                    
                  
                  
                    
                      g
                      
                        U
                        ,
                        2
                        ,
                        2
                      
                    
                  
                  
                    ...
                  
                  
                    
                      g
                      
                        U
                        ,
                        2
                        ,
                        M
                      
                    
                  
                
                
                  
                    ⋮
                  
                  
                    ⋮
                  
                  
                    ⋱
                  
                  
                    ⋮
                  
                
                
                  
                    
                      g
                      
                        U
                        ,
                        N
                        ,
                        1
                      
                    
                  
                  
                    
                      g
                      
                        U
                        ,
                        N
                        ,
                        2
                      
                    
                  
                  
                    ...
                  
                  
                    
                      g
                      
                        U
                        ,
                        N
                        ,
                        M
                      
                    
                  
                
              
              ]
            
            ⁡
            
              [
              
                
                  
                    
                      x
                      
                        U
                        ,
                        1
                      
                    
                  
                
                
                  
                    
                      x
                      
                        U
                        ,
                        2
                      
                    
                  
                
                
                  
                    ⋮
                  
                
                
                  
                    
                      x
                      
                        U
                        ,
                        M
                      
                    
                  
                
              
              ]
            
          
          +
          
            [
            
              
                
                  
                    n
                    
                      U
                      ,
                      1
                    
                  
                
              
              
                
                  
                    n
                    
                      U
                      ,
                      2
                    
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    n
                    
                      U
                      ,
                      N
                    
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        12
        )
      
    
  




where rU,n and nU,n are the received uplink symbol and the noise respectively at the n-th access point receive module 520-n, xU,m is the transmitted uplink symbol from the m-th user terminal transmit module 450, and gU,n,m is the complex-valued uplink channel coefficient between the m-th user terminal transmit module 450 and the n-th access point receive module 520-n. 
Equation (12) may be rewritten in matrix form as

rU=GUxU+nU  (13)

where GU is the N by M matrix whose (n, m)-th entry is gU,n,m.
Since the same frequency channel is used for the downlink and the uplink, the reciprocity principle states that gD,m,n=gU,n,m or

GD=GUT  (14)

where the superscript T indicates the transpose of a matrix.
Write




  
    
      
        
          s
          U
        
        =
        
          [
          
            
              
                
                  s
                  
                    U
                    ,
                    1
                  
                
              
            
            
              
                
                  s
                  
                    U
                    ,
                    2
                  
                
              
            
            
              
                ⋮
              
            
            
              
                
                  s
                  
                    U
                    ,
                    M
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        15
        )
      
    
  




where sU,m is a M-QAM or M-PSK uplink data symbol from the user terminal uplink mapping module 420. Then the scaling at the delay module 430 of the user terminal 115 is

xU,m=√{square root over (PU)}sU,m  (16)

where PU is the time-averaged transmit power of each user terminal antenna 460. (The transmit power from each user terminal transmit antenna 120 is the same.) Like the scaling in the module 320, the scaling by PU makes sure that the transmitting power from the user terminal transmit antenna 460 is constrained to PU.
Define a pseudo inverse, WU, of GU as

WU=(GUHGU)−1GUH  (17)

Wu is a M×N matrix that satisfies

WUGU=IM  (18)

Note that, because of equations (3) and (14),

WUT=WD  (19)

The zero-forcing equalisation performed by the module 530 of the access point 105 is defined using the uplink channel pseudo-inverse matrix WU as follows:




  
    
      
        
          
            z
            U
          
          =
          
            
              
                1
                
                  
                    P
                    U
                  
                
              
              ⁢
              
                W
                U
              
              ⁢
              
                r
                U
              
            
            =
            
              
                
                  
                    1
                    
                      
                        P
                        U
                      
                    
                  
                  ⁢
                  
                    W
                    U
                  
                  ⁢
                  
                    G
                    U
                  
                  ⁢
                  
                    x
                    U
                  
                
                +
                
                  
                    1
                    
                      
                        P
                        U
                      
                    
                  
                  ⁢
                  
                    W
                    U
                  
                  ⁢
                  
                    n
                    U
                  
                
              
              =
              
                
                  s
                  U
                
                +
                
                  
                    1
                    
                      
                        P
                        U
                      
                    
                  
                  ⁢
                  
                    W
                    U
                  
                  ⁢
                  
                    n
                    U
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        or
      
    
    
      
        (
        20
        )
      
    
  
  
    
      
        
          
        
        ⁢
        
          
            z
            
              U
              ,
              m
            
          
          =
          
            
              s
              
                U
                ,
                m
              
            
            +
            
              
                1
                
                  
                    P
                    U
                  
                
              
              ⁢
              
                
                  ∑
                  
                    n
                    =
                    1
                  
                  N
                
                ⁢
                
                  
                    w
                    
                      U
                      ,
                      m
                      ,
                      n
                    
                  
                  ⁢
                  
                    n
                    
                      U
                      ,
                      n
                    
                  
                
              
            
          
        
      
    
    
      
        (
        21
        )
      
    
  




The values of WU/√{square root over (PU)} are provided to the access point uplink equaliser 530 prior to the reception of data symbols. This can be achieved, for example, by sending known reference signals from each user terminal to the access point 105.
The detection of uplink data symbols from the m-th user terminal is performed by the Det module 540-m as a “hard decision”:




  
    
      
        
          
            s
            ^
          
          
            U
            ,
            m
          
        
        =
        
          arg
          ⁢
          
            
          
          ⁢
          
            
              min
              
                
                  s
                  i
                
                ∈
                Q
              
            
            ⁢
            
              
              
                
                  z
                  
                    U
                    ,
                    m
                  
                
                -
                
                  s
                  i
                
              
              
            
          
        
      
    
    
      
        (
        22
        )
      
    
  




where si, i=1, 2, . . . , 2q, is the i-th symbol in the chosen M-QAM or M-PSK constellation Q.
Alternatives to zero-forcing pre-coding such as regularised inverse pre-coding and vector perturbation can be used at the module 230 of the access point 105. Similarly, for the uplink transmission, conventional spatial multiplexing MIMO equalisation techniques, such as list sphere detection and V-BLAST, can be used as alternatives to zero-forcing equalisation at the module 530 of the access point 105. Also, wideband modulation by conventional techniques such as orthogonal frequency division multiplexing (OFDM) is an alternative to single frequency carrier modulation at the transmit modules 240-n and 450.
The capacity of each link in bits/s/Hz is directly proportional to the value of M, subject to the requirement that M≦N, as long as the bit error rate (BER) is very small. However, as M approaches N, the BER increases. Other factors that adversely affect the BER are:

    
    
        Lower signal-to-noise ratio (SNR) at the user terminal (downlink) and at the access point (uplink);
        Denser symbol constellation (i.e. larger value of q);
        Smaller separation of the antennas in the access point antenna array 110;
        Greater distance between the access point 105 and the user terminals 115;
        Smaller angular separation between the user terminals 115.
    
    


Using FEC encoding as described above, erroneous bits can be corrected at the cost of redundancy, so a rise in BER translates to a fall in error-free data rate.
A practical upper limit on M, given other system parameters (e.g. maximum distance of 60 km, a carrier frequency of 600 MHz, a 16-point QAM symbol constellation, a spectral efficiency of 2M bits/sec/Hz, an uncoded BER of 1%, and an SNR of up to 100 dB) is roughly N/2, while the separation between antennas in the access point array 110 should be at least half the wavelength of the carrier.
To increase the number M of user terminals served by a particular access point beyond the practical limit, additional frequency channels may be allocated. For example, 10 frequency channels can be utilised by one access point with 100 antennas to serve 500 user terminals simultaneously, where each of 10 frequency channels serves one group of 50 user terminals. Alternatively, the capacity of one frequency channel may be shared between multiple user groups by assigning the groups to different time slots. With 10 time slots, 500 user terminals can be served within one frequency channel, where each user terminal obtains one tenth of the original data rate. In these cases, assuming predominantly line-of-sight propagation, there is a choice in how the 500 sparsely distributed user terminals are grouped into 10 groups.
FIG. 6 illustrates a network 600 with 12 user terminals, e.g. 605, sparsely distributed around an access point 610 within an annular region bounded by two concentric circles marking a minimum and a maximum range. The user terminals are ordered from 1 to 12 by azimuth from a reference direction 620, as shown in FIG. 6. As mentioned above, transmitting independent data to two different user terminals is more error-prone when the two user terminals are located with a small angular (azimuthal) separation, for example the user terminals 4 and 5. This effect can be minimised by assigning user terminals with small azimuthal separation into different groups. In the network 600, the 12 user terminals would be grouped into two groups as follows: Group 1 consists of user terminals {1, 3, 5, 7, 9, 11} and Group 2 consists of user terminals {2, 4, 6, 8, 10, 12}. This grouping paradigm maximises the minimum azimuthal separation between each pair of user terminals that are adjacent in order of azimuth within a group.
More generally, the user terminal indices (after ordering user terminals by azimuth) making up the k-th group out of K groups, given a total number of user terminals KM, are

{k+(l−1)K,l=1,2, . . . ,M}. 

i.e. Group k comprises those user terminals whose azimuthal ordering index is equal to k modulo K. In this grouping paradigm, the required SNR to achieve the same BER performance is the same for both groups. In other words, the error-free data rates achievable at the same SNR are the same for both groups.
In a system with both multiple time slots and multiple frequency channels available, the grouping may be dynamic, because not all user terminals wish to send or receive data at every time slot. In this embodiment, for each time slot, the user terminals wishing to send or receive data will be grouped by azimuth among the frequency channels. This further increases the average azimuthal separation between user terminals in the same group.
An alternative to grouping user terminals so as to provide the same performance (BER vs SNR) among all user terminals is to group user terminals to provide differentiated performance. Grouping in this paradigm can be based on distance from the access point, propagation path loss, or received power at the user terminal.
FIG. 7 shows an example 700 of grouping user terminals to provide differentiated data rates. In the first time slot (or the first frequency channel), users 1 to 6, closer to the access point 710 than a threshold distance 720, are grouped together. In the second time slot (or the second frequency channel), users 7 to 12, further away from the access point 710 than the threshold distance 720, are grouped together. In this grouping paradigm, the required SNR to achieve the same BER performance is smaller for the first group than for the second group. In other words, the error-free data rates achievable at the same SNR are higher for the first group than for the second group.
With half-wavelength spacing of the antennas in the access point array 110 as described above, the effect of mutual coupling between antennas may significantly reduce the performance. The effect of mutual coupling can be reduced if the access point antennas are displaced vertically. FIG. 8 shows an example of such an arrangement 800 of the access point antennas, e.g. 810, to reduce mutual coupling. In the arrangement 800, adjacent vertically polarised antenna elements 810 are still separated by half a wavelength horizontally, but they are also displaced vertically by their length, to reduce mutual coupling. The vertical displacement is cyclical with a period of four antennas. The nearest horizontally collocated antennas, 810 and 820, are separated by two wavelengths, in which case the effect of mutual coupling is insignificant. The spacing of horizontally collocated antennas can be increased by increasing the period of the cyclical vertical displacement.
Each module of FIGS. 2 to 5 is preferably implemented in dedicated hardware such as one or more integrated circuits performing the functions or sub-functions of the module as described above. Such dedicated hardware may include graphic processors, digital signal processors, or one or more microprocessors and associated memories.
It is apparent from the above that the arrangements described are applicable to the wireless communication industry.
The foregoing describes only some embodiments of the present invention, and modifications and/or changes can be made thereto without departing from the scope and spirit of the invention, the embodiments being illustrative and not restrictive.

## Claims

1. A user terminal for wireless communication with a remote access point, the user terminal comprising:
a mapping module adapted to map one or more input data bits to an uplink symbol;
a delay module adapted to apply a delay to said uplink symbol;
a transmit module adapted to modulate said delayed symbol into a frequency channel; and
an antenna being adapted to transmit said modulated symbol to said access point,
wherein said delay is chosen such that said transmitted symbol arrives at said access point simultaneously with a further symbol modulated into said frequency channel and transmitted by a further said user terminal.

2. A user terminal according to claim 1, wherein said delay module is adapted to compute said delay using a propagation delay between said user terminal and said access point.

3. A user terminal according to claim 2, wherein said delay module uses a time of arrival of a time signal received from said access point to compute said propagation delay.

4. A user terminal according to claim 3, further comprising a GPS module adapted to provide time information to said delay module to compute said time of arrival.

5. A fixed user terminal comprising:
a mapping module adapted to map one or more input data bits to an uplink symbol;
a delay module adapted to apply a delay to said uplink symbol;
a transmit module adapted to modulate said delayed symbol into a frequency channel; and
an antenna being configured to transmit said modulated symbol to said access point; and
wherein said delay is chosen such that said transmitted symbol arrives at said access point simultaneously with a further symbol modulated into said frequency channel and transmitted by another said user terminal.

6. The user terminal of claim 5, wherein said delay module is adapted to compute said delay using a propagation delay between said user terminal and said access point.

7. The user terminal of claim 6, wherein said delay module uses a time of arrival of a time signal received from said access point to compute said propagation delay.

8. The user terminal of claim 7, further comprising a GPS module adapted to provide time information to said delay module to compute said time of arrival.