# Patent

## Title
Space-time-frequency coded OFDM communications over frequency-selective fading channels

## Abstract

Techniques are described for space-time-frequency (STF) coding of multi-carrier transmissions over frequency-selective fading channels. In particular, techniques for STF coding of MIMO-OFDM systems are described that provide maximum diversity, high coding gains, and low decoding complexity are described. A set of generally correlated OFDM subcarriers are divided into groups of subcarriers creating a set of group STF (GSTF) subsystems, within which STF coding is applied to each GSTF subsystem. Subcarrier grouping preserves maximum diversity gains and simplifies both the code construction within each GSTF and decoding complexity. ST coding techniques are used in designing STF block (STFB) and STF trellis (STFT) codes which are applied within GSTF subsystems.

## Background
This application claims priority from U.S. Provisional Application Ser. No. 60/464,307, filed Apr. 21, 2003, the entire content of which is incorporated herein by reference.


TECHNICAL FIELD
The invention relates to communication systems and, more particularly, transmitters and receivers for use in wireless communication systems.
BACKGROUND
Providing reliable high data rate services, e.g. real-time multimedia services, over wireless communication channels is a paramount goal in developing coding and modulation schemes. In wireless mobile communications, a channel that couples a transmitter to a receiver is often time-varying due to relative transmitter-receiver motion and multipath propagation. This time variation is commonly referred to as fading, and may severely impair performance of a wireless communication system. When a data rate for the system is high in relation to bandwidth, multipath propagation may become frequency-selective and cause intersymbol interference (ISI). Multipath fading in wireless communication channels causes performance degradation and constitutes the bottleneck for increasing data rates. In order to combat fading, techniques have been developed to exploit the available diversity.
As one example, space-time (ST) coding effectively combats fading while enhancing data rates by exploiting the presence of spatial diversity offered by multiple transmit and/or receive antennas which form a multiple-input-multiple-output (MIMO) communication system. ST coding relies on simultaneous coding across space and time to achieve diversity gain with high bandwidth efficiency. Two typical ST codes are ST trellis codes and ST block codes. In ST coding, the maximum achievable diversity advantage is equal to the number of transmit and receive antennas. Therefore, ST coding is constrained by the size and cost which a system can afford. As a result, exploitation of extra diversity dimensions, such as multipath diversity, is desirable.
Multipath diversity becomes available when frequency-selectivity is present, as is the typical case for broadband wireless channels. Multi-antenna transmissions over frequency-selective fading channels can provide a maximum diversity gain that is multiplicative in the number of transmit antennas, receive antennas, and the channel length. Space-frequency coding (SF) exploits multipath diversity by relying on simultaneous coding across space and frequency, i.e. combining an MIMO system with orthogonal frequency-division multiplexing (OFDM) modulation. Due to the prohibitive complexity in constructing SF codes, previously existing ST codes have been adopted by replacing the time domain with the frequency domain. For example, existing ST block codes and trellis-coded modulation (TCM) codes have been adopted but do not result in maximum spatial and frequency diversity gain guarantees.
Space-time-frequency (STF) coding exploits the spatial, temporal, and frequency diversities available in MIMO-OFDM systems by coding the information-bearing symbols among antennas in time and frequency. Simple repetition codes can be used to achieve the maximum diversity gain available in frequency-selective MIMO channels at the expense of bandwidth efficiency.
SUMMARY
In general, the invention is directed to space-time-frequency (STF) coding techniques for multi-carrier transmissions over frequency-selective fading channels. In particular, techniques are described for STF coding for MIMO-OFDM systems that provide maximum diversity, high coding gains, and low decoding complexity. During transmission, a set of generally correlated orthogonal frequency-division multiplexing (OFDM) subcarriers are divided into groups of subcarriers. Thus, the STF system is converted into a set of group STF (GSTF) subsystems, within which STF coding is applied to each GSTF subsystem. Subcarrier grouping preserves maximum diversity gains and simplifies both the code construction within each GSTF and decoding. ST coding techniques are used in designing STF block (STFB) codes and STF trellis (STFT) codes, which are applied within GSTF subsystems.
In one embodiment, the invention is directed to a wireless communication device comprising a subcarrier selector that divides a set of orthogonal frequency-division multiplexing (OFDM) subcarriers into two or more groups of subcarriers, and an encoder that applies a set of codes to each of groups of subcarriers to encode a data stream and produce an outbound data stream for transmission through a wireless communication channel.
In another embodiment, the invention is directed to a wireless communication device comprising a plurality of receive antennas, a demodulator, and a decoder. The plurality of receive antennas OFDM waveform, wherein the OFDM waveform has a plurality of subcarriers and carries a symbol data stream encoded within the subcarriers by separate application of an orthogonal set of codes to groups of the subcarriers. The demodulator receives the multi-carrier output waveform and produces a demodulated data stream. The decoder decodes the demodulated data stream and produces a stream of estimated symbols.
In an additional embodiment, the invention is directed to a method which groups a set of orthogonal frequency-division multiplexing (OFDM) subcarriers into two or more groups of subcarriers. Codes are applied to each of the groups of subcarriers to encode a data stream and produce an outbound data stream and an OFDM waveform is transmitted through a wireless communication channel in accordance with the outbound data stream.
In another embodiment, the invention is directed to a method which receives an orthogonal frequency-division multiplexing (OFDM) waveform, wherein the OFDM waveform has a plurality of subcarriers and carries a stream of symbols encoded within the subcarriers by separate application of a set of codes to groups of the subcarriers. The multi-carrier output waveform is demodulated to produce a demodulated data stream and the demodulated data stream is decoded to produce an estimated data stream. In yet another embodiment, the invention is directed to a computer-readable medium containing instructions. The instructions cause a programmable processor to group a set of orthogonal frequency-division multiplexing (OFDM) subcarriers into two or more groups of subcarriers and apply a set of codes to each of the groups of subcarriers to produce an outbound data stream. An OFDM waveform is transmitted in accordance with the outbound data stream.
In an additional embodiment, the invention is directed to a system comprising a transmitter and receiver. The transmitter applies codes to groups of orthogonal frequency-division multiplexing (OFDM) subcarriers to encode the subcarrier groups in space, time and frequency, wherein the transmitter outputs an OFDM waveform via a plurality of transmit antennas in accordance with the encoded subcarrier groups. The receiver receives the OFDM waveform and produces a stream of estimated symbols.
The STF coding techniques for multi-carrier transmissions over frequency selective fading channels may offer one or more advantages. For example, a maximum diversity up to order NtNr(L+1) can be achieved, where Nt is the number of transmit antennas, Nr is the number of receive antennas, and (L+1) is the number of taps corresponding to each FIR channel. Moreover, this maximum diversity may be achieved with lower complexity code construction and decoding algorithms.
The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.



BRIEF DESCRIPTION OF DRAWINGS
FIG. 1 is a block diagram illustrating an exemplary wireless communication system in which a transmitter and a receiver implement space-time-frequency (STF) coding techniques.
FIG. 2 is a conceptual diagram illustrating STF coded transmissions.
FIG. 3 is an example block diagram of another wireless communication system using space-time-frequency (STF) coding techniques in accordance with the principles of the invention.
FIG. 4 is a flow chart illustrating an example mode of operation of a communication system in which a transmitter and a receiver communicate using STF coding techniques in accordance with the principles of the invention.
FIGS. 5-8 are graphs illustrating modeled performance estimates of the STF coding techniques described herein.



DETAILED DESCRIPTION
Throughout the Detailed Description, bold upper letters denote matrices, bold lower letters stand for column vectors; (●)T, (●)*, and (●)H denote transpose, conjugate, and conjugate transpose, respectively; diag(d1, . . . , dp) denotes a P×P diagonal matrix with diagonal entries d1, . . . , dp; and Ip stands for the P×P identity matrix.
FIG. 1 is a block diagram illustrating multi-antenna orthogonal frequency-division multiplexing (OFDM) wireless communication system 2 in which transmitter 4 communicates data to receiver 8 through wireless channel 12. In particular, FIG. 1 illustrates the discrete-time equivalent baseband model in which transmitter 4 transmits data with Nt transmit antennas 7 and receiver 8 receives data with Nr receive antennas 9. OFDM has been adopted by many standards including digital audio and video broadcasting (DAB, DVB) in Europe and high-speed digital subscriber lines (DSL) in the United States. OFDM has also been proposed for local area mobile wireless broadband standards including IEEE 802.11a, MMAC and HIPERLAN/2. Wireless communication system 2 represents a multiple-input-multiple-output (MIMO) OFDM system having Nc subcarriers employed per antenna transmission.
In general, the invention described herein provides space-time-frequency (STF) coding techniques for MIMO-OFDM systems with maximum diversity, high coding gains, and low decoding complexity. In particular, transmitter 4 divides a set of generally correlated OFDM subcarriers into groups of subcarriers. Consequently, STF system 2 is converted into a set of group STF (GSTF) subsystems, within which STF coding is applied to each GSTF subsystem. Space-time (ST) coding techniques are used in constructing STF block (STFB) codes and STF trellis (STFT) codes STF codes for application by the GSTF systems. The described techniques preserve maximum diversity gains and simplify both the code construction and decoding algorithm. The techniques described herein may be applied to uplink and/or downlink transmissions, i.e. transmissions from a base station to a mobile device and vice versa. Transmitters 4 and receivers 8 may be any device configured to communicate using a multi-user wireless transmission, including a cellular distribution station, a hub for a wireless local area network, a cellular phone, a laptop or handheld computing device, a personal digital assistant (PDA), or other device.
In the exemplary embodiment of FIG. 1, transmitter 4 has multiple transmit paths corresponding to the Nt transmit antennas 7. Each transmit path includes an Inverse Fast Fourier Transform unit 5 and a cyclic prefix (CP) insertion unit 6. Similarly, receiver 8 has multiple receive paths corresponding to the Nr receive antennas 9. Each receive path includes a CP removal unit 10 and a Fast Fourier Transform unit 11. The IFFT units 5 of transmitter 4 and FFT units 11 of receiver 8 convert OFDM transmissions, which propagate through fading channel 12 with possible intersymbol interference (ISI), into a set of parallel ISI-free subcarriers. To avoid inter-block interference (IBI) between successive IFFT processed blocks, CP insertion unit 6 inserts a cyclic prefix (CP) having a length greater than or equal to the order of channel 12 for each transmission block. With the CP length at least as long as the order of channel 12, IBI is avoided by CP removal unit 10 discarding the received samples corresponding to the CP at receiver 8.
In general, fading channel 12 between the μ th transmit antenna 7 and ν th receive antenna 9 is frequency-selective but time-flat, and can be described by the discrete-time baseband equivalent impulse response vector hμν:=[hμν(0), . . . , hμν(L)]T, with L representing the order of channel 8. The channel impulse response includes the effects of transmit receive filters, physical multipath, and relative delays among transmit and receive antennas 7, 9.
The data symbol transmitted on the p th subcarrier from the μ th transmit antenna 7 during the n th OFDM symbol interval can be denoted xnν(p). As defined, the symbols {xnν(p), μ=1, . . . , Nt, p=0,1, . . . , Nc−1} are transmitted in parallel on Nc subcarriers Nt transmit antennas 7. The three variables μ, n, and p introduced index space, time, and frequency dimensions associated with the transmission of xnν(p). As a result, xnν(p) can be viewed as a point in a three-dimensional (3-D) STF parallelepiped.
At receiver 8, each receive antenna 9 receives a noisy superposition of the multi-antenna transmissions through fading channel 12. For brevity, ideal carrier synchronization, timing, and perfect symbol-rate sampling is assumed. After CP removal and FFT processing at receiver 8, the received data sample ynν(p) at the ν th receive antenna 9 can be expressed as given in equation (1). Hμν(p) is the subcarrier gain from the μ th transmit antenna 7 to the ν th receive antenna 9 evaluated on the p th subcarrier and is given in equation (2). The additive noise wnν(p) is circularly symmetric, zero-mean, complex Gaussian with variance N0 that is also assumed to be statistically independent with respect to n, ν, p.




  
    
      
        
          
            
              y
              n
              v
            
            ⁡
            
              (
              p
              )
            
          
          =
          
            
              
                ∑
                
                  μ
                  =
                  1
                
                
                  N
                  t
                
              
              ⁢
              
                
                  
                    H
                    
                      μ
                      ⁢
                      
                        
                      
                      ⁢
                      v
                    
                  
                  ⁡
                  
                    (
                    p
                    )
                  
                
                ⁢
                
                  
                    א
                    n
                    u
                  
                  ⁡
                  
                    (
                    p
                    )
                  
                
              
            
            +
            
              
                w
                n
                v
              
              ⁡
              
                (
                p
                )
              
            
          
        
        ,
        
          

        
        ⁢
        
          v
          =
          1
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          
            
              N
              r
            
            ⁢
            
              
            
            ⁢
            p
          
          =
          0
        
        ,
        ...
        ⁢
        
          
        
        ,
        
          
            N
            c
          
          -
          1
        
      
    
    
      
        (
        1
        )
      
    
  
  
    
      
        
          
            H
            
              μ
              ⁢
              
                
              
              ⁢
              v
            
          
          ⁡
          
            (
            p
            )
          
        
        :=
        
          
            ∑
            
              l
              =
              0
            
            L
          
          ⁢
          
            
              
                h
                
                  μ
                  ⁢
                  
                    
                  
                  ⁢
                  v
                
              
              ⁡
              
                (
                l
                )
              
            
            ⁢
            
              e
              
                
                  -
                  
                    j
                    ⁡
                    
                      (
                      
                        2
                        ⁢
                        
                          π
                          /
                          
                            N
                            c
                          
                        
                      
                      )
                    
                  
                
                ⁢
                lp
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




Equation (1) represents a general model for multi-antenna OFDM systems. The method in which data symbols xnν(p) are generated from information symbols sn creates trade-offs among performance, decoding complexity, and transmission rate. In wireless system 2, the generation of xnν(p) is performed via STF coding, which is described in further detail in FIG. 2.
FIG. 2 is a conceptual diagram illustrating STF codewords 28 as the collection of transmitted symbols within parallelepiped 20, spanned by Nt transmit antennas 22, OFDM symbol intervals 24, and Nc subcarriers 26. Therefore, one STF codeword contains NtNxNc transmitted symbols {xnν(p), μ=1, . . . , Nt, p=0,1, . . . , Nc−1}, which for mathematical convenience can be organized in a block matrix as given in equation (3) where X(p) represents parallel transmissions over different frequencies and is defined in equation (4).

X:=[X(0), . . . , X(Nc−1)]  (3)





  
    
      
        
          X
          ⁡
          
            (
            p
            )
          
        
        :=
        
          [
          
            
              
                
                  
                    
                      x
                      0
                      1
                    
                    ⁡
                    
                      (
                      p
                      )
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  ...
                  ⁢
                  
                    
                  
                  ⁢
                  
                    x
                    
                      
                        N
                        x
                      
                      -
                      1
                    
                    1
                  
                
              
              
                
                  (
                  p
                  )
                
              
            
            
              
                
                  ⋮
                  ⁢
                  
                    
                  
                
              
              
                ⋮
              
            
            
              
                
                  
                    
                      x
                      0
                      
                        N
                        t
                      
                    
                    ⁡
                    
                      (
                      p
                      )
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  ...
                  ⁢
                  
                    
                  
                  ⁢
                  
                    x
                    
                      
                        N
                        x
                      
                      -
                      1
                    
                    
                      N
                      t
                    
                  
                
              
              
                
                  (
                  p
                  )
                
              
            
          
          ]
        
      
    
    
      
        (
        4
        )
      
    
  




Let the MIMO channel matrix be defined H(p)∈CNrxNt with (ν, μ)th entry [H(p)]νμ=Hνμ(p), the received sample matrix Y(p)∈CNrxNx with [Y(p)]νn=ynν(p), and noise matrix W(p)∈CNrxNx. Equation (5) below follows from equation (1) which confirms that OFDM yields parallel X(p) transmissions over different frequencies. Because each X(p) can be thought of as being transmitted using an ST system, the Nc in equation (5) provides a model for the 3-D STF model illustrated in FIG. 2. In general, the transmissions of xnν(p)s are separable in both time and frequency but not in space. This separability is useful when developing a space-virtual-time system for the construction of STFT codes, which is described in detail later.

Y(p)=H(p)X(p)+W(p), p=0, . . . , Nc−1  (5)

Suppose that X has been generated by N1 information symbols collected in the block s:=[s0, . . . , s N−1]T. STF coding is then defined as an one-to-one mapping Ψ as given in equation (6).

Ψ:s→X  (6)

Because X is described in equation (3) by three dimensions, STF coding simultaneously encodes information over space, time, and frequency, as is implied by the name. The design of Ψ is discussed in greater detail below.

Let Assn be the alphabet set to which the information symbol sn belongs, and let |As| be the cardinality of As. Because X is uniquely mapped from s, the number of possible STF codewords X is |As| N1, which can be collected into a finite set Ax with |Ax|=|As| N1. From a conceptual point of view, STF coding is equivalent to constructing the finite set Ax, as well as specifying the mapping Ψ. By the definition of X, it is clear that transmitting N1 information symbols uses Nc subcarriers and occupies Nx OFDM symbols. Therefore, the STF code rate is defined as given in equation (7). Accounting for the CP and the constellation size |As|, the transmission rate is therefore given in equation (8).




  
    
      
        R
        =
        
          
            
              N
              _
            
            I
          
          
            
              N
              c
            
            ⁢
            
              N
              κ
            
          
        
      
    
    
      
        (
        7
        )
      
    
  
  
    
      
        
          R
          T
        
        =
        
          
            
              
                N
                _
              
              I
            
            
              
                (
                
                  
                    N
                    c
                  
                  +
                  L
                
                )
              
              ⁢
              
                N
                κ
              
            
          
          ⁢
          
            log
            2
          
          ⁢
          
            
            
              A
              s
            
            
          
          ⁢
          bps
          ⁢
          
            /
          
          ⁢
          Hz
        
      
    
    
      
        (
        8
        )
      
    
  




The techniques described herein optimize tradeoffs among performance, rate, and complexity based on equation (1) or its matrix counterpart given in equation (5) through design of Ψ and choosing system parameters. In order to achieve optimal tradeoffs, the design of STF coding is linked with the performance of the STF transmission modeled in equation (5).

The design criteria for the described STF coding is derived while keeping in mind the importance of simplifying the code design as much as possible without sacrificing system performance. The derivations are based on the following three assumptions.

    
    
        1.) Maximum likelihood (ML) detection is performed with channel state information (CSI) that is known at the receiver. CSI can be acquired either via preamble training or via inserted pilots.
    
    


2.) High signal-to-noise ratio (SNR) is observed at the receiver.
3.) The Nt(L+1)×1 channel vector hν:=[h1νT, . . . , hNtνT]T is zero-mean, complex Gaussian with full-rank correlation matrix Rh=E(hνhνH). However, hν s for different ν are statistically independent, which can be satisfied by sufficiently separating the multiple receive antennas.
Note that Rh in the third assumption allows for correlated wireless channel taps with, e.g. an exponential power profile. However, as will be proved later in the Detailed Description, the described STF codes are independent of Rh as long as Rh has full rank. Consequently, the design of STF codes can be simplified.
The optimal performance when STF transmissions obey the assumptions above is examined in the following paragraphs. Even when exact performance analysis is possible, it may not lead to meaningful design criteria. Alternatively, analysis can be carried out by evaluating pairwise error probability (PEP). Recalling equation (5), the PEP P(X→X′) is defined as the probability that ML decoding of X erroneously decides X′ in favor of the actually transmitted X.
According to equation (5) ML decoding of X from {Y(p)}p=0Nc−1 yields equation (9) where ∥●∥ denotes the Frobenius norm. Conditioned on H(p) s, it then follows that the PEP is given below in equation (10) where d2(X,X′) is given in equation (11) and Δ(p):=X(p)−X′(p)




  
    
      
        
          X
          ^
        
        =
        
          arg
          ⁢
          
            
              
                
              
              ⁢
              min
            
            
              X
              ∈
              
                A
                x
              
            
          
          ⁢
          
            
              ∑
              
                p
                =
                0
              
              
                
                  N
                  c
                
                -
                1
              
            
            ⁢
            
              
                
                
                  
                    Y
                    ⁡
                    
                      (
                      p
                      )
                    
                  
                  -
                  
                    
                      H
                      ⁡
                      
                        (
                        p
                        )
                      
                    
                    ⁢
                    
                      X
                      ⁡
                      
                        (
                        p
                        )
                      
                    
                  
                
                
              
              2
            
          
        
      
    
    
      
        (
        9
        )
      
    
  
  
    
      
        
          P
          ⁡
          
            (
            
              
                
                  X
                  →
                  
                    X
                    ′
                  
                
                ❘
                
                  H
                  ⁡
                  
                    (
                    0
                    )
                  
                
              
              ,
              ...
              ⁢
              
                
              
              ,
              
                H
                ⁡
                
                  (
                  
                    
                      N
                      c
                    
                    -
                    1
                  
                  )
                
              
            
            )
          
        
        ≤
        
          exp
          ⁡
          
            [
            
              -
              
                
                  
                    
                      d
                      2
                    
                    ⁢
                    X
                  
                  ,
                  
                    X
                    ′
                  
                
                
                  4
                  ⁢
                  
                    N
                    0
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        10
        )
      
    
  
  
    
      
        
          
            d
            2
          
          ⁡
          
            (
            
              X
              ,
              
                X
                ′
              
            
            )
          
        
        =
        
          
            ∑
            
              p
              =
              0
            
            
              
                N
                c
              
              -
              1
            
          
          ⁢
          
            
              
              
                
                  H
                  ⁡
                  
                    (
                    p
                    )
                  
                
                ⁢
                
                  Δ
                  ⁡
                  
                    (
                    p
                    )
                  
                
              
              
            
            2
          
        
      
    
    
      
        (
        11
        )
      
    
  




Defining (L+1)x1, equation (2) can be expressed as equation (12) as follows.

Huν(p)=hμνTω(p)  (12)

Because Rh is positive definite Hermitian symmetric, Rh can be decomposed as Rh=BhBhH, where Bh·∈CNt(L+1)xNt(L+1) is the square root of Rh with full rank. The Nt(L+1)x1 pre-whitened channel vector hν is further defined as hν:=[ h1ν(0), . . . , h1ν(L), . . . , hNtν(0), . . . , hNtν(L)]T=Bh−1h. It follows from the third assumption that hμν(l) s are independent and identically distributed (i.i.d.), zero mean, complex Gaussian with variance 1/(2L+2) per dimension. Substituting equation (12) into equation (11) and based on eigen-analysis and standard deviations, equation (10) can be rewritten as equation (13) below where equations (14-16) define Λe, Λe,Ω(p) respectively. The Kronecker product is denoted by {circle around (x)}.




  
    
      
        
          
            d
            2
          
          ⁡
          
            (
            
              X
              ,
              
                X
                ′
              
            
            )
          
        
        =
        
          
            
              ∑
              
                υ
                =
                1
              
              
                N
                r
              
            
            ⁢
            
              
                h
                v
                T
              
              ⁢
              
                Λ
                e
              
              ⁢
              
                h
                v
                *
              
            
          
          =
          
            
              ∑
              
                v
                =
                1
              
              
                N
                t
              
            
            ⁢
            
              
                
                  h
                  _
                
                v
                T
              
              ⁢
              
                
                  Λ
                  _
                
                e
              
              ⁢
              
                
                  h
                  _
                
                v
                *
              
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




 Λe:=BhTΛeBh*  (14)





  
    
      
        
          Λ
          e
        
        :=
        
          
            ∑
            
              p
              =
              0
            
            
              
                N
                c
              
              -
              1
            
          
          ⁢
          
            
              Ω
              ⁡
              
                (
                p
                )
              
            
            ⁢
            
              
                Δ
                H
              
              ⁡
              
                (
                p
                )
              
            
            ⁢
            
              
                Ω
                H
              
              ⁡
              
                (
                p
                )
              
            
          
        
      
    
    
      
        (
        15
        )
      
    
  




Ω(p)=INt{circle around (x)}ω(p)  (16)

Because the design of STF coding should not depend on particular channel realizations, it is appropriate to consider the expected PEP averaged over all channel realizations. Assume that Λe has rank rank( Λe) and denote its nonzero eigen-values as λe,i. Using the second and third assumptions from above, the expected PEP is then given by equation (17) below where equations (18, 19) are the pairwise diversity and coding advantages, respectively.




  
    
      
        
          P
          ⁡
          
            (
            
              X
              →
              
                X
                ′
              
            
            )
          
        
        ≤
        
          
            (
            
              
                G
                
                  e
                  ,
                  c
                
              
              ⁢
              
                1
                
                  4
                  ⁢
                  
                    N
                    0
                  
                
              
            
            )
          
          
            -
            
              G
              
                e
                ,
                d
              
            
          
        
      
    
    
      
        (
        17
        )
      
    
  




Ge,d=Nr·rank( Λe)  (18)





  
    
      
        
          ∏
          
            i
            =
            1
          
          
            rank
            ⁡
            
              (
              
                
                  Λ
                  _
                
                e
              
              )
            
          
        
        ⁢
        
          
            [
            
              
                1
                
                  L
                  +
                  1
                
              
              ⁢
              
                λ
                
                  e
                  ,
                  i
                
              
            
            ]
          
          
            1
            /
            
              rank
              ⁡
              
                (
                
                  
                    Λ
                    _
                  
                  e
                
                )
              
            
          
        
      
    
    
      
        (
        19
        )
      
    
  




Because both Ge,d and Ge,c depend on choice of the pair {X, X′}, the overall diversity and coding advantages are further defined in equations (20, 21) respectively. The minimization is taken over all pairs of distinct STF codewords in 3-D.





  
    
      
        
          G
          d
        
        =
        
          
            min
            
              ∀
              
                
              
              ⁢
              
                
                  X
                  ≠
                  
                    X
                    ′
                  
                
                ∈
                
                  A
                  x
                
              
            
          
          ⁢
          
            
          
          ⁢
          
            G
            
              e
              ,
              d
            
          
        
      
    
    
      
        (
        20
        )
      
    
  
  
    
      
        
          G
          c
        
        =
        
          
            min
            
              ∀
              
                
              
              ⁢
              
                
                  X
                  ≠
                  
                    X
                    ′
                  
                
                ∈
                
                  A
                  x
                
              
            
          
          ⁢
          
            
          
          ⁢
          
            G
            
              e
              ,
              c
            
          
        
      
    
    
      
        (
        21
        )
      
    
  




At reasonably high SNR, the diversity advantage plays a more substantial role than the coding advantage in improving the performance in wireless fading channels. Consequently, in one embodiment, the described STF coding techniques focus on achieving maximum diversity advantage while improving coding advantage as much as possible.
The expression of Ge,d and Ge,c in equations (17) and (18) have important implications on the design of the described system. First, the dimensionality of Λe reveals that the maximum diversity advantage in the described system is




  
    
      G
      d
      max
    
    =
    
      
        N
        r
      
      ⁢
      
        
          N
          t
        
        ⁡
        
          (
          
            L
            +
            1
          
          )
        
      
    
  
  ,




which is the same as that for ST codes and SF codes with maximum diversity gains. Second, because Bh has full rank, the maximum diversity advantage can be achieved if and only if Λe has full rank. Therefore, the number of linearly independent rows or columns contributed by each summand, Ω(p)ΔH (p)ΩH (p) in Λe is no more than Nt because the maximum rank of each summand is Nt. As a result, in order to maximize the diversity advantage, the number of subcarriers should be greater than or equal to the order of the channel, i.e. Nc≧L+1. The latter implies that to achieve maximum diversity advantage, joint coding should be applied across at least L+1 subcarriers. However, since Λe can have full rank even when Nx=1, coding across multiple subcarriers is not required. In other words, maximum diversity advantage can be achieved with SF coding, which is subsumed by STF coding. As will be described in greater detail below, taking into account the time dimension substantially simplifies the design of the STF code and offers design flexibility. Third, the maximum diversity advantage is achieved, i.e. Λe has full rank, when Ge,c can be factored as given in equation (22).





  
    
      
        
          G
          
            e
            ,
            c
          
        
        =
        
          
            
              
                1
                
                  L
                  +
                  1
                
              
              ⁡
              
                [
                
                  det
                  ⁡
                  
                    (
                    
                      
                        Λ
                        _
                      
                      e
                    
                    )
                  
                
                ]
              
            
            
              1
              /
              
                
                  N
                  t
                
                ⁡
                
                  (
                  
                    L
                    +
                    1
                  
                  )
                
              
            
          
          =
          
            
              
                1
                
                  L
                  +
                  1
                
              
              ⁡
              
                [
                
                  
                    det
                    ⁡
                    
                      (
                      
                        R
                        h
                      
                      )
                    
                  
                  ⁢
                  
                    det
                    ⁡
                    
                      (
                      
                        Λ
                        e
                      
                      )
                    
                  
                
                ]
              
            
            
              1
              /
              
                
                  N
                  t
                
                ⁡
                
                  (
                  
                    L
                    +
                    1
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        22
        )
      
    
  




Therefore, maximizing the coding advantage translates into maximizing the determinant Λe, which is independent of the channel correlation when Rh has full rank.

Thus far, the codeword Ax has been linked to the diversity advantage Gd, and the coding advantage Gc. Rank and determinant design criteria for STF coding involve designing the set Ax with codewords X of size Nt×NxNc so as to maximize both Gd and Gc. These design criteria are reduced to those proposed for SF coding when Nx=1. However, Nc is typically a large number in practical OFDM systems, e.g. Nc=48 in HIPERLAN 2. Therefore, design of STF codes or SF codes for such systems requires large size codewords. Because of the difficulties encountered in designing ST or SF codes of a much smaller size, it follows that such a design will be even more challenging, without any effort to alleviate the “curse of dimensionality.” The techniques described herein employ subcarrier grouping to reduce the dimensionality and thus facilitate design and decoding.
The first step toward subcarrier grouping for STF coding is to choose the number of subcarriers. In some embodiments, the number of subcarriers is equal to an integer multiple of the channel length as given in equation (23), where Ng is a positive integer denoting the number of groups.

Nc=Ng(L+1)  (23)

The second step toward subcarrier grouping for STF coding is to split the Nt×NxNx STF codeword X into Ng group STF (GSTF) codewords Xg, g=0, . . . , Ng−1, as given in equation (24) where Xg(l)=X(Ngl+g).

Xg=[Xg(0), . . . , Xg(L)]  (24)

Accordingly, the STF system of equation (5) is divided into Ng GSTF (sub)systems which are described through the input-output relationships of equation (25) where Yg (l), Hg (l), and Wg (l) are defined in equations (26-28) respectively.

Yg(l)=Hg(l)Xg(l)+Wg(l), l=0,1, . . . ,Ng−1  (25)

Yg(l)=Y(Ngl+g)  (26)

Hg(l)=H(Ngl+g)  (27)

Wg(l)=W(Ngl+g)  (28)

Each GSTF subsystem is a simplified STF system with a substantially smaller size in the frequency dimension in comparison with the original STF system. In order to take advantage of subcarrier grouping, STF coding is applied within each GSTF subsystem, i.e. STF coding is performed to generate Xg s individually rather than generating X as a whole. Such subcarrier grouping does not result in any reduction in the diversity advantage but does result in reducing the design complexity substantially. GSTF coding is distinguished from STF coding in equation (6) by hereafter naming the STF coding for each GSTF subsystem as GSTF coding and denoting it as such by the unique mapping of equation (29) where Nlx1 is the information symbol block used to generate Xg. It then follows that NI and thus, the code rate of equation (7) can be re-expressed as in equation (30).

Ψg:sg→Xg  (29)





  
    
      
        R
        =
        
          
            N
            1
          
          
            
              (
              
                L
                +
                1
              
              )
            
            ⁢
            
              N
              x
            
          
        
      
    
    
      
        (
        30
        )
      
    
  




Therefore, the design of Ψ is converted into the design of the set {Ψg}g=0Ng−1. Because all Ψg s are uniform, only one Ψg is described in detail in the following paragraphs.
The design criteria for the GSTF codes Xg are derived by analyzing the expected PEP p for two distinct GSTF codewords Xg:=[Xg(0), . . . ,Xg(L)]T and X′g:=[X′g(0), . . . ,X′g(L)]T. First, the notation defined in equations (31-34) is introduced.

Δg(l):=Xg(l)−X′g(l)  (31)

Ωg(l):=Ω(Ngl+g)  (32)





  
    
      
        
          Λ
          
            e
            ,
            g
          
        
        :=
        
          
            ∑
            
              l
              =
              0
            
            L
          
          ⁢
          
            
          
          ⁢
          
            
              
                Ω
                g
              
              ⁡
              
                (
                l
                )
              
            
            ⁢
            
              
                Δ
                g
              
              ⁡
              
                (
                l
                )
              
            
            ⁢
            
              
                Δ
                g
                H
              
              ⁡
              
                (
                l
                )
              
            
            ⁢
            
              
                Ω
                g
                H
              
              ⁡
              
                (
                l
                )
              
            
          
        
      
    
    
      
        (
        33
        )
      
    
  




 Λe,g:=BhTΛe,gBh*  (34)

Following steps similar to those used to derive equation (17), the pairwise diversity advantage for a GSTF subsystem is given in equation (35) where rank( Λe,g) denotes the rank of Λe,g. When Λe,g has full rank Nt(L+1), the coding advantages for GSTF subsystems is given by equation (36) which is the per group counterpart of equation (22).

Gg,e,d=Nrrank( Λe,g)  (35)





  
    
      
        
          G
          
            g
            ,
            e
            ,
            c
          
        
        =
        
          
            
              1
              
                L
                +
                1
              
            
            ⁡
            
              [
              
                
                  det
                  ⁡
                  
                    (
                    
                      R
                      h
                    
                    )
                  
                
                ⁢
                
                  det
                  ⁡
                  
                    (
                    
                      Λ
                      
                        e
                        ,
                        g
                      
                    
                    )
                  
                
              
              ]
            
          
          
            1
            /
            
              
                N
                t
              
              ⁡
              
                (
                
                  L
                  +
                  1
                
                )
              
            
          
        
      
    
    
      
        (
        36
        )
      
    
  




As mentioned previously, the goal is to preserve maximum diversity advantage and achieve the largest possible coding advantage. Letting Ax,g be the set of all possible Xg s and following the arguments presented earlier, this goal can be translated into designing Ax,g such that Λe,g has full rank and det(Λe,g) is maximized. Although subcarrier grouping clearly simplifies the design of Xg in comparison to X, the design of Xg is still challenging. However, by exploiting the fact that the described STF system is designed irrespective of the channel correlation, the design can further be simplified by letting Rh=I. For convenience, the resulting system is termed hereafter as “dummy” STF system.
Because Rh=I in the dummy system, the NtNr(L+1) channel taps hμν(l) for l=0, . . . ,L, μ=1, . . . ,Nt, ν=1, . . . ,Nr become i.i.d., zero-mean, complex Gaussian with variance 1/(2L+2) per dimension according to the third assumption. It then follows that ∀ μ, μ′, ν, ν′, and p1≠p2 from which it is deduced that Hμν(p1) and Hμ′ν′(p2) are statistically independent as shown in equation (37).

E[Hμν(p1)H*μ′ν′(p2)]=0, if mod(p1−p2,Ng)=0  (37)

Consequently, the dummy GSTF subsystem possesses the following property. When Rh=I and the parameters are chosen according to equation (22), all subcarriers within {Hg(l)}l=0L of each GSTF subsystem are statistically independent.

By utilizing this property, the PEP analysis is re-preformed to obtain the counterparts of equations (35, 36) respectively as equations (38, 39) where Λe(l):=Δg(l)Δl(l).




  
    
      
        
          G
          
            g
            ,
            e
            ,
            d
          
        
        =
        
          
            N
            r
          
          ⁢
          
            
              ∑
              
                l
                =
                0
              
              L
            
            ⁢
            
              
            
            ⁢
            
              rank
              [
              
                
                  Λ
                  e
                
                ⁡
                
                  (
                  1
                  )
                
              
              ]
            
          
        
      
    
    
      
        (
        38
        )
      
    
  
  
    
      
        
          G
          
            g
            ,
            e
            ,
            c
          
        
        =
        
          
            [
            
              
                ∏
                
                  l
                  =
                  0
                
                L
              
              ⁢
              
                
              
              ⁢
              
                det
                ⁡
                
                  [
                  
                    
                      Λ
                      e
                    
                    ⁡
                    
                      (
                      l
                      )
                    
                  
                  ]
                
              
            
            ]
          
          
            1
            /
            
              
                N
                t
              
              ⁡
              
                (
                
                  L
                  +
                  1
                
                )
              
            
          
        
      
    
    
      
        (
        39
        )
      
    
  




Because the dummy STF system is a special case of the designed STF system, the diversity and coding advantages in equations (38, 39) are identical to those in equations (35, 36) with Rh=I. Targeting maximum diversity and coding advantages as paramount goals, the following two design criteria are deduced.

The first design criteria is referred to as the “sum-of-ranks” criterion and requires designing Ax,g such that ∀Xg≠X′g, the matrices of equation (40) have full rank. The second design criteria is referred to as the “product-of-determinants” criterion and requires that for the set of matrices satisfying the sum-of-ranks criterion, design Ax,g such that ∀Xg≠X′g, which is the minimum of equation (41), is maximized.

Λe(l)=[Xg(l)−X′g (l)][Xg(l)−X′g (l)]H, ∀l∈[0,L]  (40)





  
    
      
        
          ∏
          
            l
            =
            0
          
          L
        
        ⁢
        
          
        
        ⁢
        
          det
          ⁡
          
            [
            
              
                Λ
                e
              
              ⁡
              
                (
                l
                )
              
            
            ]
          
        
      
    
    
      
        (
        41
        )
      
    
  




In order to achieve maximum diversity gain, it follows from the first design criteria that Nx≧Nt. Therefore, coding across different time slots may be advantageous in GSTF coding. Compared with SF coding where no time-dimension processing is performed, allowing for coding across time provides several advantages. First, checking the dimensionality of Xg per equation (24) reveals that the minimum size of the GSTF codewords is Nt×Nt(L+1) whereas a typical SF codeword size is Nt×Nc. In typical applications, Nc>Nt(L+1) which results in lower design complexity for GSTF coding relative to existing ST and SF codes. Second, l in both equations (40) and (41) is related to l in a more simplified manner as compared with existing SF codes. This enables GSTF codes to be constructed with improved performance over existing SF codes, which will be verified by simulations in following figures.
The dimensionality of Λe(l) reveals the maximum diversity advantage of each GSTF subsystem is NtNr(L+1), which is equivalent to the maximum diversity advantage of STF systems without subcarrier grouping. Thus, subcarrier grouping does not sacrifice diversity order even with arbitrary subcarrier grouping, as opposed to grouping according to equation (24), as long as each GSTF subsystem contains L+1 subcarriers. However, arbitrary subcarrier grouping generally involves correlated subcarriers per dummy GSTF system, which decrease the coding advantage. Because STF code design does not depend on channel correlation, the subcarrier grouping scheme of equation (24) is optimal in the sense of maximizing coding advantage for a GSTF system of a given size.
It should be noted that for channels with L=0, the described STF design criteria are, respectively, reduced to the rank and determinant criteria proposed for flat Rayleigh fading channels in existing ST codes for high data-rate wireless communication. Additionally, when Nx=1, the described STF design criteria become the distance and product criteria used to construct existing ST codes for fast fading channels.
FIG. 3 is an example block diagram illustrating multi-antenna OFDM wireless communication system 30 in which transmitter 32 communicates with receiver 58 through channels 48A and 48B (collectively, “channel 48”) with the STF coding techniques in accordance with the principles of the invention. In particular, FIG. 3 transmitter 32 transmits data with Ng=2 and Nt=2 transmit antennas 46A and 46B (collectively “transmit antennas 46”). Receiver 58 receives data through channel 48 which is frequency-selective but time-flat and is described by the discrete-time baseband equivalent impulse response as given previously.
In general, transmitter 32 jointly encodes an outbound data stream in space, time and frequency and modulates the outbound data stream to produce a multi-carrier output waveform. The multi-carrier output waveform is divided into groups with each group having subcarriers. Transmitter 32 applies codes, which may take the form of block codes or trellis codes, to the groups of subcarriers. Receiver 58 uses an ML decoding algorithm to recover the received multi-carrier output waveform. Maximum diversity is achieved by employing subcarrier grouping as described herein, while linear precoding, for example, allows maximum coding gains and low-complexity decoding.
Linear encoding increases the bandwidth efficiency of GSTF codes and is carried out in two successive stages: constellation precoding and ST component coding. Constellation precoders 36A and 36B (collectively “constellation precoders 36”) enables multipath diversity, while ST component coder 38A and 38B (collectively “ST component coders 38”) collects spatial diversity. The resulting GSTF codes are capable of achieving maximum diversity advantages while allowing low-complexity two-stage optimal decoding. Based on the previously discussed observations, the design of GSTF codewords Xg can be accomplished by the joint design of ST codewords {Xg(l)}l=0L in conjunction with the stated design criteria. GSTF block (GSTFB) codes are described in detail below followed by GSTF trellis (GSTFT) codes.
Information blocks sg are received by demultiplexer 34 and are chosen to have Nl=Ng(L+1) information symbols, where Ns is dependent on Nt and is specified below. Demultiplexer 34 demultiplexes information blocks sg into {sg,i,i=0, . . . ,Ns−1} sub-blocks such that sg:=[sg,0T, . . . , sg,Ns−1T]T. Constellation precoders 36 distributes information symbols over multiple subcarriers by precoding sg,i to obtain {tilde over (s)}g,i where Θ∈C(L+1)×(L+1) denotes the square constellation precoder. The precoded blocks {tilde over (s)}g,i s are subsequently processed to form the GSTF codeword Xg via ST component coder 38.
The design of ST component coders 38 may extend from the generalized complex orthogonal design (GCOD) described in V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space-time block codes from orthogonal designs,” in IEEE Transactions on Information Theory, vol. 45, pp. 1456-1467, July 1999, which is incorporated herein by reference. Let ONt be an Nd×Nt matrix with nonzero entries drawn from the set i. If equation (42) is satisfied for some positive constant α, then ONt is referred to as a GCOD in variables Ns−1. Provided GCODs exist, a GCOD can be found with size (Ns,Nd) which satisfies equation (43). Using the nonzero entries i, ONt can be represented as given in equation (44) where, the real matrices {Ai ∈ RNdxNt, Bi ∈ R NdxNt, i=0, . . . , Ns−1} satisfy the properties given in equations (45, 46) ∀i,i′, respectively.




  
    
      
        
          
            O
            
              N
              t
            
            H
          
          ⁢
          
            O
            
              N
              tt
            
          
        
        =
        
        ⁢
        
          α
          ⁢
          
            
              ∑
              
                i
                =
                0
              
              
                
                  N
                  s
                
                -
                1
              
            
            ⁢
            
              
            
            ⁢
            
              
                
                  
                  
                    d
                    i
                  
                  
                
                2
              
              ⁢
              
                I
                
                  N
                  t
                
              
            
          
        
      
    
    
      
        (
        42
        )
      
    
  
  
    
      
        
          (
          
            
              N
              s
            
            ,
            
              N
              d
            
          
          )
        
        =
        
          {
          
            
              
                
                  (
                  
                    2
                    ,
                    2
                  
                  )
                
              
              
                if
              
              
                
                  
                    N
                    t
                  
                  =
                  2
                
              
            
            
              
                
                  (
                  
                    3
                    ,
                    4
                  
                  )
                
              
              
                if
              
              
                
                  
                    
                      N
                      t
                    
                    =
                    3
                  
                  ,
                  4
                
              
            
            
              
                
                  (
                  
                    
                      N
                      t
                    
                    ,
                    
                      2
                      ⁢
                      
                        N
                        t
                      
                    
                  
                  )
                
              
              
                if
              
              
                
                  
                    
                      N
                      t
                    
                    〉
                  
                  ⁢
                  4
                
              
            
          
        
      
    
    
      
        (
        43
        )
      
    
  
  
    
      
        
          O
          
            N
            t
          
        
        =
        
          
            ∑
            
              i
              =
              0
            
            
              
                N
                s
              
              -
              1
            
          
          ⁢
          
            
          
          ⁢
          
            (
            
              
                
                  A
                  i
                
                ⁢
                
                  d
                  i
                
              
              +
              
                
                  B
                  i
                
                ⁢
                
                  d
                  i
                  *
                
              
            
            )
          
        
      
    
    
      
        (
        44
        )
      
    
  




AiTAi′+BiTBi′=αINtδ(i−i′)  (45)

AiTBi′=  (46)

The properties given in equations (45, 46) are useful in decoding. For example, when Nt=2, the GCOD ON2 reduces to Alamouti's ST block code matrix given in equation (47) which can be represented as in equation (44) using equations (48-51) below.




  
    
      
        
          O
          2
        
        =
        
          [
          
            
              
                
                  d
                  0
                
              
              
                
                  d
                  1
                
              
            
            
              
                
                  -
                  
                    d
                    1
                    *
                  
                
              
              
                
                  d
                  0
                  *
                
              
            
          
          ]
        
      
    
    
      
        (
        47
        )
      
    
  
  
    
      
        
          A
          0
        
        =
        
          [
          
            
              
                1
              
              
                0
              
            
            
              
                0
              
              
                0
              
            
          
          ]
        
      
    
    
      
        (
        48
        )
      
    
  
  
    
      
        
          A
          1
        
        =
        
          [
          
            
              
                0
              
              
                1
              
            
            
              
                0
              
              
                0
              
            
          
          ]
        
      
    
    
      
        (
        49
        )
      
    
  
  
    
      
        
          B
          0
        
        =
        
          [
          
            
              
                0
              
              
                0
              
            
            
              
                0
              
              
                1
              
            
          
          ]
        
      
    
    
      
        (
        50
        )
      
    
  
  
    
      
        
          B
          1
        
        =
        
          [
          
            
              
                0
              
              
                0
              
            
            
              
                
                  -
                  1
                
              
              
                0
              
            
          
          ]
        
      
    
    
      
        (
        51
        )
      
    
  




Let us define {tilde over (s)}g,i:=[{tilde over (s)}g,i,0, . . . ,{tilde over (s)}g,i,L]T. In order to perform ST component coding, ONt is used to form matrix pairs {Ai,Bi}i=0Ns−1, and then construct Xg (l) as given in equation (52). Equation (52) is a GCOD in variables {tilde over (s)}g.i,l, i=0, . . . ,Ns−1. From equation (52) it is deduced that Nx=Nd. Thus, the code rate for GSTFB coding is given in equation (53). At each block transmission interval i, the blocks {tilde over (s)}0,0 and {tilde over (s)}0,1, for example, are forwarded to the first and second transmit antenna 46A and 46B of transmitter 32, respectively. Each transmitted block from one antenna at time slot 2i+1 is a conjugated and permuted version of the corresponding transmitted block from the other antenna at time slot 2i (with a possible sign change). According to equation (43) R<1 if Nt>2, which implies that the design induces a loss in bandwidth efficiency if more than two transmit antennas are used.




  
    
      
        
          
            X
            g
            T
          
          ⁡
          
            (
            l
            )
          
        
        =
        
          
            ∑
            
              i
              =
              0
            
            
              
                N
                s
              
              -
              1
            
          
          ⁢
          
            
          
          ⁢
          
            (
            
              
                
                  A
                  i
                
                ⁢
                
                  
                    s
                    ~
                  
                  
                    g
                    ,
                    i
                    ,
                    l
                  
                
              
              +
              
                
                  B
                  i
                
                ⁢
                
                  
                    s
                    ~
                  
                  
                    g
                    ,
                    i
                    ,
                    l
                  
                  *
                
              
            
            )
          
        
      
    
    
      
        (
        52
        )
      
    
  
  
    
      
        R
        =
        
          
            N
            s
          
          
            N
            d
          
        
      
    
    
      
        (
        53
        )
      
    
  




With Θ:=[Θ0, . . . , ΘL]T denoting constellation precoder 34, {tilde over (s)}g,i,l={tilde over (s)}g,i, where ΘlT∈C1×(L+l) is the l th row of Θ. Recalling that gT is a GCOD by construction, equation (42) can be used to rewrite equation (40) as equation (54) below where the meaning of s′g,i=sg,i is clear from the PEP analysis.




  
    
      
        
          
            Λ
            e
          
          ⁡
          
            (
            l
            )
          
        
        =
        
          
            α
            ⁡
            
              [
              
                
                  ∑
                  
                    i
                    =
                    0
                  
                  
                    
                      N
                      s
                    
                    -
                    1
                  
                
                ⁢
                
                  ❘
                  
                    
                      
                        θ
                        1
                        T
                      
                      ⁡
                      
                        (
                        
                          
                            s
                            
                              g
                              ,
                              i
                            
                          
                          -
                          
                            s
                            
                              g
                              ,
                              i
                            
                            ′
                          
                        
                        )
                      
                    
                    ⁢
                    
                      ❘
                      2
                    
                  
                
              
              ]
            
          
          ⁢
          
            I
            
              N
              t
            
          
        
      
    
    
      
        (
        54
        )
      
    
  




Because the first design criteria is satisfied if the second design criteria is satisfied, only the second design criteria is considered. Substituting equation (54) into the second design criteria yields equation (55). Using the arithmetic-geometric mean inequality, equation (55) can be lower bounded by equation (56) where the equality is satisfied when |ΘlT(sg,i−s′g,i)|2=|ΘlT(sg,i−s′g,i)|2. Thus, according to the second design criteria, it is meaningful to maximize only the lower bound in equation (54) for all possible sg≠s′g.




  
    
      
        
          ξ
          ⁡
          
            (
            
              
                s
                g
              
              ,
              
                s
                g
                ′
              
            
            )
          
        
        :=
        
          
            
              ∏
              
                l
                =
                0
              
              L
            
            ⁢
            
              det
              ⁡
              
                [
                
                  
                    Λ
                    e
                  
                  ⁡
                  
                    (
                    l
                    )
                  
                
                ]
              
            
          
          =
          
            
              α
              
                N
                t
              
            
            ⁢
            
              
                ∏
                
                  l
                  =
                  0
                
                L
              
              ⁢
              
                
                  [
                  
                    
                      ∑
                      
                        i
                        =
                        0
                      
                      
                        
                          N
                          s
                        
                        -
                        1
                      
                    
                    ⁢
                    
                      
                        
                        
                          
                            θ
                            l
                            T
                          
                          ⁡
                          
                            (
                            
                              
                                s
                                
                                  g
                                  ,
                                  i
                                
                              
                              -
                              
                                s
                                
                                  g
                                  ,
                                  i
                                
                                ′
                              
                            
                            )
                          
                        
                        
                      
                      2
                    
                  
                  ]
                
                
                  N
                  t
                
              
            
          
        
      
    
    
      
        (
        55
        )
      
    
  
  
    
      
        
          ξ
          ⁡
          
            (
            
              
                s
                g
              
              ,
              
                s
                g
                ′
              
            
            )
          
        
        ≥
        
          
            α
            
              N
              t
            
          
          ⁢
          
            N
            s
            
              N
              t
            
          
          ⁢
          
            
              ∏
              
                l
                =
                0
              
              L
            
            ⁢
            
              
                ∏
                
                  i
                  =
                  0
                
                
                  
                    N
                    s
                  
                  -
                  1
                
              
              ⁢
              
                
                  
                  
                    
                      θ
                      1
                      T
                    
                    ⁡
                    
                      (
                      
                        
                          s
                          
                            g
                            ,
                            i
                          
                        
                        -
                        
                          s
                          
                            g
                            ,
                            i
                          
                          ′
                        
                      
                      )
                    
                  
                  
                
                
                  
                    N
                    t
                  
                  /
                  
                    N
                    s
                  
                
              
            
          
        
      
    
    
      
        (
        56
        )
      
    
  




Because the lower bound is attained when |ΘlT(sg,i−s′g,i)|2s are equal for different i s, s is used to denote a generic s′g,i. From the second design criteria, the design criterion for Θ, referred to as the “product distance criterion” is reduced to equation (57).




  
    
      
        
          min
          
            ∀
            
              
            
            ⁢
            
              
                s
                _
              
              ≠
              
                s
                ′
              
            
          
        
        ⁢
        
          
            ∏
            
              l
              =
              0
            
            L
          
          ⁢
          
            
            
              
                θ
                1
                T
              
              ⁡
              
                (
                
                  
                    s
                    _
                  
                  -
                  
                    
                      s
                      _
                    
                    ′
                  
                
                )
              
            
            
          
        
      
    
    
      
        (
        57
        )
      
    
  




Equation (57) has been used to construct constellation precoders for flat fading channels. For example, using the precoders designed in Z. Wang and G. B. Giannakis, “Space-time diversity systems based on linear constellation preceding,” IEEE Transactions on Wireless Communications, Vol. 2, No. 2, March 2003, when L=1, 3 and quadrature phase-shift keying (QPSK) is employed, the precoders Θ are given, respectively, by equations (58, 59).





  
    
      
        θ
        =
        
          
            1
            
              2
            
          
          ⁡
          
            [
            
              
                
                  1
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          π
                          /
                          4
                        
                        )
                      
                    
                  
                
              
              
                
                  1
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          5
                          ⁢
                          
                            π
                            /
                            4
                          
                        
                        )
                      
                    
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        58
        )
      
    
  
  
    
      
        θ
        =
        
          
            1
            2
          
          ⁡
          
            [
            
              
                
                  1
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          π
                          /
                          8
                        
                        )
                      
                    
                  
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          2
                          ⁢
                          
                            π
                            /
                            8
                          
                        
                        )
                      
                    
                  
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          3
                          ⁢
                          
                            π
                            /
                            8
                          
                        
                        )
                      
                    
                  
                
              
              
                
                  1
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          5
                          ⁢
                          
                            π
                            /
                            8
                          
                        
                        )
                      
                    
                  
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          10
                          ⁢
                          
                            π
                            /
                            8
                          
                        
                        )
                      
                    
                  
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          15
                          ⁢
                          
                            π
                            /
                            8
                          
                        
                        )
                      
                    
                  
                
              
              
                
                  1
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          9
                          ⁢
                          
                            π
                            /
                            8
                          
                        
                        )
                      
                    
                  
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          18
                          ⁢
                          
                            π
                            /
                            8
                          
                        
                        )
                      
                    
                  
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          27
                          ⁢
                          
                            π
                            /
                            8
                          
                        
                        )
                      
                    
                  
                
              
              
                
                  1
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          13
                          ⁢
                          
                            π
                            /
                            8
                          
                        
                        )
                      
                    
                  
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          26
                          ⁢
                          
                            π
                            /
                            8
                          
                        
                        )
                      
                    
                  
                
                
                  
                    e
                    
                      j
                      ⁡
                      
                        (
                        
                          39
                          ⁢
                          
                            π
                            /
                            8
                          
                        
                        )
                      
                    
                  
                
              
            
            ]
          
        
      
    
    
      
        (
        59
        )
      
    
  




It is important to note that Θ is square, and thus nonredundant, and its constellation specific design depends on the finiteness of As.

To summarize, five steps may be used to design GSTFB codes and are given below.

    
    
        1.) Choose Ng and Nc=Ng(L+1) for given Nt, Nr, and L.
        2.) Determine Ns, and Nd according to equation (43).
        3.) Choose  N, Nx=Nd and NI=NgNI.
        4.) Design the (L+1)×(L+1) constellation precoder Θ.
        5.) Construct GSTFB codewords according to equation (52).
    
    


For example, FIG. 3 illustrates transmitter 32 with Nt=2 and Ng=2 where the Nc×(L+1) matrices {Φg}g=0Ng−1 represents subcarrier selectors 40A and 40B (collectively “subcarrier selectors 40”) that are used to assign L+1 subcarriers to each GSTF subsystem according to the subcarrier grouping scheme described previously. Denoting (Ngl+g) ∈ CNc×1 as the (Ngl+g+1) st column of the Nc×Nc identity matrix INc. Mathematically, Φg is given by equation (60).

Φg=[e(g,0), e(g,1), . . . ,e(g,L)]  (60)

The encoded GSTF information blocks are added together using summers 42 and OFDM modulator 44A and 44B form multi-carrier output waveforms in accordance with the outbound data stream. Transmit antennas 46A and 46B transmit the multi-carrier output waveforms formed by OFDM modulators 44A and 44B through wireless channel 48, respectively.
Following the reverse order of the encoding process, we perform the decoding starting with ST component decoder 52 to obtain decision statistics of {tilde over (s)}g,i from which sg,i is recovered by ML decoder 54. Parallel to serial (P/S) unit 56 then parses the information blocks into a stream of serial information symbols. Alternately, ST component decoding may also be performed by the lower complexity sphere decoding algorithm described in M. O. Damen, A. Chkeif, and J. C. Belfiore, “Lattice code decoder for space-time codes,” IEEE Communications Letters, Vol. 4, pp. 161-163, May 2000 and E. Viterbo and J. Boutros, “A universal lattice code decoder for fading channels,” IEEE Transactions on Information Theory, Vol. 45, pp. 1639-1642, July 1999, which is incorporated herein by reference. Decoding the received transmissions relies on exploiting the separability of GSTF transmission in the frequency dimension.
Combining equation (25) with equation (52) yields equation (61) where WgT(l)50 is additive noise experienced during transmission through channel 48 which is described in detail previously. In order to decode {tilde over (s)}g,i,l we further define l,i,ν as given in equation (62) where, [Ai]μ and [Bi]μ denote the μ th columns of Ai and Bi, respectively.




  
    
      
        
          
            Y
            g
            T
          
          ⁡
          
            (
            l
            )
          
        
        =
        
          
            
              [
              
                
                  ∑
                  
                    i
                    =
                    0
                  
                  
                    
                      N
                      s
                    
                    -
                    1
                  
                
                ⁢
                
                  (
                  
                    
                      
                        A
                        i
                      
                      ⁢
                      
                        
                          s
                          ~
                        
                        
                          g
                          ,
                          i
                          ,
                          l
                        
                      
                    
                    +
                    
                      
                        B
                        i
                      
                      ⁢
                      
                        
                          s
                          ~
                        
                        
                          g
                          ,
                          i
                          ,
                          l
                        
                        *
                      
                    
                  
                  )
                
              
              ]
            
            ⁢
            
              
                H
                g
                T
              
              ⁡
              
                (
                l
                )
              
            
          
          +
          
            
              W
              g
              T
            
            ⁡
            
              (
              l
              )
            
          
        
      
    
    
      
        (
        61
        )
      
    
  
  
    
      
        
          φ
          
            l
            ,
            i
            ,
            v
          
          T
        
        :=
        
          [
          
            
              
                ∑
                
                  μ
                  =
                  1
                
                
                  N
                  t
                
              
              ⁢
              
                
                  
                    [
                    
                      A
                      i
                    
                    ]
                  
                  μ
                  T
                
                ⁢
                
                  
                    H
                    
                      v
                      ⁢
                      
                        
                      
                      ⁢
                      μ
                    
                    *
                  
                  ⁡
                  
                    (
                    
                      
                        
                          N
                          g
                        
                        ⁢
                        l
                      
                      +
                      g
                    
                    )
                  
                
              
            
            ❘
            
              ×
              
                
                  ∑
                  
                    μ
                    =
                    1
                  
                  
                    N
                    t
                  
                
                ⁢
                
                  
                    
                      [
                      
                        B
                        i
                      
                      ]
                    
                    μ
                    T
                  
                  ⁢
                  
                    
                      H
                      
                        v
                        ⁢
                        
                          
                        
                        ⁢
                        μ
                      
                    
                    ⁡
                    
                      (
                      
                        
                          
                            N
                            g
                          
                          ⁢
                          l
                        
                        +
                        g
                      
                      )
                    
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        62
        )
      
    
  




Based on equation (61), the soft decision statistics of {tilde over (s)}g, i,l can be formed as given in equation (62) with yl,ν denoting the νth column of YgT (l). Using equation (42), direct substitution verifies that in the absence of noise equation (63) yields equation (64).





  
    
      
        
          
            s
            
              ~
              ^
            
          
          
            g
            ,
            i
            ,
            l
          
        
        =
        
          
            ∑
            
              v
              =
              1
            
            
              N
              r
            
          
          ⁢
          
            
              φ
              
                l
                ,
                i
                ,
                v
              
              T
            
            ⁡
            
              [
              
                
                  
                    
                      y
                      
                        l
                        ,
                        v
                      
                    
                  
                
                
                  
                    
                      y
                      
                        l
                        ,
                        v
                      
                      *
                    
                  
                
              
              ]
            
          
        
      
    
    
      
        (
        63
        )
      
    
  
  
    
      
        
          
            s
            
              ~
              ^
            
          
          
            g
            ,
            i
            ,
            l
          
        
        =
        
          α
          ⁢
          
            
              ∑
              
                v
                =
                1
              
              
                N
                r
              
            
            ⁢
            
              
                ∑
                
                  μ
                  =
                  1
                
                
                  N
                  t
                
              
              ⁢
              
                
                  
                    
                    
                      
                        H
                        
                          v
                          ⁢
                          
                            
                          
                          ⁢
                          μ
                        
                      
                      ⁡
                      
                        (
                        
                          
                            
                              N
                              g
                            
                            ⁢
                            l
                          
                          +
                          g
                        
                        )
                      
                    
                    
                  
                  2
                
                ⁢
                
                  
                    s
                    ~
                  
                  
                    g
                    ,
                    i
                    ,
                    l
                  
                
              
            
          
        
      
    
    
      
        (
        64
        )
      
    
  




After obtaining {tilde over (ŝ)}g,i :=[{tilde over (ŝ)}g,i,0, . . . ,{tilde over (ŝ)}g,i,L]T, ML decoding of sg,i is performed using the sphere decoding algorithm. The complexity of the sphere decoding algorithm is independent of the constellation size and polynomial in L+1. Additionally, because L is small relative to Nc, the decoding complexity of GSTFB codes is low.
Alternately, STF trellis codes can be designed by applying multiple trellis coded modulation (M-TCM) which has been used for developing ST trellis codes in V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space-time codes for high data rate wireless communication: performance criterion and code construction,” IEEE Transactions on Information Theory, Vol. 44, pp. 744-765, March 1998, the entire contents being incorporated herein by reference. In order to enable the application of M-TCM, a link between the described STF system and the conventional ST system is made.
The so-called “smart-greedy” ST trellis codes have already been designed to achieve acceptable performance for both flat-fading and time-varying channels. However, unlike the paper above, the time varying channel Ht herein is artificially created and its time variations are well structured. Therefore, “smart” ST codes need not be designed; instead, ST codes need only be “greedy” in order to take advantage of time selectivity. Consequently, the two design criteria are sufficient.
Recalling that equation (19) represents 3-D GSTF codes Xg as a set of 2-D codes, it is implicitly suggested that the transmission of Xg can be thought of as being carried out in a an equivalent 2-D “space-virtual-time” (SVT) system with Nt transmit antennas and Nr receive antennas, where the virtual-time dimension corresponds to the joint dimensions of time and frequency in a manner described in detail below.
First, define xt:=[xt1, . . . ,xtNt]T as the symbol block transmitted by Nt transmit antennas during the tth virtual time interval and yt:=[yt1, . . . ,ytNt]T ∈ CNr×1 as the corresponding block of received samples. Equation (65) models the SVT system where Nr×Nt is the MIMO channel matrix, and Nr×1 is the noise vector. Equations (66, 67) are defined to link the SVT system to the GSTF system and equations (68-71) specify yt, xt, wt, and Ht respectively. The index functions and in equations (67-69) and equation (70) respectively are given by equations (71, 72) with └●┘ denoting the integer floor.

yt=Htxt+wt, t=0, . . . , Nx(L+1)  (65)

Yg:=└Yg(0), . . . , Yg(L)┘  (66)

Wg:=└Wg(0), . . . , Wg(L)┘  (67)

yt=└Yg┘ζ(t)  (68)

χt=└Xg┘ζ(t)  (69)

wt=└Wg┘ζ(t)  (69)

Ht:=Hg(τ(t))  (70)





  
    
      
        
          ϛ
          ⁡
          
            (
            t
            )
          
        
        :=
        
          
            
              N
              κ
            
            ⁢
            t
          
          -
          
            
              ⌊
              
                t
                
                  L
                  +
                  1
                
              
              ⌋
            
            ⁢
            
              (
              
                
                  
                    N
                    κ
                  
                  ⁢
                  L
                
                +
                
                  N
                  κ
                
                -
                1
              
              )
            
          
          +
          1
        
      
    
    
      
        (
        71
        )
      
    
  
  
    
      
        
          τ
          ⁡
          
            (
            t
            )
          
        
        :=
        
          t
          -
          
            
              ⌊
              
                t
                
                  L
                  +
                  1
                
              
              ⌋
            
            ⁢
            
              (
              
                L
                +
                1
              
              )
            
          
        
      
    
    
      
        (
        72
        )
      
    
  




Except for the difference in ordering of transmissions, the model in equation (65) is mathematically equivalent to the model in equation (21). In modeling the described STF system as an SVT system, the property that STF transmissions are separable in both frequency and time but not in space has been exploited.

Although the underlying fading channels are time-invariant, Ht varies with virtual-time due to the fact each GSTF codeword is transmitted over different subcarriers. Therefore, equation (65) can be thought of as an ST system transmitting over time-selective, but frequency-flat, fading channels. This provides an explicit link between each GSTF subsystem and the well-developed ST system. Furthermore, equation (65) implies that due to the presence of time diversity (or, more precisely, virtual-time diversity) the SVT (or STF) system can achieve a diversity advantage greater than NtNr and it is possible to take advantage of existing ST coding techniques in designing GSTFT codes.
Based on equation (65), the design of STFT codes is equivalent to building a trellis to generate xt s continuously. It is important to note the following property of STFT codes before pursuing the design of STFT codes.
Theorem 1: Suppose that each transmitted symbol xtμ belongs to the constellation set At with |At|2=2b elements. If the maximum diversity advantage Gdmax=NtNr(L+1) is achieved, then the transmission rate is at most Rtmax=log2|At|/(L+1)=b/(L+1) bits/s/Hz. Because Rtmax is related to R by Rtmax=R log2|As|, Theorem 1 implicitly suggests two possible design strategies which are described below.
Strategy 1: Design an STF trellis code with rate R=1, where the trellis outputs a single block xt corresponding to each information symbol st and has cardinality |At|=|As|(L+1).
Strategy 2: Design an STF trellis code with code rate R=1/(L+1), where the trellis outputs L+1 blocks xt corresponding to each information symbol st and has cardinality |As|=|At|.
These two design strategies are equivalent in the sense that the resulting codes achieve the same transmission rate Rtmax.Moreover, both strategies expand either the constellation of the transmitted symbols or that of the information symbols. However, the implementation of the two strategies is drastically different. According to the first strategy, it is desirable to select a trellis involving constellation expansion, which is not the case for most existing ST trellis codes. However, because the goal is to take advantage of existing techniques for ST trellis codes, the STF trellis codes constructed below use the second strategy.
An ST trellis encoder with R=1 with TST(●), and cardinality |As|=|At|=2Rtmax (L+1) could be used as the ST component coder 38 in FIG. 3. According to the second strategy, the STF trellis encoder with R=1/(L+1) is constructed from TST(●) by repeating its output L+1 times. In other words, going back to each GSTF subsystem, transmissions are repeated over L+1 subcarriers. Therefore, the design of STFT trellis codes is reduced to designing conventional trellis codes with repeated transmissions. A similar approach was also taken in designing the “smart-greedy” ST trellis codes. For example, when Nt=2, L=1, and Rt=2 bits/s/Hz, the ST trellis code depicted in FIG. 19 of the cited paper can be used to generate STFT codes.
Because GSTF trellis codes are generated by a trellis, decoding can be efficiently implemented by using Viterbi decoding which may be used in place of ML decoder 54 in FIG. 3. According to equation (65), the branch metric for xt is given by equation (74) where [Ht]νμ denotes the (ν,μ) th element of Ht. Similar to ST trellis codes, the decoding complexity of GSTF trellis codes is exponential in the number of trellis states and the transmission rate.




  
    
      
        
          ∑
          
            v
            =
            1
          
          
            N
            r
          
        
        ⁢
        
          
            
            
              
                y
                t
                v
              
              -
              
                
                  ∑
                  
                    μ
                    =
                    1
                  
                  
                    N
                    i
                  
                
                ⁢
                
                  
                    
                      [
                      
                        H
                        t
                      
                      ]
                    
                    
                      v
                      ⁢
                      
                        
                      
                      ⁢
                      μ
                    
                  
                  ⁢
                  
                    κ
                    t
                    μ
                  
                
              
            
            
          
          2
        
      
    
    
      
        (
        74
        )
      
    
  




Both STF block and trellis codes may be used in accordance with the described invention. However, before comparing simulation for testing the performance of STF block and trellis codes, several issues relevant to their performance and implementation are described. The issues examined here are as follows:

    
    
        1.) How much diversity advantage is sufficient?
        2.) Is it more advantageous to use STF block or STF trellis coding?
    
    


As mentioned previously, the primary goal of the described invention is to improve the diversity advantage from order NtNr(in an ST coded system) to order Gdmax=NtNr(L+1) by additionally exploiting multipath diversity. However, performance improvement by increasing Gdmax will eventually saturate as the diversity order grows beyond a certain threshold. Hence, STF coding may be preferred when dealing with systems having a small number of antennas. A small number of antennas is commercially preferable because of cost. In particular, minimal multi-antenna systems with Nt=2 and Nr=1 are desirable for downlink applications. When Nr=1, little is gained by using more than Nt=4 transmit antennas in an ST coded system. Therefore, L+1 should provide sufficient diversity advantage in the described STF system with Nt=2 and Nr=1. Such a system may be desirable because the smaller the value for L, the lower the decoding complexity for both STFB and STFT codes.
Thus far, L has been restricted to the physical channel order. This restriction is lifted by allowing Lreal to denote the physical channel order and L to represent the channel order assumed in designing STF codes. As a result, L can be generally different from Lreal. In typical wireless environments, Lreal>2. In order to minimize decoding complexity, L can be chosen such that L≦Lreal and STF codes can be designed as previously described. If L≦Lreal, the resulting system can achieve a diversity advantage of order NtNr(L+1) as well as a high coding advantage. Consequently, the achieved performance may be sub-optimal in this case, but it may be sufficiently good for most practical applications.
Although the described design of STF block and STF trellis codes applies to arbitrary Nt and Nr, the minimal multi-antenna system with Nt=2 and Nr=1 is used when comparing the two codes. Recall that with Nt=2 there is no rate loss when using STF block coding.
One advantage of STF blocks codes over STF trellis codes is the low decoding complexity of STF block codes. More importantly, the decoding complexity of STF block codes is independent of the transmission rate, which is not the case for STF trellis codes. In addition, the construction of STF block codes is easier than that of STF trellis codes. On the other hand, STF trellis coding operates in a similar way as conventional channel coding. Therefore, STF trellis codes can more easily by incorporated into existing communication systems. For example, an ST trellis coder can be directly applied to STF trellis codes.
FIG. 4 is a flowchart illustrating an example mode of operation of communication system 2 of FIG. 1 in which transmitter 4 and receiver 8 communicate using the described STF coding techniques. Generally, transmitter 4 forms Ng groups of subcarriers from a set of Nc subcarriers (step 60). As described previously, the number of subcarriers may be selected to be an integer multiple of the channel length. Forming Ng groups generates GSTF codewords according to equation (23) and also generates GSTF subsystems according to equation (24).
Next, transmitter 4 applies codes to the Ng groups of subcarriers, thereby performing STF coding within each GSTF subsystem, as described previously. In other words STF coding generates Xgs individually rather than generating X as whole, thereby achieving efficiencies. Transmitter 4 may apply STFB codes or STFT codes, as previously described, to each of the GSTF subsystems. During this process, a data stream of information blocks are demultiplexed into a plurality of interleaved sub-blocks (step 62) and linearly precoded (step 63) before application of the codes (step 64). In this manner, the data stream produces an outbound data stream that is jointly encoded in space, time, and frequency (step 64). The encoded outbound data stream is modulated to form a multi-carrier output waveform (step 65) and transmitted by Nt antennas through communication channel 12 to receiver 8. The multi-carrier output waveform has diversity that is multiplicative in number of transmit antennas; receive antennas, and the length of the wireless channel.
Receiver 8 demodulates the incoming multi-carrier waveform via Nr receive antennas to form a received data stream (step 66). ML decoder 54 decodes the sub-blocks of the data stream to form decision statistics (step 67) as described previously. Receiver 8 may employ sphere decoding or Viterbi decoding when STFB codes or STFT codes are applied respectively. As a result, wireless communication system 2 achieves maximum diversity and high coding gains, while also having lower decoding complexity than well known ST and SF coding techniques.
FIGS. 5-8 are graphs that present simulations of GSTF block and GSTF trellis coding techniques and comparisons with existing SF and ST codes. In all simulations, a minimum multi-antenna OFDM system with Nt=2 and Nr=1 is used and performance is measured with OFDM symbol error rate (OFDM-SER) which is averaged over 100,000 channel realizations. Additionally, the transmission rate is fixed at Rt=2 bps/Hz for all simulations.
The random channels were generated according to two different channel models, a multiray channel model and a HIPERLAN 2 channel model. The multiray channel model corresponds to channel taps that are i.i.d., zero mean, complex Gaussian with variance 1/(2Lreal+2) per dimension. The HIPERLAN 2 random channel models are based on the HIPERLAN 2 channel model A, which corresponds to a typical office environment. Each channel tap in the profile of channel model A is characterized by the Jakes' Doppler spectrum with a mobile speed at 3 m/s. In all simulations a distinction is made between L and Lreal as described previously.
FIG. 5 is a graph comparing GSTF block 70 and GSTF trellis 72 codes to the SF coding schemes (74, 76) described in H. Bölcskei and A. Paulraj, “Space-frequency coded broadband OFDM systems,” in IEEE Wireless Communications Networking Conference, Chicago, Ill., Sep. 23-28, 2000, pp. 1-6 and B. Lu and X. Wang, “Space-time code design in OFDM systems,” in Proceedings on Global Telecommunications Conference, Vol. 2, San Francisco, Calif., Nov.-Dec. 27-1, 2000, pp. 1000-1004, respectively, thee entire contents of both papers being incorporated herein by reference. The design of both GSTF block 70 and trellis 72 codes is based on L=1, which could be different from Lreal. QPSK modulation (|As|=4) is chosen for GSTF block 70 coding and for the two SF coding schemes (74, 76), whereas 16-QAM (|As|=16) is selected for GSTF trellis coding 72. As a result, the transmission rate for all four coding schemes is Rt=2 bps/Hz. GSTF trellis code 72 is constructed using the described techniques in conjunction with the ST trellis code in FIG. 19 of the previously referenced paper entitled “Space-time codes for high data rate wireless communication: performance criterion and code construction.” The 16-state TCM code with effective length 3 and the 16-state ST trellis code of FIG. 5 of the same reference are used to generate SF codes (74, 76) respectively. All simulations are carried out with the number of subcarriers Nc=64 and with multiray100 channels having Lreal=1.
Both GSTF block 70 and GSTF trellis 72 codes are able to achieve higher diversity gain than the SF codes (74, 76). While GSTF block code 70 outperforms SF codes (74, 76) for all SNR values, GSTF trellis code 72 outperforms SF codes (74, 76) only when the SNR value is greater than 20 dB. The latter implies that GSTF trellis code 72 has lower coding gain, which is due to the fact that the chosen ST trellis code upon which it is based is not optimal in terms of coding gain. Performance improvement can be expected by maximizing both diversity and coding gains for GSTF trellis codes 72 (as in GSTF block codes 70), which usually involves high-complexity computer search.
FIG. 6 is a graph using the same codes as FIG. 5 but with simulations using HIPERLAN 2 channels with Lreal=8. Both GSTF block 70 and GSTF trellis codes 72 have higher diversity gains than SF codes (74, 76). The performance of GSTF trellis codes 72 is close to that of SF codes (74, 76) even for low SNR values. It should be noted that GSTF block 70 and GSTF trellis 72 codes are designed regardless of the real channel order Lreal=8, channel correlation, and power profile in HIPERLAN 2 channels, which speaks for the robustness of the GSTF coding design.
FIG. 7 is a graph simulating the performance of GSTF block coding in the presence of multi-ray channels with varying channel orders, Lreal=1,2,3. FIG. 7 illustrates the performance improvement with multipath diversity. Assuming perfect knowledge of Lreal, the GSTF block codes are designed with L=Lreal. The number of subcarriers is chosen as Nc=48. The GSTF codes clearly achieve higher diversity gains as the channel order increases, which justifies the importance of GSTF coding that accounts for multipath diversity.
FIG. 8 is a graph illustrating the performance of GSTF block codes when the channel order is underestimated, i.e. the GSTF block code is designed for L=1 while its performance is simulated when Lreal=1,2,3. Multiray channels are used in simulation and the number of subcarriers is selected to be Nc=48. The SER performance curves with different Lreal values are relatively close. Therefore, using the results of FIG. 7 it is concluded that when maximum diversity gain is a goal, GSTF codes should be designed with L chosen as the upper bound of all possible Lreal values.
Various embodiments of the invention have been described. The described techniques can be embodied in a variety of receivers and transmitters including base stations, cell phones, laptop computers, handheld computing devices, personal digital assistants (PDA's), and the like. The devices may include a digital signal processor (DSP), field programmable gate array (FPGA), application specific integrated circuit (ASIC) or similar hardware, firmware and/or software for implementing the techniques. If implemented in software, a computer readable medium may store computer readable instructions, i.e., program code, that can be executed by a processor or DSP to carry out one of more of the techniques described above. For example, the computer readable medium may comprise random access memory (RAM), read-only memory (ROM), non-volatile random access memory (NVRAM), electrically erasable programmable read-only memory (EEPROM), flash memory, or the like. The computer readable medium may comprise computer-readable instructions that when executed in a wireless communication device, cause the wireless communication device to carry out one or more of the techniques described herein. These and other embodiments are within the scope of the following claims.

## Claims

1. A wireless communication device comprising:
a plurality of antennas to transmit a multi-carrier waveform, wherein each antenna outputs a plurality of orthogonal frequency-division multiplexing (OFDM) subcarriers;
a subcarrier selector to divide the OFDM subcarriers into two or more groups of subcarriers, wherein the subcarriers for at least one of the antennas are divided between at least two of the groups of subcarriers; and
an encoder that applies a set of codes to each of groups of the groups of subcarriers to jointly encode a data stream in space, time, and frequency, and produce an outbound data stream for transmission through a wireless communication channel by the antennas.

2. The wireless communication device of claim 1, wherein the number of subcarriers is an integer multiple of a length of the wireless communication channel.

3. The wireless communication device of claim 1, wherein the number of subcarriers is selected as a function of a length L of the communication channel.

4. The wireless communication device of claim 3, wherein the number of subcarriers is selected in accordance with the following equation:


Nc=Ng(L+1)


where Nc is the number of subcarriers per each of the antennas, Ng is the number of groups into which the subcarriers are divided, and L +1 is the length of the wireless channel.

5. The wireless communication device of claim 1, wherein the outbound data stream comprises STF codewords having encoded symbols, and the subcarrier selector divides the subcarriers into the two or more groups so the encoded symbols of each of the STF codewords are allocated across the groups of subcarriers.

6. The wireless communication device of claim 5, wherein the subcarrier selector divides each of the STF codewords X into respective Ng group space-time-frequency codewords Xg in accordance with the following equation:


Xg=[Xg(0),Xg(1),. . . ,Xg(L)]X2(l)=X(Ngl+g),g=0,. . . ,Ng−1


where l represents the column vectors of the matrix representing Group Space Time Frequency (GSTF) codeword Xg and g represents the number of groups of subcarriers.

7. The wireless communication device of claim 1, wherein the codes take the form of block codes or trellis codes.

8. The wireless communication device of claim 1, further comprising a modulator to produce a multi-carrier output waveform in accordance with the outbound data stream for transmission through the wireless channel.

9. The wireless communication device of claim 1, further comprising:
a demultiplexer that receives the data stream and outputs a plurality of interleaved data streams; and
a set of linear precoders that linearly precodes the interleaved data streams to produce precoder data streams for processing by the encoder.

10. The wireless communication device of claim 9, wherein the encoder comprises a plurality of space-time-frequency (STF) encoders.

11. The wireless communication device of claim 10,
wherein the plurality of STE encoders output a plurality of encoded data streams, and
wherein the wireless communication device further comprises a summer to sum the encoded data streams and produce the encoded output data stream.

12. The wireless communication device of claim 9, wherein the linear precoders apply unitary matrices to blocks of symbols of the interleaved data streams.

13. The wireless communication device of claim 1, wherein the multi-carrier waveform has a diversity that is multiplicative in the number of antennas and a length of the wireless channel.

14. The wireless communication device of claim 1, wherein the wireless communication device comprises one of a base station and a mobile device.

15. The wireless communication device of claim 1,
wherein the subcarrier selector and the encoder comprise executable instructions, and
wherein the wireless communication device comprises a digital signal processor to execute the instructions.

16. A method comprising: grouping a set of orthogonal frequency-division multiplexing (OFDM) subcarriers into two or more groups of subcarriers;
applying a unique codes to each of the groups of subcarriers to jointly encode a data stream in space time, and frequency and produce an outbound data stream; and
transmitting an OFDM waveform through a wireless communication channel in accordance with the outbound data stream using a plurality of transmit antennas, where each of the transmit antennas outputs OFDM subcarriers selected from the two or more groups of subcarriers.

17. The method of claim 16, further comprising selecting the number of subcarriers in the set of subcarriers as an integer multiple of a length of the wireless communication channel.

18. The method of claim 17, further comprising selecting the number of subcarriers in the set of subcarriers as an integer multiple of the channel length in accordance with the following equation:


Nc=Ng(L+1)


where Nc is the number of subcarriers in the set of subcarriers, Ng is the number of groups into which the set of subcarriers is divided, and L +1 is the length of the wireless channel.

19. The method of clam 16, wherein the outbound data stream comprises space-time-frequency (STF) codewords having encoded symbols, and grouping the subcarriers comprises grouping the subcarriers into the two or more groups so the encoded symbols of each of the STF codewords are allocated across the groups of subcarriers.

20. The method of claim 19, wherein grouping the set of subcarriers into two or more groups comprises dividing each of the STF codewords X into respective Ng group space-time-frequency codewords Xg in accordance with the following equation:


Xg=[Xg(0),Xg(1), . . .,Xg(L)]Xg(l)=X(Ngl+g),g=0, . . .,Ng−1


where Xg(l) represents the column vectors of the matrix representing group STF (GSTF) codeword Xg, and g represents the number of groups of subcarriers.

21. The method of claim 20, further comprising designing the set of all possible Xgs, Ax,g, such that ∀Xg ≠X′g ∈Ax,g, matrices in the following equation have full rank:


Λe(l)=[Xg(l)−X′g(l)][Xg(l)−X′g(l)]H,∀lε[0,L]


and such that ∀Xg ≠X′g εAx,g, the following equation is maximized:




  
    
      ∏
      
        l
        =
        0
      
      L
    
    ⁢
    
      det
      ⁡
      
        [
        
          
            Λ
            e
          
          ⁡
          
            (
            l
            )
          
        
        ]
      
    
  
  ,




where Λe(l) represents a sum of ranks of matrices Xg(l) and X′g,(l).

22. The method of claim 16, wherein the codes take the form of block codes or trellis codes.

23. The method of claim 16, further comprising modulating the outbound data stream to produce the OFDM waveform far transmission through the wireless channel.

24. The method of claim 16, further comprising:
demultiplexing the data stream into a plurality of interleaved data streams;
linearly precoding the plurality of interleaved data streams to produce precoded data streams; and
applying the codes to the precoded data streams in accordance with the selected subcarrier groups.

25. The method claim 24, wherein linearly precoding comprises applying unitary matrices to blocks of symbols of the interleaved data streams.

26. A computer-readable medium comprising instructions to cause a programmable processor to:
group a set of orthogonal frequency-division multiplexing (OFDM) subcarriers into two or more groups of subcarriers;
apply a unique set of codes to each of the groups of subcarriers to produce an outbound data stream jointly encoded in space. time and frequency; and
transmit an OFDM waveform from a plurality of transmit antennas in accordance with the outbound data stream, wherein each of the transmit antennas outputs OFDM subcarriers selected from the two or more groups of subcarriers.

27. A system comprising:
a transmitter that groups a set of orthogonal frequency-division multiplexing (OFDM) subcarriers into two or more groups of subcarriers, applies a unique codes to information blocks for each group of OFDM subcarriers to encode the information blocks of the subcarrier groups in space, time and frequency, sums the corresponding information blocks for subcarriers of each of a plurality of transmit antenna from the two or more groups, and outputs an OFDM waveform via the plurality of transmit antennas in accordance with the encoded subcarrier groups; and
a receiver that receives the OFDM waveform and produces a stream of estimated symbols.