# Patent

## Title
Method and apparatus for pilot multiplexing in a wireless communication system

## Abstract

Techniques for multiplexing pilots in a wireless transmission are described. In one aspect, a transmitter station generates multiple pilot sequences for multiple transmit antennas, with each pilot sequence comprising pilot symbols sent in the time domain on a different set of subcarriers. The transmitter station further generates multiple pilot transmissions for the transmit antennas based on the pilot sequences. In another aspect, a transmitter station generates multiple pilot sequences for multiple transmit antennas based on frequency-domain code division multiplexing (FD-CDM) of a Chu sequence defined by a transmitter-specific value. The transmitter station further generates multiple pilot transmissions for the transmit antennas based on the pilot sequences. In yet another aspect, a transmitter station generates multiple pilot transmissions for multiple transmit antennas based on a first multiplexing scheme and generates multiple data transmissions based on a second multiplexing scheme that is different from the first multiplexing scheme.

## Background
CLAIM OF PRIORITY
The present application for patent is a divisional of U.S. patent application Ser. No. 11/624,646, entitled “METHOD AND APPARATUS FOR PILOT MULTIPLEXING IN A WIRELESS COMMUNICATION SYSTEM”, filed Jan. 18, 2007, which claims priority to Provisional Application Ser. No. 60/760,482, entitled “METHOD AND APPARATUS FOR PILOT MULTIPLEXING IN A WIRELESS COMMUNICATIONS SYSTEM,” filed Jan. 20, 2006, assigned to the assignee hereof, and expressly incorporated herein by reference.


BACKGROUND
1. Field
The present disclosure relates generally to communication, and more specifically to techniques for transmitting pilots in a wireless communication system.
2. Background
In a wireless communication system, a transmitter station (e.g., a base station or a terminal) may utilize multiple (T) transmit antennas for a multiple-input multiple-output (MIMO) transmission to a receiver station equipped with multiple (R) receive antennas. The multiple transmit and receive antennas form a MIMO channel that may be used to increase throughput and/or improve reliability. For example, the transmitter station may transmit up to T data streams simultaneously from the T transmit antennas to improve throughput. Alternatively, the transmitter station may transmit a single data stream from up to T transmit antennas to improve reception by the receiver station.
Good performance may be achieved if the MIMO channel response can be accurately estimated. For example, the receiver station may use the MIMO channel response to perform data detection for the MIMO transmission, to select a spatial mapping matrix to be applied by the transmitter station for the MIMO transmission, etc. Channel estimation is typically supported by transmitting pilot symbols that are known a priori by the receiver station. The receiver station may then estimate the MIMO channel response based on the received pilot symbols and the known pilot symbols.
Channel estimates obtained based on pilot are typically impaired by both noise and interference. The noise may come from various sources such as the wireless channel, receiver electronics, etc. The interference may include inter-antenna interference and inter-transmitter interference. Inter-antenna interference is interference due to transmissions from other transmit antennas. Inter-antenna pilot interference may be present if multiple pilot transmissions are sent simultaneously from all T transmit antennas and the pilot transmission from each antenna interferes with the pilot transmissions from the other antennas. Inter-transmitter interference is interference due to transmissions from other transmitter stations. Inter-transmitter interference may also be referred to as inter-sector interference, inter-cell interference, inter-terminal interference, etc. The inter-antenna interference and inter-transmitter interference may adversely impact channel estimation, which may then degrade data performance.
There is therefore a need in the art for techniques to transmit pilot in a wireless communication system.
SUMMARY
According to an aspect, an apparatus is described which generates a plurality of pilot sequences for a plurality of transmit antennas, with each pilot sequence comprising a plurality of pilot symbols sent in the time domain on a different set of subcarriers. The apparatus further generates a plurality of pilot transmissions for the plurality of transmit antennas based on the plurality of pilot sequences.
According to another aspect, an apparatus is described which generates a plurality of pilot sequences for a plurality of transmit antennas based on frequency-domain code division multiplexing (FD-CDM) of a constant amplitude zero auto-correlation (CAZAC) sequence such as a Chu sequence defined by a transmitter-specific value. The apparatus further generates a plurality of pilot transmissions for the plurality of transmit antennas based on the plurality of pilot sequences.
According to yet another aspect, an apparatus is described which receives a plurality of pilot transmissions via a plurality of receive antennas, with each pilot transmission comprising a plurality of pilot symbols sent in the time domain on a different set of subcarriers. The apparatus processes the plurality of received pilot transmissions to obtain channel estimates.
According to yet another aspect, an apparatus is described which receives a plurality of pilot transmissions via a plurality of receive antennas, with the pilot transmissions being generated based on FD-CDM of a CAZAC sequence such as a Chu sequence defined by a transmitter-specific value. The apparatus processes the plurality of received pilot transmissions to obtain channel estimates.
According to yet another aspect, an apparatus is described which generates a plurality of pilot transmissions for a plurality of transmit antennas based on a first multiplexing scheme. The apparatus further generates a plurality of data transmissions for the plurality of transmit antennas based on a second multiplexing scheme that is different from the first multiplexing scheme.
According to yet another aspect, an apparatus is described which receives a plurality of pilot transmissions generated based on a first multiplexing scheme. The apparatus further receives a plurality of data transmissions generated based on a second multiplexing scheme that is different from the first multiplexing scheme. The plurality of pilot transmissions and the plurality of data transmissions are for a MIMO transmission sent from multiple transmit antennas to multiple receive antennas. The multiple transmit antennas may be located at a single transmitter station or multiple transmitter stations.
Various aspects and features of the disclosure are described in further detail below.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 shows a wireless multiple-access communication system.
FIG. 2 shows a block diagram of a base station and a terminal.
FIGS. 3A and 3B show two interleaved frequency division multiplexing (IFDM) pilot subcarrier structures.
FIGS. 4 and 5 show two processes for generating an IFDM pilot.
FIG. 6 shows pilot transmissions from 4 transmit antennas for an FD-CDM pilot.
FIGS. 7 and 8 show two processes for generating the FD-CDM pilot.
FIG. 9 shows a process for sending pilot and data with different multiplexing schemes.



DETAILED DESCRIPTION
The techniques described herein may be used for various wireless communication systems such as multiple-access communication systems, broadcast systems, wireless local area networks (WLANs), etc. The terms “systems” and “networks” are often used interchangeably. The multiple-access systems may be code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, orthogonal FDMA (OFDMA) systems, single-carrier FDMA (SC-FDMA) systems, spatial division multiple access (SDMA) systems, etc. The techniques may also be used for systems that employ different multiple access schemes for the downlink and uplink, e.g., OFDMA for the downlink and SC-FDMA for the uplink. The downlink (or forward link) refers to the communication link from the base stations to the terminals, and the uplink (or reverse link) refers to the communication link from the terminals to the base stations.
An OFDMA system utilizes orthogonal frequency division multiplexing (OFDM). An SC-FDMA system utilizes single-carrier frequency division multiplexing (SC-FDM). OFDM and SC-FDM partition the system bandwidth into multiple (K) orthogonal subcarriers, which are also commonly referred to as tones, bins, etc. Each subcarrier may be modulated with data. In general, symbols are sent in the frequency domain with OFDM and in the time domain with SC-FDM. SC-FDM includes (a) IFDM which transmits information on subcarriers that are uniformly distributed across a given frequency allocation and (b) localized frequency division multiplexing (LFDM) which transmits information on adjacent subcarriers.
FIG. 1 shows a wireless multiple-access communication system 100 with multiple base stations 110. A base station is generally a fixed station that communicates with the terminals and may also be referred to as a Node B, an enhanced Node B (eNode B), an access point, etc. Each base station 110 provides communication coverage for a particular geographic area. The term “cell” can refer to a base station and/or its coverage area depending on the context in which the term is used. To improve system capacity, a base station coverage area may be partitioned into multiple smaller areas, e.g., three smaller areas. Each smaller area may be served by a respective base transceiver station (BTS). The term “sector” can refer to a BTS and/or its coverage area depending on the context in which the term is used. For a sectorized cell, the BTSs for all sectors of that cell are typically co-located within the base station for the cell.
Terminals 120 may be dispersed throughout the system. A terminal may be stationary or mobile and may also be referred to as a user equipment, a mobile station, a mobile equipment, an access terminal, a station, etc. A terminal may be a cellular phone, a personal digital assistant (PDA), a wireless modem, a wireless communication device, a handheld device, a subscriber unit, a laptop computer, a cordless phone, etc.
A system controller 130 may couple to base stations 110 and provide coordination and control for these base stations. System controller 130 may be a single network entity or a collection of network entities.
FIG. 2 shows a block diagram of a design of a base station 110 and a terminal 120 in system 100. Base station 110 is equipped with multiple (U) antennas 220a through 220u, which may be used for data transmission on the downlink and data reception on the uplink. Terminal 120 is equipped with multiple (V) antennas 152a through 152v, which may be used for data transmission on the uplink and data reception on the downlink. Each antenna may be a physical antenna or an antenna array.
On the downlink, at base station 110, a transmit (TX) data and pilot processor 214 receives data from a data source 212, processes (e.g., formats, encodes, interleaves, and symbol maps) the data, and generates data symbols. Processor 214 also generates pilot symbols as described below and provides the pilot and data symbols to a TX spatial processor 216. As used herein, a data symbol is a symbol for data, a pilot symbol is a symbol for pilot, a zero symbol is a signal value of zero, and a symbol is typically a complex value. The data symbols may be modulation symbols from a modulation scheme such as PSK or QAM. Pilot is data that is known a priori by both the transmitter and receiver stations. Processor 216 multiplexes the pilot and data symbols, performs transmitter spatial mapping (if applicable), and provides U output symbol streams to U modulators (MOD) 218a through 218u. Each modulator 218 performs modulation (e.g., for OFDM, SC-FDM, etc.) on its output symbol stream to generate output chips and further processes (e.g., converts from digital to analog, analog filters, amplifies, and upconverts) the output chips to generate a downlink signal. U downlink signals from modulators 218a through 218u are transmitted via U antennas 220a through 220u, respectively.
At terminal 120, V antennas 252a through 252v receive the U downlink signals, and each antenna 252 provides a received signal to a respective demodulator (DEMOD) 254. Each demodulator 254 processes (e.g., filters, amplifies, downconverts, and digitizes) its received signal to obtain samples and further performs demodulation (e.g., for OFDM, SC-FDM, etc.) on the samples to obtain received symbols. Each demodulator 254 provides received data symbols to a MIMO detector 256 and provides received pilot symbols to a channel processor 284. Channel processor 284 estimates the downlink MIMO channel response based on the received pilot symbols and provides channel estimates to MIMO detector 256. MIMO detector 256 performs MIMO detection on the received data symbols with the channel estimates and provides data symbol estimates. An RX data processor 258 further processes (e.g., deinterleaves and decodes) the data symbol estimates and provides decoded data to a data sink 260.
On the uplink, at terminal 120, data from a data source 272 and pilot are processed by a TX data and pilot processor 274, further processed by a TX spatial processor 276, and modulated and processed by modulators 254a through 254v to generate V uplink signals, which are transmitted via V antennas 252a through 252v. At base station 110, the uplink signals are received by U antennas 220a through 220u, processed and demodulated by demodulators 218a through 218u, detected by a MIMO detector 232, and further processed by an RX data processor 234 to recover the data sent by terminal 120. A channel processor 244 estimates the uplink MIMO channel response based on the received pilot symbols and provides channel estimates to MIMO detector 232 for MIMO detection.
Controllers/processors 240 and 280 control the operation at base station 110 and terminal 120, respectively. Memories 242 and 282 store data and program codes for base station 110 and terminal 120, respectively.
The techniques described herein may be used with various subcarrier structures. The following description assumes that K total subcarriers are available for transmission and are assigned indices of 0 through K−1.
FIG. 3A shows an IFDM pilot subcarrier structure 300 that may be used for IFDM or distributed OFDM data transmission. In subcarrier structure 300, the K total subcarriers are arranged into T disjoint or non-overlapping sets such that each set contains L′ subcarriers that are uniformly distributed across the K total subcarriers, where T and L′ are suitably selected integer values. Consecutive subcarriers in each set are spaced apart by T subcarriers, where K=T·L′. Hence, set i contains subcarriers i, T+i, 2T+i, . . . , (L′−1)·T+i, for iε{0, . . . , T−1}.
FIG. 3B shows an IFDM pilot subcarrier structure 310 that may be used for LFDM or localized OFDM data transmission. In subcarrier structure 310, the K total subcarriers are arranged into G disjoint groups such that each group contains N′′=K/G consecutive subcarriers, where N′′ and G are suitably selected integer values. Thus, group 0 includes subcarrier 0 through N′′−1, group 1 includes subcarriers N′′ through 2N′′−1, and so on, and group G−1 includes subcarriers K−N′′ through K−1.
The N′′ subcarriers in each group may be arranged into T disjoint sets such that each set contains L′′ subcarriers that are uniformly distributed across the N′′ subcarriers in that group, where N′′=L′′·T. The N′′ subcarriers in each group may thus be arranged in similar manner as described above in FIG. 3A. FIG. 3B shows the T sets of subcarriers for subcarrier group 1.
In general, any subcarrier structure may be used for pilot and data transmission on the downlink and uplink. For example, subcarrier structure 300 may be used for the downlink, and subcarrier structure 310 may be used for the uplink. Other subcarrier structures may also be used. On each link, pilot and data may be sent using the same or different subcarrier structures.
A transmitter station may transmit pilot via multiple (T) transmit antennas using various multiplexing schemes such as time division multiplexing (TDM), time-domain code division multiplexing (TD-CDM), OFDM, IFDM, FD-CDM, etc. A receiver station may receive the pilot via multiple (R) receive antennas and may estimate the MIMO channel response as well as background noise and interference based on the received pilot. For the downlink, the transmitter station may be base station 110, the receiver station may be terminal 120, T may be equal to U, and R may be equal to V. For the uplink, the transmitter station may be terminal 120, the receiver station may be base station 110, T may be equal to V, and R may be equal to U. Pilot for a MIMO transmission may comprise a different pilot sequence for each of the T transmit antennas. A pilot sequence is a sequence of known symbols that may be sent in the time domain or frequency domain depending on the multiplexing scheme used for the pilot.
For TDM pilot, a time interval designated for pilot may be partitioned into T time segments that may be assigned to the T transmit antennas. The transmitter station may send a pilot transmission from each antenna in the time segment assigned to that antenna. The pilot transmission from each antenna may be any pilot sequence and may be appended with a cyclic prefix to combat frequency selective fading caused by delay spread in a multipath channel. A cyclic prefix is also referred to as a guard interval, a preamble, etc. The cyclic prefix length may be selected based on the expected delay spread. A unique word may also be used in place of the cyclic prefix. The receiver station may estimate the MIMO channel response and noise using time-domain RAKE processing (which is commonly used in CDMA systems) or frequency-domain processing. Noise estimation may be trivial since pilot is sent from only one transmit antenna in any given time segment and there is no interference from other transmit antennas. Inter-transmitter pilot interference from other transmitter stations may be suppressed by using different pilot scrambling sequences for different transmitter stations.
For TD-CDM pilot, T different orthogonal sequences may be assigned to the T transmit antennas and used to achieve orthogonality in the time domain. The transmitter station may generate a time-domain pilot sequence for each transmit antenna by multiplying a time-domain base sequence with the orthogonal sequence for that antenna. The transmitter station may then generate a pilot transmission for each transmit antenna based on its time-domain pilot sequence. The pilot transmission from each transmit antenna may not observe multipath interference due to data streams but may observe multipath interference due to pilot transmissions from other transmit antennas. The receiver station may estimate the MIMO channel response using time-domain RAKE processing, which can exploit the orthogonality among the T pilot transmissions due to use of the orthogonal sequences assigned to the T transmit antennas. The receiver station may estimate noise without interference from the observed data streams. Inter-transmitter pilot interference may be suppressed by using different pilot scrambling sequences for different transmitter stations.
For OFDM and IFDM pilots, N subcarriers may be used for pilot transmission and may be arranged into T disjoint sets, e.g., as shown in FIG. 3A or 3B, with each set including L subcarriers, where N=T·L≦K. In FIG. 3A, N may be equal to K, and L may be equal to L′. In FIG. 3B, N may be equal to N′′, and L may be equal to L′′. In any case, the L subcarriers in each set may be uniformly distributed across the N subcarriers to allow the receiver station to sample the frequency spectrum across all of the N subcarriers, which may improve channel and noise estimation performance. Each of the T transmit antennas may be assigned a different one of the T subcarrier sets.
For OFDM pilot, the transmitter station may send a pilot transmission from each transmit antenna in the frequency domain on a set of L subcarriers assigned to that antenna. For each transmit antenna, the transmitter station may map L pilot symbols to L subcarriers in the assigned set, map zero symbols to the remaining K−L subcarriers, and generate an OFDM symbol based on the mapped pilot and zero symbols. The T pilot transmissions from the T transmit antennas occupy different subcarriers and are thus orthogonal in frequency. The receiver station may perform channel and noise estimation based on received pilot symbols using frequency-domain processing. The channel and noise estimation does not suffer from inter-antenna interference since orthogonality is achieved among the T pilot transmissions. However, a drawback with OFDM is high peak-to-average power ratio (PAPR), which means that the ratio of the peak power to the average power of an OFDM waveform can be high in the time domain. The pilot symbols used for each transmit antenna may be generated or selected such that the PAPR is as low as possible. Inter-transmitter interference may be mitigated by proper pilot planning, frequency hopping, etc.
For IFDM pilot, the transmitter station may send a pilot transmission from each transmit antenna in the time domain on a set of L subcarriers assigned to that antenna. For each transmit antenna, the transmitter station may transform L pilot symbols from the time domain to the frequency domain, map the L transformed symbols to L subcarriers in the assigned set, map zero symbols to the remaining K-L subcarriers, and generate an IFDM symbol based on the mapped transformed and zero symbols. The T pilot transmissions from the T transmit antennas occupy different subcarriers and are thus orthogonal in frequency. The receiver station may perform channel and noise estimation based on received pilot symbols using frequency-domain processing. The channel and noise estimation does not suffer from inter-antenna interference since orthogonality is achieved among the T pilot transmissions. Furthermore, high PAPR may be avoided by using pilot symbols with constant amplitude in the time domain. Good channel estimation performance may be achieved by properly generating the pilot symbols as described below. Inter-sector interference may be mitigated by proper pilot planning, frequency hopping, etc.
For FD-CDM pilot, T different orthogonal sequences may be assigned to the T transmit antennas and used to achieve orthogonality in the frequency domain. The transmitter station may generate a frequency-domain pilot sequence for each transmit antenna by multiplying a frequency-domain base sequence with the orthogonal sequence for that antenna. The transmitter station may then generate a pilot transmission for each transmit antenna based on its frequency-domain pilot sequence. The T pilot transmissions from the T transmit antennas may be nearly orthogonal in a multipath channel due to use of different orthogonal sequences. The receiver station may perform channel and noise estimation based on received pilot symbols using frequency-domain processing, e.g., in similar manner as for the OFDM and IFDM pilots.
Several multiplexing schemes for pilot are described in further detail below.
1. IFDM Pilot
An IFDM pilot may be sent from the T transmit antennas on T disjoint sets of subcarriers, e.g., as shown in FIG. 3A or 3B, one set of L subcarriers for each transmit antenna. The IFDM pilot may be generated with a base sequence having good properties. For example, the base sequence may be selected to have good temporal characteristics (e.g., a constant time-domain envelope) and good spectral characteristics (e.g., a flat frequency spectrum). These good temporal and spectral characteristics may be obtained with various CAZAC (constant amplitude zero auto-correlation) sequences. Some example CAZAC sequences include a Chu sequence, a Frank sequence, a generalized chirp-like (GCL) sequence, a Golomb sequence, P1, P3, P4 and Px sequences, etc.
In one design, a Chu sequence cL(n) of length L is used as the base sequence for the IFDM pilot. This Chu sequence may be expressed as:




  
    
      
        
          
            
              c
              L
            
            ⁡
            
              (
              n
              )
            
          
          =
          
            e
            
              j
              ⁢
              
                
                  π
                  ⁢
                  
                    
                  
                  ⁢
                  λ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    n
                    2
                  
                
                L
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            n
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          L
          -
          
            1
            ⁢
            
              
            
            ⁢
            with
            ⁢
            
              
            
            ⁢
            even
            ⁢
            
              
            
            ⁢
            L
          
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          1
          )
        
      
    
  
  
    
      
        
          
            
              c
              L
            
            ⁡
            
              (
              n
              )
            
          
          =
          
            e
            
              j
              ⁢
              
                
                  π
                  ⁢
                  
                    
                  
                  ⁢
                  
                    λ
                    ⁡
                    
                      (
                      
                        n
                        +
                        1
                      
                      )
                    
                  
                  ⁢
                  n
                
                L
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            n
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          L
          -
          
            1
            ⁢
            
              
            
            ⁢
            with
            ⁢
            
              
            
            ⁢
            odd
            ⁢
            
              
            
            ⁢
            L
          
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          2
          )
        
      
    
  




where λ is a frequency increment index that is selected such that λ and L are relatively prime and have a greatest common denominator of 1. L is the base sequence length and may correspond to the number of subcarriers assigned to each transmit antenna for pilot transmission. L may be a prime number (e.g., L=257), which may provide good cross-correlation properties for Chu sequences generated with L−1 different values of λ. L may also be selected based on the number of subcarriers used for pilot transmission by each transmit antenna (e.g., L=256).

In equations (1) and (2), λ may be used as a transmitter-specific value or code to distinguish the pilots from different transmitter stations, as described below. A set of values may be determined for λ based on the sequence length L. For example, the set may include λ values of 1, 2, 3, 4, 5, and 6 for sequence length of L=7. Different λ values may be assigned to different transmitter stations, e.g., different base stations on the downlink or different terminals on the uplink. Since two base sequences generated with different λ values have minimal cross-correlation if the difference between the two λ values are relatively prime to L, pilots sent by different transmitter stations with different λ values minimally interfere with one another in such a case.
The Chu sequence has a constant time-domain envelope, which results in low PAPR for the pilot. The Chu sequence also has a flat frequency spectrum, which may improve channel estimation performance especially when the distribution of the channel spectral density is not known.
In another design, an L-point inverse discrete Fourier transform (IDFT) is performed on the Chu sequence cL(n) to obtain a transformed sequence CL(k) with L symbols. The transformed sequence is then used as the base sequence.
In yet another design, a pseudo-random number (PN) sequence pn(n) having good auto-correlation and cross-correlation properties and low PAPR properties in the time domain is used as the base sequence. The PN sequence may be derived in any manner known in the art, e.g., based on a polynomial generator or with an exhaustive search of all possible sequences of length L. Other sequences may also be used as the base sequence.
The IFDM pilot for the T transmit antennas may be generated in various manners. In one scheme, the base sequence is replicated T times and concatenated to obtain an extended base sequence, as follows:




  
    
      
        
          
            
              b
              ext
            
            ⁡
            
              (
              n
              )
            
          
          =
          
            
              ∑
              
                i
                =
                0
              
              
                T
                -
                1
              
            
            ⁢
            
              
            
            ⁢
            
              
                b
                L
              
              ⁡
              
                (
                
                  n
                  -
                  
                    i
                    ·
                    L
                  
                
                )
              
            
          
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          3
          )
        
      
    
  




where

    
    
        bL(n−i·L) is a base sequence that is delayed by i·L samples, and
        bext(n) is an extended base sequence of length N.
    
    


The base sequence bL(n) of length L may be equal to (a) the Chu sequence so that bL(n)=cL(n), (b) the PN sequence so that bL(n)=pn(n), or (c) some other sequence. In equation (3), the T copies of the base sequence bL(n) are delayed and arranged such that the start of the i-th sequence follows immediately after the end of the (i−1)-th sequence. The T delayed sequences are summed to obtain the extended base sequence bext(n) of length N.
A pilot sequence may be generated for each transmit antenna as follows:




  
    
      
        
          
            
              p
              i
            
            ⁡
            
              (
              n
              )
            
          
          =
          
            
              e
              
                j
                ⁢
                
                  
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    i
                    ⁢
                    
                      
                    
                    ⁢
                    n
                  
                  N
                
              
            
            ·
            
              
                b
                ext
              
              ⁡
              
                (
                n
                )
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            n
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          N
          -
          1
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          4
          )
        
      
    
  




where pi(n) is the pilot sequence for transmit antenna i. Equation (4) applies a linear phase ramp to the N samples in the extended base sequence. The slope of the phase ramp is different for different transmit antennas.

The base sequence bL(n) contains L time-domain samples and occupies L consecutive subcarriers. The replication of the base sequence T times results in the extended base sequence bext(n) occupying every T-th subcarriers in the frequency domain, with zeros for the T−1 subcarriers between consecutive occupied subcarriers. The multiplication with ej2πin/N in equation (4) effectively shifts the pilot sequence for transmit antenna i by i subcarriers in the frequency domain. The T pilot sequences for the T antennas are shifted by different numbers of subcarriers and are thus orthogonal in the frequency domain, with each pilot sequence occupying a different set of L subcarriers, e.g., as shown in FIG. 3A or 3B.
FIG. 4 shows a process 400 for generating the IFDM pilot. A plurality of pilot sequences are generated for a plurality of transmit antennas, with each pilot sequence comprising a plurality of pilot symbols sent in the time domain on a different set of subcarriers (block 410). The plurality of pilot sequences may be generated based on a Chu sequence with λ=1, a Chu sequence defined by a transmitter-specific λ value, some other CAZAC sequence, a PN sequence, etc. A plurality of pilot transmissions are generated based on the plurality of pilot sequences (block 420).
FIG. 5 shows a process 500 for generating the IFDM pilot. Process 500 includes blocks 510 and 520 that correspond to blocks 410 and 420, respectively, in FIG. 4. A base sequence of length L (e.g., a Chu sequence, an IDFT of the Chu sequence, a PN sequence, etc.) is initially generated (block 512). An extended base sequence of length N is then generated by replicating and concatenating multiple (T) copies of the base sequence (block 514). A pilot sequence is generated for each transmit antenna by applying a different phase ramp to the extended base sequence, e.g., as shown in equation (4) (block 516). A pilot transmission of length N+C may be generated for each transmit antenna by appending a cyclic prefix of length C to the pilot sequence for that antenna (block 520). The cyclic prefix insertion is achieved by copying the last C samples of the pilot sequence and appending these C samples to the start of the pilot sequence. The pilot transmission may also be generated in other manners based on the pilot sequence, e.g., the pilot sequence may be provided directly as the pilot transmission without any cyclic prefix.
In another scheme for generating the IFDM pilot for the T transmit antennas, which may be used for any subcarrier structure including the ones shown in FIGS. 3A and 3B, a time-domain base sequence with L pilot symbols (e.g., a Chu sequence) is initially generated. An L-point discrete Fourier transform (DFT) is then performed on the time-domain base sequence to obtain a frequency-domain base sequence with L transformed symbols. For each transmit antenna, the L transformed symbols are mapped to the L subcarriers assigned to that antenna, and N-L zero symbols are mapped to the remaining subcarriers. An N-point IDFT is then performed on the N transformed symbols and zero symbols to obtain a time-domain pilot sequence with N samples. A cyclic prefix may be appended to this pilot sequence to obtain the pilot transmission for the transmit antenna. The IFDM pilot for the T transmit antennas may also be generated in other manners.
In general, a pilot sequence or a pilot transmission may be generated by determining the symbols or samples for the pilot sequence/transmission based on appropriate equations, e.g., as described above. A pilot sequence or a pilot transmission may also be pre-computed and stored in memory. In this case, the pilot sequence or pilot transmission may be generated, whenever needed, by simply reading from the memory. Thus, the term “generate” may include any action (e.g., computation, memory retrieval, etc.) to obtain the pilot sequence or pilot transmission.
For the IFDM pilot, the T pilot transmissions from the T transmit antennas are disjoint in frequency and are thus orthogonal in a multipath channel. The PAPR is low if a pilot sequence with constant envelope in the time domain is used. Furthermore, the pilot energy is uniformly distributed in frequency if a CAZAC sequence such as a Chu sequence is used, which may simplify channel and noise estimation while providing good performance.
2. FD-CDM Pilot
An FD-CDM pilot may be sent from the T transmit antennas on the same set of N subcarriers. However, the pilot transmission from each antenna is multiplied in the frequency domain with a different orthogonal sequence. The FD-CDM pilot may be generated with a base sequence having good characteristics.
In one design, a Chu sequence cN(n) of length N is used as a time-domain base sequence for the FD-CDM pilot. This Chu sequence, for even N, may be expressed as:




  
    
      
        
          
            
              c
              N
            
            ⁡
            
              (
              n
              )
            
          
          =
          
            e
            
              j
              ⁢
              
                
                  π
                  ⁢
                  
                    
                  
                  ⁢
                  λ
                  ⁢
                  
                    
                  
                  ⁢
                  
                    n
                    2
                  
                
                N
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            n
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          N
          -
          1.
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          5
          )
        
      
    
  




An N-point IDFT may be performed on the Chu sequence cN(n) to obtain a transformed Chu sequence CN(k) with N symbols. The transformed Chu sequence may be used as a frequency-domain base sequence BN(k). In another design, the Chu sequence cN(n) is used directly as the frequency-domain base sequence. In yet another design, a PN sequence PN(k) of length N is used as the frequency-domain base sequence. Other sequences may also be used as the base sequence. In general, the frequency-domain base sequence BN(k) of length N may be equal to (a) the Chu sequence so that BN(k)=cN(n) where n=k, (b) the transformed Chu sequence so that BN(k)=CN(k), (c) the PN sequence so that BN(k)=PN(k), or (d) some other sequence.
The FD-CDM pilot for the T transmit antennas may be generated in various manners. In one scheme, a frequency-domain pilot sequence may be generated for each transmit antenna as follows:

{tilde over (P)}i(k)=Wi(k)·BN(k), for k=0, . . . , N−1,  Eq (6)

where

    
    
        Wi(k) is an orthogonal sequence for transmit antenna i, and
        {tilde over (P)}i(k) is a frequency-domain pilot sequence for transmit antenna i.
    
    


In general, various orthogonal sequences may be used for Wi(k) in equation (6). For example, the orthogonal sequences may be Walsh sequences from a Hadamard matrix, sequences from a Fourier matrix, etc. The orthogonal sequences may also have any length that is equal to or longer than T and is an integer divisor of N. In one design, the orthogonal sequences are defined as follows:




  
    
      
        
          
            
              
                W
                i
              
              ⁡
              
                (
                k
                )
              
            
            =
            
              e
              
                j
                ⁢
                
                  
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    ik
                  
                  T
                
              
            
          
          ,
          
            
              for
              ⁢
              
                
              
              ⁢
              k
            
            =
            0
          
          ,
          ...
          ⁢
          
            
          
          ,
          
            N
            -
            1
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              and
              ⁢
              
                
              
              ⁢
              i
            
            =
            0
          
          ,
          ...
          ⁢
          
            
          
          ,
          
            T
            -
            1.
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          7
          )
        
      
    
  




T orthogonal sequences may be generated based on equation (7) for i=0, . . . , T−1. These orthogonal sequences have length of N but are periodic over T and thus repeat every T symbols. The use of these orthogonal sequences does not increase the time-domain PAPR nor the frequency-domain PAPR, which is desirable.
The frequency-domain pilot sequence for each transmit antenna may then be generated as follows:




  
    
      
        
          
            
              
                P
                ~
              
              i
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              e
              
                j
                ⁢
                
                  
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    ik
                  
                  T
                
              
            
            ·
            
              
                B
                N
              
              ⁡
              
                (
                k
                )
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            k
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          N
          -
          1.
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          8
          )
        
      
    
  




Equation (8) essentially modulates the frequency-domain base sequence with the orthogonal sequence, which is at a different frequency for each transmit antenna. It can be shown that modulating the frequency-domain base sequence by ej2πik/T is equivalent to cyclically shifting the corresponding time-domain base sequence by L·i samples. The time-domain pilot sequence for each transmit antenna may then be generated as follows:

{tilde over (p)}i(n)=bN((n−i·L)mod N), for n=0, . . . , N−1,  Eq (9)

where

    
    
        bN(n) is a time-domain base sequence of length N, and
        {tilde over (p)}i(n) is a time-domain pilot sequence for transmit antenna i.
    
    


The time-domain base sequence bN(n) may be equal to (a) the Chu sequence so that bN(b)=cN(n), (b) the PN sequence so that bN(n)=pn(n), or (c) some other sequence. The cyclic shifting in equation (9) is achieved by taking the last L·i samples of the time-domain base sequence and appending these L·i samples to the start of the base sequence. Different numbers of samples are cyclically shifted for different transmit antennas. In particular, 0 samples are cyclically shifted for transmit antenna 0, L samples are cyclically shifted for transmit antenna 1, and so on, and (T−1)·L samples are cyclically shifted for transmit antenna T−1.
FIG. 6 shows example pilot sequences and pilot transmissions for T=4 transmit antennas for the FD-CDM pilot. The pilot sequence for transmit antenna 0 is equal to the base sequence bN(n). The pilot sequence for transmit antenna 1 is equal to the base sequence cyclically shifted by L samples. The pilot sequence for transmit antenna 2 is equal to the base sequence cyclically shifted by 2L samples. The pilot sequence for transmit antenna 3 is equal to the base sequence cyclically shifted by 3L samples. The pilot transmission for each transmit antenna is generated by appending a cyclic prefix to the pilot sequence for that transmit antenna.
FIG. 7 shows a process 700 for generating the FD-CDM pilot. A plurality of pilot sequences are generated for a plurality of transmit antennas based on FD-CDM of a base sequence, e.g., a CAZAC sequence such as a Chu sequence defined by a transmitter-specific λ value (block 710). A plurality of pilot transmissions are generated based on the plurality of pilot sequences (block 720). The pilot transmissions may be sent on the downlink, and neighboring base stations may be assigned different transmitter-specific values. The pilot transmissions may also be sent on the uplink, and different terminals may be assigned different transmitter-specific values.
FIG. 8 shows a process 800 for generating the FD-CDM pilot. Process 800 includes blocks 810 and 820 that correspond to blocks 710 and 720, respectively, in FIG. 7. A time-domain base sequence of length N (e.g., a Chu sequence defined by a transmitter-specific value, a PN sequence, etc.) is initially generated (block 812). A time-domain pilot sequence for each transmit antenna i is then generated by cyclically shifting the time-domain base sequence by L·i samples (block 814). The cyclic shifting in the time domain achieves the frequency-domain multiplication with the orthogonal sequence shown in equation (7). A pilot transmission of length N+C may be generated for each transmit antenna by appending a cyclic prefix of length C to the time-domain pilot sequence for that antenna (block 820).
In another scheme for generating the FD-CDM pilot for the T transmit antennas, which may be used with any orthogonal sequences and for any subcarrier structure, a time-domain base sequence of length N (e.g., a Chu sequence defined by a transmitter-specific value) is initially generated and transformed with an N-point DFT to obtain a frequency-domain base sequence. For each transmit antenna, the frequency-domain base sequence is multiplied with an orthogonal sequence assigned to that antenna to obtain an intermediate sequence. An N-point IDFT is then performed on the intermediate sequence to obtain a time-domain pilot sequence of length N. A cyclic prefix may be appended to the time-domain pilot sequence to obtain the pilot transmission for the transmit antenna. The FD-CDM pilot for the T transmit antennas may also be generated in other manners.
For both the IFDM and FD-CDM pilots with the Chu sequences, different values of λ may be assigned to different transmitter stations to reduce pilot interference and assist the receiver stations acquire pilots from the different transmitter stations. On the downlink, different λ values may be assigned to neighboring base stations or BTSs, one λ value for each base station or BTS. Each base station or BTS may generate U pilot transmissions for its U antennas with the assigned λ value, e.g., as described above. A terminal may receive pilot transmissions from multiple base stations and may be able to detect and distinguish the pilot transmissions from each base station based on the λ value assigned to that base station or BTS. On the uplink, different λ values may be assigned to different terminals that may simultaneously sent pilot transmissions to the same base station or BTS, one λ value for each terminal. Each terminal may generate V pilot transmissions for its V antennas with the assigned λ value, e.g., as described above. The base station may receive pilot transmissions from multiple terminals and may be able to detect and distinguish the pilot transmissions from each terminal based on the λ value assigned to that terminal.
It is desirable for the pilot sequences from different transmitter stations (e.g., different base stations on the downlink or different terminals on the uplink) to have as low cross-correlation as possible. Pilot sequences of length L for the IFDM pilot or length N for the FD-CDM pilot may be generated with different λ values. The cross-correlation between these pilot sequences may be determined for different time shifts. A set of λ values with small cross-correlation between their pilot sequences may be selected for use.
Different λ values may also be used to support spatial division multiplexing (SDM) on the uplink. For example, multiple terminals transmitting simultaneously to a given base station may be assigned different λ values. Each terminal may generate its pilot transmissions based on its assigned λ value. Alternatively, the multiple terminals transmitting simultaneously to the base station may be assigned the same λ value but different orthogonal sequences or cyclic shifts. Each terminal may generate its pilot transmissions based on the common λ value and its assigned orthogonal sequences or cyclic shifts.
3. Pilot and Data Multiplexing Schemes
In general, the transmitter station may achieve orthogonality between pilot and data using TDM, FDM, etc. For TDM, the transmitter station may send pilot in some time intervals and send data in other time intervals. For FDM, the transmitter station may send pilot on some subcarriers and send data on other subcarriers. The transmitter station may achieve orthogonality between the pilot transmissions from the T transmit antennas using any of the multiplexing schemes described above. The transmitter station may send pilot from T transmit antennas using a first multiplexing scheme and may send data from the T antennas using a second multiplexing scheme. In general, the first multiplexing scheme may be the same as or different from the second multiplexing scheme.
FIG. 9 shows a process 900 for sending pilot and data with different multiplexing schemes. A plurality of pilot transmissions for a plurality of transmit antennas are generated based on a first multiplexing scheme (block 912). A plurality of data transmissions for the plurality of transmit antennas are generated based on a second multiplexing scheme that is different from the first multiplexing scheme (block 914). The plurality of pilot transmissions may be sent in a first time interval, and the plurality of data transmissions may be sent in a second time interval with TDM (block 916). The plurality of pilot transmissions may also be sent on a first set of subcarriers, and the plurality of data transmissions may be sent on a second set of subcarriers with FDM.
The first multiplexing scheme may be OFDM, and the second multiplexing scheme may be SC-FDM (e.g., IFDM or LFDM), TD-CDM, SDM, etc. The first multiplexing scheme may be SC-FDM (e.g., IFDM), and the second multiplexing scheme may be OFDM, TD-CDM, SDM, etc. The first multiplexing scheme may be FD-CDM, and the second multiplexing scheme may be OFDM, SC-FDM, TD-CDM, SDM, etc. The first and second multiplexing schemes may also be other combinations of multiplexing schemes.
The first multiplexing scheme may be selected to reduce pilot overhead while achieving good channel and noise estimation performance for MIMO transmission. The second multiplexing scheme may be selected to achieve good performance for data transmission among different streams of a single terminal or among different terminals. Different multiplexing schemes for pilot and data may be readily supported using frequency-domain processing for channel estimation and data detection, as described below.
4. Channel Estimation
The receiver station may receive pilot transmissions from the transmitter station and may perform channel estimation in various manners based on the received pilot transmissions. Channel estimation may be performed in different manners for different pilot multiplexing schemes. Several example channel estimation techniques are described below.
For the IFDM pilot, the receiver station may obtain R received pilot transmissions via the R receive antennas and may remove the cyclic prefix in each received pilot transmission to obtain N time-domain samples. The receiver station may then transform the N time-domain samples for each receive antenna with an N-point DFT to obtain N received symbols for the N subcarriers used for the IFDM pilot. The received symbols from each receive antenna may be expressed as:




  
    
      
        
          
            
              R
              j
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              
                ∑
                
                  i
                  =
                  0
                
                
                  T
                  -
                  1
                
              
              ⁢
              
                
              
              ⁢
              
                
                  
                    P
                    i
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
                ·
                
                  
                    H
                    
                      i
                      ,
                      j
                    
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
            
            +
            
              
                N
                j
              
              ⁡
              
                (
                k
                )
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            k
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          N
          -
          1
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          10
          )
        
      
    
  




where

    
    
        Pi(k) is a transmitted symbol from transmit antenna i on subcarrier k,
        Hi,j(k) is a complex channel gain from transmit antenna i to receive antenna j on subcarrier k,
        Rj(k) is a received symbol from receive antenna j on subcarrier k, and
        Nj(k) is noise for receive antenna j on subcarrier k.

Pi(k) is a frequency-domain pilot sequence that may be obtained by performing an N-point DFT on the time-domain pilot sequence pi(n) for transmit antenna i.

    
    


As shown in equation (10), the received symbol Rj(k) from receive antenna j is composed of the sum of the T transmitted symbols Pi(k) weighted by the channel gains Hi,j(k) between the T transmit antennas and receive antenna j. The received symbol Rj(k) is further degraded by noise Nj(k). For the IFDM pilot, each transmit antenna i is assigned a different subset of the N subcarriers. Hence, the transmitted symbols Pi(k) from transmit antenna i are non-zero for only L subcarriers assigned to antenna i.
In one design, the channel gains are estimated based on least-squares technique, as follows:




  
    
      
        
          
            
              
                H
                ^
              
              
                i
                ,
                j
              
            
            ⁡
            
              (
              
                
                  k
                  ·
                  T
                
                +
                i
              
              )
            
          
          =
          
            
              
                R
                j
              
              ⁡
              
                (
                
                  
                    k
                    ·
                    T
                  
                  +
                  i
                
                )
              
            
            
              
                P
                i
              
              ⁡
              
                (
                
                  
                    k
                    ·
                    T
                  
                  +
                  i
                
                )
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            k
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          L
          -
          1
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          11
          )
        
      
    
  




where Ĥi,j(k·T+i) is a channel gain estimate between transmit antenna i and receive antenna j for subcarrier k·T+i, which is an estimate of Hi,j(k·T+i). Since each transmit antenna is assigned a different set of L subcarriers, equation (11) derives the channel gain estimates for each transmit antenna i by dividing the received symbols from the L subcarriers assigned to antenna i by the transmitted symbols from antenna i.

In another design, the channel gains are estimated based on minimum mean-square error (MMSE) technique, as follows:




  
    
      
        
          
            
              
                H
                ^
              
              
                i
                ,
                j
              
            
            ⁡
            
              (
              
                
                  k
                  ·
                  T
                
                +
                i
              
              )
            
          
          =
          
            
              
                
                  R
                  j
                
                ⁡
                
                  (
                  
                    
                      k
                      ·
                      T
                    
                    +
                    i
                  
                  )
                
              
              ·
              
                
                  P
                  i
                  *
                
                ⁡
                
                  (
                  
                    
                      k
                      ·
                      T
                    
                    +
                    i
                  
                  )
                
              
            
            
              
                
                  
                  
                    
                      P
                      i
                    
                    ⁡
                    
                      (
                      
                        
                          k
                          ·
                          T
                        
                        +
                        i
                      
                      )
                    
                  
                  
                
                2
              
              +
              
                
                  σ
                  N
                  2
                
                ⁡
                
                  (
                  
                    
                      k
                      ·
                      T
                    
                    +
                    i
                  
                  )
                
              
            
          
        
        ,
        
          

        
        ⁢
        
          
            for
            ⁢
            
              
            
            ⁢
            k
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          L
          -
          1
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          12
          )
        
      
    
  




where σN2(k·T+i) is the variance of the noise Nj(k·T+i) for subcarrier k·T+i. For the Chu sequence, |Pi(k·T+i)|2=1 and the denominator in equation (12) may be replaced with 1+σN2(k·T+i).

A channel gain estimate may be derived based on equation (11) or (12) or some other equation for each subcarrier k of each pair of transmit antenna i and receive antenna j. T·R sets of channel gain estimates may be obtained for all T transmit antennas and R receive antennas, one set for each transmit-receive antenna pair, with each set including L channel gain estimates for L subcarriers. Each set of channel gain estimates may be transformed with an L-point IDFT to obtain a corresponding channel impulse response estimate with L taps, as follows:

ĥi,j(l)=IDFT{Ĥi,j(k)},  Eq (13)

where ĥi,j(l) is a channel impulse response estimate between transmit antenna i and receive antenna j. The channel impulse response estimate may also be obtained from the channel gain estimates using least-squares, MMSE, robust MMSE, or some other technique known in the art.

Various types of post-processing such as truncation, thresholding, tap selection, etc., may be performed on the L channel taps of each channel impulse response estimate. For truncation, the first Q channel taps are retained and the remaining L-Q channel taps are zeroed out, where Q may be selected based on the expected delay spread of the wireless channel. For thresholding, channel taps with magnitude below a threshold are zeroed out, where the threshold may be a fixed value or a particular percentage of the total energy of all L channel taps. For tap selection, B best channel taps are retained and all other channel taps are zeroed out, where B may be a fixed value or a configurable value determined based on SNR, etc.
After completing the post-processing, the L-tap channel impulse response estimate for each transmit-receive antenna pair may be padded with N-L zeros. An N-point DFT may then be performed on the zero-padded channel impulse response estimate to obtain N channel gain estimates for the N subcarriers of the transmit-receive antenna pair. The channel gain estimates may be used for MIMO detection of received data symbols and/or other purposes
For the FD-CDM pilot, the received symbols from each receive antenna may be expressed as:




  
    
      
        
          
            
              
                R
                ~
              
              j
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              
                ∑
                
                  i
                  =
                  0
                
                
                  T
                  -
                  1
                
              
              ⁢
              
                
              
              ⁢
              
                
                  
                    
                      P
                      ~
                    
                    i
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
                ·
                
                  
                    H
                    
                      i
                      ,
                      j
                    
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
            
            +
            
              
                N
                j
              
              ⁡
              
                (
                k
                )
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            k
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          N
          -
          1
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          14
          )
        
      
    
  




where {tilde over (R)}j(k) is a received symbol from receive antenna j on subcarrier k.

In one design, the channel gains are estimated based on the least-squares technique, as follows:




  
    
      
        
          
            
              
                H
                ^
              
              
                i
                ,
                j
              
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              
                
                  
                    R
                    ~
                  
                  j
                
                ⁡
                
                  (
                  k
                  )
                
              
              
                
                  
                    P
                    ~
                  
                  i
                
                ⁡
                
                  (
                  k
                  )
                
              
            
            =
            
              
                
                  H
                  
                    i
                    ,
                    j
                  
                
                ⁡
                
                  (
                  k
                  )
                
              
              +
              
                
                  H
                  
                    inf
                    ,
                    j
                  
                
                ⁡
                
                  (
                  k
                  )
                
              
              +
              
                
                  
                    N
                    ~
                  
                  j
                
                ⁡
                
                  (
                  k
                  )
                
              
            
          
        
        ,
        
          

        
        ⁢
        
          
            for
            ⁢
            
              
            
            ⁢
            k
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          N
          -
          1
        
        ,
        
          

        
        ⁢
        where
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          15
          )
        
      
    
  
  
    
      
        
          
            
              
                H
                
                  inf
                  ,
                  j
                
              
              ⁡
              
                (
                k
                )
              
            
            =
            
              
                
                  ∑
                  
                    
                      m
                      =
                      0
                    
                    ,
                    
                      m
                      ≠
                      i
                    
                  
                  
                    T
                    -
                    1
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    
                      
                        P
                        ~
                      
                      m
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  ·
                  
                    
                      H
                      
                        m
                        ,
                        j
                      
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
              
                
                  
                    P
                    ~
                  
                  i
                
                ⁡
                
                  (
                  k
                  )
                
              
            
          
          ,
          and
        
        ⁢
        
          

        
        ⁢
        
          
            
              N
              ~
            
            j
          
          ⁡
          
            (
            k
            )
          
        
        =
        
          
            
              
                N
                j
              
              ⁡
              
                (
                k
                )
              
            
            /
            
              
                
                  P
                  ~
                
                i
              
              ⁡
              
                (
                k
                )
              
            
          
          ⁢
          
            
          
          ⁢
          is
          ⁢
          
            
          
          ⁢
          processed
          ⁢
          
            
          
          ⁢
          
            noise
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          16
          )
        
      
    
  




Hinf,j(k) is the interference observed by the channel gain estimates Ĥi,j(k) for transmit antenna i due to pilot transmissions from the other T−1 transmit antennas. For the orthogonal sequence shown in equation (7), the interference from each transmit antenna m to transmit antenna i may be expressed as:




  
    
      
        
          
            
              
                
                  
                    P
                    ~
                  
                  m
                
                ⁡
                
                  (
                  k
                  )
                
              
              ·
              
                
                  H
                  
                    m
                    ,
                    j
                  
                
                ⁡
                
                  (
                  k
                  )
                
              
            
            
              
                
                  P
                  ~
                
                i
              
              ⁡
              
                (
                k
                )
              
            
          
          =
          
            
              e
              
                j
                ⁢
                
                  
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    
                      π
                      ⁡
                      
                        (
                        
                          m
                          -
                          i
                        
                        )
                      
                    
                    ⁢
                    k
                  
                  T
                
              
            
            ·
            
              
                H
                
                  m
                  ,
                  j
                
              
              ⁡
              
                (
                k
                )
              
            
          
        
        ,
        
          

        
        ⁢
        
          
            for
            ⁢
            
              
            
            ⁢
            m
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          T
          -
          1
        
        ,
        
          m
          ≠
          
            i
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          17
          )
        
      
    
  




An N-point IDFT of equation (17) may be expressed as:




  
    
      
        
          
            h
            
              m
              ,
              j
            
          
          ⁡
          
            (
            
              l
              -
              
                
                  (
                  
                    m
                    -
                    i
                  
                  )
                
                ·
                L
              
            
            )
          
        
        =
        
          I
          ⁢
          
            
          
          ⁢
          D
          ⁢
          
            
          
          ⁢
          F
          ⁢
          
            
          
          ⁢
          T
          ⁢
          
            
              {
              
                
                  e
                  
                    j
                    ⁢
                    
                      
                        2
                        ⁢
                        
                          
                        
                        ⁢
                        
                          π
                          ⁡
                          
                            (
                            
                              m
                              -
                              i
                            
                            )
                          
                        
                        ⁢
                        k
                      
                      T
                    
                  
                
                ·
                
                  
                    H
                    
                      m
                      ,
                      j
                    
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
              }
            
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          18
          )
        
      
    
  




Equations (17) and (18) indicate that the interference from transmit antenna m to transmit antenna i is the channel impulse response hm,j(l) for transmit antenna m shifted by (m−i)·L taps. The amount of shift in hm,j(l) is equal to the difference in the cyclic shifts for transmit antennas m and i. L should thus be greater than the expected delay spread of the wireless channel. An N-point IDFT of equation (15) may then be expressed as:




  
    
      
        
          
            
              
                h
                ^
              
              
                i
                ,
                j
              
            
            ⁡
            
              (
              l
              )
            
          
          =
          
            
              
                h
                
                  i
                  ,
                  j
                
              
              ⁡
              
                (
                l
                )
              
            
            +
            
              
                h
                
                  inf
                  ,
                  j
                
              
              ⁡
              
                (
                l
                )
              
            
            +
            
              n
              ⁡
              
                (
                l
                )
              
            
          
        
        ,
        
          

        
        ⁢
        where
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          19
          )
        
      
    
  
  
    
      
        
          
            h
            
              inf
              ,
              j
            
          
          ⁡
          
            (
            l
            )
          
        
        =
        
          
            ∑
            
              
                m
                =
                0
              
              ,
              
                m
                ≠
                i
              
            
            
              T
              -
              1
            
          
          ⁢
          
            
          
          ⁢
          
            
              
                h
                
                  m
                  ,
                  j
                
              
              ⁡
              
                (
                
                  l
                  -
                  
                    
                      (
                      
                        m
                        -
                        i
                      
                      )
                    
                    ·
                    L
                  
                
                )
              
            
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          20
          )
        
      
    
  




Equations (19) and (20) indicate that the channel impulse response estimate ĥi,j(l) between transmit antenna i and receive antenna j includes the desired channel impulse response hi,j(l) plus T−1 time shifted channel impulse responses for the other T−1 transmit antennas. The removal of the other pilot sequences in equation (6) may thus be performed in the time domain by retaining the first L channel taps, which contain hi,j(l) for transmit antenna i, and discarding the remaining N-L channel taps, which contain hm,j(l) for the other T−1 transmit antennas.
For the least-squares technique with a Chu sequence having a flat frequency spectrum, an N-point IDFT may be performed on the N received symbols {tilde over (R)}j(k) for N subcarriers, after removing the phase of the transformed Chu sequence, to obtain N channel taps. For other base sequences without a flat frequency spectrum (e.g., a PN sequence), the received symbols {tilde over (R)}j(k) may be divided by the frequency-domain base sequence BN(k) and then transformed with an N-point IDFT to obtain N channel taps. For the orthogonal sequence shown in equation (7), the first L channel taps may be provided as the channel impulse response estimate ĥ0,j(l) for transmit antenna 0, the next L channel taps may be provided as the channel impulse response estimate ĥ1,j(l) for transmit antenna 1, and so on, and the last L channel taps may be provided as the channel impulse response estimate ĥT-1,j(l) for transmit antenna T−1.
In another design, the channel gains are estimated based on the MMSE technique, as follows:




  
    
      
        
          
            
              
                H
                ^
              
              
                i
                ,
                j
              
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              
                
                  R
                  j
                
                ⁡
                
                  (
                  k
                  )
                
              
              ·
              
                
                  
                    P
                    ~
                  
                  i
                  *
                
                ⁡
                
                  (
                  k
                  )
                
              
            
            
              
                
                  
                  
                    
                      
                        P
                        ~
                      
                      i
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  
                
                2
              
              +
              
                
                  σ
                  N
                  2
                
                ⁡
                
                  (
                  k
                  )
                
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            k
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          N
          -
          1.
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          21
          )
        
      
    
  




An N-point IDFT may be performed on the N channel gain estimates from equation (21) to obtain N channel taps for T channel impulse response estimates for the T transmit antennas, as described above.
In general, N received symbols {tilde over (R)}j(k) from N subcarriers for each receive antenna j may be processed with the frequency-domain base sequence BN(k) based on the least-squares technique, the MMSE technique, or some other technique to obtain N initial channel gain estimates Ĥi,j(k). The N initial channel gain estimates may be multiplied in the frequency domain with the orthogonal sequence Wi(k) for each transmit antenna to obtain L channel gain estimates for that transmit antenna. The L channel gain estimates for each transmit antenna may be transformed with an L-point IDFT to obtain an L-tap channel impulse response estimate ĥi,j(l) for that transmit antenna. Alternatively, the removal of the other pilot sequences may be performed in the time domain, as described above. In any case, post-processing (e.g., truncation, thresholding, tap selection, zero padding, etc.) may be performed on the L-tap channel impulse response estimate for each transmit antenna to obtain an N-tap zero-padded channel impulse response estimate, which may then be transformed with an N-point DFT to obtain N final channel gain estimates for the N subcarriers of that transmit antenna. The processing may be performed in different manners depending on the frequency-domain base sequence BN(k) and the orthogonal sequences Wi(k) used for the FD-CDM pilot. Channel estimation may also be performed in other manners.
The background noise and interference for each subcarrier may be estimated based on the received symbols and the channel gain estimates. For the IFDM pilot, the noise and interference for each subcarrier k may be estimated as follows:




  
    
      
        
          
            σ
            
              N
              ,
              j
            
            2
          
          ⁡
          
            (
            k
            )
          
        
        =
        
          
            
              
              
                
                  
                    R
                    j
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
                -
                
                  
                    ∑
                    
                      i
                      =
                      0
                    
                    
                      T
                      -
                      1
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      
                        P
                        i
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                    ·
                    
                      
                        
                          H
                          ^
                        
                        
                          i
                          ,
                          j
                        
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                  
                
              
              
            
            2
          
          .
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          22
          )
        
      
    
  




where σN,j2(k) the estimated variance of the noise and interference for receive antenna j on subcarrier k. The noise and interference may be estimated in similar manner for the FD-CDM pilot, albeit with Rj(k) replaced with {tilde over (R)}j(k) and Pi(k) replaced with {tilde over (P)}i(k). The noise and interference estimate σN,j2(k) may be averaged across R receive antennas to obtain a noise and interference estimate σN2(k) for each subcarrier k, which may be used for MIMO detection and/or other purposes. The noise and interference estimate σN2(k) may also be averaged over all subcarriers and across time to obtain a long-term noise and interference estimate, which may be used to estimate operating conditions and/or for other purposes.

5. MIMO Detection
The receiver station may recover data symbols sent by the transmitter station based on various MIMO detection techniques such as an MMSE technique, a zero-forcing (ZF) technique, a maximal ratio combining (MRC) technique, a space-frequency equalization technique, etc. The received data symbols from the R receive antennas for each subcarrier k may be expressed as:




  
    
      
        
          
            
              r
              _
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              
                
                  
                    H
                    _
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
                ·
                
                  
                    x
                    _
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
              +
              
                
                  n
                  _
                
                ⁡
                
                  (
                  k
                  )
                
              
            
            =
            
              
                
                  ∑
                  
                    i
                    =
                    0
                  
                  
                    T
                    -
                    1
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    
                      
                        h
                        _
                      
                      i
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  ·
                  
                    
                      X
                      i
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
              +
              
                
                  n
                  _
                
                ⁡
                
                  (
                  k
                  )
                
              
            
          
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          23
          )
        
      
    
  




where

    
    
        r(k) is an R×1 vector of received symbols from the R receive antennas,
        x(k)=[X0(k) . . . XT-1(k)]T is a T×1 vector of transmitted symbols sent from the T transmit antennas, where “T” denotes a transpose,
        hi(k)=[Hi,0(k) . . . Hi,R-1(k)]T is an R×1 vector of channel gains for transmit antenna i,
        H(k)=[h0(k) . . . hT-1(k)] is an R×T MIMO channel response matrix, and
        n(k) is an R×1 vector of noise.
    
    


The transmitted symbols Xi(k) may be data symbols sent in the frequency domain with OFDM or the DFT of data symbols sent in the time domain with SC-FDM. The channel gains in hi(k) and H(k) may be estimated based on the received pilot transmissions, as described above.
Equalizer coefficients may be derived based on the MMSE, ZF, and MRC techniques, as follows:




  
    
      
        
          
            
              
                w
                _
              
              i
              H
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              
                
                  S
                  i
                
                ⁡
                
                  (
                  k
                  )
                
              
              
                1
                +
                
                  
                    
                      S
                      i
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  ·
                  
                    
                      
                        h
                        _
                      
                      i
                      H
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  ·
                  
                    
                      
                        Ψ
                        _
                      
                      i
                      
                        -
                        1
                      
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  ·
                  
                    
                      
                        h
                        _
                      
                      i
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
            
            ·
            
              
                
                  h
                  _
                
                i
                H
              
              ⁡
              
                (
                k
                )
              
            
            ·
            
              
                
                  Ψ
                  _
                
                i
                
                  -
                  1
                
              
              ⁡
              
                (
                k
                )
              
            
          
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          24
          )
        
      
    
  
  
    
      
        
          
            
              
                
                  w
                  _
                
                ~
              
              i
              H
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              
                
                  S
                  i
                
                ⁡
                
                  (
                  k
                  )
                
              
              
                1
                +
                
                  
                    
                      S
                      i
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  ·
                  
                    
                      
                        h
                        _
                      
                      i
                      H
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  ·
                  
                    
                      
                        h
                        _
                      
                      i
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
            
            ·
            
              
                
                  h
                  _
                
                i
                H
              
              ⁡
              
                (
                k
                )
              
            
          
        
        ,
        and
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          25
          )
        
      
    
  
  
    
      
        
          
            
              
                
                  w
                  _
                
                ⋓
              
              i
              H
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              
                h
                _
              
              i
              H
            
            ⁡
            
              (
              k
              )
            
          
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          26
          )
        
      
    
  




where

    
    
        wiH(k) is a 1×R vector of MMSE equalizer coefficients for transmit antenna i,
        {tilde over (w)}iH(k) is a 1×R vector of ZF equalizer coefficients for transmit antenna i,
        {hacek over (w)}iH(k) is a 1×R vector of MRC equalizer coefficients for transmit antenna i,
        Si(k)=E{|Xi(k)|2} is a power spectrum of Xi(k) sent from antenna i,
        Ψi(k) is an R×R noise and interference covariance matrix for antenna i, and “H” denotes a conjugate transpose
    
    


The noise and interference covariance matrix may be expressed as:




  
    
      
        
          
            
              
                Ψ
                _
              
              i
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              
                ∑
                
                  
                    m
                    =
                    0
                  
                  ,
                  
                    m
                    ≠
                    i
                  
                
                
                  T
                  -
                  1
                
              
              ⁢
              
                
              
              ⁢
              
                
                  
                    S
                    m
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
                ·
                
                  
                    
                      h
                      _
                    
                    m
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
                ·
                
                  
                    
                      h
                      _
                    
                    m
                    H
                  
                  ⁡
                  
                    (
                    k
                    )
                  
                
              
            
            +
            
              
                R
                _
              
              ⁡
              
                (
                k
                )
              
            
          
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          27
          )
        
      
    
  




where R(k)=E{n(k)·nH(k)} is an R×R noise covariance matrix, and E{ } is an expectation operation.

The noise covariance matrix may be approximated as R(k)=σN2(k)·I for spatially and spectrally uncorrelated noise, where I is an identity matrix. R(k) may also be estimated based on equation (22).
MIMO detection for each transmit antenna i may be performed as follows:

Yi(k)=wiH(k)·r(k)=Bi(k)·Xi(k)+Vi(k),  Eq (28)

where

    
    
        Yi(k) is a biased estimate of Xi(k) sent from transmit antenna i,
        Bi(k)=wiH(k)·hi(k) is a scaling factor for Xi(k), and
        Vi(k) is post-detection noise and interference for Xi(k).
    
    


The detected symbols for each transmit antenna i may then be expressed as:




  
    
      
        
          
            
              X
              ^
            
            i
          
          ⁡
          
            (
            k
            )
          
        
        =
        
          
            
              
                Y
                i
              
              ⁡
              
                (
                k
                )
              
            
            
              
                B
                i
              
              ⁡
              
                (
                k
                )
              
            
          
          .
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          29
          )
        
      
    
  




The detected symbols {circumflex over (X)}i(k) may be provided directly as data symbol estimates if the data symbols are sent in the frequency domain with OFDM. The detected symbols may be transformed with an IDFT to obtain the data symbol estimates if the data symbols are sent in the time domain with SC-FDM.
Those of skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
The various illustrative logical blocks, modules, and circuits described in connection with the disclosure herein may be implemented or performed with a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
The steps of a method or algorithm described in connection with the disclosure herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.
Headings are included herein for reference and to aid in locating certain sections. These headings are not intended to limit the scope of the concepts described therein under, and these concepts may have applicability in other sections throughout the entire specification.
The previous description of the disclosure is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to the disclosure will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other variations without departing from the spirit or scope of the disclosure. Thus, the disclosure is not intended to be limited to the examples described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

## Claims

1. An apparatus comprising:
at least one processor configured to generate a plurality of pilot sequences for a plurality of transmit antennas based on frequency-domain code division multiplexing (FD-CDM) of a Chu sequence defined by a transmitter-specific value, and to generate a plurality of pilot transmissions based on the plurality of pilot sequences; and
a memory coupled to the at least one processor.

2. The apparatus of claim 1, wherein the at least one processor generates the Chu sequence with the transmitter-specific value, and generates the plurality of pilot sequences based on the Chu sequence.

3. The apparatus of claim 2, wherein the at least one processor generates the Chu sequence as follows:




  
    c
    ⁡
    
      (
      n
      )
    
  
  =
  
    e
    
      j
      ⁢
      
        
          πλ
          ⁢
          
            
          
          ⁢
          
            n
            2
          
        
        N
      
    
  




where c(n) is the Chu sequence, N is a length of the Chu sequence, 2 is the transmitter-specific value, and n is time index.

4. The apparatus of claim 2, wherein the at least one processor generates each of the plurality of pilot sequences based on a different cyclic shift of the Chu sequence.

5. The apparatus of claim 1, wherein the at least one processor generates a frequency-domain base sequence based on the Chu sequence, multiplies the frequency-domain base sequence with a plurality of orthogonal sequences to obtain a plurality of intermediate sequences, and generates the plurality of pilot sequences based on the plurality of intermediate sequences.

6. The apparatus of claim 1, wherein the plurality of pilot transmissions are sent on downlink, and wherein neighboring base stations are assigned different transmitter-specific values.

7. The apparatus of claim 1, wherein the plurality of pilot transmissions are sent on uplink, and wherein different terminals are assigned different transmitter-specific values.

8. A method comprising:
generating a plurality of pilot sequences for a plurality of transmit antennas based on frequency-domain code division multiplexing (FD-CDM) of a Chu sequence defined by a transmitter-specific value; and
generating a plurality of pilot transmissions based on the plurality of pilot sequences.

9. The method of claim 8, wherein the generating the plurality of pilot sequences comprises
generating the Chu sequence with the transmitter-specific value, and
generating the plurality of pilot sequences based on the Chu sequence.

10. The method of claim 8, wherein the generating the plurality of pilot sequences comprises
generating each of the plurality of pilot sequences based on a different cyclic shift of the Chu sequence.

11. An apparatus comprising:
means for generating a plurality of pilot sequences for a plurality of transmit antennas based on frequency-domain code division multiplexing (FD-CDM) of a Chu sequence defined by a transmitter-specific value; and
means for generating a plurality of pilot transmissions based on the plurality of pilot sequences.

12. The apparatus of claim 11, wherein the means for generating the plurality of pilot sequences comprises
means for generating the Chu sequence with the transmitter-specific value, and
means for generating the plurality of pilot sequences based on the Chu sequence.

13. The apparatus of claim 11, wherein the means for generating the plurality of pilot sequences comprises
means for generating each of the plurality of pilot sequences based on a different cyclic shift of the Chu sequence.

14. An apparatus comprising:
at least one processor configured to receive, via a plurality of receive antennas, a plurality of pilot transmissions generated based on frequency-domain code division multiplexing (FD-CDM) of a Chu sequence defined by a transmitter-specific value, and to process the plurality of received pilot transmissions to obtain channel estimates; and
a memory coupled to the at least one processor.

15. The apparatus of claim 14, wherein for each received pilot transmission the at least one processor obtains received symbols based on the received pilot transmission and derives channel estimates for a plurality of transmit antennas based on the received symbols.

16. The apparatus of claim 15, wherein for each received pilot transmission the at least one processor derives a plurality of channel taps comprising a plurality of non-overlapping sets of channel taps based on the received symbols, and provides each of the plurality of non-overlapping sets of channel taps as a channel impulse response estimate for a different one of the plurality of transmit antennas.

17. The apparatus of claim 15, wherein for each received pilot transmission the at least one processor multiplies the received symbols with a plurality of orthogonal sequences to obtain a plurality of sets of symbols for the plurality of transmit antennas, and derives channel estimates for each transmit antenna based on a corresponding set of symbols.

18. The apparatus of claim 14, wherein for each received pilot transmission the at least one processor obtains received symbols based on the received pilot transmission, scales the received symbols based on a plurality of pilot sequences determined based on the Chu sequence to obtain a plurality of sets of scaled symbols, and derives channel estimates for a plurality of transmit antennas based on the plurality of sets of scaled symbols.

19. The apparatus of claim 14, wherein the plurality of received pilot transmissions are obtained via downlink, and wherein neighboring base stations are assigned different transmitter-specific values.

20. The apparatus of claim 14, wherein the plurality of received pilot transmissions are obtained via uplink, and wherein different terminals are assigned different transmitter-specific values.

21. The apparatus of claim 14, wherein the plurality of received pilot transmissions are obtained via uplink, and wherein different terminals are assigned a common transmitter-specific value and different cyclic shifts of a pilot sequence generated by the FD-CDM of the Chu sequence defined by the common transmitter-specific value.

22. A method comprising:
receiving, via a plurality of receive antennas, a plurality of pilot transmissions generated based on frequency-domain code division multiplexing (FD-CDM) of a Chu sequence defined by a transmitter-specific value; and
processing the plurality of received pilot transmissions to obtain channel estimates.

23. The method of claim 22, wherein the processing the plurality of received pilot transmissions comprises, for each received pilot transmission,
obtaining received symbols based on the received pilot transmission,
deriving a plurality of channel taps comprising a plurality of non-overlapping sets of channel taps based on the received symbols, and
providing each of the plurality of non-overlapping sets of channel taps as a channel impulse response estimate for a different one of a plurality of transmit antennas.

24. The method of claim 22, wherein the processing the plurality of received pilot transmissions comprises, for each received pilot transmission,
obtaining received symbols based on the received pilot transmission,
scaling the received symbols based on a plurality of pilot sequences determined based on the Chu sequence to obtain a plurality of sets of scaled symbols, and
deriving channel estimates for a plurality of transmit antennas based on the plurality of sets of scaled symbols.

25. An apparatus comprising:
means for receiving, via a plurality of receive antennas, a plurality of pilot transmissions generated based on frequency-domain code division multiplexing (FD-CDM) of a Chu sequence defined by a transmitter-specific value; and
means for processing the plurality of received pilot transmissions to obtain channel estimates.

26. The apparatus of claim 25, wherein the means for processing the plurality of received pilot transmissions comprises, for each received pilot transmission,
means for obtaining received symbols based on the received pilot transmission,
means for deriving a plurality of channel taps comprising a plurality of non-overlapping sets of channel taps based on the received symbols, and
means for providing each of the plurality of non-overlapping sets of channel taps as a channel impulse response estimate for a different one of a plurality of transmit antennas.

27. The apparatus of claim 25, wherein the means for processing the plurality of received pilot transmissions comprises, for each received pilot transmission,
means for obtaining received symbols based on the received pilot transmission,
means for scaling the received symbols based on a plurality of pilot sequences determined based on the Chu sequence to obtain a plurality of sets of scaled symbols, and
means for deriving channel estimates for a plurality of transmit antennas based on the plurality of sets of scaled symbols.

28. A computer-program product for wireless communications, comprising a non-transitory computer-readable medium comprising instructions executed by at least one processor to:
generate a plurality of pilot sequences for a plurality of transmit antennas based on frequency-domain code division multiplexing (FD-CDM) of a Chu sequence defined by a transmitter-specific value; and
generate a plurality of pilot transmissions based on the plurality of pilot sequences.

29. A computer-program product for wireless communications, comprising a non-transitory computer-readable medium comprising instructions executed by at least one processor to:
receive, via a plurality of receive antennas, a plurality of pilot transmissions generated based on frequency-domain code division multiplexing (FD-CDM) of a Chu sequence defined by a transmitter-specific value; and
process the plurality of received pilot transmissions to obtain channel estimates.