# Patent

## Title
Method and system for utilizing space-time codes for block fading channels

## Abstract

A communication system for transmitting encoded signals over a communication channel is disclosed. The system includes a transmitter, which has a source that is configured to output a message signal, and an encoder that is configured to generate a code word in response to the message signal. The code word is based upon a stacking construction that is generalized for the communication channel. The communication channel is characterized as a multi-input multi-output (MIMO) block fading channel. The transmitter also includes a modulator that is configured to modulate the code word for transmission over the communication channel. Further, the transmitter includes a plurality of transmit antennas that are configured to transmit the modulated code word over the communication channel. The system also includes a receiver, which has a plurality of receive antennas. The receiver is configured to receive the transmitted code word via the plurality of receive antennas.

## Background
CROSS-REFERENCES TO RELATED APPLICATION
This application is a continuation of U.S. patent application Ser. No. 10/011,831, filed Nov. 5, 2001, entitled “Method and System for Utilizing Space-Time Codes for Blocking Fading Channels”. This application is related to, and claims the benefit of the earlier filing date of U.S. Provisional Patent Application Ser. No. 60/246,025, filed Nov. 6, 2000, entitled “Method and Constructions for Space-Time Codes for Block Fading Channels,” the entirety of which is incorporated herein by reference.


BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to coding in a communication system, and is more particularly related to space-time codes having spatial diversity and temporal diversity.
2. Discussion of the Background
Given the constant demand for higher system capacity of wireless systems, multiple antenna systems have emerged to increase system bandwidth vis-à-vis single antenna systems. In multiple antenna systems, data is parsed into multiple streams, which are simultaneously transmitted over a corresponding quantity of transmit antennas. At the receiving end, multiple receive antennas are used to reconstruct the original data stream. To combat the detrimental effects of the communication channel, communication engineers are tasked to develop channel codes that optimize system reliability and throughput in a multiple antenna system.
To minimize the effects of the communication channel, which typically is Rayleigh, space-time codes have been garnered significant attention. Rayleigh fading channels introduce noise and attenuation to such an extent that a receiver may not reliably reproduce the transmitted signal without some form of diversity; diversity provides a replica of the transmitted signal. Space-time codes are two dimensional channel codes that exploit spatial transmit diversity, whereby the receiver can reliably detect the transmitted signal. Conventional designs of space-time codes have focused on maximizing spatial diversity in quasi-static fading channels and fast fading channels. However, real communication systems exhibit channel characteristics that are somewhere between quasi-static and fast fading. Accordingly, such conventional space-time codes are not optimized.
Further, other approaches to space-time code design assume that channel state information (CSI) are available at both the transmitter and receiver. Thus, a drawback of such approaches is that the design requires the transmitter and receiver to have knowledge of the CSI, which increases implementation costs because of the need for additional hardware. Moreover, these approaches view the transmit diversity attending the use of space-time codes as a substitute for time diversity; consequently, such space-time codes are not designed to take advantage of other forms of diversity.
Based on the foregoing, there is a clear need for improved approaches for providing space-time codes that can be utilized in a multi-input multi-output (MIMO) block fading channel. There is also a need to design space-time codes that can exploit spatial diversity as well as time diversity. There is also a need to improve system reliability without reducing transmission rate. There is a further need to simplify the receiver design. Therefore, an approach for constructing space-time codes that can enhance system reliability and throughput in a multiple antenna system is highly desirable.
SUMMARY OF THE INVENTION
The present invention addresses the above stated needs by providing space-time codes to optimally exploit the spatial and temporal diversity available in the multi-input multi-output (MIMO) block fading channels.
According to one aspect of the invention, a method for transmitting encoded signals over a communication channel of a communication system is provided. The method includes receiving a message signal, and generating a code word in response to the message signal. The code word is based upon a stacking construction that is generalized for the communication channel. The communication channel is characterized as a multi-input multi-output block fading channel. Under this approach, spatial diversity and temporal diversity are enhanced, without sacrificing transmission rate.
According to another aspect of the invention, an apparatus for encoding signals for transmission over a communication channel of a communication system is provided. The apparatus comprises a source that is configured to output a message signal, and an encoder that is configured to generate a code word in response to the message signal. The code word is based upon a stacking construction that is generalized for the communication channel. The communication channel is characterized as a multi-input multi-output block fading channel. The above arrangement advantageously improves system throughput and system reliability of a communication system.
According to one aspect of the invention, an apparatus for encoding signals for transmission over a communication channel of a communication system is provided. The apparatus includes means for receiving a message signal, and means for generating a code word in response to the message signal. The code word is based upon a stacking construction that is generalized for the communication channel. The communication channel is characterized as a multi-input multi-output block fading channel. The above arrangement advantageously provides increased system capacity.
According to another aspect of the invention, a communication system for transmitting encoded signals over a communication channel is disclosed. The system includes a transmitter, which has a source that is configured to output a message signal, and an encoder that is configured to generate a code word in response to the message signal. The code word is based upon a stacking construction that is generalized for the communication channel. The communication channel is characterized as a multi-input multi-output block fading channel. The transmitter also includes a modulator that is configured to modulate the code word for transmission over the communication channel. Further, the transmitter includes a plurality of transmit antennas that are configured to transmit the modulated code word over the communication channel. The system also includes a receiver, which has a plurality of receive antennas; the receiver is configured to receive the transmitted code word via the plurality of receive antennas. The above arrangement advantageously maximizes spatial and temporal diversity.
According to another aspect of the invention, a waveform signal for transmission over a communication channel of a communication system is disclosed. The waveform signal includes a code word that is based upon a stacking construction, which is generalized for the communication channel. The communication channel is characterized as a multi-input multi-output block fading channel. The above approach minimizes data transmission errors.
In yet another aspect of the invention, a computer-readable medium carrying one or more sequences of one or more instructions for transmitting encoded signals over a communication channel of a communication system is disclosed. The one or more sequences of one or more instructions include instructions which, when executed by one or more processors, cause the one or more processors to perform the step of receiving a message signal. Another step includes generating a code word in response to the message signal. The code word is based upon a stacking construction that is generalized for the communication channel. The communication channel is characterized as a multi-input multi-output block fading channel. This approach advantageously provides simplified receiver design.
In yet another aspect of the present invention, an apparatus for receiving signals over a communication channel of a communication system is provided. The apparatus includes a demodulator that is configured to demodulate a signal containing a code word, wherein the code word being based upon a stacking construction that is generalized for the communication channel. The communication channel is characterized as a multi-input multi-output block fading channel. The apparatus also includes a decoder that is configured to decode the code word and to output a message signal. Under this approach, the effective bandwidth of the communication system is increased.



BRIEF DESCRIPTION OF THE DRAWINGS
A more complete appreciation of the invention and many of the attendant advantages thereof will be readily obtained as the same becomes better understood by reference to the following detailed description when considered in connection with the accompanying drawings, wherein:
FIG. 1 is a diagram of a communication system configured to utilize space-time codes, according to an embodiment of the present invention;
FIG. 2 is a diagram of an encoder that generates space-time codes, in accordance with an embodiment of the present invention;
FIG. 3 is a diagram of a decoder that decodes space-time codes, according to an embodiment of the present invention;
FIG. 4 is a flow chart of the process of constructing space-time codes used in the system of FIG. 1;
FIG. 5 is a diagram of a wireless communication system employing the space-time codes, according to an embodiment of the present invention; and
FIG. 6 is a diagram of a computer system that can perform the processes of encoding and decoding of space-time codes, in accordance with an embodiment of the present invention.



DESCRIPTION OF THE PREFERRED EMBODIMENTS
In the following description, for the purpose of explanation, specific details are set forth in order to provide a thorough understanding of the invention. However, it will be apparent that the invention may be practiced without these specific details. In some instances, well-known structures and devices are depicted in block diagram form in order to avoid unnecessarily obscuring the invention.
Although the present invention is discussed with respect to MIMO block fading channels, the present invention has applicability to communication channels with other channel characteristics.
FIG. 1 shows a diagram of a communication system configured to utilize space-time codes, according to an embodiment of the present invention. A digital communication system 100 includes a transmitter 101 that generates signal waveforms across a communication channel 103 to a receiver 105. In the discrete communication system 100, transmitter 101 has a message source that produces a discrete set of possible messages; each of the possible messages have a corresponding signal waveform. These signal waveforms are attenuated, or otherwise altered, by communications channel 103. As a result, receiver 105 must be able to compensate for the attenuation that is introduced by channel 103. To assist with this task, transmitter 101 employs coding to introduce redundancies that safeguard against incorrect detection of the received signal waveforms by the receiver 105.
FIG. 2 shows a diagram of an encoder that generates space-time codes, in accordance with an embodiment of the present invention. A transmitter 200, as mentioned above, possesses a message source 201 that generates k signals from a discrete alphabet, X. Encoder 203 then generates signals from alphabet Y to a modulator 205. Modulator 205 maps the encoded messages from encoder 203 to signal waveforms that are transmitted to Lt number of antennas 207, which emit these waveforms over the communication channel 103 (as shown in FIG. 1). Accordingly, the encoded messages are segmented into Lt data streams and then simultaneously transmitted over the antennas 207.
FIG. 3 shows a diagram of a decoder that decodes space-time codes, according to an embodiment of the present invention. At the receiving side, a receiver 300 includes a demodulator 301 that performs demodulation of received signals from transmitter 200. These signals are received at multiple antennas 303. After demodulation, the received signals are forwarded to a decoder 305, which attempts to reconstruct the original source messages by generating messages, X′. Receiver 300, according to one embodiment of the present invention, has a memory 307 that stores channel state information (CSI) associated with the communication channel 103. Conventional communication systems typically require that CSI be available at both the transmitter and the receiver. By contrast, the present invention, according to one embodiment, does not require CSI at the transmitter 200, thus, providing a more robust design.
FIG. 4 shows a flow chart of the process of constructing space-time codes used in the system of FIG. 1. As stated previously, some research have explored the availability of multiple transmit antennas in designing channel codes that exploit spatial transmit diversity. The present invention focuses on a quasi-static fading model of the communication channel 103 in which the path gains remain fixed throughout the code word. Specifically, in the present invention, the more general block fading model is examined, based upon the quasi-static fading channel. In the present model, the code word is composed of multiple blocks. The fading coefficients are constant over one fading block but are independent from block to block. The number of fading blocks per code word can be regarded as a measure of the interleaving delay allowed in the system 100, so that systems subject to a strict delay constraint are usually characterized by a small number of independent blocks. The information theoretic capacity of multiple antenna systems 100 in block fading channels has been studied; assuming the availability of channel state information (CSI) at both the transmitter 101 and receiver 105, it is noted that antenna diversity can be a substitute for time diversity. However, this conclusion does not hold when CSI is only available at the receiver 105. The code design of the present invention exploits both spatial and temporal diversity.
Spatial and temporal diversity can be achieved through the construction of space-time codes, as described in FIG. 4. In step 401, a baseband design criteria that determine the diversity and coding advantage achieved over block fading channels are developed. As will be more fully described, this design criteria, as in [1] [2], for quasi-static and fast fading channels are special cases of the new criteria. Then, according to step 403, the diversity advantage baseband design criterion is translated into binary rank criteria for PSK modulated codes; this approach is more fully detailed in a paper by A. R. Hammons Jr. and H. El Gamal, entitled “On the theory of space-time codes for PSK modulation” IEEE Trans. Info. Theory, March 2000, which is incorporated herein by reference in its entirety. Next, the binary rank criteria are then used to develop an algebraic framework for space-time code design in block fading design, per step 405. Such an algebraic framework permits construction of space-time codes that realize the optimum trade-off between diversity advantage and transmission rate for arbitrary number of transmit antennas and fading blocks (step 407). According to the present invention, the notion of universal space-time coding, which aims at constructing codes that exploit the spatial and temporal diversity when available, is described. This notion is a generalization of the smart greedy design principle proposed in [1].
In addition to its importance in the study of code design in time varying fading channels, the MIMO block fading model of communications channel 103 is beneficial in the frequency selective scenario. The developed algebraic framework is employed to construct space-frequency codes that exploit the frequency diversity available in the MIMO frequency selective fading channels.
In system 100, maximum likelihood (ML) decoding at receiver 105 is assumed. This assumption represents the case in which only a small number of receive antennas 303 (FIG. 3) are available so that the receiver signal processing capabilities are limited. In the case in which a relatively large number of receive antennas are available, more efficient signal processing techniques can be employed to separate the different transmit antenna signals. The code design criterion is different in both scenarios. The present invention develops a coding approach for systems 100 with small number of receive antennas 303.
Before discussing the construction of space-time codes of the present invention, it is instructive to discuss the concepts of space-time code design in general. First, a system model is discussed, and then the design criteria for space-time code design in quasi-static and fast fading channels, respectively, are described.
The system model, according to an embodiment of the present invention, the source 201 of transmitter 200 generates k information symbols from the discrete alphabet X, which are encoded by the error control code C via encoder 203 to produce code words of length N=nLt over the symbol alphabet Y. The encoded symbols are parsed among Lt transmit antennas 207 and then mapped by the modulator into constellation points from the discrete complex-valued signaling constellation Ω for transmission across the channel 103. The modulated streams for all antennas 207 are transmitted simultaneously.
At the receiver 300, there are Lr receive antennas 303 to collect the incoming transmissions. The received baseband signals are subsequently decoded by the space-time decoder 305. Each spatial channel (the link between one transmit antenna (e.g., 207) and one receive antenna (e.g., 303)) is assumed to experience statistically independent flat Rayleigh fading. Receiver noise is assumed to be AWGN (Additive White Gaussian Noise).
A space-time code is defined to include an underlying error control code together with a spatial parser. An Lt×n space-time code C of size S consists of an (Ltn, S) error control code C and a spatial parser σ that maps each code word vector c∈C to an Lt×n matrix c, whose entries are a rearrangement of those of c. Except as noted to the contrary, it is assumed that the standard parser maps the following

c=(c11, c12, . . . , c1Lt, c21, c22, . . . , c2Lt, cn1, cn2, . . . , cnLt)∈C

to the matrix





  c
  =
  
    [
    
      
        
          
            c
            1
            1
          
        
        
          
            c
            2
            1
          
        
        
          ⋯
        
        
          
            c
            n
            1
          
        
      
      
        
          
            c
            1
            2
          
        
        
          
            c
            2
            2
          
        
        
          ⋯
        
        
          
            c
            n
            2
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋰
        
        
          ⋮
        
      
      
        
          
            c
            1
            
              L
              t
            
          
        
        
          
            c
            2
            
              L
              t
            
          
        
        
          ⋯
        
        
          
            c
            n
            
              L
              t
            
          
        
      
    
    ]
  




In this notation, it is understood that cti, is the code symbol assigned to transmit antenna i (e.g., 207) at time t.

Assuming that f:Y→Ω is the modulator mapping function, then s=f(c) is the baseband version of the code word as transmitted across the channel 103. For this system, we have the following baseband model of the received signal:




  
    y
    t
    j
  
  =
  
    
      
        
          E
          s
        
      
      ⁢
      
        
          ∑
          
            i
            =
            1
          
          L
        
        ⁢
        
          
            α
            i
            ij
          
          ⁢
          
            s
            t
            i
          
        
      
    
    +
    
      n
      t
      j
    
  




where √{square root over (Es)} is the energy per transmitted symbol; αtij is the complex path gain from transmit antenna i (e.g., 207) to receive antenna j (e.g., 303) at time t, sti=f(cti) is the transmitted constellation point from antenna i at time t, ntj is the additive white Gaussian noise sample for receive antenna j at time t. The noise samples are independent samples of zero-mean complex Gaussian random variable with variance N0/2 per dimension. The different path gains αtij are assumed to be statistically independent.

The fading model of primary interest is that of a block flat Rayleigh fading process in which the code word encompasses M fading blocks. The complex fading gains are constant over one fading block but are independent from block to block. The quasi-static and fast fading models are special cases of the block fading model in which M=1, and M=n, respectively. For simplicity, it is assumed that M divides n.
For the quasi-static flat Rayleigh fading channel, the pairwise error probability is given by [1] [2]:



  
    
      P
      ⁡
      
        (
        
          c
          →
          e
        
        )
      
    
    ≤
    
      
        (
        
          1
          
            
              ∏
              
                i
                =
                1
              
              d
            
            ⁢
            
              (
              
                1
                +
                
                  
                    λ
                    i
                  
                  ⁢
                  
                    
                      E
                      S
                    
                    /
                    4
                  
                  ⁢
                  
                    N
                    0
                  
                
              
              )
            
          
        
        )
      
      
        L
        r
      
    
  




  
    
      P
      ⁡
      
        (
        
          c
          →
          e
        
        )
      
    
    ≤
    
      
        (
        
          
            μ
            ⁢
            
              
            
            ⁢
            
              E
              s
            
          
          
            4
            ⁢
            
              N
              0
            
          
        
        )
      
      
        -
        
          dL
          r
        
      
    
  



where d=rank(f(c)−f(e)) and μ=(λ1λ2 . . . λd)1/d is the geometric mean of the nonzero eigen-values of A=(f(c)−f(e))(f(c)−f(e))H. The exponent dLt is, also referred to as the “diversity advantage,” while the multiplicative factor μ is known as the “coding advantage.” The parameter d is the diversity provided by the multiple transmit antennas 207.

Accordingly, the rank and equivalent product distance criteria for space-time codes in quasi-static channels [1] results. Specifically, the rank criterion specifies that the transmit diversity advantage d=rank(f(c)−f(e)) be maximized over all pairs of distinct code words c, e∈C. Further, the product distance criterion requires the maximization of the coding advantage μ=(λ1λ2 . . . λd)1/d over all pairs of distinct code words c, e∈C. The rank criterion is the more important of the two criteria, as it determines the asymptotic slope of the performance curve as a function of Es/N0.
The binary rank criterion for BPSK (Binary Phase-Shift Keying)-modulated, binary space-time codes are now developed. It is assumed that C is a linear Lt×n space-time code with underlying binary code C of length N=nLt, wherein n>Lt. It is also assumed that every non-zero code word c is a matrix of full rank over the binary field F. Thus, for BPSK transmission over the quasi-static fading channel, the space-time code C achieves full spatial diversity LtLr.
Using the above binary rank criterion, the following general construction for space-time codes, which is referred to as the “stacking construction” is developed. It is assumed that M1, M2, . . . , MLt are binary matrices of dimension k×n,n≧k, and C is a Lt×n space-time code of dimension k consisting of the code word matrices




  c
  =
  
    [
    
      
        
          
            
              x
              _
            
            ⁢
            
              M
              1
            
          
        
      
      
        
          
            
              x
              _
            
            ⁢
            
              M
              2
            
          
        
      
      
        
          ⋮
        
      
      
        
          
            
              x
              _
            
            ⁢
            
              M
              
                L
                t
              
            
          
        
      
    
    ]
  




where x denotes an arbitrary k-tuple of information bits and Lt<n. Consequently, C satisfies the binary rank criterion, and thus, for BPSK transmission over the quasi-static fading channel, achieves full spatial diversity LtLr, if and only if M1, M2, . . . , MLt have the property that

∀a1, a2, . . . , aLt∈F:

M=a1M1⊕a2M2⊕ . . . ⊕aLtMLt 

is of full rank k unless a1=a2= . . . =aLt=0.

The previously described binary rank criteria and stacking construction may lift to the Z4 domain, where they describe full diversity QPSK (Quadrature Phase-Shift Keying)-modulated space-time codes. The stacking construction encompasses as special cases transmit delay diversity, Tarokh's hand-crafted trellis codes [1], and certain block and concatenated coding schemes. The stacking construction is general in the number of transmit antennas 207 and applies to tail terminated trellis codes as well as block codes. The important class of rate 1/Lt binary convolutional codes with optimal dfree can usually be spatially formatted to yield full diversity space-time codes.
The present invention generalizes the stacking construction in two different ways. First, a generalization is described that allows for increasing the transmission rate at the expense of minimal reduction in the diversity advantage. This construction can then be extended to block fading channels in which an objective is to optimally exploit the spatial and temporal diversity available in the channel without compromising the transmission rate.
With respect to a fast fading channel, the pairwise error probability that the decoder 305 prefers an alternate code word e to c can be upper bounded by [1]



  
    
      P
      ⁡
      
        (
        
          c
          →
          e
        
        )
      
    
    ≤
    
      
        (
        
          1
          
            
              ∏
              
                i
                =
                1
              
              d
            
            ⁢
            
              (
              
                1
                +
                
                  
                    
                      
                      
                        
                          f
                          ⁡
                          
                            (
                            
                              
                                c
                                _
                              
                              t
                            
                            )
                          
                        
                        -
                        
                          f
                          ⁡
                          
                            (
                            
                              
                                e
                                _
                              
                              t
                            
                            )
                          
                        
                      
                      
                    
                    2
                  
                  ⁢
                  
                    
                      E
                      S
                    
                    /
                    4
                  
                  ⁢
                  
                    N
                    0
                  
                
              
              )
            
          
        
        )
      
      
        L
        r
      
    
  




  
    
      P
      ⁡
      
        (
        
          c
          →
          e
        
        )
      
    
    ≤
    
      
        (
        
          
            μ
            ⁢
            
              
            
            ⁢
            
              E
              s
            
          
          
            4
            ⁢
            
              N
              0
            
          
        
        )
      
      
        -
        
          dL
          r
        
      
    
  



where ct, is the ith column of c, et is the tth column of e, d is the number of columns ct that are different from et, and





  μ
  =
  
    
      (
      
        
          ∏
          
            
              c
              t
            
            ≠
            
              e
              t
            
          
        
        ⁢
        
          
            
            
              
                f
                ⁡
                
                  (
                  
                    
                      c
                      _
                    
                    t
                  
                  )
                
              
              -
              
                f
                ⁡
                
                  (
                  
                    
                      e
                      _
                    
                    t
                  
                  )
                
              
            
            
          
          2
        
      
      )
    
    
      1
      /
      d
    
  




The diversity advantage is dLr; and the coding advantage is μ. Thus, the fundamental design criteria [1] for space-time codes over fast fading channels are as follows. For the distance criterion, the number of column differences d=|{t:{overscore (c)}t≠ēt}| over all pairs of distinct code words c, e∈C are maximized. In addition, for product criterion, the following coding advantage is maximized over all pairs of distinct code words c, e∈C:




  μ
  =
  
    
      (
      
        
          ∏
          
            
              c
              t
            
            ≠
            
              e
              t
            
          
        
        ⁢
        
          
            
            
              
                f
                ⁡
                
                  (
                  
                    
                      c
                      _
                    
                    t
                  
                  )
                
              
              -
              
                f
                ⁡
                
                  (
                  
                    
                      e
                      _
                    
                    t
                  
                  )
                
              
            
            
          
          2
        
      
      )
    
    
      1
      /
      d
    
  




Because real fading channels are neither quasi-static nor fast fading, but something in between, Tarokh et al. [1] suggested the ad-hoc strategy of designing space-time codes based on a combination of the quasi-static and fast fading design criteria. They refer to space-time codes designed according to the hybrid criteria as “smart greedy codes,” meaning that the codes seek to exploit both spatial and temporal diversity whenever available. The present invention introduces the notion of universal space-time coding that attempts to achieve the same goal, in a systematic fashion, under the MIMO block fading model.
The present invention considers the block fading model and develops a systematic approach for designing space-time codes that achieve the maximum diversity advantage for any coding rate, number of transmit antennas 207, and temporal interleaving depth. First, the design criteria that governs the code performance in such channels are developed. The baseband design criterion is described. Under the block fading assumption, the path gains are constant over n/M consecutive symbol durations. The notation (.)[m] denotes the single or two dimensional vector of values of parameter (.) for the mth fading block. Accordingly, the following parameters are defined:

αij[m]=α(m−1n/M+1)ij= . . . =αmn/Mij,

Y[m]=[y((m−1)n/M)+11, . . . , ymn/M1, . . . , ymn/MLr],

N[m]=[n((m−1)n/M)+11, . . . , nmn/M1, . . . , nmn/MLr],

A[m]=[α11[m], . . . , αLt1[m], . . . , αLtLr[m]], 

c[m]=[{overscore (c)}((m−1)n/M)+1, . . . , {overscore (c)}mn/M],

For 1≦m≦M, the following expression exists:

Y[m]=√{square root over (Es)}A[m]Dc[m]+N[m]

If code word c is transmitted, then the conditional pairwise error probability that the decoder 305 will prefer the alternate code word e to c is given by the following:

P(c→e|{αij})=P(V<0|αij),

where





  V
  =
  
    
      ∑
      
        m
        =
        1
      
      M
    
    ⁢
    
      [
      
        
          
            
            
              
                
                  
                    A
                    _
                  
                  ⁡
                  
                    [
                    m
                    ]
                  
                
                ⁢
                
                  (
                  
                    
                      
                        D
                        c
                      
                      ⁡
                      
                        [
                        m
                        ]
                      
                    
                    -
                    
                      
                        D
                        e
                      
                      ⁡
                      
                        [
                        m
                        ]
                      
                    
                  
                  )
                
              
              +
              
                
                  N
                  _
                
                ⁡
                
                  [
                  m
                  ]
                
              
            
            
          
          2
        
        -
        
          
            
            
              
                N
                _
              
              ⁡
              
                [
                m
                ]
              
            
            
          
          2
        
      
      ]
    
  




is a Gaussian random variable with mean





  
    E
    ⁢
    
      {
      V
      }
    
  
  =
  
    
      ∑
      
        m
        =
        1
      
      M
    
    ⁢
    
      
        
        
          
            
              
                A
                _
              
              ⁡
              
                [
                m
                ]
              
            
            ⁢
            
              (
              
                
                  
                    D
                    c
                  
                  ⁡
                  
                    [
                    m
                    ]
                  
                
                -
                
                  
                    D
                    e
                  
                  ⁡
                  
                    [
                    m
                    ]
                  
                
              
              )
            
          
          +
          
            
              N
              _
            
            ⁡
            
              [
              m
              ]
            
          
        
        
      
      2
    
  




and variance





  
    
      Var
      ⁢
      
        {
        V
        }
      
    
    =
    
      2
      ⁢
      
        N
        0
      
      ⁢
      E
      ⁢
      
        
          {
          V
          }
        
        .
        
          

        
        ⁢
        Thus
      
    
  
  ,
  
    

  
  ⁢
  
    
      
        P
        ⁡
        
          (
          
            
              V
              <
              0
            
            |
            
              {
              
                α
                ij
              
              }
            
          
          )
        
      
      ⁢
      Q
    
    =
    
      
        (
        
          
            
              ∑
              
                n
                =
                1
              
              M
            
            ⁢
            
              
              
                
                  
                    A
                    _
                  
                  ⁡
                  
                    [
                    m
                    ]
                  
                
                ⁢
                
                  (
                  
                    
                      
                        D
                        c
                      
                      ⁡
                      
                        [
                        m
                        ]
                      
                    
                    -
                    
                      
                        D
                        e
                      
                      ⁡
                      
                        [
                        m
                        ]
                      
                    
                  
                  )
                
              
              
            
          
          
            
              2
              ⁢
              
                
              
              ⁢
              
                N
                0
              
            
          
        
        )
      
      ≤
      
        
          1
          2
        
        ⁢
        exp
        ⁢
        
          {
          
            
              -
              
                1
                
                  4
                  ⁢
                  
                    N
                    0
                  
                
              
            
            ⁢
            
              
                ∑
                
                  m
                  =
                  1
                
                M
              
              ⁢
              
                
                  
                  
                    
                      
                        A
                        _
                      
                      ⁡
                      
                        [
                        m
                        ]
                      
                    
                    ⁢
                    
                      (
                      
                        
                          
                            D
                            c
                          
                          ⁡
                          
                            [
                            m
                            ]
                          
                        
                        -
                        
                          
                            D
                            e
                          
                          ⁡
                          
                            [
                            m
                            ]
                          
                        
                      
                      )
                    
                  
                  
                
                2
              
            
          
          }
        
      
    
  




Accordingly, the pairwise probability of error can be manipulated to yield the fundamental bound [1] [2]:





  
    P
    ⁡
    
      (
      
        c
        →
        e
      
      )
    
  
  ≤
  
    
      (
      
        
          μ
          ⁢
          
            
          
          ⁢
          
            E
            s
          
        
        
          4
          ⁢
          
            N
            0
          
        
      
      )
    
    
      -
      
        dL
        r
      
    
  




where





  
    d
    =
    
      
        ∑
        
          m
          =
          1
        
        M
      
      ⁢
      
        d
        m
      
    
  
  ,
  
    
      d
      m
    
    =
    
      rank
      ⁡
      
        (
        
          
            f
            ⁡
            
              (
              
                c
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
          -
          
            f
            ⁡
            
              (
              
                e
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
        
        )
      
    
  
  ,
  
    

  
  ⁢
  
    μ
    =
    
      
        (
        
          
            ∏
            
              m
              =
              1
            
            M
          
          ⁢
          
            
              
                λ
                1
              
              ⁡
              
                [
                m
                ]
              
            
            ⁢
            
              
                λ
                
                  2
                  ⁢
                  
                    
                  
                
              
              ⁡
              
                [
                m
                ]
              
            
            ⁢
            
              
            
            ⁢
            ⋯
            ⁢
            
              
            
            ⁢
            
              
                λ
                
                  d
                  m
                
              
              ⁡
              
                [
                m
                ]
              
            
          
        
        )
      
      
        1
        /
        d
      
    
  
  ,




λ1[m], λ2[m], . . . , λdm[m] are the nonzero eigenvalues of ·A[m]=(f(c[m])−f(e[m]))(f(c[m])−f(e[m]))H. Hence, the generalized diversity and product distance criteria for space-time codes over block fading channels are as follows: for the block fading baseband rank criterion, the transmit diversity advantage





  
    d
    m
  
  =
  
    
      ∑
      
        m
        =
        1
      
      M
    
    ⁢
    
      rank
      ⁡
      
        (
        
          
            f
            ⁡
            
              (
              
                c
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
          -
          
            f
            ⁡
            
              (
              
                e
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
        
        )
      
    
  




over all pairs of distinct code words c, e∈C is maximized, and the block fading product distance criterion entails maximizing the coding advantage





  μ
  =
  
    
      (
      
        
          ∏
          
            m
            =
            1
          
          M
        
        ⁢
        
          
            
              λ
              1
            
            ⁡
            
              [
              m
              ]
            
          
          ⁢
          
            
              λ
              2
            
            ⁡
            
              [
              m
              ]
            
          
          ⁢
          
            
          
          ⁢
          ⋯
          ⁢
          
            
          
          ⁢
          
            
              λ
              
                d
                m
              
            
            ⁡
            
              [
              m
              ]
            
          
        
      
      )
    
    
      1
      /
      d
    
  




over all pairs of distinct code words c, e∈C.

It is straightforward to observe that the design criteria for quasi-static and fast fading channels can be obtained from the block fading generalized criteria by simply letting M=1, M=n, respectively. As in the case of quasi-static fading channels, the fact that the baseband rank criterion applies to the complex-valued differences between baseband code words represents a major obstacle to the systematic design of space-time codes that achieve the maximum possible diversity advantage. It is possible to translate the baseband criterion into an equivalent binary rank criteria for BPSK and QPSK modulated space-time codes. These general binary criteria are sufficient to ensure that a space-time code achieves a certain level of diversity over block fading channels. To this end, a certain equivalence relation is imposed upon potential baseband difference matrices. Each equivalence class contains a special representative that is seen to be a binary projection of a code word whose rank over the binary field is a lower bound on the rank of any of the complex matrices in the equivalence class.
Turning now to the discussion of the BPSK binary rank criterion, for BPSK modulation, the natural discrete alphabet is the field F={0,1} of integers modulo 2. Modulation is performed by mapping the symbol x∈F to the constellation point s=f(x)∈{−1,1} according to the rule s=(−1)x. It is noted that it is possible for the modulation format to include an arbitrary phase offset eiφ, since a uniform rotation of the BPSK constellation will not affect the rank of the matrices f(c[m])−f(e[m])nor the eigenvalues of the matrices A[m]=(f(c[m])−f(e[m]))(f(c[m])−f(e[m])H. Notationally, the circled operator ⊕ will be used to distinguish modulo 2 addition from real- or complex-valued (+, −) operations.
Based on the above discussion, the following result for BPSK modulated codes over block fading (BF) channels is achieved. It is assumed that C is a linear Lt×n space-time code with n≧Lt used in communication system 100 with Lt transmit antennas 207, Lr receive antennas 303, and operating over a block fading channel 103 with M blocks per code word. Additionally, it is supposed that every non-zero binary code word c∈C has the property that d is the largest integer such that




  
    
      
        ∑
        
          m
          =
          1
        
        M
      
      ⁢
      
        rank
        ⁡
        
          (
          
            c
            ⁡
            
              [
              m
              ]
            
          
          )
        
      
    
    ≥
    d
  
  ,




where the rank is over the binary field F. Then, for BPSK transmission, the space-time code C achieves a diversity level at least as large as dLr. This result stems from the fact that for any two code words c, e∈C, the following expression holds true:

rank(f(c[m])−f(e[m]))≧rank(f(c[m])⊕f(e[m])),

where the rank in the left hand side is over the complex field and in the right hand side is over the binary field. Hence,





  
    
      ∑
      
        m
        =
        1
      
      M
    
    ⁢
    
      rank
      ⁡
      
        (
        
          
            f
            ⁡
            
              (
              
                c
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
          -
          
            f
            ⁡
            
              (
              
                e
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
        
        )
      
    
  
  ≥
  
    
      ∑
      
        m
        =
        1
      
      M
    
    ⁢
    
      rank
      ⁡
      
        (
        
          
            f
            ⁡
            
              (
              
                c
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
          ⊕
          
            f
            ⁡
            
              (
              
                e
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
        
        )
      
    
  




Since C is linear, then c⊕e∈C and





  
    
      min
      
        c
        ,
        
          e
          ∈
          C
        
      
    
    ⁢
    
      
        ∑
        
          m
          =
          1
        
        M
      
      ⁢
      
        rank
        ⁡
        
          (
          
            
              f
              ⁡
              
                (
                
                  c
                  ⁡
                  
                    [
                    m
                    ]
                  
                
                )
              
            
            -
            
              f
              ⁡
              
                (
                
                  e
                  ⁡
                  
                    [
                    m
                    ]
                  
                
                )
              
            
          
          )
        
      
    
  
  ≥
  
    
      min
      
        c
        ∈
        C
      
    
    ⁢
    
      
        ∑
        
          m
          =
          1
        
        M
      
      ⁢
      
        
          rank
          ⁡
          
            (
            
              c
              ⁡
              
                [
                m
                ]
              
            
            )
          
        
        .
      
    
  




As regards the QPSK binary rank criterion, in QPSK modulation, the natural discrete alphabet is the ring Z4={0,±1,2} of integers modulo 4. Modulation is performed by mapping the symbol x∈Z4 to the constellation point s∈{±1,±i} according to the rule s=ix,
where i=√{square root over (−1)}. Again, the absolute phase reference of the QPSK constellation could have been chosen arbitrarily without affecting the diversity advantage or coding advantage of a Z4-valued space-time code.
For the Z4-valued matrix c[m], the binary-valued indicant projections are defined: Ξ(c[m]) and Ψ(c[m]). These indicant projections as defined below serve to indicate certain aspects of the binary structure of the Z4 matrix in which multiples of two are ignored.
A Z4-valued matrix c[m]of dimension Lt×n/M is said to be of type 1l2Lt−l if it consists of exactly l rows that are not multiples of two.
It is assumed that c[m] is a Z4-valued matrix of type 1l2Lt−l. After suitable row permutations if necessary, it has the following row structure:




  
    c
    ⁡
    
      [
      m
      ]
    
  
  =
  
    [
    
      
        
          
            
              
                c
                _
              
              1
            
            ⁡
            
              [
              m
              ]
            
          
        
      
      
        
          ⋮
        
      
      
        
          
            
              
                c
                _
              
              1
            
            ⁡
            
              [
              m
              ]
            
          
        
      
      
        
          
            2
            ⁢
            
              
                
                  c
                  _
                
                
                  l
                  +
                  1
                
                ′
              
              ⁡
              
                [
                m
                ]
              
            
          
        
      
      
        
          ⋮
        
      
      
        
          
            2
            ⁢
            
              
                
                  c
                  _
                
                
                  L
                  t
                
                ′
              
              ⁡
              
                [
                m
                ]
              
            
          
        
      
    
    ]
  




The row-based indicant projection (5-projection) is then defined as the following:





  
    Ξ
    ⁡
    
      (
      
        c
        ⁡
        
          [
          m
          ]
        
      
      )
    
  
  =
  
    [
    
      
        
          
            β
            ⁡
            
              (
              
                
                  
                    c
                    _
                  
                  1
                
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
        
      
      
        
          ⋮
        
      
      
        
          
            β
            ⁡
            
              (
              
                
                  
                    c
                    _
                  
                  1
                
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
        
      
      
        
          
            β
            ⁡
            
              (
              
                
                  
                    c
                    _
                  
                  
                    l
                    +
                    1
                  
                  ′
                
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
        
      
      
        
          ⋮
        
      
      
        
          
            β
            ⁡
            
              (
              
                
                  
                    c
                    _
                  
                  
                    L
                    t
                  
                  ′
                
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
        
      
    
    ]
  




Similarly, the column-based indicant projection (Ψ-projection) is defined as

[Ψ(c[m])]T=Ξ(c[m])T)

Using the binary indicants, we have the following result that translates the baseband rank criterion into binary rank criterion for QPSK modulated codes in a block fading environment.
With respect to the QPSK-BF binary rank criterion, it is assumed that C is a linear Lt×n space-time code over Z4, with n≧Lt in communication system 100 with Lt transmit antennas 207, Lr receive antennas 303, and operating over a block fading channel 103 with M blocks per code word. It is further assumed that, every non-zero code word c∈C has the property that d is the largest integer such that




  
    
      ∑
      
        m
        =
        1
      
      M
    
    ⁢
    
      rank
      ⁢
      
        {
        
          Ξ
          ⁡
          
            (
            
              c
              ⁡
              
                [
                m
                ]
              
            
            )
          
        
        }
      
    
  
  ≥
  
    d
    ⁢
    
      
    
    ⁢
    or
    ⁢
    
      
    
    ⁢
    
      
        ∑
        
          m
          =
          1
        
        M
      
      ⁢
      
        rank
        ⁢
        
          {
          
            Ψ
            ⁡
            
              (
              
                c
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
          }
        
      
    
  
  ≥
  d




where the rank is over the binary field F. Then, for QPSK transmission, the space-time code C achieves a diversity level at least as large as dLr.

The block fading channel binary rank criteria open the door for developing an algebraic framework for constructing space-time codes that realize the optimum trade-off between transmission rate and diversity advantage. First, it is shown that the design of spec-time codes that realize full diversity is relatively easy using the multi-stacking construction in [2]. However, attaining full diversity entails a significant loss in the transmission rate compared to the quasi-static scenario, irrespective of the coding scheme used. The more challenging task, as recognized by the present invention, is to construct space-time codes that exploit the temporal diversity in a multi-input multi-output (MIMO) block fading channel without compromising the transmission rate. This coding paradigm can achieve significant increase in the diversity advantage with a relatively small number of fading blocks per code word (i.e., a small penalty in terms of interleaving delay).
The algebraic framework for BPSK space-time codes is now described. In a MIMO block fading channel 103 with Lt transmit antennas 207 and M fading blocks per codeword the maximum transmit diversity is LtM. Under this model, the space-time code C is defined to include the following code words




  c
  =
  
    [
    
      
        
          
            
              x
              _
            
            ⁢
            
              
            
            ⁢
            
              M
              11
            
          
        
        
          
            
              x
              _
            
            ⁢
            
              
            
            ⁢
            
              M
              12
            
          
        
        
          ⋯
        
        
          
            
              x
              _
            
            ⁢
            
              
            
            ⁢
            
              M
              
                1
                ⁢
                M
              
            
          
        
      
      
        
          
            
              x
              _
            
            ⁢
            
              
            
            ⁢
            
              M
              21
            
          
        
        
          
            
              x
              _
            
            ⁢
            
              
            
            ⁢
            
              M
              22
            
          
        
        
          ⋯
        
        
          
            
              x
              _
            
            ⁢
            
              
            
            ⁢
            
              M
              
                2
                ⁢
                M
              
            
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋰
        
        
          ⋮
        
      
      
        
          
            
              x
              _
            
            ⁢
            
              
            
            ⁢
            
              M
              
                
                  L
                  t
                
                ⁢
                1
              
            
          
        
        
          
            
              x
              _
            
            ⁢
            
              
            
            ⁢
            
              M
              
                
                  L
                  t
                
                ⁢
                2
              
            
          
        
        
          ⋯
        
        
          
            
              x
              _
            
            ⁢
            
              
            
            ⁢
            
              M
              
                
                  L
                  t
                
                ⁢
                M
              
            
          
        
      
    
    ]
  




where x∈Fk,Mij∈Fk×n/M. Full diversity is realized in this channel 103 by the following multi-stacking code construction. The space-time code C achieves full transmit diversity LtM if for every i, 1≦i≦M, the set of matrices {M1i, M2i, . . . , MLti} satisfies the stacking construction as discussed previously.

The main disadvantage of the above multi-stacking construction is that the transmission rate is reduced to 1/M bits/sec/Hz; it is noted that in quasi-static fading channels, the stacking construction supports 1 bits/sec/Hz. This reduction in rate is not a special characteristic of the multi-stacking construction and any space-time code that achieves full diversity in the MIMO block fading channel suffers from this advantage. This fact is formalized in the following result that serves to establish the fundamental limit on the transmission rate for space-time codes with a certain level of diversity advantage in MIMO block fading channels.
The maximum transmission rate for BPSK modulation in a communication system 100 with Lt transmit antennas 207, operating over a block fading channel 103 with M blocks and using a space-time code that achieves d levels of transmit diversity is




  
    
      
        ML
        t
      
      -
      d
      +
      1
    
    M
  
  ⁢
  
    
  
  ⁢
  bits
  ⁢
  
    /
  
  ⁢
  sec
  ⁢
  
    /
  
  ⁢
  
    Hz
    .
  




It is observed that the scenario at hand is strictly more restrictive than the case of single transmit antenna with MLt fading block—i.e., a code that achieves d levels of diversity in the MIMO block fading scenario achieves at least the same diversity order in the later scenario.

At this point, the general case of constructing codes that realize the optimum trade between the transmission rate and diversity advantage for any arbitrary transmission rate is described. The main result for space-time code design in MIMO block fading channels is obtained in two steps. First, a generalization of the stacking construction in quasi-static fading channels that allows for increasing the transmission rate at the expense of minimal reduction the diversity advantage is achieved. This important result introduces the technical machinery necessary for the second step, in which space-time codes are constructed to optimally exploit the diversity available in MIMO block fading channels.
In the first step, the previously discussed stacking construction is generalized to handle codes that achieve d<Lt levels of spatial transmit diversity. These codes are capable of supporting higher transmission rates than full diversity codes. For example, with BPSK modulation and Lt transmit antennas 207, a d-diversity code can support η≧1 bits/sec/Hz, where Lt−d+1≧η≧Lt−d, over the quasi-static fading channel. Before proceeding further, certain definitions and terminologies are presented to facilitate the discussion of the generalized stacking construction.
The BPSK space-time code under consideration C is defined as in the previously described stacking construction with the modification that n can be smaller than k to allow for higher transmission rates than 1 bits/sec/Hz. G is defined as the set of binary full rank matrices {G: G=└gi,j┘LtxLt} resulting from applying any number of simple row operations to the identity matrix, ILt. Also, ∀G∈G,x∈FK, let




  
    Q
    ⁡
    
      (
      
        
          x
          _
        
        ,
        G
      
      )
    
  
  =
  
    
      G
      ⁡
      
        [
        
          
            
              
                
                  x
                  _
                
                ⁢
                
                  
                
                ⁢
                
                  M
                  1
                
              
            
          
          
            
              
                
                  x
                  _
                
                ⁢
                
                  
                
                ⁢
                
                  M
                  2
                
              
            
          
          
            
              ⋮
            
          
          
            
              
                
                  x
                  _
                
                ⁢
                
                  
                
                ⁢
                
                  M
                  
                    L
                    t
                  
                
              
            
          
        
        ]
      
    
    =
    
      
        [
        
          
            
              q
              1
              T
            
            ⁡
            
              (
              
                
                  x
                  _
                
                ,
                G
              
              )
            
          
          ,
          
            
              q
              2
              T
            
            ⁡
            
              (
              
                
                  x
                  _
                
                ,
                G
              
              )
            
          
          ,
          ...
          ⁢
          
            
          
          ,
          
            
              q
              
                L
                t
              
              T
            
            ⁡
            
              (
              
                
                  x
                  _
                
                ,
                G
              
              )
            
          
        
        ]
      
      T
    
  




According to the BPSK binary rank criterion, for C to achieve at least r levels of diversity, the binary rank for each code word must be larger than or equal to r. A code word matrix c has a binary rank equal to r, if and only if all matrices resulting from applying any number of simple row operations to c have at least r non zero rows (i.e., the number of zero rows is less than Lt−r+1). Noting that {Q(x, G)} is the set of matrices resulting from applying all possible combinations of simple row operations to the code word matrix corresponding to the input stream x, the following condition for a space-time code achieving r levels of diversity results:

∀G∈G,x∈FK 

└q1(x,G), q2(x,G), . . . , qLt−r+1(x,G)┘≠01×n(Lt−r+1) 

Now, the following relationships are used to obtain the generalized the stacking construction:





  
    
      
        
          
            q
            i
          
          ⁡
          
            (
            
              
                x
                _
              
              ,
              G
            
            )
          
        
        =
        
          
            
              x
              _
            
            ⁡
            
              [
              
                
                  
                    q
                    
                      i
                      ,
                      1
                    
                  
                  ⁢
                  
                    I
                    k
                  
                
                ,
                
                  
                    q
                    
                      i
                      ,
                      2
                    
                  
                  ⁢
                  
                    I
                    k
                  
                
                ,
                ...
                ⁢
                
                  
                
                ,
                
                  
                    q
                    
                      i
                      ,
                      
                        L
                        t
                      
                    
                  
                  ⁢
                  
                    I
                    k
                  
                
              
              ]
            
          
          ⁡
          
            [
            
              
                
                  
                    M
                    1
                  
                
              
              
                
                  
                    M
                    2
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    M
                    
                      L
                      t
                    
                  
                
              
            
            ]
          
        
      
    
  
  
    
      
        
          =
          
            
              x
              _
            
            ⁢
            
              
            
            ⁢
            
              
                R
                i
              
              ⁡
              
                (
                G
                )
              
            
          
        
        ,
      
    
  




In the generalized stacking construction, C is assumed to be a linear Lt×n space-time code as defined in the previously described stacking construction with the exception that n≦k is allowed. Then, for BPSK transmission over the quasi-static fading channel, C achieves at least d levels of transmit diversity if d is the largest integer such that ∀G∈G, R(G)=└R1(G), R2(G), . . . , RLt−d+1(G),┘ has a full rank k over the binary field F. It is clear that for d=Lt, this condition reduces to the previously described stacking construction. The above generalized stacking construction allows for a significant increase in throughput. For example, in the case of 4 transmit antennas 207, the rate can be increased from 1 bits/sec/Hz to 2 bits/sec/Hz at the expense of a small reduction in diversity advantage from 4 to 3.

The same idea behind the generalized stacking construction can be used to design space-time codes for MIMO block fading channels. First, the following notations are introduced:

∀1≦m≦M,Gm=[gi,j(m)]∈G,x∈FK, let





  
    
      
        
          Q
          ⁡
          
            (
            
              
                x
                _
              
              ,
              
                G
                m
              
              ,
              m
            
            )
          
        
        =
        
          
            G
            m
          
          ⁡
          
            [
            
              
                
                  
                    
                      x
                      _
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      M
                      
                        1
                        ⁢
                        m
                      
                    
                  
                
              
              
                
                  
                    
                      x
                      _
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      M
                      
                        2
                        ⁢
                        m
                      
                    
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    
                      x
                      _
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      M
                      
                        
                          L
                          t
                        
                        ⁢
                        m
                      
                    
                  
                
              
            
            ]
          
        
      
    
  
  
    
      
        =
        
          
            [
            
              
                
                  q
                  1
                  T
                
                ⁡
                
                  (
                  
                    
                      x
                      _
                    
                    ,
                    
                      G
                      m
                    
                    ,
                    m
                  
                  )
                
              
              ,
              
                
                  q
                  2
                  T
                
                ⁡
                
                  (
                  
                    
                      x
                      _
                    
                    ,
                    
                      G
                      m
                    
                    ,
                    m
                  
                  )
                
              
              ,
              ...
              ⁢
              
                
              
              ,
              
                
                  q
                  
                    L
                    t
                  
                  T
                
                ⁡
                
                  (
                  
                    
                      x
                      _
                    
                    ,
                    
                      G
                      m
                    
                    ,
                    m
                  
                  )
                
              
            
            ]
          
          T
        
      
    
  




Using the block fading channel binary rank criterion and the generalized stacking construction argument, it is observed that the space-time code C achieves at least r levels of diversity if it satisfies the following condition:

∀G∈G, . . . , Gm∈G,x∈FK, 0≦m1≦min(Lt,MLt−r+1), . . . , 0≦mM≦min(Lt,MLt−r+1),

and





  
    
      
        ∑
        
          m
          =
          1
        
        M
      
      ⁢
      
        m
        i
      
    
    =
    
      
        ML
        t
      
      -
      r
      +
      1
    
  
  ,




[q0(x,G1,1), . . . , qm1(x,G1,1), q0(x,G2,2), . . . , qm2(x,G2,2), . . . , qmM(x,GM,M)]≠01×n(Lt−r+1) 

where q0(x,Gm,m)=[ ] is an empty vector.
Again the following fact is utilized:




  
    
      
        
          
            q
            i
          
          ⁡
          
            (
            
              
                x
                _
              
              ,
              
                G
                m
              
              ,
              m
            
            )
          
        
        =
        
          
            
              x
              _
            
            ⁡
            
              [
              
                
                  
                    
                      g
                      
                        i
                        ,
                        1
                      
                    
                    ⁡
                    
                      (
                      m
                      )
                    
                  
                  ⁢
                  
                    I
                    k
                  
                
                ,
                
                  
                    
                      g
                      
                        i
                        ,
                        2
                      
                    
                    ⁡
                    
                      (
                      m
                      )
                    
                  
                  ⁢
                  
                    I
                    k
                  
                
                ,
                ...
                ⁢
                
                  
                
                ,
                
                  
                    
                      g
                      
                        i
                        ,
                        
                          L
                          t
                        
                      
                    
                    ⁡
                    
                      (
                      m
                      )
                    
                  
                  ⁢
                  
                    I
                    k
                  
                
              
              ]
            
          
          ⁡
          
            [
            
              
                
                  
                    M
                    
                      1
                      ⁢
                      m
                    
                  
                
              
              
                
                  
                    M
                    
                      2
                      ⁢
                      m
                    
                  
                
              
              
                
                  ⋮
                
              
              
                
                  
                    M
                    
                      
                        L
                        t
                      
                      ⁢
                      m
                    
                  
                
              
            
            ]
          
        
      
    
  
  
    
      
        
          =
          
            
              x
              _
            
            ⁢
            
              
            
            ⁢
            
              
                R
                i
              
              ⁡
              
                (
                
                  
                    G
                    m
                  
                  ,
                  m
                
                )
              
            
          
        
        ,
      
    
  




for i≧1 and R0(Gm,m) is an empty matrix, to obtain the result below, which applies the generalized stacking construction to MIMO block fading channels.

In the case of a block fading generalized stacking construction, C is assumed to be a linear Lt×n space-time code. For BPSK transmission over a block fading channel 103 with M blocks, C achieves at least r levels of transmit diversity if r is the largest integer such that

∀G∈G, . . . , Gm∈G,0≦m1≦min(Lt,MLt−r+1), . . . , 0≦mM≦min(Lt,MLt−r+1), and





  
    
      
        ∑
        
          m
          =
          1
        
        M
      
      ⁢
      
        m
        i
      
    
    =
    
      
        ML
        t
      
      -
      r
      +
      1
    
  
  ,




    
    
        Rm1, . . . , mM(G1, . . . , Gm)=└R0(G1), . . . , Rm1(G1), R0(G2), . . . , Rm2(G2), . . . , RmM(GM)┘ has a full rank k over the binary field F.

It is straightforward to note that the multi-stacking construction can be obtained by setting the diversity advantage d=MLt. Further, it is interesting to compare the above condition to the threaded stacking construction for layered space-time systems.

    
    


Space-time layering is suitable for systems with relatively large number of receive antennas. The large number of receive antennas allows for the design of efficient signal processing algorithms to separate the signals from different layers efficiently, and hence, code design for layered systems can assume no spatial interference for between layers. Based on this assumption, it is observed that the layered space-time code needs to satisfy the above condition when every ∀Gm is a permutation of the identity matrix. This relaxed constraint constitute the base for the framework for layered space-time coding. For example, the present invention according to one embodiment, considers use of a relatively smaller number of receive antennas 303 than the number of transmit antennas 207, thereby limiting the ability to separate the different transmit antenna signals. Hence, the burden now lays on the code design to account for the fact that the input to the maximum likelihood decoder 305 is the sum of the different transmit antenna signals multiplied with the corresponding fading coefficients.
The block fading generalized stacking construction permits construction of space-time codes that optimally exploit the diversity available in MIMO block fading channels with arbitrary number of transmit antennas 207 and fading blocks per code word. The special case of designing space-time convolutional codes for this scenario is now described. Such codes advantageously enables the use of computationally efficient maximum likelihood decoders (e.g., 305).
The natural space-time codes associated with binary rate 1/MLt convolutional codes with periodic bit interleaving are attractive candidates for the application under consideration in the present invention, as they can be easily formatted to satisfy the multi-stacking condition, and hence achieve full diversity. Each output arm from the encoder 203 is assigned to a distinct pair of transmit antenna 207 and fading block.
The next step is to consider the more challenging task of finding rate k/MLt codes that achieve the best trade-off between throughput and diversity advantage for arbitrary choice of the transmission throughput. It is assumed that C is a binary convolutional code of rate k/MLt. The encoder 203 processes k binary input sequences x1(t), x2(t), . . . , xk(t) and produces MLt coded output sequences y1(t), y2(t), . . . , yMLt(t) which are multiplexed together to form the output code word. A sequence {x(t)} is often represented by the formal series X(D)=x(0) +x(1)D+x(2)D2+ . . . . {x(t)}X(D) is referred to as a D-transform pair. The action of the binary-convolutional encoder 203 is linear and is characterized by the so-called impulse responses gi,1(t)Gi,j(D) associating output yi(t) with input xi(t). Thus, the encoder 203 action is summarized by the matrix equation:

Y(D)=X(D)G(D),

where Y(D)=└Y1(D)Y2(D) . . . YMLt(D)┘, X(D)=[X1(D)X2(D) . . . Xk(D)], and





  
    G
    ⁡
    
      (
      D
      )
    
  
  =
  
    [
    
      
        
          
            
              G
              
                1
                ,
                1
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          
            
              G
              
                1
                ,
                2
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          ⋯
        
        
          
            
              G
              
                1
                ,
                
                  ML
                  t
                
              
            
            ⁡
            
              (
              D
              )
            
          
        
      
      
        
          
            
              G
              
                2
                ,
                1
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          
            
              G
              
                2
                ,
                2
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          ⋯
        
        
          
            
              G
              
                1
                ,
                
                  ML
                  t
                
              
            
            ⁡
            
              (
              D
              )
            
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋰
        
        
          ⋮
        
      
      
        
          
            
              G
              
                k
                ,
                1
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          
            
              G
              
                k
                ,
                2
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          ⋯
        
        
          
            
              G
              
                k
                ,
                
                  ML
                  t
                
              
            
            ⁡
            
              (
              D
              )
            
          
        
      
    
    ]
  




The natural space-time formatting of C is considered, whereby the output sequence corresponding to Y(m−1)Lt+l(D) is assigned to the lth transmit antenna 207 in the mth fading block, such that the diversity that can be achieved by this scheme can be characterized. The algebraic analysis technique considers the rank of matrices formed by concatenating linear combinations of the column vectors:




  
    
      
        
          
            F
            l
          
          ⁡
          
            (
            D
            )
          
        
        =
        
          [
          
            
              
                
                  
                    G
                    
                      1
                      ,
                      l
                    
                  
                  ⁡
                  
                    (
                    D
                    )
                  
                
              
            
            
              
                
                  
                    G
                    
                      2
                      ,
                      l
                    
                  
                  ⁡
                  
                    (
                    D
                    )
                  
                
              
            
            
              
                ⋮
              
            
            
              
                
                  
                    G
                    
                      k
                      ,
                      l
                    
                  
                  ⁡
                  
                    (
                    D
                    )
                  
                
              
            
          
          ]
        
      
    
    
      
        (
        15
        )
      
    
  




Using the same approach as in the block fading generalized stacking construction, the following is defined ∀Gm∈G, 1≦i≦Lt, 1≦m≦M





  
    
      
        
          R
          i
          
            (
            
              
                G
                m
              
              ,
              m
            
            )
          
        
        ⁢
        
           
          
            
              (
              D
              )
            
            =
            
              

            
            ⁢
            
              
                [
                
                  
                    
                      
                        g
                        
                          i
                          ,
                          1
                        
                      
                      ⁡
                      
                        (
                        m
                        )
                      
                    
                    ⁢
                    
                      I
                      k
                    
                  
                  ,
                  
                    
                      
                        g
                        
                          i
                          ,
                          2
                        
                      
                      ⁡
                      
                        (
                        m
                        )
                      
                    
                    ⁢
                    
                      I
                      k
                    
                  
                  ,
                  ...
                  ⁢
                  
                    
                  
                  ,
                  
                    
                      
                        g
                        
                          i
                          ,
                          
                            L
                            t
                          
                        
                      
                      ⁡
                      
                        (
                        m
                        )
                      
                    
                    ⁢
                    
                      t
                      k
                    
                  
                
                ]
              
              ⁡
              
                [
                
                  
                    
                      
                        
                          F
                          
                            
                              
                                (
                                
                                  m
                                  -
                                  1
                                
                                )
                              
                              ⁢
                              
                                L
                                t
                              
                            
                            +
                            1
                          
                        
                        ⁡
                        
                          (
                          D
                          )
                        
                      
                    
                  
                  
                    
                      
                        
                          F
                          
                            
                              
                                (
                                
                                  m
                                  -
                                  1
                                
                                )
                              
                              ⁢
                              
                                L
                                t
                              
                            
                            +
                            2
                          
                        
                        ⁡
                        
                          (
                          D
                          )
                        
                      
                    
                  
                  
                    
                      ⋮
                    
                  
                  
                    
                      
                        
                          F
                          
                            mL
                            i
                          
                        
                        ⁡
                        
                          (
                          D
                          )
                        
                      
                    
                  
                
                ]
              
            
          
        
      
    
    
      
        (
        16
        )
      
    
  




An algebraic framework for designing BPSK space-time convolutional codes is now established. In a communication system 100 with Lt transmit antennas 207 operating over a block fading channel 103 with M blocks, C denotes the space-time code that includes the binary convolutional code C, whose k×MLt transfer function matrix is G(D)=└F1(D) . . . FMLt(D)┘ and the spatial parser σ in which the output Y(m−1)Lt+l(D)=X(D)F(m−1)Lt+l(D) is assigned to antenna l in fading block m. Then, for BPSK transmission, C achieves d levels of transmit diversity if d is the largest integer such that

∀G1∈G, . . . , GM∈G, 0≦m1≦min(Lt,MLt−d+1), . . . , 0≦mM≦min(Lt,MLt−r+1),





  
    
      and
      ⁢
      
        
      
      ⁢
      
        
          ∑
          
            m
            =
            1
          
          M
        
        ⁢
        
          m
          i
        
      
    
    =
    
      
        ML
        t
      
      -
      d
      +
      1
    
  
  ,




Rm1, . . . , mM(G1, . . . , GM)(D)=└R0(G1,1)(D), . . . , Rm1(G1,1)(D), R0(G2,2)(D), . . . , Rm2(G2,2)(D), . . . , RmM(GM,M)(D)┘

has a rank k over the space of all formal series.
The above result is utilized to construct convolutional space-time codes that realize the optimum tradeoff between transmission rate and diversity order for BPSK modulation with arbitrary coding rate, number of transmit antennas 207, and number of fading blocks. It can be easily seen that this framework encompasses as special case rate 1/n′ convolutional codes with bit or symbol interleaving across the transmit antennas and fading blocks.
The binary constructions previously proposed for BPSK modulation can also be used to construct codes for higher order constellations. For QPSK modulation, linear Z4 codes can be constructed by “lifting” linear binary codes to the Z4 alphabet (i.e., the binary projection of the Z4 code generator matrix is the same as the binary generator matrix). Another way for designing codes for QPSK modulation is to combine two binary codes A, B with the same diversity advantage in a dyadic format C=A+2B. The resulting Z4 code achieves the same diversity advantage as the binary code, however, for QPSK transmission.
The present invention considers the design of space-time codes for MIMO block fading channels. The developed baseband design criteria determines the diversity and coding advantage achieved by space-time codes in block fading channels. For BPSK and QPSK modulated codes, the developed binary rank criteria allow for designing space-time codes that exhibit the optimum diversity-vs.- throughput tradeoff. These binary criteria are then utilized to develop general algebraic framework for space-time code design in MIMO block fading channels. The above construct has applicability in a number of communication systems; for example, the space-time codes can be deployed in a wireless communication, as seen in FIG. 5.
FIG. 5 shows a diagram of a wireless communication system that utilizes space-time codes, according to an embodiment of the present invention. In a wireless communication system 500, multiple terminals 501 and 503 communicate over a wireless network 505. Terminal 501 is equipped with a space-time encoder 203 (as shown in FIG. 2) that generates space-time codes with a block fading generalized stacking construction. Terminal 501 also includes multiple transmit antennas 207 (as shown in FIG. 2). In this example, each of the terminals 501 and 503 are configured to encode and decode the space-time codes; accordingly, both of the terminals 501 and 503 possess the transmitter 200 and receiver 300. However, it is recognized that each of the terminals 501 and 503 may alternatively be configured as a transmitting unit or a receiving unit, depending on the application. For example, in a broadcast application, terminal 501 may be used as a head-end to transmit signals to multiple receiving terminals (in which only receiving terminal 503 is shown). Consequently, terminal 503 would only be equipped with a receiver 300. The space-time code construction of the present invention advantageously permits use of a smaller number of receive antennas than that of the transmitting terminal 501, thereby resulting in hardware cost reduction. In an exemplary embodiment, a terminal that is designated as a receiving unit may possess a smaller quantity of antennas that of the transmitting unit.
FIG. 6 shows a diagram of a computer system that can perform the processes of encoding and decoding of space-time codes, in accordance with an embodiment of the present invention. Computer system 601 includes a bus 603 or other communication mechanism for communicating information, and a processor 605 coupled with bus 603 for processing the information. Computer system 601 also includes a main memory 607, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 603 for storing information and instructions to be executed by processor 605. In addition, main memory 607 may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 605. Computer system 601 further includes a read only memory (ROM) 609 or other static storage device coupled to bus 603 for storing static information and instructions for processor 605. A storage device 611, such as a magnetic disk or optical disk, is provided and coupled to bus 603 for storing information and instructions.
Computer system 601 may be coupled via bus 603 to a display 613, such as a cathode ray tube (CRT), for displaying information to a computer user. An input device 615, including alphanumeric and other keys, is coupled to bus 603 for communicating information and command selections to processor 605. Another type of user input device is cursor control 617, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 605 and for controlling cursor movement on display 613.
According to one embodiment, channel code generation within system 100 is provided by computer system 601 in response to processor 605 executing one or more sequences of one or more instructions contained in main memory 607. Such instructions may be read into main memory 607 from another computer-readable medium, such as storage device 611. Execution of the sequences of instructions contained in main memory 607 causes processor 605 to perform the process steps described herein. One or more processors in a multi-processing arrangement may also be employed to execute the sequences of instructions contained in main memory 607. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions. Thus, embodiments are not limited to any specific combination of hardware circuitry and software.
Further, the instructions to support the generation of space-time codes of system 100 may reside on a computer-readable medium. The term “computer-readable medium” as used herein refers to any medium that participates in providing instructions to processor 605 for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 611. Volatile media includes dynamic memory, such as main memory 607. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 603. Transmission media can also take the form of acoustic or light waves, such as those generated during radio wave and infrared data communication.
Common forms of computer-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punch cards, paper tape, any other physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.
Various forms of computer readable media may be involved in carrying one or more sequences of one or more instructions to processor 605 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions relating to encoding and decoding of space-time codes used in system 100 remotely into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 601 can receive the data on the telephone line and use an infrared transmitter to convert the data to an infrared signal. An infrared detector coupled to bus 603 can receive the data carried in the infrared signal and place the data on bus 603. Bus 603 carries the data to main memory 607, from which processor 605 retrieves and executes the instructions. The instructions received by main memory 607 may optionally be stored on storage device 611 either before or after execution by processor 605.
Computer system 601 also includes a communication interface 619 coupled to bus 603. Communication interface 619 provides a two-way data communication coupling to a network link 621 that is connected to a local network 623. For example, communication interface 619 may be a network interface card to attach to any packet switched local area network (LAN). As another example, communication interface 619 may be an asymmetrical digital subscriber line (ADSL) card, an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line. Wireless links may also be implemented. In any such implementation, communication interface 619 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
Network link 621 typically provides data communication through one or more networks to other data devices. For example, network link 621 may provide a connection through local network 623 to a host computer 625 or to data equipment operated by a service provider, which provides data communication services through a communication network 627 (e.g., the Internet). LAN 623 and network 627 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 621 and through communication interface 619, which carry the digital data to and from computer system 601, are exemplary forms of carrier waves transporting the information. Computer system 601 can transmit notifications and receive data, including program code, through the network(s), network link 621 and communication interface 619.
The techniques described herein provide several advantages over prior approaches to providing space-time codes for MIMO block fading channels. Such code construction enhances spatial and temporal diversity without sacrificing transmission rate.
Obviously, numerous modifications and variations of the present invention are possible in light of the above teachings. It is therefore to be understood that within the scope of the appended claims, the invention may be practiced otherwise than as specifically described herein.
REFERENCES
[1] V. Tarokh, N. Seshadri, and A. R. Calderbank. Space-time codes for high data rate wireless communication: Performance criterion and code construction. IEEE Trans. Info. Theory, IT-44:774–765, March 1998.
[2] J.-C. Guey, M. R. Bell M. P. Fitz, and W.-Y. Kuo. Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels. IEEE Vehicular Technology Conference, pages 136–140, Atlanta, 1996.
[3] E. Biglieri, G. Caire, and G. Taricco. Limiting performance for block-fading channels with multiple antennas, submitted to IEEE Trans. Info. Theory, September 1999.

## Claims

1. A method for generating space-time codes, the method comprising:
computing a baseband design criteria for determining a diversity advantage and a coding advantage achieved over block fading channels;
translating the baseband design criteria into a binary rank criteria for modulated codes corresponding to the space-time codes; and
outputting the space-time codes according an algebraic framework derived from the binary rank criteria, wherein the binary rank criteria specifies that for every non-zero code word c∈C,





  
    
      
        ∑
        
          m
          =
          1
        
        M
      
      ⁢
      
        rank
        ⁡
        
          (
          
            c
            ⁡
            
              [
              m
              ]
            
          
          )
        
      
    
    ≥
    d
  
  ,



 the rank is over a binary field F and d is the largest possible integer, the space-time code C achieving a diversity level of at least dLn Lr being the number of the plurality of receive antennas, m representing the number of blocks per code word.

2. A method according to claim 1, wherein the transmit diversity advantage is as follows:




  
    d
    m
  
  =
  
    
      ∑
      
        m
        =
        1
      
      M
    
    ⁢
    
      rank
      ⁡
      
        (
        
          
            f
            ⁡
            
              (
              
                c
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
          -
          
            f
            ⁡
            
              (
              
                e
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
        
        )
      
    
  




over all pairs of distinct code words c, e∈C, m representing a fading block.

3. A method according to claim 1, wherein the coding advantage is as follows:




  μ
  =
  
    
      (
      
        
          ∏
          
            m
            =
            1
          
          M
        
        ⁢
        
          
            
              λ
              1
            
            ⁡
            
              [
              m
              ]
            
          
          ⁢
          
            
              λ
              2
            
            ⁡
            
              [
              m
              ]
            
          
          ⁢
          
            
          
          ⁢
          ⋯
          ⁢
          
            
          
          ⁢
          
            
              λ
              
                d
                m
              
            
            ⁡
            
              [
              m
              ]
            
          
        
      
      )
    
    
      1
      /
      d
    
  




over all pairs of distinct code words c, e∈C, m representing a fading block, λ1[m]λ2[m] . . . λdm[m] being nonzero elgenvalues of


(f(c[m])−f(e[m]))(f(c[m])−(e[m]))H.

4. A method according to claim 1, wherein the algebraic framework specifies C as a linear Lt×n space-time code, the space-time code being of dimension k including code word matrices,




  c
  =
  
    [
    
      
        
          
            
              x
              _
            
            ⁢
            
              M
              1
            
          
        
      
      
        
          
            
              x
              _
            
            ⁢
            
              M
              2
            
          
        
      
      
        
          ⋮
        
      
      
        
          
            
              x
              _
            
            ⁢
            
              M
              
                L
                t
              
            
          
        
      
    
    ]
  




wherein x denotes an arbitrary k-tuple of information bits and n≧Lt, M1, M2, . . . , MLt are binary matrices of dimension k×n, n≦k, and Lt represents the number of transmit antennas in the communication system.

5. A method according to claim 4, wherein M1, M2, . . . , MLt has the following property,


∀a1, a2, . . . , aLt∈F:



M=a1M1⊕a2M2⊕ . . . ⊕aLtMLt 


is of full rank k unless a1=a2= . . . =aLt=0.

6. A method for generating space-time codes, the method comprising:
computing a baseband design criteria for determining a diversity advantage and a coding advantage achieved over block fading channels;
translating the baseband design criteria into a binary rank criteria for modulated codes corresponding to the space-time codes; and
outputting the space-time codes according an algebraic framework derived from the binary rank criteria,
wherein the binary rank criteria specifies for every non-zero code word c∈C, at least one of





  
    
      
        ∑
        
          m
          =
          1
        
        M
      
      ⁢
      
        
      
      ⁢
      
        rank
        ⁢
        
          {
          
            Ξ
            ⁡
            
              (
              
                c
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
          }
        
      
    
    ≥
    d
  
  ,
  
    
      and
      ⁢
      
        
      
      ⁢
      
        
          ∑
          
            m
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          rank
          ⁢
          
            {
            
              Ψ
              ⁡
              
                (
                
                  c
                  ⁡
                  
                    [
                    m
                    ]
                  
                
                )
              
            
            }
          
        
      
    
    ≥
    d
  



 holds true, wherein the rank is over a binary field and d is the largest possible integer, Ξ being a row-based indicant projection, Ψ being a column-based indicant projection, the space-time code C achieving a diversity level of at least dLn Lr being the number of the plurality of receive antennas, m representing the number of blocks per code word.

7. An apparatus for generating space-time codes, the apparatus comprising:
means for computing a baseband design criteria for determining a diversity advantage and a coding advantage achieved over block fading channels;
means for translating the baseband design criteria into a binary rank criteria for modulated codes corresponding to the space-time codes; and
means for outputting the space-time codes according an algebraic framework derived from the binary rank criteria, wherein the binary rank criteria specifies that for every non-zero code word c∈C,





  
    
      
        ∑
        
          m
          =
          1
        
        M
      
      ⁢
      
        rank
        ⁡
        
          (
          
            c
            ⁡
            
              [
              m
              ]
            
          
          )
        
      
    
    ≥
    d
  
  ,



 the rank is over a binary field F and d is the largest possible integer, the space-time code C achieving a diversity level of at least dLn Lr being the number of the plurality of receive antennas, m representing the number of blocks per code word.

8. An apparatus according to claim 7, wherein the transmit diversity advantage is as follows:




  
    d
    m
  
  =
  
    
      ∑
      
        m
        =
        1
      
      M
    
    ⁢
    
      rank
      ⁡
      
        (
        
          
            f
            ⁡
            
              (
              
                c
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
          -
          
            f
            ⁡
            
              (
              
                e
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
        
        )
      
    
  



 over all pairs of distinct code words c, e∈C, m representing a fading block.

9. An apparatus according to claim 7, wherein the coding advantage is as follows:




  μ
  =
  
    
      (
      
        
          ∏
          
            m
            =
            1
          
          M
        
        ⁢
        
          
            
              λ
              1
            
            ⁡
            
              [
              m
              ]
            
          
          ⁢
          
            
              λ
              2
            
            ⁡
            
              [
              m
              ]
            
          
          ⁢
          
            
          
          ⁢
          ⋯
          ⁢
          
            
          
          ⁢
          
            
              λ
              
                d
                m
              
            
            ⁡
            
              [
              m
              ]
            
          
        
      
      )
    
    
      1
      /
      d
    
  




over all pairs of distinct code words c, e∈C, m representing a fading block, λ1[m]λ2[m] . . . λdm[m] being nonzero eigenvalues of


(f(c[m])−f(e[m]))(f(c[m])−f(e[m]))H.

10. An apparatus according to claim 7, wherein the algebraic framework specifies C as a linear Lt×n space-time code, the space-time code being of dimension k including code word matrices,




  c
  =
  
    [
    
      
        
          
            
              x
              _
            
            ⁢
            
              M
              1
            
          
        
      
      
        
          
            
              x
              _
            
            ⁢
            
              M
              2
            
          
        
      
      
        
          ⋮
        
      
      
        
          
            
              x
              _
            
            ⁢
            
              M
              
                L
                t
              
            
          
        
      
    
    ]
  




wherein x denotes an arbitrary k-tuple of information bits and n≧Lt, M1, M2, . . . , MLt are binary matrices of dimension k×n, n≦k, and Lt represents the number of transmit antennas in the communication system.

11. An apparatus according to claim 10, wherein M1, M2, . . . , MLt has the following property,


∀a1, a2, . . . , aLt∈F:



M=a1M1⊕a2M2⊕ . . . ⊕aLtMLt 


is of full rank k unless a1=a2= . . . =aLt=0.
3

12. An apparatus according to claim 7, wherein the binary rank criteria specifies for every non-zero code word c∈C, at least one of




  
    
      
        ∑
        
          m
          =
          1
        
        M
      
      ⁢
      
        
      
      ⁢
      
        rank
        ⁢
        
          {
          
            Ξ
            ⁡
            
              (
              
                c
                ⁡
                
                  [
                  m
                  ]
                
              
              )
            
          
          }
        
      
    
    ≥
    d
  
  ,
  
    
      and
      ⁢
      
        
      
      ⁢
      
        
          ∑
          
            m
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          rank
          ⁢
          
            {
            
              Ψ
              ⁡
              
                (
                
                  c
                  ⁡
                  
                    [
                    m
                    ]
                  
                
                )
              
            
            }
          
        
      
    
    ≥
    d
  




holds true, wherein the rank is over a binary field and d is the largest possible integer, Ξ being a row-based indicant projection, Ψ being a column-based indicant projection, the space-time code C achieving a diversity level of at least dLn Lr being the number of the plurality of receive antennas, m representing the number of blocks per code word.

13. A method for communicating over a communication system, the method comprising:
generating a code word in response to an input message, the code word being based upon a stacking construction generalized for a multi-input multi-output (MIMO) block fading channel, wherein the generalized stacking construction specifies C as a linear Lt×n space-time code, the space-time code being of dimension k including code word matrices,





  c
  =
  
    [
    
      
        
          
            
              x
              _
            
            ⁢
            
              M
              1
            
          
        
      
      
        
          
            
              x
              _
            
            ⁢
            
              M
              2
            
          
        
      
      
        
          ⋮
        
      
      
        
          
            
              x
              _
            
            ⁢
            
              M
              
                L
                t
              
            
          
        
      
    
    ]
  



 wherein x denotes an arbitrary k-tuple of information bits and n≧Lt, M1, M2, . . . , MLt are binary matrices of dimension k×n, n≦k, and Lt represents the number of transmit antennas in the communication system; and
transmitting the code word over a plurality of transmit antennas to a receiver configured to decode the code word using maximum likelihood decoding, wherein the receiver includes a plurality of receive antennas.

14. A method according to claim 13, further comprising:
modulating the code word based on either BPSK (binary phase-shift keying) modulation or QPSK (quadrature phase-shift keying) modulation.

15. A method according to claim 13, wherein the number of receive antennas is less than the number of transmit antennas.