# Patent

## Title
Precoding for single transmission streams in multiple antenna systems

## Abstract

Precoding for multiple transmission streams in multiple antenna systems. Disclosed herein is a general method that transmits signal from multiple antennas using a one/two dimensional precoder. This precoder is fixed in a given resource block (RB) or slot, which is composed of P subcarriers and Q OFDM symbols (where the values for P and Q are greater than or equal to 1). The precoder in each resource block may take same or different values, which span the two dimensional time-frequency grid. The precoder is chosen as a function of either logical frequency index or physical frequency index of the RB.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is a divisional patent application of U.S. patent application Ser. No. 12/999,894 filed on Jan. 21, 2011, which claims priority to PCT application number PCT/IN2009/000352, filed on Jun. 18, 2009, which also claims priority to Indian provisional application number 1486/CHE/2008, filed on Jun. 18, 2008 and Indian provisional application number 31/CHE/2009, filed on Jan. 7, 2009, the contents of which, in their entireties, are herein incorporated by reference.


FIELD OF INVENTION
This invention relates to wireless communications, and more particularly to using multiple transmission antennas in wireless communications.
BACKGROUND OF INVENTION
A wireless network generally comprises of many smaller region called a cell that is further divided in to multiple sectors. Each cell/sector may have a base station (BS) and multiple mobile stations (MSs). The MSs in a sector may be fixed, nomadic or mobile. Communication from a BS to a MS is called as downlink or forward link. Similarly, communication from an MS to a BS is called as uplink or reverse link.
The radio frequency signal transmitted from the BS will travel through multiple paths before reaching the MS or vice versa. This results in the superposition of different multi-path signals, adding constructively and destructively at the receiver. The time varying nature of the mobile channel is due to the multipath time dispersion, doppler shift, and random phase modulation. Resolving the multipaths becomes difficult in system operating at very high carrier frequencies. The un-resolvable multiple paths contribute to fading and the resolvable multiple paths lead to inter-symbol interference (ISI). The presence of these resolved multipath components lead to the frequency selective nature of the wireless channel.
The problem of fading is overcome by providing multiple replicas of the transmitted signal to the receiver(s). This can be done by transmitting same (space-time coded) signals through all transmit antennas during the same time interval or at different time intervals to the receiver and/or by obtaining multiple replicas of the transmitted signal using multiple receivers. This is called as antenna diversity. This will ensure that less attenuated signal is available at the receiver under the assumption that the fading across the antennas are uncorrelated.
Cyclic delay diversity (CDD) is a scheme in which the cyclic shift of the first antenna is set to zero, while an antenna specific cyclic shift is applied to the remaining antennas. The cyclic shift is done after the N-point IFFT of the OFDM transmitter. The time domain CDD and the frequency domain phase diversity equivalent of a CDD signal is given by:




  
    
      
        s
        ⁡
        
          (
          
            t
            -
            
              δ
              
                n
                T
              
            
          
          )
        
      
      }
    
    
      CDD
      ⁢
      
        
      
      ⁢
      Signal
    
  
  =
  
    
      1
      
        N
      
    
    ⁢
    
      
        ∑
        n
        
          N
          -
          1
        
      
      ⁢
      
        
      
      ⁢
      
        
          
            
              
                e
                
                  
                    -
                    j
                  
                  ⁢
                  
                    
                      2
                      ⁢
                      
                        
                      
                      ⁢
                      π
                    
                    N
                  
                  ⁢
                  n
                  ⁢
                  
                    
                  
                  ⁢
                  
                    δ
                    n
                  
                
              
              ⁢
              S
              ⁢
              
                (
                n
                )
              
            
            }
          
          PhaseDiversitySignal
        
        ⁢
        
          e
          
            
              -
              j
            
            ⁢
            
              
                2
                ⁢
                
                  
                
                ⁢
                π
              
              N
            
            ⁢
            n
            ⁢
            
              
            
            ⁢
            t
          
        
      
    
  




Where δnT is the antennas specific delay, N is the size of the IFFT. Note that in CDD the phase is varied on every subcarrier depending on the subcarrier index.
Space-time block coding (STBC) is a technique in which the signals to be transmitted will be coded across space (antennas) and time. When the encoding is done across space and frequency resource, it is called space-frequency block coding (SFBC). A STBC scheme with two transmit antennas is described below.
Signal s1 is transmitted through the first antenna and s2 is transmitted through the second antenna in time instant t and signal −s2* is transmitted through the first antenna and s1* is transmitted through the second antenna in next time instant t+T, where T is the symbol duration. The received signals r1 and r2 in two adjacent time instants is given by:




  
    (
    
      
        
          
            r
            1
          
        
      
      
        
          
            r
            2
          
        
      
    
    )
  
  =
  
    
      
        (
        
          
            
              
                s
                1
              
            
            
              
                s
                2
              
            
          
          
            
              
                -
                
                  s
                  2
                  *
                
              
            
            
              
                s
                1
                *
              
            
          
        
        )
      
      ⁢
      
        (
        
          
            
              
                h
                1
              
            
          
          
            
              
                h
                2
              
            
          
        
        )
      
    
    +
    
      (
      
        
          
            
              n
              1
            
          
        
        
          
            
              n
              2
            
          
        
      
      )
    
  




After complex conjugating the received signal r2, the above equation can be written as:




  
    (
    
      
        
          
            r
            1
          
        
      
      
        
          
            r
            2
            *
          
        
      
    
    )
  
  =
  
    
      
        (
        
          
            
              
                h
                1
              
            
            
              
                h
                2
              
            
          
          
            
              
                h
                2
                *
              
            
            
              
                -
                
                  h
                  1
                  *
                
              
            
          
        
        )
      
      ⁢
      
        (
        
          
            
              
                s
                1
              
            
          
          
            
              
                s
                2
              
            
          
        
        )
      
    
    +
    
      (
      
        
          
            
              n
              1
            
          
        
        
          
            
              n
              2
              *
            
          
        
      
      )
    
  




It can be easily shown that the channel matrix is orthogonal, and the receiver processing to detect s1 and s2 is linear. In case of SFBC, two frequency resources in one time instant are used instead of two time instants. The above scheme or its variant can be extended to arbitrary number of antennas.
Techniques like space-time block codes (STBC) and space frequency block codes (SFBC) have better performance as compared to CDD. In conventional STBC/SFBC schemes, distinct pilot tones are transmitted on different antennas which results in a high pilot overhead. STBC/SFBC schemes also require higher complexity during implementation. In ISI channels, the performance of Cyclic Delay Diversity (CDD) is generally poor. Phase diversity schemes are generally applicable to TDMA systems only. Phase diversity schemes are also restricted to one-dimension in time.
SUMMARY OF INVENTION
Accordingly the invention provides a method and system for transmission of a signal from a plurality of antennas, the method further comprising steps of splitting frequency band of the signal into a plurality of subcarriers, wherein the subcarriers span frequency and time; and transmitting each of the subcarriers from the plurality of antennas, each subcarrier transmitted on each antenna using a complex weight specific to the antenna, wherein the complex weight further relies on at least one of time index of the subcarrier; frequency index of the subcarrier; and time and frequency indices of the subcarrier.
Also provided herein is a method and system for selection of a precoder for a signal, said method comprising steps of dividing available bandwidth of said signal into frequency partitions, wherein said frequency partition is further divided into a plurality of frequency sub-partitions, each of said frequency sub-partitions comprising of a plurality of Physical Resource Units (PRUs); grouping said plurality of PRUs into sets, wherein each said set comprise of an arbitrary number of PRUs; further classifying said sets into a plurality of sets, where elements of said sets comprises of L physically contiguous PRUs, where L is greater or equal to 1 and may vary with each of said sets; assigning each element of said sets a logically contiguous index i, wherein i takes values from 0, 1, 2, . . . NL−1, where NL may vary for each of said sets; determining a precoding matrix W(i,q) of size Nt×1 for each element of a set chosen from said plurality of sets, where Nt is number of transmitting antennas and said element comprises of a plurality of PRUs; applying a precoding matrix to each element of said set to obtain said precoder, and W(i,q) is same for all PRUs contained in said element.
Embodiments herein disclose a method and system for single stream transmission for Nt transmission antennas comprising of transmitting elements of y simultaneously from said Nt antennas, where y=W(p,q)sk,l, further wherein sk,l denotes signal present in kth subcarrier and the lth OFDM symbol contained in the (p,q)th unit of said stream, p is frequency index of y, q is time index of y and W(p,q) is a Nt×1 vector.
Also disclosed is an OFDM receiver comprising of a baseband portion, where said OFDM receiver receives a precoded signal comprising of precoded pilot tones and precoded data tones, further where said precoded signal relies on at least one of time index of a subcarrier of said precoded signal; frequency index of said subcarrier; and time and frequency indices of said subcarrier and is transmitted using a plurality of antennas, said baseband portion further comprising of at least one means adapted for estimating channel state information using said precoded pilot tones; estimating interference covariance estimation using said precoded pilot tones; demodulating said precoded data tones; and computing filter weights using said channel state information and said interference covariance estimation.
Disclosed herein is a DFT-S-OFDMA receiver comprising of a baseband portion, where said receiver receives a precoded signal comprising of precoded pilot tones and precoded data tones, further where said precoded signal relies on at least one of time index of a subcarrier of said precoded signal; frequency index of said subcarrier; and time and frequency indices of said subcarrier and is transmitted using a plurality of antennas, said baseband portion further comprising of at least one means adapted for estimating channel state information using said precoded pilot tones; estimating interference covariance estimation using said precoded pilot tones; demodulating said precoded data tones; and computing filter weights using said channel state information and said interference covariance estimation.
Embodiments herein disclose a method and system for transmitting a DFT-S-OFDMA stream from a plurality of transmitting antennas, said method comprising steps of applying DFT precoding to an input stream of subcarriers; applying a multi-antenna precoder scheme to each of said subcarriers to create a plurality of precoded subcarriers, wherein said multi-antenna precoder scheme is at least one of 1-Dimensional Phase Offset Diversity (1D-POD); antenna switching in frequency; antenna switching in time; antenna switching in time and frequency; and a combination of 1D-POD and antenna switching; applying an IDFT to said plurality of precoded subcarriers to produce a plurality of signals; and transmitting a signal chosen from said plurality of signals using an antenna chosen from said plurality of antennas, wherein said antenna is specific to said signal and each of said plurality of signals is transmitted from a distinct antenna chosen from said plurality of antennas.
Disclosed herein is a method and system for transmitting a DFT-S-OFDMA stream from a plurality of transmitting antennas, said method comprising steps of applying DFT precoding to an input stream of subcarriers, wherein said subcarriers comprise of Physical Resource Units (PRUs); performing subcarrier mapping on said subcarriers; performing IDFT on output of said subcarriers; adding cyclic prefix to said subcarriers; transmitting said subcarriers from a first antenna from said plurality of transmitting antennas; transmitting said subcarriers multiplied with a PRU specific phase rotation from a second antenna from said plurality of transmitting antennas; and transmitting said subcarriers multiplied with a phase rotation from subsequent antennas, wherein said phase rotation relies on PRU and specific antenna.
Disclosed herein is a method and system for transmitting a DFT-S-OFDMA stream from a plurality of transmitting antennas, said method comprising steps of applying DFT precoding to an input stream of subcarriers; performing subcarrier mapping on said subcarriers; multiplying each of said subcarriers with a plurality of complex weights, where said number of plurality of said complex weights is equal to number of said plurality of transmitting antennas; performing IDFT on each of said subcarriers to create a plurality of signals; and transmitting said plurality of signals from said plurality of antennas, wherein each signal is transmitted from a distinct antenna.
Embodiments herein disclose a method and system for transmitting a DFT-S-OFDMA stream from a plurality of transmitting antennas, said method comprising steps of modulating FEC encoded data; splitting said modulating FEC encoded data into a plurality of data sets, where number of said plurality of data sets is equal to said number of said plurality of antennas; modulating each of said plurality of data sets onto contiguous subcarriers; encoding each of said plurality of data sets using a DFT-S-OFDMA transmitter; transmitting each of said plurality of data sets on distinct antennas chosen from said plurality of antennas.
Also, disclosed herein is a method and system for transmitting a DFT-S-OFDMA stream from a plurality of transmitting antennas, said method comprising steps of modulating FEC encoded data; splitting said modulating FEC encoded data into a plurality of data sets, where number of said plurality of data sets is equal to said number of said plurality of antennas; performing DFT operation on each of said data sets to create a set of DFT precoded data; modulating each of said DFT precoded data onto contiguous subcarriers to create DFT precoded data sets; precoding each of said plurality of DFT precoded data sets using a multi-antenna precoder for a subset of said plurality of antennas to create a plurality of multi-antenna DFT precoded data streams; performing IDFT on each of said plurality of plurality of multi-antenna DFT precoded data streams to obtain multi-antenna precoded data streams; mapping said multi-antenna precoded data streams to said plurality of antennas; transmitting each of said plurality of multi-antenna precoded data streams on distinct antennas chosen from said plurality of antennas.
These and other aspects of the embodiments herein will be better appreciated and understood when considered in conjunction with the following description and the accompanying drawings. It should be understood, however, that the following descriptions, while indicating preferred embodiments and numerous specific details thereof, are given by way of illustration and not of limitation. Many changes and modifications may be made within the scope of the embodiments herein without departing from the spirit thereof, and the embodiments herein include all such modifications.



BRIEF DESCRIPTION OF FIGURES
This invention is illustrated in the accompanying drawings, through out which like reference letters indicate corresponding parts in the various figures. The embodiments herein will be better understood from the following description with reference to the drawings, in which:
FIG. 1 depicts the block diagram of an OFDMA based system, according to embodiments as disclosed herein;
FIG. 2 depicts a localized LTE system using the DFT-S-OFDMA framework, according to embodiments as disclosed herein;
FIG. 3 depicts a distributed LTE system using the DFT-S-OFDMA framework, according to embodiments as disclosed herein;
FIG. 4 depicts a typical slot format for localized/distributed SC-FDMA, according to embodiments as disclosed herein;
FIG. 5 illustrates an example of RB or PRU structure used in DL of 16m, according to embodiments as disclosed herein;
FIG. 6 the general structure of PRU/slot specific 2D-precoder implementation, according to embodiments as disclosed herein;
FIG. 7 depicts the POD method, according to embodiments as disclosed herein;
FIG. 8 depicts the POD method, according to embodiments as disclosed herein;
FIG. 9 illustrates the general structure of OFDMA transmitter which uses multi-antenna precoding, according to embodiments as disclosed herein;
FIG. 10 illustrates the general structure of 4-Tx multi-antenna precoding for 4-Tx antennas, according to embodiments as disclosed herein;
FIG. 11 depicts the general structure of 2D-amplitude and phase varying precoder for 2-Tx antennas, according to embodiments as disclosed herein;
FIG. 12 depicts a 1-dimensional PRU specific antenna switching scheme, according to embodiments as disclosed herein;
FIG. 13 illustrates a general DFT-S-OFDMA structure with precoding, according to embodiments as disclosed herein;
FIG. 14 illustrates a general DFT-S-OFDMA structure which uses an IDFT for each antenna, according to embodiments as disclosed herein;
FIG. 15 illustrates the DFT-S-OFDMA structure which uses 1D-POD using a single IDFT module, according to embodiments as disclosed herein;
FIG. 16 illustrates a more general form of precoding, according to embodiments as disclosed herein;
FIG. 17 illustrates scheme for 2-Tx antennas, according to embodiments as disclosed herein;
FIG. 18 illustrates the transmitter structure for Nt=4, according to embodiments as disclosed herein;
FIG. 19 depicts DFT-S-OFDMA with precoding-1, according to embodiments as disclosed herein;
FIG. 20 depicts DFT-S-OFDMA with precoding and antenna permutation, according to embodiments as disclosed herein;
FIG. 21 illustrates the baseband portion of the OFDM receiver, according to embodiments as disclosed herein;
FIG. 22 illustrates the baseband portion of the DFT-S-OFDMA receiver, according to embodiments as disclosed herein; and
FIG. 23 illustrates the baseband portion of the DFT-S-OFDMA receiver, according to embodiments as disclosed herein.



DETAILED DESCRIPTION OF INVENTION
The embodiments herein and the various features and advantageous details thereof are explained more fully with reference to the non-limiting embodiments that are illustrated in the accompanying drawings and detailed in the following description. Descriptions of well-known components and processing techniques are omitted so as to not unnecessarily obscure the embodiments herein. The examples used herein are intended merely to facilitate an understanding of ways in which the embodiments herein may be practiced and to further enable those of skill in the art to practice the embodiments herein. Accordingly, the examples should not be construed as limiting the scope of the embodiments herein.
The embodiments herein achieve transmit diversity and precoding using multiple antennas in wireless networks. Referring now to the drawings, and more particularly to FIGS. 1 through 23, where similar reference characters denote corresponding features consistently throughout the figures, there are shown preferred embodiments.
The IEEE 802.16e Wireless Metropolitan Area Network (MAN) is a broadband wireless standard that uses Orthogonal Frequency Division Multiplexing Access (OFDMA) technology for both downlink and uplink transmissions. The block diagram of an OFDMA based system is shown in FIG. 1.
The physical subcarriers are grouped to form a sub-channel, which consists of a set of subcarriers. In the downlink, a sub-channel may be intended for different (groups of) users; in the uplink, a transmitter may be assigned one or more sub-channels, several transmitters may transmit simultaneously. The PSK/QAM input data are mapped to distinct subcarriers, and filled with zeros in the unused subcarriers before taking an N-point IDFT. The subcarriers forming one sub-channel may, but need not be adjacent. When they are adjacent, channel dependent scheduling (CDS) can improve the throughput. When they are not adjacent but distributed over the complete bandwidth (for instance, in a pseudo-random fashion that can include fast hopping across the tones), interference from adjacent tones is averaged and frequency diversity is exploited inherently. The total available physical channel is divided into logical sub-channels to support scalability, multiple accesses.
The distributed resource unit (DRU) contains a group of subcarriers which are spread across the distributed resource allocations within a frequency partition. The size of the DRU equals the size of PRU, i.e., P subcarriers by Q OFDMA symbols. The minimum unit for forming the DRU is equal to either a single subcarrier or a pair of subcarriers, called tone-pair.
The localized resource unit, also known as contiguous resource unit (CRU) contains a group of subcarriers which are contiguous across the localized resource allocations. The minimum size of the CRU equals the size of the PRU, i.e., P subcarriers by Q OFDMA symbols. When the number of PRUs in a CRU is 1 or 2, it is called as a miniband CRU, and when the number of PRUs in a CRU is 3 or more, it is called as a subband CRU. The minibands CRUs available in a frequency partition can be divided into two groups. The first group can be used as miniband CRU itself, and the second group will be used to create subcarrier or pairs of subcarrier permuted distributed resource unit (DRU).
3GPP-LTE is a standard that uses a variant of OFDMA called as DFT-spread-OFDMA (DFT-S-OFDMA). The frequency domain transmitter implementation of an LTE system using the DFT-S-OFDMA framework is shown in FIG. 2. An M-point FFT is applied to the PSK/QAM input data and the outputs of the FFT are mapped to distinct subcarriers, and filled with zeros in the unused subcarriers before taking an N-point IDFT with N>M. The mapping of subcarriers can be either localized or distributed in frequency domain. The mapping of subcarriers can be either localized as in FIG. 2 or distributed as in FIG. 3.
In the uplink of LTE which uses DFT-S-FDMA, the basic packet resource unit (PRU) which is also called a tile may is composed of P subcarrier and 7 OFDM symbols. A physical resource unit (PRU) is the basic physical unit for resource allocation that comprises P consecutive subcarriers by Q consecutive OFDMA symbols. A Typical value for P is 18 subcarriers and Q is 5 or 6 or 7 OFDMA symbols. A logical resource unit (LRU) is the basic logical unit for distributed and localized resource allocations. An LRU is P·Q subcarriers. The LRU includes the pilot tones that are used in a PRU. The effective number of subcarriers in an LRU depends on the number of allocated pilots. A typical slot format for localized/distributed SC-FDMA, which is used in the 3GPP-LTE standard, is shown in FIG. 4. The slots denoted by P are slots which contain allocated pilots.
A typical slot format for localized/distributed DFT-S-OFDMA comprises of 12*m subcarriers in frequency and 7-OFDM symbols, where “m” is a positive integer. Pilot tones are transmitted in the fourth OFDM symbol. The remaining 6 OFDM symbols are used for transmission of DFT-S-OFDMA data tones. In LTE, pilot symbols do not use DFT spreading. The pilot tones are directly modulated using constant-amplitude-zero-auto-correlation (CAZAC) sequences which has low peak-to-average-power-ratio (PAPR). In DFT-S-OFDMA, the number of allocated tones in a slot is generally an integer multiple of 12. Therefore, in LTE, the uplink slot comprises of P subcarriers in frequency and 7 OFDM symbols.
In LTE, data is typically allocated in pairs of slots which are contiguous in time. Therefore, for channel estimation purposes, the receiver may use two pilot OFDM symbols which are separated in time. A 2D-MMSE channel estimation algorithm can be used to track the channel variation both in frequency and time.
In multi-user systems, resources are allocated in time and frequency dimensions, where the basic signal is confined to one OFDM symbol that spans N subcarriers spanning entire bandwidth.
A basic unit for transmission is a slot which is composed of P subcarriers and Q OFDM symbols. Data is allocated in terms of slots which are either contiguous (localized) or scattered (distributed) in a two dimensional time-frequency grid that contains N subcarriers and M OFDM symbols where (N>>P and M>>Q). P and Q may be greater than one. Each slot is designated by the two dimensional index (p,q) where p is the frequency index and q is the time index and p=1, 2, . . . , Nf, q=1, 2, . . . Nt. Nt is equal to the total number slots in time axis. Nf is equal to the total number slots in frequency axis. Nt+Nf is equal to the total number of allocated slots. For example slot (1,1) and (1,2) are two adjacent slots in time and slot (1,1) and (2,1) are two adjacent slots in frequency. The size of the basic resource unit in the uplink can be same or different from that of the downlink i.e., the pair P and Q in the uplink can be same or different from that of the downlink.
In a practical system, the frequency slot index p represents the logical set of frequency slots allocated in a given frequency partition. In other words, the index p, may represent physically contiguous frequency slots, or physically non-contiguous (distributed) frequency slots which are scattered in entire frequency band or a given frequency partition.
Q (Q=5 or 6 or 7) OFDM symbols are grouped to form a sub-frame in IEEE 802.16m standards, and there are eight such sub-frames in a 5 millisecond frame. However, 2Q (Q=7) OFDM symbols are grouped to form a sub-frame in 3GPP-LTE standards, and there are 10 such sub-frames in a 10 millisecond frame.
In the downlink of IEEE 802.16m, the basic packet resource unit (PRU) may is composed of 18 subcarrier and 6 OFDM symbols. DL of 16m uses OFDMA. FIG. 5 illustrates an example of RB or PRU structure used in DL of 16m. In each PRU certain subcarriers are reserved for pilot tones which are used for estimating the channel between the transmitter and receiver. FIG. 5 illustrates an example of Resource Block (RB) or PRU structure used in DL of 16m. The resource allocated to a user or a group of users will be in multiple of the basic resource units, and it can be either contiguous or distributed. N1 contiguous basic resource unit is called as sub-band, and N2 contiguous resource unit is called as miniband in IEEE 802.16m standards. N1 and N2 are positive integers. Typical number for N1 is 3 or 4 or 5 and N2 is 1 or 2.
The embodiments herein disclose a method for transmission of a signal from multiple antennas using a one or two dimensional precoder. The precoder may take same or different values in different slots, which span the two dimensional time-frequency grid.
Embodiments herein disclose a technique for single stream transmission for NT transmit antennas as:

y=W(p,q)sk 

Where sk denotes the data/pilot transmitted in the kth subcarrier contained in the (p,q)th RB/slot/PRU, and W(p,q) is typically a (NT×1) vector. The elements of y will be transmitted from NT antennas simultaneously. FIG. 6 illustrates the general structure of PRU/slot specific 2D-precoder implementation.
For a system with two transmit antennas, an embodiment herein discloses a 2-phase offset diversity scheme designated by:




  A
  =
  
    
      [
      
        
          
            
              s
              k
            
          
        
        
          
            
              
                s
                k
              
              ⁢
              
                e
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Φ
                    ⁡
                    
                      (
                      
                        p
                        ,
                        q
                      
                      )
                    
                  
                
              
            
          
        
      
      ]
    
    ⁢
    
      
        
          
            ⟶
            
              Ant
              ⁢
              
                
              
              ⁢
              1
            
          
        
      
      
        
          
            ⟶
            
              Ant
              ⁢
              
                
              
              ⁢
              2
            
          
        
      
    
  




Where sk denotes the kth data/pilot subcarrier contained in the (p,q)th slot and Φ(p,q) is the phase rotation applied in the (p,q)th slot. The rows of the vector A will be transmitted simultaneously from antennas 1 and 2 respectively. The signal which is transmitted on each antenna may be weighed by a constant amplitude or phase weight which is common for all antennas.
Φ(p,q) may be expressed as Φ(p,q)=Φ(p)+Φ(q) where Φ(p) is the phase rotation which is applied in the slot whose frequency index is p and Φ(q) is the phase rotation of the slot whose time index is q. The slot dependent phase offsets Φ(p) and Φ(q) can be jointly chosen such that the total diversity benefit is maximized. An example of a phase offset pattern for localized allocation spanning 4-slots is provided in Table-1. Since this scheme de-correlates the channel in both time and frequency directions simultaneously, better performance is obtained as compared to CDD or time dependent phase diversity.










TABLE 1









Φ(1,1) = 0




  
    Φ
    ⁡
    
      (
      
        1
        ,
        2
      
      )
    
  
  =
  
    π
    2
  







 



Φ(2,1) = π




  
    Φ
    ⁡
    
      (
      
        2
        ,
        2
      
      )
    
  
  =
  
    
      3
      ⁢
      π
    
    2
  














The same pilot tone is transmitted from both antennas with slot specific 2D phase rotation, resulting in a pilot overhead half that of the STBC/SFBC. Pilot structures which are designed for single antenna systems can be used. The 2 Dimensional-Phase Offset Diversity (2D-POD) receiver performs channel estimation just as in single (virtual) antenna mode and estimates the equivalent channel from two antennas, resulting in lower implementation complexity.
FIGS. 7 and 8 illustrate the POD method. FIG. 9 illustrates the general structure of OFDMA transmitter which uses multi-antenna precoding. In FIG. 9, one or several forward error correction (FEC) coded streams are transmitted. Output bits of each FEC block is scrambled using a cell specific scrambling code and the output bits are mapped to modulation data. Modulation data of several FEC blocks is multiplexed into a single modulation stream. Data symbols of each user are mapped to physical subcarriers of PRUs allocated for that user using a MIMO encoder. Pilot tones are inserted in the PRU as shown in FIG. 5 for single stream case. In FIG. 9, after MIMO encoding, the baseband signal corresponding to each antenna branch is used to generate an analog OFDM signal i.e., the output of each antenna branch goes through IDFT, CP insertion, D/A, RF up conversion, power amplification steps.
In an embodiment of 1D/2D POD, the phase Φ2(p) can be chosen based on the number of slots Ra allocated to a user along the frequency direction. The phase can be chosen as




  
    
      Φ
      2
    
    ⁡
    
      (
      p
      )
    
  
  =
  
    e
    
      j
      ⁢
      
        
      
      ⁢
      2
      ⁢
      
        
      
      ⁢
      π
      ⁢
      
        
          (
          
            p
            -
            1
          
          )
        
        
          R
          a
        
      
    
  




where p=1, 2, . . . , Ra is the slot index along the frequency phase direction. The phase Φ2(q) can be chosen from a predefined set depending on the slot index q along the time direction, and this phase is kept same across the frequency direction. The following sets





  0
  ,
  
    π
    ⁢
    
      
    
    ⁢
    or
    ⁢
    
      
    
    ⁢
    0
  
  ,
  π
  ,
  
    π
    2
  
  ,
  
    
      
        3
        ⁢
        π
      
      2
    
    ⁢
    
      
    
    ⁢
    or
    ⁢
    
      
    
    ⁢
    0
  
  ,
  π
  ,
  
    π
    2
  
  ,
  
    
      3
      ⁢
      π
    
    2
  
  ,
  
    
      π
      4
    
    ⁢
    
      
        5
        ⁢
        π
      
      4
    
    ⁢
    
      
        3
        ⁢
        π
      
      4
    
    ⁢
    
      
        7
        ⁢
        π
      
      4
    
  




are some typical examples.

In another preferred embodiment, the phase values, which are allocated in a particular slot is based on the slot index (p,q) can be fixed in the frame or sub-frame in a predetermined manner, and this can be specified for different bandwidths or frequency partitions. The phase values can be chosen as defined above for the frequency and time direction. However, in this case the allocated phase patterns are frame specific and not user specific, and this will depend on the system bandwidth or frequency partitions.
The frequency dependent phase offset can be specified as a function of slot index only i.e., any user allocated in that slot will use that predefined phase offset value. For a given time index q, the following sequence of phase values can be used in successive frequency slots:




  
    [
    
      0
      ,
      π
      ,
      
        π
        2
      
      ,
      
        
          3
          ⁢
          π
        
        2
      
    
    ]
  
  .




Other possible sequences are:





  
    0
    ⁢
    
      
    
    ⁢
    π
    ⁢
    
      
    
    ⁢
    or
    ⁢
    
      
        
      
      ⁢
      
        
      
    
    ⁢
    0
  
  ,
  
    π
    2
  
  ,
  π
  ,
  
    
      
        3
        ⁢
        π
      
      2
    
    ⁢
    
      
    
    ⁢
    or
    ⁢
    
      
    
    ⁢
    0
  
  ,
  π
  ,
  
    π
    2
  
  ,
  
    
      3
      ⁢
      π
    
    2
  
  ,
  
    
      π
      4
    
    ⁢
    
      
        5
        ⁢
        π
      
      4
    
    ⁢
    
      
        3
        ⁢
        π
      
      4
    
    ⁢
    
      
        7
        ⁢
        π
      
      4
    
  
  ,




but not limited to these set of phase values. In general, this can be obtained from any M-ary PSK constellation. One of the above mentioned sequence is repetitively assigned when the given frequency resource (number of slots) exceeds the number of different phase values. An example of frequency dependent phase allocation is shown in Table-2. Table 2 depicts an allocation for 4 slots in frequency. The allocations for remaining frequency slots can be obtained from the base pattern, which can be repeated in the rest of the frequency slots.











TABLE 2







(p,q)
q









P
0



 



p + 1




  π
  2







 



p + 2
π



 



p + 3




  
    3
    ⁢
    π
  
  2














The time dependent phase offset Φ2(q) can be obtained in one of the following ways:
For a given frequency index p, the phase difference between successive time dependent phase offsets is equal to a fixed value i.e., |Φ2(q+1)−Φ2(q)|=θ0 Where θ0 takes any value in the range (0,2π). Preferred values are θ0ε[0, π/4, π/2, π, 5π/4, 3π/2, 7π/4]. In an embodiment, one may use a phase difference of π between any pairs of adjacent time slots. An example of 2D-phase allocation is shown in Tables 3 and 4 for θ0=π and π/3, respectively. These tables show an allocation for 4 slots in frequency. The allocations for remaining frequency slots can be obtained from the base pattern, which can be repeated in the rest of the time/frequency slots.













TABLE 3







(p,q)
q
q + 1
q + 2
q + 3









P
0
π
0
π



 



p + 1




  π
  2








  
    3
    ⁢
    π
  
  2








  π
  2








  
    3
    ⁢
    π
  
  2







 



p + 2
π
0
π
0



 



p + 3




  
    3
    ⁢
    
      
    
    ⁢
    π
  
  2








  π
  2








  
    3
    ⁢
    
      
    
    ⁢
    π
  
  2








  π
  2


























TABLE 4







(p,q)
q
q + 1 
q + 2









P
0




  π
  3








  
    2
    ⁢
    
      
    
    ⁢
    π
  
  3







 



p + 1




  π
  2








  
    5
    ⁢
    
      
    
    ⁢
    π
  
  6








  
    7
    ⁢
    
      
    
    ⁢
    π
  
  6







 



p + 2
π




  
    4
    ⁢
    
      
    
    ⁢
    π
  
  3








  
    5
    ⁢
    
      
    
    ⁢
    π
  
  3







 



p + 3




  
    3
    ⁢
    
      
    
    ⁢
    π
  
  2








  
    11
    ⁢
    
      
    
    ⁢
    π
  
  6








  
    13
    ⁢
    
      
    
    ⁢
    π
  
  6














In another embodiment, one may use a phase difference of π within a block, where a block is obtained by concatenating two adjacent time slots. An example of 2D-phase allocation is shown in Table 5.













TABLE 5







(p,q)
q
q + 1
q + 2
q + 3









P
0
π




  π
  2








  
    3
    ⁢
    π
  
  2







 



p + 1




  π
  2








  
    3
    ⁢
    π
  
  2




π
0



 



p + 2
π
0




  
    3
    ⁢
    π
  
  2








  π
  2







 



p + 3




  
    3
    ⁢
    π
  
  2








  π
  2




0
π










In yet another embodiment, one may use the following technique. For a given frequency index p, the phase offset can be kept constant for several consecutive slots and then its takes a new value which lies in the range (0,2π). An example is shown in Table-6.













TABLE 6







(p,q)
q
q + 1
q + 2
q + 3









P
0
0
π
π



 



p + 1




  π
  2








  π
  2








  
    3
    ⁢
    π
  
  2








  
    3
    ⁢
    π
  
  2







 



p + 2
π
π
0
0



 



p + 3




  
    3
    ⁢
    π
  
  2








  
    3
    ⁢
    π
  
  2








  π
  2








  π
  2














In another embodiment herein, cyclic delay diversity (CDD) may be employed on the second antenna together with a slot dependent phase offset which is a function of time index p only. If the delay is chosen to be D time samples and Δf is the subcarrier width, the CDD+POD diversity scheme may be represented as:




  A
  =
  
    
      [
      
        
          
            
              s
              k
            
          
        
        
          
            
              
                s
                k
              
              ⁢
              
                e
                
                  j2π
                  ⁢
                  
                    
                  
                  ⁢
                  kΔfD
                
              
              ⁢
              
                e
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Φ
                    ⁡
                    
                      (
                      q
                      )
                    
                  
                
              
            
          
        
      
      ]
    
    ⁢
    
      
        
          
            →
            
              Ant
              ⁢
              
                
              
              ⁢
              1
            
          
        
      
      
        
          
            →
            
              Ant
              ⁢
              
                
              
              ⁢
              2
            
          
        
      
    
  




CDD+POD may be applied for distributed allocations by choosing a delay which is less than the cyclic prefix (CP) length
In another implementation CDD+POD may be implemented as:




  A
  =
  
    
      [
      
        
          
            
              s
              k
            
          
        
        
          
            
              
                s
                k
              
              ⁢
              
                e
                
                  φ
                  ⁢
                  
                    
                  
                  ⁢
                  k
                
              
              ⁢
              
                e
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Φ
                    ⁡
                    
                      (
                      q
                      )
                    
                  
                
              
            
          
        
      
      ]
    
    ⁢
    
      
        
          
            →
            
              Ant
              ⁢
              
                
              
              ⁢
              1
            
          
        
      
      
        
          
            →
            
              Ant
              ⁢
              
                
              
              ⁢
              2
            
          
        
      
    
  




Where Φ is a pre-defined phase and k is subcarrier index.
In system with 4 transmit antennas, the 2D-POD scheme may be generalized as:




  A
  =
  
    [
    
      
        
          
            s
            k
          
        
      
      
        
          
            
              s
              k
            
            ⁢
            
              e
              
                j
                ⁢
                
                  
                
                ⁢
                
                  Φ
                  ⁡
                  
                    (
                    
                      p
                      ,
                      q
                    
                    )
                  
                
              
            
          
        
      
      
        
          
            
              s
              k
            
            ⁢
            
              e
              
                j
                ⁢
                
                  
                
                ⁢
                
                  Ψ
                  ⁡
                  
                    (
                    
                      p
                      ,
                      q
                    
                    )
                  
                
              
            
          
        
      
      
        
          
            
              s
              k
            
            ⁢
            
              e
              
                j
                ⁢
                
                  
                
                ⁢
                
                  Θ
                  ⁡
                  
                    (
                    
                      p
                      ,
                      q
                    
                    )
                  
                
              
            
          
        
      
    
    ]
  




where distinct phase rotations are applied on different antennas in each slot. The signal which is transmitted on each antenna may be weighed by a constant amplitude or phase weight which is common for all antennas.

In Table 7, an example phase pattern is given for 4-antenna 2D-POD. The proposed scheme can be generalized for arbitrary number of antennas where each antenna uses a different slot wise 2D-phase rotation.










TABLE 7









Φ (1,1) = 0, Ψ (1,1) = 
Φ (1,2) = π, Ψ (1,2) =



0, Θ (1,1) = 0
0, Θ (1,2) = π



Φ (2,1) = 0, Ψ (2,1) = 
Φ (2,2) = π, Ψ (2,2) = 



π, Θ (2,1) = π
π, Θ (2,2) = 0










FIG. 10 illustrates the general structure of 4-Tx multi-antenna precoding for 4-Tx antennas.
The above mentioned scheme with 2-antenna precoder may be represented in a more general form as:




  y
  =
  
    
      [
      
        
          
            
              
                
                  w
                  1
                
                ⁡
                
                  (
                  
                    p
                    ,
                    q
                  
                  )
                
              
              ⁢
              
                e
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      Φ
                      1
                    
                    ⁡
                    
                      (
                      
                        p
                        ,
                        q
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              
                
                  w
                  2
                
                ⁡
                
                  (
                  
                    p
                    ,
                    q
                  
                  )
                
              
              ⁢
              
                e
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      Φ
                      2
                    
                    ⁡
                    
                      (
                      
                        p
                        ,
                        q
                      
                      )
                    
                  
                
              
            
          
        
      
      ]
    
    ⁢
    
      s
      k
    
    ⁢
    
      
        
          
            →
            
              Ant
              ⁢
              
                
              
              ⁢
              1
            
          
        
      
      
        
          
            →
            
              Ant
              ⁢
              
                
              
              ⁢
              2
            
          
        
      
    
  




where sk denotes the data/pilot transmitted on the kth subcarrier contained in the (p,q)th slot, wj(p,q), Φj(p,q), j=1, 2 are the amplitude variation, phase rotation applied in the (p,q)th slot. The rows of the vector y will be transmitted simultaneously from antennas 1 and 2, respectively. In this scheme, the 2D amplitude and phase values can be kept constant during the slot and they may take new values in different slots, which span both time and frequency dimensions.

In this scheme, the amplitude weights wj(p,q) and slot dependent phase values Φj(p) and Φj(q) can be jointly chosen such that the total diversity benefit is maximized under all channel conditions including correlated, uncorrelated, and Rician channels. FIG. 11 illustrates the general structure of 2D-amplitude and phase varying precoder for 2-Tx antennas.
In an embodiment, the amplitude weights on both antennas are kept to unity and a constant phase offset is applied on the second antenna with respect to the first antenna, i.e., w1(p,q)=1, w2(p,q)=1 which results in 1D/2D POD scheme.
The amplitude weights are constrained to take two values from the set wj(p,q)ε[1,0]. Further, the phase weight on one of the antenna can be set to zero value and a slot dependent phase-offset can be applied on the second antenna.
For two antenna case, the amplitude and phase weights can be chosen from the following set either deterministically or randomly in each slot. The precoding vector W(p,q) can be chosen from the following set:




  
    S
    ∈
    
      [
      
        
          
            1
          
        
        
          
            0
          
        
      
      ]
    
  
  ,
  
    [
    
      
        
          0
        
      
      
        
          1
        
      
    
    ]
  
  ,
  
    [
    
      
        
          1
        
      
      
        
          
            e
            
              j
              ⁢
              
                
              
              ⁢
              
                θ
                ⁡
                
                  (
                  m
                  )
                
              
            
          
        
      
    
    ]
  
  ,




where θ(m) may take any phase value between 0 and 2π including those values.

In an alternative embodiment,




  
    S
    ∈
    
      [
      
        
          
            1
          
        
        
          
            0
          
        
      
      ]
    
  
  ,
  
    [
    
      
        
          0
        
      
      
        
          1
        
      
    
    ]
  
  ,
  
    [
    
      
        
          1
        
      
      
        
          
            e
            
              j
              ⁢
              
                
              
              ⁢
              2
              ⁢
              π
              ⁢
              
                
                  (
                  
                    l
                    -
                    1
                  
                  )
                
                R
              
            
          
        
      
    
    ]
  
  ,
  
    l
    =
    1
  
  ,
  2
  ,
  ...
  ⁢
  
    
  
  ,
  R




where R is an integer. As an example, amplitude and phase weights of the following set can be used if the number of assigned slots is 4.





  
    S
    ∈
    
      [
      
        
          
            1
          
        
        
          
            0
          
        
      
      ]
    
  
  ,
  
    [
    
      
        
          0
        
      
      
        
          1
        
      
    
    ]
  
  ,
  
    [
    
      
        
          1
        
      
      
        
          1
        
      
    
    ]
  
  ,
  
    [
    
      
        
          1
        
      
      
        
          
            -
            1
          
        
      
    
    ]
  




or





  
    S
    ∈
    
      [
      
        
          
            1
          
        
        
          
            0
          
        
      
      ]
    
  
  ,
  
    [
    
      
        
          0
        
      
      
        
          1
        
      
    
    ]
  
  ,
  
    [
    
      
        
          1
        
      
      
        
          
            e
            
              j
              ⁢
              
                
              
              ⁢
              Θ
            
          
        
      
    
    ]
  
  ,
  
    [
    
      
        
          1
        
      
      
        
          
            e
            
              
                -
                j
              
              ⁢
              
                
              
              ⁢
              Θ
            
          
        
      
    
    ]
  




where Θ is an angle between 0 and 2π.

In another embodiment, the phase values are set to zero on both antennas, and only 2D or 1D amplitude weights can be used. The vector set in that case is given by:




  
    S
    ∈
    
      [
      
        
          
            1
          
        
        
          
            0
          
        
      
      ]
    
  
  ,
  
    [
    
      
        
          0
        
      
      
        
          1
        
      
    
    ]
  




A vector from this set is chosen for each slot either deterministically or randomly. In this case, the scheme becomes 2D/1D slot based antenna switching in frequency or time or a combination of both. An example of 2D-allocation is shown in Table 8:













TABLE 8








q
q + 1
q + 2 
q + 3









p
W1
W2 
W1
W2



p + 1
W2
W1
W2
W1



p + 2
W1
W2
W1
W2



p + 3
W2
W1
W2
W1










The precoder takes following values:




  
    
      W
      ⁢
      
        
      
      ⁢
      1
    
    =
    
      [
      
        
          
            1
          
        
        
          
            0
          
        
      
      ]
    
  
  ,
  
    
      W
      ⁢
      
        
      
      ⁢
      2
    
    =
    
      [
      
        
          
            0
          
        
        
          
            1
          
        
      
      ]
    
  




As shown in Table 8, W1 and W2 are allocated alternatively in time/frequency directions. The same pattern can be repeated when there are more time/frequency slots.
In general, the phase and amplitude values in frequency slots may be chosen from a predefined code book with arbitrary entries.
In another embodiment described herein, the data and/or pilots in a given slot are switched between different antennas either in time, frequency. For example, as shown in Table 9, data and/or pilots in frequency slot-1 are transmitted through antenna-1 and a second frequency slot is sent on antenna-2.









TABLE 9








Slot(1,1)




Transmitted on




Antenna-1




Slot(2,1)




Transmitted on




Antenna-2









Alternatively, slot wise antenna switching in time can be implemented as shown in Table 10:










TABLE 10









Slot(1,1) on Antenna-1
Slot(1,2) on Antanna-2










FIG. 12 shows a 1-dimensional PRU specific antenna switching scheme. In FIG. 12, antenna switching is applied for two antennas. In an embodiment, the first and second set of PRUs span the same time interval but they are distinct PRU sets in frequency. This scheme uses block wise antenna switching in frequency. In another embodiment, the first and second PRU sets may span different time slots.
More generally, the transmission scheme for 4-Tx antenna case is given by:




  y
  =
  
    
      [
      
        
          
            
              
                
                  w
                  1
                
                ⁡
                
                  (
                  
                    p
                    ,
                    q
                  
                  )
                
              
              ⁢
              
                e
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      Φ
                      1
                    
                    ⁡
                    
                      (
                      
                        p
                        ,
                        q
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              
                
                  w
                  2
                
                ⁡
                
                  (
                  
                    p
                    ,
                    q
                  
                  )
                
              
              ⁢
              
                e
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      Φ
                      2
                    
                    ⁡
                    
                      (
                      
                        p
                        ,
                        q
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              
                
                  w
                  3
                
                ⁡
                
                  (
                  
                    p
                    ,
                    q
                  
                  )
                
              
              ⁢
              
                e
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      Φ
                      3
                    
                    ⁡
                    
                      (
                      
                        p
                        ,
                        q
                      
                      )
                    
                  
                
              
            
          
        
        
          
            
              
                
                  w
                  4
                
                ⁡
                
                  (
                  
                    p
                    ,
                    q
                  
                  )
                
              
              ⁢
              
                e
                
                  j
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      Φ
                      4
                    
                    ⁡
                    
                      (
                      
                        p
                        ,
                        q
                      
                      )
                    
                  
                
              
            
          
        
      
      ]
    
    ⁢
    
      s
      k
    
  




where different combination of amplitude and phase weights can be applied in each slot and the rows of the vector are transmitted from 4-antennas.

In an embodiment, the phase on the first antenna can be kept to zero. The amplitude and phase weights can be chosen from the following set:




  
    
      S
      1
    
    ∈
    
      [
      
        
          
            1
          
        
        
          
            0
          
        
        
          
            0
          
        
        
          
            0
          
        
      
      ]
    
  
  ,
  
    [
    
      
        
          0
        
      
      
        
          1
        
      
      
        
          0
        
      
      
        
          0
        
      
    
    ]
  
  ,
  
    [
    
      
        
          0
        
      
      
        
          0
        
      
      
        
          1
        
      
      
        
          0
        
      
    
    ]
  
  ,
  
    [
    
      
        
          0
        
      
      
        
          0
        
      
      
        
          0
        
      
      
        
          1
        
      
    
    ]
  
  ,
  
    [
    
      
        
          1
        
      
      
        
          
            e
            
              j
              ⁢
              
                
              
              ⁢
              
                θ
                ⁡
                
                  (
                  1
                  )
                
              
            
          
        
      
      
        
          
            e
            
              j
              ⁢
              
                
              
              ⁢
              
                θ
                ⁡
                
                  (
                  2
                  )
                
              
            
          
        
      
      
        
          
            e
            
              j
              ⁢
              
                
              
              ⁢
              
                θ
                ⁡
                
                  (
                  3
                  )
                
              
            
          
        
      
    
    ]
  




where the phase angles can take any value between 0 and 2π. In an embodiment, the phase angles may be chosen such that the phase dependent vectors form a Hadamard matrix or a generalized DFT matrix.

A Hadamard matrix is a square matrix whose entries are either +1 or −1 and whose rows are mutually orthogonal. In geometric terms, this means that every two different rows in a Hadamard matrix represent two perpendicular vectors, while in combinatorial terms, it means that every two different rows have matching entries in exactly half of their columns and mismatched entries in the remaining columns.
The amplitude and phase weighing technique can be generalized to arbitrary number of antennas.
The 2D-precoder to be used in a given slot may be obtained from a predefined code book. The precoder for (p,q)th slot can be obtained from Table-9 where W1, W2, W3, W4 may take the following sets:



  
    
      
        W
        ⁢
        
          
        
        ⁢
        1
      
      =
      
        [
        
          
            
              1
            
          
          
            
              0
            
          
          
            
              0
            
          
          
            
              0
            
          
        
        ]
      
    
    ,
    
      
        W
        ⁢
        
          
        
        ⁢
        2
      
      =
      
        [
        
          
            
              0
            
          
          
            
              1
            
          
          
            
              0
            
          
          
            
              0
            
          
        
        ]
      
    
    ,
    
      W
      ⁢
      
        
      
      ⁢
      
        3
        ⁡
        
          [
          
            
              
                0
              
            
            
              
                0
              
            
            
              
                1
              
            
            
              
                0
              
            
          
          ]
        
      
    
    ,
    
      W
      ⁢
      
        
      
      ⁢
      
        4
        ⁡
        
          [
          
            
              
                0
              
            
            
              
                0
              
            
            
              
                0
              
            
            
              
                1
              
            
          
          ]
        
      
    
    ,
    
      
    
    ⁢
    or
  




  
    
      
        W
        1
      
      =
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
        
        ]
      
    
    ,
    
      
        W
        2
      
      =
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
    ,
    
      
        W
        3
      
      =
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
    ,
    
      
        W
        4
      
      =
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
        
        ]
      
    
  



In an embodiment, W1, W2, W3, W4 can be arranged in any order.
The proposed method can be utilized with common or dedicated pilots. Common pilots or shared pilots are defined as pilots, which are common to all users or a group of users. When the system uses shared pilots, the subcarriers in a given PRU are shared by a group of users while the pilot tones are common to the group. In this case, all the users which use the shared pilots may use the same multiple antenna precoder for both data and pilot tones in that PRU.
In some systems, the data tones may be precoded using a PRU specific precoder while the pilot tones may not use precoding. In that case, the system may train each antenna using distinct pilots which are specific to that antenna.
Dedicated pilots are defined as user specific pilots. In case of dedicated pilot transmission, the pilots can be interspersed along with data and they are transmitted from both antennas with slot specific 2D-amplitude variation and/or 2D-phase rotation. Pilot structures that are designed for precoded or single antenna systems can be used with this scheme. The receiver can perform channel estimation in each PRU in a single (virtual) antenna mode and estimates a single equivalent channel per receiver antenna from the NT transmit antennas. Therefore, this scheme has a lower implementation complexity. Demodulation and decoding can be implemented using conventional techniques.
In the following, a technique which uses either a physical PRU index in frequency axis or logical PRU index indices to determine the precoder for a given PRU has been disclosed.
In an embodiment herein, the available bandwidth is divided into a number of frequency partitions. A frequency partition FPi, i=0, 1, 2, . . . , Np consists of a total of NPRU PRUs which may include localized and/or distributed resource units. The frequency spacing between distributed units is arbitrary.
If a given frequency partition contains distributed PRUs, and if precoder selection is done based on physical subcarrier index or physical PRU index, the allocated precoder sequence does not follow the desired periodic pattern. Such as scheme looses diversity gain in channels with low frequency selectivity. Moreover, if a given frequency partition contains a mix of sub-bands and mini-bands, it may not be possible to define the precoders for both sub-bands and mini-bands using PRU index as the basis.
In an embodiment herein, each PRU in a given frequency partition is assigned a logically contiguous PRU index “i” which ranges from 0, 1, 2, . . . , NPRU−1. The index “i” is assigned in the increasing order starting from first to last PRU in that frequency partition. Note that indexing is done before subcarrier per mutation if DRUs are present in that frequency partitions. In some embodiments the PRU index “i” may correspond to physically contiguous PRUs. The precoder may be defined for each PRU in that partition based on the logical PRU index.
In each frequency partition, the indexing may be done for subbands and mini-band separately. In other words, all the subbands and minibands are treated as separate sub partitions within a frequency partitions for the purpose of precoder allocation. In an alternative implementation, the subbands and a first set of minibands are utilized localized resource allocations and a second set of mini-bands are allocated for subcarrier permuted distributed allocations. In that case, the frequency partition consists of three separate sub-partitions.
If subbands are used in that frequency partition, each subband is allocated an index isubband which ranges from 0, 1, 2, . . . , Nsubbands−1. Nsubbands is the total number of subbands in the frequency sub partition.
If the first set of mini-band are utilized for localized allocations, in that frequency partition, each miniband in that first set is allocated an index iminiband 1 which ranges from 0, 1, 2, . . . , Nminiband 1−1. Nminiband 1 is the total number of minibands in the frequency sub partition.
If a second set of mini-band are utilized for the purpose of subcarrier permuted allocations, each miniband in that second set is allocated an index iminiband 2 which ranges from 0, 1, 2, . . . , Nminiband 2−1. Nminiband 2 is the total number of minibands in second set in that frequency sub partition
In some implementations, the first and seconds sets of minibands can be combined and they can be assigned an index iminiband which ranges from 0, 1, 2, . . . , Nminiband−1. Nminiband is the total number of mini-bands in the frequency sub partition.
In each sub-partition, precoder allocation can be defined using a pre-defined method. This type of sub-partition specific dependent indexing makes precoder allocation more efficient especially if system contains a mixture of subbands and mini-bands. For subbands, The precoder is kept constant for all N1 successive PRUs contained in each subband. Preferred values for N1 are 3, or 4, or 5. For mini-bands, the precoder is kept constant for N2 successive PRUs contained in each mini-band. Preferred values for N2 are 1, or 2.
In each sub partition, a precoding matrix W of size Nt×1 which is applied in each subband or miniband with frequency index “i”, and sub-frame index “v”, is determined from a code book C as: W=C(m).
For 1D-precoding “m” is defined as: m=mod [u,M]+1. For 2-D precoding “m” is defined as: m=mod [(u+v),M]+1, where M is the size of code book C, u=mod(i,M)+1. “v” is the subframe number.
In the above mentioned embodiment, the precoder which is implemented in a PRU depends on index “i” of the subband, or mini-band to which it belongs, and the subframe index “v”. In 2D-precoding, the sum of index “i” in frequency and the subframe index “v” are used to decide the precoder which is applied in that PRU. In 1D-precoding, the PRU index “i” in frequency is used to decide the precoder which is applied in that subband or miniband. In an alternative embodiment for 2D precoding, the precoding matrix W may be chosen as: W=C(m)·C(n) where the notation C(m)·C(n) denotes element-wise multiplication of the two matrices/vectors, and m=mod [u,M]+1, n=mod [v,M]+1.
For single stream 2-Tx precoding, the code book may be chosen as:




  
    
      C
      ⁡
      
        (
        1
        )
      
    
    =
    
      
        1
        
          2
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              j
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        2
        )
      
    
    =
    
      
        
          1
          
            2
          
        
        ⁡
        
          [
          
            
              
                1
              
            
            
              
                
                  -
                  j
                
              
            
          
          ]
        
      
      .
    
  




In an alternative embodiment, for 2-Tx antennas, the entries of the code book C for a typical value of M=8 are given by:




  
    
      C
      ⁡
      
        (
        1
        )
      
    
    =
    
      
        1
        
          2
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        2
        )
      
    
    =
    
      
        1
        
          2
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        3
        )
      
    
    =
    
      
        1
        
          2
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              j
            
          
        
        ]
      
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁡
      
        (
        4
        )
      
    
    =
    
      
        1
        
          2
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                j
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        5
        )
      
    
    =
    
      
        1
        
          2
        
      
      [
      
        
          
            
              1
            
          
          
            
              
                1
                +
                j
              
            
          
        
        
          2
        
      
      ]
    
  
  ,
  
    
      C
      ⁡
      
        (
        6
        )
      
    
    =
    
      
        1
        
          2
        
      
      [
      
        
          
            
              1
            
          
          
            
              
                
                  -
                  1
                
                -
                j
              
            
          
        
        
          2
        
      
      ]
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁡
      
        (
        7
        )
      
    
    ⁢
    
      
        1
        
          2
        
      
      [
      
        
          
            
              1
            
          
          
            
              
                
                  -
                  1
                
                +
                j
              
            
          
        
        
          2
        
      
      ]
    
  
  ,
  
    
      C
      ⁡
      
        (
        8
        )
      
    
    ⁢
    
      
        
          1
          
            2
          
        
        [
        
          
            
              
                1
              
            
            
              
                
                  
                    -
                    1
                  
                  -
                  j
                
              
            
          
          
            2
          
        
        ]
      
      .
    
  




For M<8, the code book will be a subset of a bigger set (M=8) in this case. For example, for M=2 first two entries can be considered, and for M=4 first four entries can be considered, and so on. Preferred values for M are 2, 4, 6, 8, respectively, but not limited to these values. The entries of the code book C for M=2 are given by:




  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        1
        )
      
    
    =
    
      [
      
        
          
            1
          
        
        
          
            1
          
        
      
      ]
    
  
  ,
  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        2
        )
      
    
    =
    
      [
      
        
          
            1
          
        
        
          
            
              -
              1
            
          
        
      
      ]
    
  




For 4-Tx antennas, single stream, transmission, the preferred entries of the code book are given by:




  
    
      C
      ⁡
      
        (
        1
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        2
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁡
      
        (
        3
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              j
            
          
          
            
              
                -
                1
              
            
          
          
            
              j
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        4
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                j
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                j
              
            
          
        
        ]
      
    
  




In an alternative embodiment the following entries may be chosen for single stream 4-Tx case:




  
    
      C
      ⁡
      
        (
        1
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        2
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁡
      
        (
        3
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        4
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
        
        ]
      
    
  




The elements of code book for 8-Tx case may be chosen as:



  
    
      
        C
        ⁡
        
          (
          1
          )
        
      
      =
      
        
          1
          
            8
          
        
        ⁡
        
          [
          
            
              
                1
              
            
            
              
                
                  e
                  
                    j
                    ⁢
                    
                      
                    
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    
                      Sin
                      (
                      
                        θ
                        1
                      
                      )
                    
                  
                
              
            
            
              
                
                  e
                  
                    j
                    ⁢
                    
                      
                    
                    ⁢
                    2
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    
                      Sin
                      (
                      
                        θ
                        1
                      
                      )
                    
                  
                
              
            
            
              
                
                  e
                  
                    j
                    ⁢
                    
                      
                    
                    ⁢
                    3
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    
                      Sin
                      (
                      
                        θ
                        1
                      
                      )
                    
                  
                
              
            
            
              
                
                  e
                  
                    j
                    ⁢
                    
                      
                    
                    ⁢
                    4
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    
                      Sin
                      (
                      
                        θ
                        1
                      
                      )
                    
                  
                
              
            
            
              
                
                  e
                  
                    j
                    ⁢
                    
                      
                    
                    ⁢
                    5
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    
                      Sin
                      (
                      
                        θ
                        1
                      
                      )
                    
                  
                
              
            
            
              
                
                  e
                  
                    j
                    ⁢
                    
                      
                    
                    ⁢
                    6
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    
                      Sin
                      (
                      
                        θ
                        1
                      
                      )
                    
                  
                
              
            
            
              
                
                  e
                  
                    j7
                    ⁢
                    
                      
                    
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    
                      Sin
                      (
                      
                        θ
                        1
                      
                      )
                    
                  
                
              
            
          
          ]
        
      
    
    ⁢
    
      
    
  




  
    
      
        where
        ⁢
        
          
        
        ⁢
        
          θ
          l
        
      
      =
      
        
          
            (
            
              
                (
                
                  l
                  -
                  1
                
                )
              
              +
              
                1
                2
              
            
            )
          
          ⁢
          
            π
            4
          
        
        -
        
          π
          23
        
      
    
    ⁢
    
      
    
  




  
    
      
        and
        ⁢
        
          
        
        ⁢
        l
      
      =
      1
    
    ,
    
      
    
    ⁢
    2
    ,
    
      
    
    ⁢
    ...
    ⁢
    
      
    
    ,
    16
  



In alternative implementation, a precoder W is applied in a PRU with two dimensional indices (p,q) where W(p,q)=W(p)·W(q) where the notation W(p)·W(q) denotes element wise multiplication of two vectors/matrices. The notation (p,q) denotes the index of the physical resource unit (PRU) in two dimensional frequency-time planes, where ‘p’ denotes PRU index along frequency, and ‘q’ denotes index in time dimension. The index “p” may be a physical PRU index or a logical index.
W(p)=C(m), where m=mod(p,rM)+1 where M is the size of code book
W(q)=C1(n), where n=mod(q,sM1)+1 where M1 is the size of code book C1, where r and s take any value greater than or equal to 1.
In 1D implementation, W(p,q)=W(p)
In an embodiment r and s are equal to 1. In an embodiment, for 2-Tx antennas, the entries of the code book C for a typical value of M=8 are given by:




  
    
      C
      ⁡
      
        (
        1
        )
      
    
    =
    
      
        1
        
          2
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        2
        )
      
    
    =
    
      
        1
        
          2
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        3
        )
      
    
    =
    
      
        1
        
          2
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              j
            
          
        
        ]
      
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁡
      
        (
        4
        )
      
    
    =
    
      
        1
        
          2
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                j
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        5
        )
      
    
    =
    
      
        1
        
          2
        
      
      [
      
        
          
            
              1
            
          
          
            
              
                1
                +
                j
              
            
          
        
        
          2
        
      
      ]
    
  
  ,
  
    
      C
      ⁡
      
        (
        6
        )
      
    
    =
    
      
        1
        
          2
        
      
      [
      
        
          
            
              1
            
          
          
            
              
                
                  -
                  1
                
                -
                j
              
            
          
        
        
          2
        
      
      ]
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁡
      
        (
        7
        )
      
    
    ⁢
    
      
        1
        
          2
        
      
      [
      
        
          
            
              1
            
          
          
            
              
                
                  -
                  1
                
                +
                j
              
            
          
        
        
          2
        
      
      ]
    
  
  ,
  
    
      C
      ⁡
      
        (
        8
        )
      
    
    ⁢
    
      
        
          1
          
            2
          
        
        [
        
          
            
              
                1
              
            
            
              
                
                  
                    -
                    1
                  
                  -
                  j
                
              
            
          
          
            2
          
        
        ]
      
      .
    
  




For M<8, the code book will be a subset of a bigger set (M=8) in this case. For example, for M=2 first two entries can be considered, and for M=4 first four entries can be considered, and so on. Preferred values for M are 2, 4, 6, 8, respectively, but not limited to these values. The entries of the code book C1 for M1=2 are given by:




  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        1
        )
      
    
    =
    
      [
      
        
          
            1
          
        
        
          
            1
          
        
      
      ]
    
  
  ,
  
    C
    ⁢
    
      
    
    ⁢
    1
    ⁢
    
      
        (
        2
        )
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  




The entries of the code book C for M=4 are given by:




  
    
      C
      ⁡
      
        (
        1
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        2
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁡
      
        (
        3
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        4
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
        
        ]
      
    
  




The entries of the code book C1 for M1=4 are given by:




  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        1
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        2
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        3
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        4
        )
      
    
    =
    
      
        1
        
          4
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
        
        ]
      
    
  




In an embodiment, the elements of the code book C can be arranged in any order. More generally, the code book C1 can be obtained from C by using a permutated version of the code book C. The permutation sequence can be obtained as follows.
Take the code book indices of C i.e., 1, 2, . . . M and write them in binary form after subtracting 1 from each index For M=4, the indices are represented as (00), (01), (10), (11).
Rewrite the indices in bit reversal order i.e. for M=4, now we have (00), (10), (01), (11), which becomes 0,2,1,3. Add 1 to entry. The permutation sequence now becomes 1,3,2,4. Use this permutation sequence to permute the code book C.
The elements of code book C1 are given by C(1), C(3), C(2), C4). This technique can be generalized applied to any code book C to obtain the permuted code book C1.
The entries of the code book C for M=8 are given by:




  
    
      C
      ⁡
      
        (
        1
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        2
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        3
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁡
      
        (
        4
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        5
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        6
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁡
      
        (
        7
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁡
      
        (
        8
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  




In an embodiment, the elements of the code book C can be arranged in any order. The entries of the code book C1 for M1=8 are given by:




  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        1
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        2
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        3
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        4
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        5
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        6
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    

  
  ⁢
  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        7
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
        
        ]
      
    
  
  ,
  
    
      C
      ⁢
      
        
      
      ⁢
      1
      ⁢
      
        (
        8
        )
      
    
    =
    
      
        1
        
          8
        
      
      ⁡
      
        [
        
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
          
            
              1
            
          
          
            
              1
            
          
          
            
              
                -
                1
              
            
          
        
        ]
      
    
  




FIG. 13 illustrates a general DFT-S-OFDMA structure with precoding. 2-transmit antennas are shown for illustration. The multi-antenna precoder is applied for each subcarrier after DFT precoding. Open loop (OL) precoding schemes such as 1D-POD in time or antenna switching in frequency or a combination of them can be employed to obtain transmit diversity gain.
FIG. 14 illustrates a general DFT-S-OFDMA structure which uses an IDFT for each antenna. The frequency domain signal is fed to the IDFT module on the first antenna. The same signal is multiplied with a PRU specific phase weight and the phase weighed signal is fed to another IDFT module. The output is transmitted on the second antenna. In 1D-POD implementation, the phase may take different values in different PRUs. However, in some cases, it is preferable to keep the phase on second antenna can be kept constant over two successive PRUs. In that case, the precoder values may change every two PRUs.
FIG. 15 illustrates the DFT-S-OFDMA structure which uses 1D-POD using a single IDFT module. The IDFT output is transmitted on first antenna. This signal is multiplied with a PRU specific phase rotation and it is transmitted on the second antenna. When the system has more than 2-Tx antennas, an antenna specific phase rotation is applied on the signal transmitted on each antenna. The phase rotation can be done in time.
FIG. 16 illustrates a more general form of precoding where the signal, which is transmitted on each antenna is multiplied with a PRU specific complex weight whose magnitude and phase depends on the antenna on which the signal is transmitted.
FIG. 17 illustrates scheme for 2-Tx antennas in which the FEC encoded modulation data is split into Nt=2 sets where the first set contains first half of data sequence and the second set contains the second half of data sequence. Each data set is transmitted using DFT-S-OFDMA transmitter and transmitted on distinct antenna. The first set of data may span first N contiguous subcarriers and second set of data may span second N contiguous set subcarriers where first and second sets may span the same time duration. Moreover, the first set and second set may be contiguous or distributed in frequency.
In an alternative embodiment, the first set of data may span first N contiguous subcarriers in the first time slot and set of data may span second N contiguous subcarriers in the second time slot. The first and second subcarriers may span the same frequency duration or they may belong to distinct subcarrier groups.
FIG. 18 illustrates the transmitter structure for Nt=4. Each set of subcarriers are contiguous in frequency. The first four sets of subcarriers may be contiguous or distributed in frequency.
In all the above embodiments, since the multiple data sets are encoded using a common channel code, and also since each set undergoes a different channel state, the receiver benefits from transmit diversity after channel decoding.
In another embodiment shown in FIG. 19, the FEC encoded data is split into multiple sets where each PAM/QAM data of each set is modulated on to contiguous subcarriers. Each set is encoded using a DFT-S-OFDMA transmitter and the signal is precoded and the precoded signal is transmitted using a subset of antennas. When the subset size is two, the precoder may be POD type precoder of form:




  W
  ∈
  
    [
    
      
        
          1
        
      
      
        
          
            e
            
              j
              ⁢
              
                
              
              ⁢
              
                θ
                ⁡
                
                  (
                  1
                  )
                
              
            
          
        
      
    
    ]
  




which is kept constant for all subcarriers with in PRU. The phase weights can be varied in time every “n” PRUs where n can be any integer.

In an embodiment, shown in FIG. 20, the precoder output to antenna mapping can be changed in time or frequency to obtain additional diversity benefit.
In all the above embodiments, the OFDM symbols which carry the data and pilot signals are transmitted using the same precoder. The precoder is kept constant for either a single time slot, pair of slots or more. Keeping the precoders constant in time is useful for enhancing the channel estimation and interference covariance estimation.
For transmission schemes described in FIGS. 17-20, each data set is equalized using a DFT-S-OFDMA receiver and the equalized bit level soft decisions are multiplexed into a single stream for channel decoding.
FIG. 21 illustrates the baseband portion of the OFDM receiver. Precoded pilot tones are used to estimate the channel state information and interference covariance estimation. A filter is used to demodulate the precoded data tones. The filter weights are computed using the estimated channel and estimated interference covariance. In typical implementations, the receiver processes each PRU independently.
FIG. 22 illustrates the baseband portion of the DFT-S-OFDMA receiver. Precoded pilot tones are used to estimate the channel state information and interference covariance estimation. A filter is used to demodulate the precoded data tones. The filter weights are computed using the estimated channel and estimated noise-plus-interference covariance. In typical implementations, the receiver processes each PRU independently.
FIG. 23 illustrates the baseband portion of the DFT-S-OFDMA receiver. Precoded pilot symbols are used to estimate the channel state information and interference covariance estimation. A filter is used to equalize the precoded data tones in frequency domain. The filter weights are computed using the estimated channel and estimated noise-plus-interference covariance. Data is demodulated after IDFT. In typical implementations, the receiver processes either single slot or pairs of slots for channel and interference covariance estimation.
The embodiments disclosed herein can be implemented through at least one software program running on at least one hardware device and performing network management functions to control the network elements. The network elements shown in FIGS. 1, 2 and 3 include blocks which can be at least one of a hardware device, or a combination of hardware device and software module.
The embodiment disclosed herein describes a method and system to achieve transmission diversity and precoding using multiple antennas in wireless networks. Therefore, it is understood that the scope of the protection is extended to such a program and in addition to a computer readable means having a message therein, such computer readable storage means contain program code means for implementation of one or more steps of the method, when the program runs on a server or mobile device or any suitable programmable device. The method is implemented in a preferred embodiment through or together with a software program written in e.g. Very high speed integrated circuit Hardware Description Language (VHDL) another programming language, or implemented by one or more VHDL or several software modules being executed on at least one hardware device. The hardware device can be any kind of portable device that can be programmed. The device may also include means which could be e.g. hardware means like e.g. an ASIC, or a combination of hardware and software means, e.g. an ASIC and an FPGA, or at least one microprocessor and at least one memory with software modules located therein. The method embodiments described herein could be implemented partly in hardware and partly in software. Alternatively, the invention may be implemented on different hardware devices, e.g. using a plurality of CPUs.
The foregoing description of the specific embodiments will so fully reveal the general nature of the embodiments herein that others can, by applying current knowledge, readily modify and/or adapt for various applications such specific embodiments without departing from the generic concept, and, therefore, such adaptations and modifications should and are intended to be comprehended within the meaning and range of equivalents of the disclosed embodiments. It is to be understood that the phraseology or terminology employed herein is for the purpose of description and not of limitation. Therefore, while the embodiments herein have been described in terms of preferred embodiments, those skilled in the art will recognize that the embodiments herein can be practiced with modification within the spirit and scope of the embodiments as described herein.

## Claims

1. An OFDM receiver comprising of a baseband portion, where said OFDM receiver receives a precoded OFDM transmit signal comprising of precoded pilot tones and precoded data tones, further where said precoded OFDM transmit signal relies on at least one of time index of a subcarrier of said precoded OFDM transmit signal; frequency index of said subcarrier; and time and frequency indices of said subcarrier and is transmitted using a plurality of antennas, said baseband portion further comprising at least one of:
estimating channel state information using said precoded pilot tones;
estimating interference covariance estimation using said precoded pilot tones;
demodulating said precoded data tones; and
computing filter weights using said channel state information and said interference covariance estimation.

2. The OFDM receiver as claimed in claim 1, wherein said receiver is configured to compute said filter weights using estimated channel and interference covariance.

3. The OFDM receiver as claimed in claim 1, wherein a filter module is configured to demodulate said precoded data tones and compute said filter weights.

4. The OFDM receiver as claimed in claim 1, wherein precoded OFDM transmit signal for Nt transmission antennas is obtained by transmitting elements of y simultaneously from said Nt antennas, where Y=W(p,q)sk,l, further wherein sk,l denotes signal present in kth subcarrier and the lth OFDM symbol contained in the (p,q)th unit of single stream, p is frequency index of y, q is time index of y and W(p,q) is a Nt×1 vector.

5. The OFDM receiver as claimed in claim 4, wherein said signal present in kth subcarrier is one of pilot and data.

6. The OFDM receiver as claimed in claim 4, wherein said unit of said stream comprises of P contiguous subcarriers and Q contiguous OFDM symbols.

7. The OFDM receiver as claimed in claim 4, wherein elements of said W(p,q) contains antenna specific phase rotation of the (p,q)th unit of said stream.

8. The OFDM receiver as claimed in claim 4, wherein said W(p,q) applied on each element in said stream is indicated by a predefined pattern.

9. The OFDM receiver as claimed in claim 4, wherein said elements of said stream comprises at least one of data and pilots.

10. A DFT-S-OFDMA receiver comprising of a baseband portion, where said receiver receives a precoded DFT-S-OFDMA transmit signal comprising of precoded pilot tones and precoded data tones, further where said precoded DFT-S-OFDMA transmit signal relies on at least one of time index of a subcarrier of said precoded DFT-S-OFDMA transmit signal; frequency index of said subcarrier; and time and frequency indices of said subcarrier and is transmitted using a plurality of antennas, said baseband portion further comprising at least one of:
estimating channel state information using said precoded pilot tones;
estimating interference covariance estimation using said precoded pilot tones;
demodulating said precoded data tones; and
computing filter weights using said channel state information and said interference covariance estimation.

11. The DFT-S-OFDMA receiver as claimed in claim 10, wherein said receiver is configured to compute said filter weights using estimated channel and interference covariance.

12. The DFT-S-OFDMA receiver as claimed in claim 10, wherein a filter module is configured to demodulate said precoded data tones and compute said filter weights.

13. The DFT-S-OFDMA receiver as claimed in claim 10, wherein said receiver is configured to perform Inverse Digital Fourier Transform (IDFT) before demodulating said precoded data tones.

14. The DFT-S-OFDMA receiver as claimed in claim 10, wherein said precoded DFT-S-OFDMA transmit signal of pilot tones and data tones is obtained by at least one of:
1-Dimensional Phase Offset Diversity (1D-POD);
antenna switching in frequency; and
antenna switching in time;
wherein said precoded DFT-S-OFDMA transmit signal chosen from a plurality of signals using an antenna chosen from said plurality of antennas, wherein said antenna is specific to said signal and each of said plurality of signals is transmitted from a distinct antenna chosen from said plurality of antennas.

15. The DFT-S-OFDMA receiver as claimed in claim 10, wherein each of said subcarriers are transmitted using an identical precoder scheme.

16. The DFT-S-OFDMA receiver as claimed in claim 10, wherein said precoded DFT-S-OFDMA transmit signal is obtained by:
applying DFT precoding to an input stream of subcarriers, wherein said subcarriers comprise of Physical Resource Units (PRUs);
performing subcarrier mapping on said subcarriers;
performing IDFT on output of said subcarriers;
adding cyclic prefix to said subcarriers;
transmitting said subcarriers from a first antenna from said plurality of transmitting antennas;
transmitting said subcarriers multiplied with a PRU specific phase rotation from a second antenna from said plurality of transmitting antennas; and
transmitting said subcarriers multiplied with a phase rotation from subsequent antennas, wherein said phase rotation relies on PRU and specific antenna.

17. The DFT-S-OFDMA receiver as claimed in claim 16, wherein each of said subcarriers are transmitted using an identical precoder.

18. The DFT-S-OFDMA receiver as claimed in claim 10, wherein said precoded DFT-S-OFDMA transmit signal is obtained by:
applying DFT precoding to an input stream of subcarriers;
performing subcarrier mapping on said subcarriers;
multiplying each of said subcarriers with a plurality of complex weights, where said number of plurality of said complex weights is equal to number of said plurality of transmitting antennas;
performing IDFT on each of said subcarriers to create a plurality of signals; and
transmitting said plurality of signals from said plurality of antennas, wherein each signal is transmitted from a distinct antenna.

19. The DFT-S-OFDMA receiver as claimed in claim 18, wherein magnitude and phase of said complex weight depends on an antenna from said plurality of antennas, wherein said antenna is used to transmit a subcarrier from said plurality of subcarriers.

20. The DFT-S-OFDMA receiver as claimed in claim 18, wherein each of said subcarriers are transmitted using an identical precoder.

21. The DFT-S-OFDMA receiver as claimed in claim 10, wherein said precoded DFT-S-OFDMA transmit signal is obtained by:
modulating FEC encoded data;
splitting said modulating FEC encoded data into a plurality of data sets, where number of said plurality of data sets is equal to said number of said plurality of antennas;
modulating each of said plurality of data sets onto contiguous subcarriers;
encoding each of said plurality of data sets using a DFT-S-OFDMA transmitter; and
transmitting each of said plurality of data sets on distinct antennas chosen from said plurality of antennas.

22. The DFT-S-OFDMA receiver as claimed in claim 10, wherein said precoded DFT-S-OFDMA transmit signal is obtained by:
modulating FEC encoded data;
splitting said modulating FEC encoded data into a plurality of data sets, where number of said plurality of data sets is equal to said number of said plurality of antennas;
performing DFT operation on each of said data sets to create a set of DFT precoded data;
modulating each of said DFT precoded data onto contiguous subcarriers to create DFT precoded data sets;
precoding each of said plurality of DFT precoded data sets using a multi-antenna precoder for a subset of said plurality of antennas to create a plurality of multi-antenna DFT precoded data streams;
performing IDFT on each of said plurality of plurality of multi-antenna DFT precoded data streams to obtain multi-antenna precoded data streams;
mapping said multi-antenna precoded data streams to said plurality of antennas; and
transmitting each of said plurality of multi-antenna precoded data streams on distinct antennas chosen from said plurality of antennas.

23. The DFT-S-OFDMA receiver as claimed in claim 22, wherein mapping of said precoded data sets to said plurality of antennas varies with one of time and frequency.

24. A DFT-S-OFDMA system with precoding comprising of a plurality of transmitting antennas, said system comprising:
estimating channel state information using said precoded pilot tones;
estimating interference covariance estimation using said precoded pilot tones;
a filter for demodulating said precoded data tones;
and computing filter weights using said channel state information and said interference covariance estimation.

25. The system, as claimed in claim 24, with precoding comprising of a plurality of transmitting antennas, said system comprising of:
a DFT precoder applying DFT precoding to an input stream of subcarriers;
a multi-antenna precoder applying a multi-antenna precoder scheme to each of said subcarriers to create a plurality of precoded subcarriers, wherein said multi-antenna precoder scheme is at least one of:
1-Dimensional Phase Offset Diversity (1D-POD);
antenna switching in time; and
antenna switching in frequency;

an IDFT module applying an IDFT to said plurality of precoded subcarriers to produce a plurality of signals; and
an antenna chosen from said plurality of antennas transmitting a signal chosen from said plurality of signals using, wherein said antenna is specific to said signal and each of said plurality of signals is transmitted from a distinct antenna chosen from said plurality of antennas.

26. The system as claimed in claim 25, wherein said DFT-S-OFDMA system is configured to transmit each of said subcarriers using an identical precoder scheme.

27. The system as claimed in claim 24, wherein said system comprising of:
a DFT precoder applying DFT precoding to an input stream of subcarriers, wherein said subcarriers comprise of Physical Resource Units (PRUs);
a subcarrier mapping module performing subcarrier mapping on output of said DFT precoder;
an IDFT module performing IDFT on output of said subcarrier mapping module;
a cyclic prefix module adding cyclic prefix to output of said IDFT module;
a first antenna from said plurality of transmitting antennas transmitting output of said cyclic prefix module;
a second antenna from said plurality of transmitting antennas transmitting output of said cyclic prefix module multiplied with a PRU specific phase rotation; and
subsequent antennas transmitting output of said cyclic prefix module multiplied with a phase rotation, wherein said phase rotation relies on PRU and specific antenna.

28. The system as claimed in claim 27, wherein said DFT-S-OFDMA system is configured to transmit each of said subcarriers using an identical precoder.

29. The system as claimed in claim 24, wherein said system comprising of:
a DFT precoder applying DFT precoding to an input stream of subcarriers;
a subcarrier mapping module performing subcarrier mapping on output of said DFT precoder;
a multiplication module for multiplying each of said subcarriers with a plurality of complex weights, where said number of plurality of said complex weights is equal to number of said plurality of transmitting antennas;
an IDFT module performing IDFT on each of said subcarriers to create a plurality of signals; and
said plurality of antennas transmitting said plurality of signals, wherein each signal is transmitted from a distinct antenna.

30. The system as claimed in claim 29, wherein said multiplication module is configured to change magnitude and phase of said complex weight depending on an antenna from said plurality of antennas, wherein said antenna is used to transmit a subcarrier from said plurality of subcarriers.

31. The system as claimed in claim 29, wherein said DFT-S-OFDMA system is configured to transmit each of said subcarriers using an identical precoder.

32. The system as claimed in claim 24, wherein, said system comprising of:
a modulator modulating FEC encoded data;
a splitting module splitting said modulating FEC encoded data into a plurality of data sets, where number of said plurality of data sets is equal to said number of said plurality of antennas;
a subcarrier mapper modulating each of said plurality of data sets onto contiguous subcarriers;
a DFT-S-OFDMA transmitter encoding each of said plurality of data sets; and
distinct antennas chosen from said plurality of antennas transmitting each of said plurality of data sets.

33. The system as claimed in claim 24, wherein, said system comprising of:
a modulator modulating FEC encoded data;
a splitting module splitting said modulating FEC encoded data into a plurality of data sets, where number of said plurality of data sets is equal to said number of said plurality of antennas;
a DFT module performing DFT operation on each of said data sets to create a set of DFT precoded data;
a modulator modulating each of said DFT precoded data onto contiguous subcarriers to create DFT precoded data sets;
a precoder precoding each of said plurality of DFT precoded data sets using a multi-antenna precoder for a subset of said plurality of antennas to create a plurality of multi-antenna DFT precoded data streams;
an IDFT module performing IDFT on each of said plurality of plurality of multi-antenna DFT precoded data streams to obtain multi-antenna precoded data streams;
a multi-antenna mapper mapping said multi-antenna precoded data streams to said plurality of antennas; and
distinct antennas chosen from said plurality of antennas transmitting each of said plurality of multi-antenna precoded data streams.

34. The system as claimed in claim 33, wherein said multi-antenna precoder is configured to vary mapping of said precoded data sets with one of time and frequency.

35. An OFDM system with precoding comprising of a plurality of transmitting antennas, said system comprising:
estimating channel state information using said precoded pilot tones;
estimating interference covariance estimation using said precoded pilot tones;
a filter for demodulating said precoded data tones;
and computing filter weights using said channel state information and said interference covariance estimation.

36. The system as claimed in claim 35, wherein said system comprising transmitting elements of y simultaneously from said Nr antennas, where 3 y=W(p,q)ski, further wherein sk,1 denotes signal present in kth subcarrier and the Ith OFDM 4 symbol contained in the (p,q)th unit of said stream, p is frequency index of y, q is time index 5 of y and W(p,q) is a Nr×1 vector.