# Patent

## Title
Method and system for utilizing space-time and space-frequency codes for multi-input multi-output frequency selective 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 outputs a message signal. The transmitter also includes an encoder that generates a code word in response to the message signal. The code word has a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel, wherein the code word achieves a diversity based upon the number of transmit antennas and the number of ISI paths. Further, the transmitter includes a modulator that modulates the code word for transmission over the communication channel, and multiple antennas that transmit the modulated code word over the communication channel. The system encompasses a receiver that receives the transmitted code word via a number of receive antennas.

## Background
CROSS-REFERENCES TO RELATED APPLICATION
This application is related to, and claims the benefit of the earlier filing date of U.S. Provisional Patent Application 60/246,024, filed Nov. 6, 2000, entitled “Method and Constructions for Space-Time and Space-Frequency Codes for Multi-Input Multi-Output Frequency Selective 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 that exploit multiple forms of 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.
Notably, information theoretic studies have shown that spatial diversity provided by multiple transmit and/or receive antennas allows for a significant increase in the capacity of wireless communication systems operated in a flat Rayleigh fading environment [1] [2]. Following this observation, various approaches for exploiting this spatial diversity have been proposed. In one approach, channel coding is performed across the spatial dimension as well as time to benefit from the spatial diversity provided by using multiple transmit antennas [3]. Tarokh et al. coined the term “space-time coding” for this scheme. One potential drawback of this scheme is that the complexity of the maximum likelihood (ML) decoder is exponential in the number of transmit antennas. Another approach, as proposed by Foshini [5], relies upon arranging the transmitted data stream into multiple independent layers and sub-optimal signal processing techniques at the receiver to achieve performance that is asymptotically close to the outage capacity with reasonable complexity. In this approach, no effort is made to optimize the channel coding scheme.
Conventional approaches to space-time coding design have focused primarily on the flat fading channel model. With respect to the treatment of multi-input multi-output (MIMO) frequency selective channels, one approach contends the that space-time codes that are designed to achieve a certain diversity order in flat fading channels achieve at least the same diversity order in frequency selective fading channels. Such an approach fails to exploit the spatial and frequency diversity available in the channel.
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) selective 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. 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 that exploit the multipath nature of the communication channel, which exhibits characteristics of a multi-input multi-output (MIMO) selective block fading channel. The code have a construction that defines a intersymbol interference (ISI) paths in the communication channel, wherein the code achieves a diversity based upon the number of transmit antennas and the number of ISI paths.
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. Additionally, the method includes generating a code word in response to the message signal for transmission over the communication channel via a plurality of transmit antennas. The code word has a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel, wherein the code word achieves a diversity that is based upon the number of transmit antennas and the number of ISI paths. 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 includes a source that is configured to output a message signal. The apparatus also includes an encoder that is configured to generate code word in response to the message signal for transmission over the communication channel via a plurality of transmit antennas. The code word has a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel. The code word achieves a diversity that is based upon the number of transmit antennas and the number of ISI paths. 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. Additionally, the apparatus includes means for generating a code word in response to the message signal for transmission over the communication channel via a plurality of transmit antennas. The code word has a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel, wherein the code word achieves a diversity that is based upon the number of transmit antennas and the number of ISI paths. 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. The transmitter also includes an encoder that is configured to generate a code word in response to the message signal. Further, the transmitter includes a modulator that is configured to modulate the code word for transmission over the communication channel, and a plurality of transmit antennas that are configured to transmit the modulated code word over the communication channel. The code word has a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel, wherein the code word achieves a diversity based upon the number of transmit antennas and the number of ISI paths. The system encompasses a receiver that includes a plurality of receive antennas, in which the receiver is configured to receive the transmitted code word via a 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 message signal. The code word being generated for transmission over the communication channel via a plurality of transmit antennas, wherein the code word has a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel. The code word achieves a diversity based upon the number of transmit antennas and the number of ISI paths. 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 for transmission over the communication channel via a plurality of transmit antennas. The code word has a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel, wherein the code word achieves a diversity that is based upon the number of transmit antennas and the number of ISI paths. This approach advantageously maximizes the diversity in the communication channel.
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. The code word has a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel. The code word achieves a diversity that is based upon the number of transmit antennas and the number of ISI paths. 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;
FIGS. 3A and 3B are diagrams of receivers that employ space-time codes and space-frequency codes, respectively, according to various embodiments of the present invention;
FIGS. 4A–4G are graphs of simulation results of the space-time codes and space-frequency codes, according to the embodiments of the present invention;
FIG. 5 is a diagram of a wireless communication system that is capable of employing the space-time codes and space-frequency codes, according to embodiments 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 and space-frequency, in accordance with embodiments 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 Binary Phase-Shift Keying (BPSK) and Quadrature Phase-Shift Keying (QPSK) modulation, the present invention has applicability to other modulation schemes.
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. One phenomena of interest is Intersymbol Interference (ISI), in which the channel 103 causes the overlap of signal pulses, resulting in the lost of signal orthogonality. As described with respect to the construction of space-frequency codes, the channel ISI characteristics are minimized. It is evident that 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. To minimize the impact of the communication channel 103 on the transmission signals, channel coding is utilized. An algebraic design framework for layered and non-layered space-time codes in flat fading channels are in the following: A. R. Hammons Jr. and H. El Gamal. “On the theory of space-time codes for PSK modulation,” IEEE Trans. Info. Theory, March 2000; and H. El Gamal and A. R. Hammons Jr. “The layered space-time architecture: a new prospective,” IEEE Trans. Info. Theory, 1999; each of which is incorporated herein by reference in its entirety.
Based upon the algebraic design framework for space-time coding in flat fading channels in “On the Theory of Space-Time Codes for PSK Modulation,” A. R. Hammons Jr. and H. El Gamal, IEEE Trans. Info. Theory, March 2000, the present invention extends this framework to design algebraic codes for multi-input multi-output (MIMO) frequency selective fading channels. The codes, according to the present invention, optimally exploit both the spatial and frequency diversity available in the channel. Two design approaches with different complexity-versus-diversity advantage trade-offs are considered. The first approach (referred to as “single carrier time domain design” approach or STC (space-time coding)), which is more fully described below in FIG. 3A, uses space-time coding and maximum likelihood (ML) decoding to exploit the multipath nature of the channel. The second approach utilizes an orthogonal frequency division multiplexing (OFDM) technique to transform the multi-path channel into a block fading channel (referred to as “OFDM based design” approach or SFC (space-frequency coding)); this approach is detailed in the discussion of FIG. 3B. The new algebraic framework, according to one embodiment of the present invention, is then used to construct space-frequency codes that optimally exploit the diversity available in the resulting block fading channel.
The two approaches, according to the present invention, differ in terms of decoder complexity, maximum achievable diversity advantage, and simulated frame error rate performance. The first approach requires relatively greater complexity at the receiver 105 over the second approach, in that the first approach combines algebraic space-time coding with maximum likelihood decoding to achieve the maximum possible diversity advantage in MIMO frequency selective channels to achieve the diversity advantage. As a result, this first approach has a relatively large trellis complexity, as required by the maximum likelihood receiver 105. The second approach utilizes an orthogonal frequency division multiplexing (OFDM) front-end to transform an intersymbol-interference (ISI) fading channel into a flat block fading channel.
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 is equipped with a channel encoder 203 that accepts input from an information source 201 and outputs coded stream of higher redundancy suitable for error correction processing at the receiver 105 (FIG. 1). The information source 201 generates k signals from a discrete alphabet, X′. Encoder 203 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. Accordingly, the encoded messages are modulated and distributed among the Lt antennas 207. The transmissions from each of the Lt transmit antennas 207 are simultaneous and synchronous.
FIG. 3A 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. The signal received at each antenna 303 is therefore a superposition of the L, transmitted signals corrupted by additive white Gaussian noise (AWGN) and the multiplicative intersymbol interference (ISI) fading. 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.
At the receiver 300, the signal rij received by antenna j at time t is given by 



  
    r
    t
    j
  
  =
  
    
      
        
          E
          s
        
      
      ⁢
      
        
          ∑
          
            l
            =
            0
          
          
            
              L
              
                I
                ⁢
                
                  
                
                ⁢
                S
                ⁢
                
                  
                
                ⁢
                I
              
            
            -
            1
          
        
        ⁢
        
          
            ∑
            
              i
              =
              1
            
            
              L
              t
            
          
          ⁢
          
            
              α
              l
              
                i
                ⁢
                
                  
                
                ⁢
                j
              
            
            ⁢
            
              s
              
                t
                -
                1
              
              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 to receive antenna j for the lth path; LISI is the length of the channel impulse response; sti is the symbol transmitted 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 circularly symmetric zero-mean complex Gaussian random variable with variance N0/2 per dimension. The different path gains αtij are assumed to be statistically independent.

A space-time code is defined to include an underlying error control code together with a spatial parsing formatter. Specifically, an Lt×l space-time code C of size M has an (Ltl, M) error control code C and a spatial parser σ that maps each code word vector {overscore (c)} ε C to an Lt×l matrix C whose entries are a rearrangement of those of {overscore (c)}. The space-time code C is said to be linear if both C and σ are linear.
It is assumed that the standard parser maps

{overscore (c)}=(c1(1), c1(2), . . . , c1(Lt), c2(2), . . . , c2(Lt), . . . , cl(1), cl(2), . . . , cl(Lt))ε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
            
          
        
      
    
    ]
  




The baseband code word f(c) is obtained by applying the modulation operator f on the components of c. This modulation operator maps the entries of c into constellation points from the discrete complex-valued signaling constellation Ω for transmission across the channel. In this notation, it is understood that ct(i) is the code symbol assigned to transmit antenna i at time t and st(i)=f(ct(i)).

The diversity advantage of a space-time code is defined as the minimum absolute value of the slope of any pairwise probability of error versus signal-to-noise ratio curve on a log-log scale. To maximize the spatial diversity advantage provided by the multiple transmit antenna in quasi-static flat fading MIMO channels, the following rank criterion is utilized [3][4]: for the baseband rank criterion, d=rank(f(c)−f(e)) is maximized over all pairs of distinct code words c, e ε C. Therefore fall spatial transmit diversity is achieved if and only if rank(f(c)−f(e))=Lt for all pairs of distinct code words c, e ε C. It should be noted that in the presence of Lr receive antennas 303, the total diversity advantage achieved by this code is LtLr.
Space-time code constructions for frequency selective fading channels is based on the concept that in an ISI (intersymbol interference) environment with LISI paths, a space-time system with Lt transmit antennas 207 is equivalent to a space-time system operating in flat fading channel with LtLISI transmit antenna 207. However, in this equivalent model the code word matrices are restricted to have a certain special structure. This structure is captured in the following definition for the baseband code word matrix in ISI environments: 



  
    
      f
      ⁡
      
        (
        c
        )
      
    
    
      I
      ⁢
      
        
      
      ⁢
      S
      ⁢
      
        
      
      ⁢
      I
    
  
  =
  
    [
    
      
        
          
            f
            ⁡
            
              (
              c
              )
            
          
        
        
          
            0
            _
          
        
        
          ...
        
        
          
            0
            _
          
        
      
      
        
          
            0
            _
          
        
        
          
            f
            ⁡
            
              (
              c
              )
            
          
        
        
          ...
        
        
          
            0
            _
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋰
        
        
          ⋮
        
      
      
        
          
            0
            _
          
        
        
          
            0
            _
          
        
        
          ...
        
        
          
            f
            ⁡
            
              (
              c
              )
            
          
        
      
    
    ]
  




where c is the code word matrix as defined in (2) below, and 0 is the Lt×1 all zero vector. From the equivalent model, it is clear that in the frequency selective fading channels, space-time codes can be constructed to achieve LtLISI transmit diversity order. Therefore, the following baseband design criterion for space-time codes in the ISI channel is established: for ISI baseband rank criterion, d=rank(fISI(c)−fISI(e)) is maximized over all pairs of distinct code words c, e ε C. Full transmit diversity in this scenario is equal to LtLISI, and is achieved if and only if rank(fISI(c)−fISI(e))=LtLISI for all pairs of distinct code words c, e ε C.

Next, the binary rank criteria is developed; this criteria facilitate the construction of algebraic space-time codes for BPSK (Binary Phase-Shift Keying) and QPSK (Quadrature Phase-Shift Keying) modulated systems with an arbitrary number of transmit antennas 207 and channel impulse response lengths. A new code word matrix cISI that captures the nature of the ISI channel is defined as follows: 



  
    c
    
      I
      ⁢
      
        
      
      ⁢
      S
      ⁢
      
        
      
      ⁢
      I
    
  
  =
  
    [
    
      
        
          c
        
        
          
            0
            _
          
        
        
          ...
        
        
          0
        
      
      
        
          0
        
        
          c
        
        
          ...
        
        
          0
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋰
        
        
          ⋮
        
      
      
        
          0
        
        
          0
        
        
          ...
        
        
          c
        
      
    
    ]
  




It is first observed that in general

f(cISI)≠f(c)ISI,  (2)

since

f(0)≠0

However, it is noted the diversity advantage only depends on differences between code words rather than the code words themselves, and thus

f(cISI)−f(eISI)=f(c)ISI−f(e)ISI

for any signaling constellation. The previous result is the key to the algebraic space-time constructions developed in this section.

Attention is now turned to the development of BPSK modulated codes, which may be utilized in the communication system 100 of FIG. 1. For BPSK modulation, elements in c are drawn from the field F={0, 1} of integers modulo 2. The modulation operator/maps the symbol ct(i)ε F to the constellation point st(i)=f(ct(i))ε{−1,1} according to the rule f(ct(i))=(−1)ct(i). The binary rank criterion for full diversity space-time codes in ISI channels can thus be stated as follows.
With respect to the ISI channel binary rank criterion, it is assumed that C is a linear Lt×l space-time code with underlying binary code C of length N=Ltl operating in an ISI channel with LISI paths, where l≦LtLISI. Also, assuming that every non-zero code word c corresponds to a matrix cISI of full rank LtLISI over the binary field F, then, for BPSK transmission over the frequency selective quasi-static fading channel 103, the space-time code C achieves full transmit diversity LtLISI.
While the previous result was stated for full transmit diversity codes, it readily generalizes to any order of transmit diversity less than or equal to LtLISI. The ISI channel binary rank criterion permits the use of a stacking construction that establishes an algebraic framework for the design of algebraic space-time codes for MIMO ISI fading channels. According to an embodiment of the present invention, the ISI channel stacking construction, M1, M2, . . . , MLt are binary matrices of dimension k×l,l≧k, and C is the Lt×l space-time code of dimension k including 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<l. The following is denoted

Mn,m=└OLt×(m−1)MnOLt×(LISI+1−m)┘,

where OLt33 (m−1) is the Lt×(m−1) all zero matrix. Hence, C satisfies the ISI channel binary rank criterion, and accordingly, for BPSK transmission over the quasi-static fading channel, achieves full transmit diversity LtLISI, if and only if M1,1, M2,1, . . . , MLtLISI have the property that ∀a1, a2, . . . , aLtε F:

M=a1M1,1⊕a2M2,1⊕ . . . ⊕aLtLISIMLtLISI is of full rank k unless a1= . . . aLtLISI=0. It is noted that 



  
    c
    
      I
      ⁢
      
        
      
      ⁢
      S
      ⁢
      
        
      
      ⁢
      I
    
  
  =
  
    
      [
      
        
          
            
              
                x
                _
              
              ⁢
              
                
              
              ⁢
              
                M
                
                  1
                  ,
                  1
                
              
            
          
        
        
          
            
              
                x
                _
              
              ⁢
              
                
              
              ⁢
              
                M
                
                  1
                  ,
                  2
                
              
            
          
        
        
          
            ⋮
          
        
        
          
            
              
                x
                _
              
              ⁢
              
                
              
              ⁢
              
                M
                
                  
                    L
                    t
                  
                  ,
                  
                    L
                    
                      I
                      ⁢
                      
                        
                      
                      ⁢
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      I
                    
                  
                
              
            
          
        
      
      ]
    
    .
  




The stacking construction is general and applies to block codes as well as trellis codes. An important example of the stacking construction is given by the class of binary convolutional codes. This class is important because it allows for a reasonable complexity maximum likelihood decoder. Let C be the binary, rate l/Lt, convolutional code having transfer function matrix [6]

G(D)=└g1(D),g2(D), . . . ,gLt,1(D), . . . ,gLt,LISI(D)┘,

then the natural space-time code C associated with C is defined to include the code word matrices c(D)=GT(D)x(D), where the polynomial x(D) represents the input information bit stream. In other words, for the natural space-time code, the natural transmission format is adopted, in which the output coded bits generated by gi(D) are transmitted via antenna i. It is assumed the trellis codes are terminated by tail bits [3]. Thus, if x(D) is restricted to a block of N information bits, then C is an Lt×(N+v) space-time code, where v=max1≦i≦Lt {deg gi(x)} is the maximal memory order of the convolutional code C. The following is denoted

GISI(D)=[g1,1(D), g2,1(D), . . . ,gLt,LISI(D)]

where gn.m=D(m−1)gn. The following characterizes the result of the performance of natural space-time convolutional codes in ISI channels.

The natural space-time code C associated with the rate 1/Lt convolutional code C satisfies the binary rank criterion, and thus achieves full transmit diversity for BPSK transmission in an ISI channel with LISI paths, if and only if the transfer function matrix GISI(D) of C has full rank LtLISI as a matrix of coefficients over F. This result stems from the observation that 



  
    
      ∑
      
        
          1
          ≤
          i
          ≤
          
            L
            t
          
        
        ,
        
          1
          ≤
          j
          ≤
          
            L
            
              I
              ⁢
              
                
              
              ⁢
              S
              ⁢
              
                
              
              ⁢
              I
            
          
        
      
    
    ⁢
    
      
        a
        
          i
          ,
          j
        
      
      ⁢
      
        
          g
          
            i
            ,
            j
          
        
        ⁢
        
          (
          D
          )
        
      
      ⁢
      
        x
        ⁢
        
          (
          D
          )
        
      
    
  
  =
  0




for some x(D)≠0 iff 



  
    
      ∑
      
        
          1
          ≤
          i
          ≤
          
            L
            t
          
        
        ,
        
          1
          ≤
          j
          ≤
          
            L
            
              I
              ⁢
              
                
              
              ⁢
              S
              ⁢
              
                
              
              ⁢
              I
            
          
        
      
    
    ⁢
    
      
        a
        
          i
          ,
          j
        
      
      ⁢
      
        
          g
          
            i
            ,
            j
          
        
        ⁢
        
          (
          D
          )
        
      
    
  
  =
  0.




This observation readily generalizes to recursive convolutional codes.

The above result extends to convolutional codes with arbitrary rates and arbitrary diversity orders. Since the coefficients of GISI(D) form a binary matrix of dimension LtLISI×(v+LISI), and the column rank must be equal to the row rank, the result provides a simple bound as to how complex the convolutional code must be in order to satisfy the full diversity ISI channel binary rank criterion.
The maximum diversity order achieved by a space-time code based on an underlying rate 1/Lt convolutional code C with a maximal memory order v in a LISI paths ISI channel is v+LISI. This bound shows that, for a fixed trellis complexity, increasing the number of antennas beyond 



  
    L
    t
  
  =
  
    
      v
      +
      
        L
        
          I
          ⁢
          
            
          
          ⁢
          S
          ⁢
          
            
          
          ⁢
          I
        
      
    
    
      L
      
        I
        ⁢
        
          
        
        ⁢
        S
        ⁢
        
          
        
        ⁢
        I
      
    
  




will not result in an increase in the diversity advantage. This fact is supported by the results in Table 1, below, which lists the diversity advantage for BPSK algebraic space-time codes with optimal free distance for MIMO frequency selective fading channels:














TABLE 1








d for
d for
d for
d for


Lt
ν
Connection Polynomials
LISI = 1
LISI = 2
LISI = 3
LISI = 4





















2
2
5, 7
2
4
5
6



3
64, 74
2
4
6
7



4
46, 72
2
4
6
8



5
65, 57
2
4
6
8



6
554, 744
2
4
6
8


3
3
54, 64, 74
3
5
6
7



4
52, 66, 76
3
6
7
8



5
47, 53, 75
3
6
8
9



6
554, 624, 764
3
6
9
10


4
4
52, 56, 66, 76
4
6
7
8



5
53, 67, 71, 75
4
7
8
9


5
5
75, 71, 73, 65, 57
5
7
8
9









Because the number of paths is not known a priori at the transmitter 200, it is desirable to construct space-time codes that achieve the maximum diversity order for arbitrary numbers of paths. This leads to the notion of universal space-time codes that combine the maximum spatial diversity with the ISI channel frequency diversity whenever available. Within the class of universal space-time codes with maximum diversity advantage, it is ideal to select the code with the maximum product distance, which measures the asymptotic coding achieved by the code [3] [4].
Although BSPK modulation is discussed, it is recognized that the extension to QPSK modulation can be readily made. The ISI binary rank criterion and stacking construction for BPSK modulation can be generalized to obtain similar results for QPSK modulation. As a consequence of the QPSK ISI binary rank criterion and stacking construction, it is observed that the binary connection polynomials of Table 1 can be used to generate linear, Z4-valued, rate 1/Lt convolutional codes whose natural space-time formatting achieves full spatial diversity LtLISI for QPSK modulation. More generally, any set of Z4-valued connection polynomials with modulo 2 projections (shown Table 1) may be used. In most cases under consideration, the best performance was obtained from the lifted Z4 codes constructed by replacing the zero coefficients by twos. This lifting produces the codes in Table 2, which lists Z4 space-time codes for QPSK modulation in MIMO frequency selective fading channels.











TABLE 2







Lt
ν
Connection Polynomials









2
1
1 + 2D, 2 + D




2
1 + 2D + D2, 1 + D + D2




3
1 + D + 2D2 + D3, 1 + D + D2 + D3




4
1 + 2D + 2D2 + D3 + D4, 1 + D + D2 +





2D3 + D4




5
1 + D + 2D2 + D3 + 2D4 + D5, 1 + 2D +





D2 + D3 + D4 + D5



3
2
1 + 2D + 2D2, 2 + D + 2D2, 1 + D + 2D2




3
1 + D + 2D2 + D3, 1 + D + 2D2 + D3,





1 + D + D2 + D3




4
1 + 2D + D2 + 2D3 + D4, 1 + D + 2D2 +





D3 + D4, 1 + D + D2 + D3 + D4




5
1 + 2D + 2D2 + D3 + D4 + D5, 1 + 2D +





D2 + 2D3 + D4 + D5, 1 + D + D2 +





D3 + 2D4 + D5



4
3
1 + 2D + 2D2 + 2D3, 2 + D + 2D2 + 2D3, 2 +





2D + D2 + 2D3, 2 + 2D + 2D2 + D3




4
1 + 2D + D2 + 2D3 + D4, 1 + D + 2D2 + D3 +





D4, 1 + D + 2D2 + D3 + D4, 1 + D + D2 +





D3 + D4




5
1 + 2D + D2 + 2D3 + D4 + D5, 1 + D + 2D2 +





D3 + D4 + D5, 1 + D + D2 + 2D3 + 2D4 +





D5, 1 + D + D2 + D3 + 2D4 + D5



5
4
1 + 2D + 2D2 + 2D3 + 2D4, 2 + D + 2D2 +





2D3 + 2D4, 2 + 2D + D2 + 2D3 + 2D4,





2 + 2D + 2D2 + D3 + 2D4, 2 + 2D + 2D2 +





2D3 + D4




5
1 + D + D2 + D3 + 2D4 + D5, 1 + D + D2 +





2D3 + 2D4 + D5, 1 + D + D2 + 2D3 + D4 +





D5, 1 + D + 2D2 + D3 + 2D4 + D5, 1 + 2D +





D2 + D3 + 2D4 + D5










The described single carrier time domain design approach requires the use of a relatively more complex maximum likelihood decoder 305 to account for the multi-input multi-output ISI nature of the channel 103. In an exemplary embodiment, this maximum likelihood decoder 305 can be realized using a Viterbi decoder with trellis complexity proportional to 2(LISI+v) and 4(LISI+v) for BPSK and QPSK modulations, respectively (wherein v is the maximal memory order of the underlying convolutional code).
If receiver complexity presents an issue, which is conceivable in certain applications, then a second design approach may be implemented. Such an approach uses space-frequency codes. In particular, to reduce the complexity of the receiver 300, an OFDM front-end 313 is utilized to transform the ISI channel into a flat, however, selective fading channel. The baseband signal assigned to each antenna 207 is passed through an inverse fast Fourier transform (IFFT) before transmission. The transmitted signal from antenna i at the nth interval is given by 



  
    
      x
      n
      i
    
    =
    
      
        ∑
        
          k
          =
          0
        
        
          N
          -
          1
        
      
      ⁢
      
        
          s
          k
          i
        
        ⁢
        
          exp
          ⁡
          
            (
            
              
                -
                j
              
              ⁢
              
                
              
              ⁢
              
                
                  2
                  ⁢
                  π
                  ⁢
                  
                    
                  
                  ⁢
                  k
                  ⁢
                  
                    
                  
                  ⁢
                  n
                
                N
              
            
            )
          
        
      
    
  
  ,




where N is block length. A cyclic prefix of length LISI−1 is added to eliminate the ISI between consecutive OFDM symbols. At the receiver end, the signal ynj received by antenna j at time t is given by 



  
    
      
        
          y
          n
          j
        
        =
        
        ⁢
        
          
            
              
                E
                s
              
            
            ⁢
            
              
                ∑
                
                  l
                  =
                  0
                
                
                  
                    L
                    
                      I
                      ⁢
                      
                        
                      
                      ⁢
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      I
                    
                  
                  -
                  1
                
              
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  
                    L
                    t
                  
                
                ⁢
                
                  
                    α
                    l
                    
                      i
                      ⁢
                      
                        
                      
                      ⁢
                      j
                    
                  
                  ⁢
                  
                    x
                    
                      t
                      -
                      1
                    
                    j
                  
                
              
            
          
          +
          
            n
            t
            j
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            
              
                E
                s
              
            
            ⁢
            
              
                ∑
                
                  l
                  =
                  0
                
                
                  
                    L
                    
                      I
                      ⁢
                      
                        
                      
                      ⁢
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      I
                    
                  
                  -
                  1
                
              
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  
                    L
                    t
                  
                
                ⁢
                
                  
                    ∑
                    
                      k
                      =
                      0
                    
                    
                      N
                      -
                      1
                    
                  
                  ⁢
                  
                    
                      α
                      l
                      
                        i
                        ⁢
                        
                          
                        
                        ⁢
                        j
                      
                    
                    ⁢
                    
                      s
                      k
                      j
                    
                    ⁢
                    
                      exp
                      ⁡
                      
                        (
                        
                          
                            -
                            j
                          
                          ⁢
                          
                            
                          
                          ⁢
                          
                            
                              2
                              ⁢
                              π
                              ⁢
                              
                                
                              
                              ⁢
                              
                                k
                                ⁡
                                
                                  (
                                  
                                    n
                                    -
                                    1
                                  
                                  )
                                
                              
                            
                            N
                          
                        
                        )
                      
                    
                  
                
              
            
          
          +
          
            n
            t
            j
          
        
      
    
  




The fast Fourier transform (FFT) operator is then applied to the received signal to yield 



  
    
      
        
          r
          t
          j
        
        =
        
        ⁢
        
          
            ∑
            
              n
              =
              0
            
            
              N
              -
              1
            
          
          ⁢
          
            
              y
              k
              j
            
            ⁢
            
              exp
              ⁡
              
                (
                
                  
                    -
                    j
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      2
                      ⁢
                      π
                      ⁢
                      
                        
                      
                      ⁢
                      n
                      ⁢
                      
                        
                      
                      ⁢
                      t
                    
                    N
                  
                
                )
              
            
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            
              ∑
              
                i
                =
                1
              
              
                L
                t
              
            
            ⁢
            
              
                (
                
                  
                    ∑
                    
                      l
                      =
                      0
                    
                    
                      
                        L
                        
                          I
                          ⁢
                          
                            
                          
                          ⁢
                          S
                          ⁢
                          
                            
                          
                          ⁢
                          I
                        
                      
                      -
                      1
                    
                  
                  ⁢
                  
                    
                      α
                      l
                      
                        i
                        ⁢
                        
                          
                        
                        ⁢
                        j
                      
                    
                    ⁢
                    
                      exp
                      ⁡
                      
                        (
                        
                          
                            -
                            j
                          
                          ⁢
                          
                            
                          
                          ⁢
                          
                            
                              2
                              ⁢
                              π
                              ⁢
                              
                                
                              
                              ⁢
                              n
                              ⁢
                              
                                
                              
                              ⁢
                              t
                            
                            N
                          
                        
                        )
                      
                    
                  
                
                )
              
              ⁢
              
                s
                t
                i
              
            
          
          +
          
            N
            t
            j
          
        
      
    
  
  
    
      
        
          =
          
          ⁢
          
            
              
                ∑
                
                  i
                  =
                  1
                
                
                  L
                  i
                
              
              ⁢
              
                
                  H
                  t
                  
                    (
                    
                      i
                      ⁢
                      
                        
                      
                      ⁢
                      j
                    
                    )
                  
                
                ⁢
                
                  s
                  t
                  i
                
              
            
            +
            
              N
              t
              i
            
          
        
        ,
      
    
  




where Ntj are independent noise samples of circularly symmetric zero-mean complex Gaussian random variable with variance N0/2 per dimension. The complex fading coefficients of the equivalent channel model Htij have the following auto-correlation function: 



  
    
      
        
          R
          ⁡
          
            (
            
              
                
                  i
                  1
                
                -
                
                  i
                  2
                
              
              ,
              
                
                  j
                  1
                
                -
                
                  j
                  2
                
              
              ,
              
                
                  t
                  1
                
                -
                
                  t
                  2
                
              
            
            )
          
        
        =
        
        ⁢
        
          E
          ⁡
          
            (
            
              
                H
                
                  t
                  1
                
                
                  (
                  
                    
                      i
                      1
                    
                    ⁢
                    
                      j
                      1
                    
                  
                  )
                
              
              ⁢
              
                H
                
                  t
                  2
                
                
                  
                    (
                    
                      
                        i
                        2
                      
                      ⁢
                      
                        j
                        2
                      
                    
                    )
                  
                  *
                
              
            
            )
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          δ
          ⁢
          
            (
            
              
                
                  i
                  1
                
                -
                
                  i
                  2
                
              
              ,
              
                
                  j
                  1
                
                -
                
                  j
                  2
                
              
            
            )
          
        
      
    
  
  
    
      
        
        ⁢
        
          
            
              ∑
              
                l
                =
                0
              
              
                
                  L
                  
                    I
                    ⁢
                    
                      
                    
                    ⁢
                    S
                    ⁢
                    
                      
                    
                    ⁢
                    I
                  
                
                -
                1
              
            
            ⁢
            
              exp
              ⁡
              
                (
                
                  
                    -
                    j
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      2
                      ⁢
                      π
                      ⁢
                      
                        
                      
                      ⁢
                      
                        l
                        ⁢
                        
                          (
                          
                            
                              t
                              1
                            
                            -
                            
                              t
                              2
                            
                          
                          )
                        
                      
                    
                    N
                  
                
                )
              
            
          
          ,
        
      
    
  




where δ(i,j) is the dirac-delta function. It is clear that the fading coefficients of the equivalent channel are spatially independent [6] and that 



  
    R
    ⁢
    
      (
      
        0
        ,
        0
        ,
        
          
            k
            ⁢
            
              
            
            ⁢
            N
          
          
            L
            
              I
              ⁢
              
                
              
              ⁢
              S
              ⁢
              
                
              
              ⁢
              I
            
          
        
      
      )
    
  
  =
  0




for k=1,2, . . . ,LISI−1. This observation suggests that the equivalent fading channel can be approximated by the piece-wise constant block fading channel. In this model the code word encompasses LISI fading blocks. It is assumed that the complex fading gains are constant over one fading block, but are independent from block to block. Another type of receiver may be utilized in the event that receiver complexity presents a key design concern, as shown in FIG. 3B.

FIG. 3B shows a diagram of a receiver that employs space-frequency codes, according to an embodiment of the present invention. As with receiver 300 of the space-time code approach, receiver 311 processes signals via antennas 309 and includes a demodulator 315, a decoder 317, and a memory 319. Unlike receiver 300, receiver 311 employs an OFDM front-end 313, and includes a fast Fourier transform (FFT) logic 321 that may operate in parallel with the demodulator 315.
The design of space-frequency codes for the OFDM based design approach is described below. These space-frequency codes optimally exploit both spatial and frequency-selective diversity available in the multi-input-multi-output (MIMO) block fading channel. As in the single carrier time domain design approach, attention is focused on trellis based codes because of the availability of reasonable complexity ML decoders. For the purpose of explanation, the discussion pertains to BPSK modulated systems; however, it is recognized by one of ordinary skill in the art that QPSK codes can be obtained by lifting the BPSK codes, as described previously.
The general case in which C is a binary convolutional code of rate k/LtLISI, is considered. The encoder 203 processes k binary input sequences x1(t),x2(t), . . . ,xk(t) and produces LtLISI coded output sequences y1(t),y2(t), . . . ,yLtLISI(t), which are multiplexed together to form the output code word. The encoder action is summarized by the following matrix equation

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

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




  
    G
    ⁡
    
      (
      D
      )
    
  
  =
  
    [
    
      
        
          
            
              G
              
                1
                ,
                1
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          
            
              G
              
                1
                ,
                2
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          ⋯
        
        
          
            
              G
              
                1
                ,
                
                  
                    L
                    t
                  
                  ⁢
                  
                    L
                    
                      I
                      ⁢
                      
                        
                      
                      ⁢
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      I
                    
                  
                
              
            
            ⁡
            
              (
              D
              )
            
          
        
      
      
        
          
            
              G
              
                2
                ,
                1
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          
            
              G
              
                2
                ,
                2
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          ⋯
        
        
          
            
              G
              
                1
                ,
                
                  
                    L
                    t
                  
                  ⁢
                  
                    L
                    
                      I
                      ⁢
                      
                        
                      
                      ⁢
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      I
                    
                  
                
              
            
            ⁡
            
              (
              D
              )
            
          
        
      
      
        
          ⋮
        
        
          ⋮
        
        
          ⋰
        
        
          ⋮
        
      
      
        
          
            
              G
              
                k
                ,
                1
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          
            
              G
              
                k
                ,
                2
              
            
            ⁡
            
              (
              D
              )
            
          
        
        
          ⋯
        
        
          
            
              G
              
                k
                ,
                
                  
                    L
                    t
                  
                  ⁢
                  
                    L
                    
                      I
                      ⁢
                      
                        
                      
                      ⁢
                      S
                      ⁢
                      
                        
                      
                      ⁢
                      I
                    
                  
                
              
            
            ⁡
            
              (
              D
              )
            
          
        
      
    
    ]
  




The natural space-time formatting of C is such that the output sequence corresponding to Y(m−1)Lt+l(D)is assigned to the lth transmit antenna in the mth fading block. 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
              )
            
          
        
      
    
    ]
  




G is defined to be the set of binary full rank matrices {G:G=└gi,j┘Lt×Lt } resulting from applying any number of simple row operations to the identity matrix ILt; and ∀G1εG, 1≦i≦Lt1≦i≦LISI, 



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




Accordingly, the following algebraic construction for BPSK space-frequency convolutional codes results. In a MIMO OFDM based communication system with Lt transmit antennas 207 operating over a frequency selective block fading channel with LISI blocks, C denotes the space-frequency code that includes the binary convolutional code C, whose k×LtLISI transfer function matrix is G(D)=└F1(D) . . . FLtLISI(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, . . . ,GLISIεG,0≦m1≦min(Lt,LISILt−d+1), . . . ,0≦mLISI≦min(Lt,LISILt−d+1),

and 



  
    
      
        ∑
        
          i
          =
          1
        
        
          L
          ISI
        
      
      ⁢
      
        m
        i
      
    
    =
    
      
        
          L
          ISI
        
        ⁢
        
          L
          t
        
      
      -
      d
      +
      1
    
  
  ,






  
    
      R
      
        
          m
          1
        
        ,
        ...
        ,
        
          m
          ⁢
          
            
          
          ⁢
          
            L
            ISI
          
        
      
      
        (
        
          
            G
            1
          
          ,
          ...
          ,
          
            G
            
              L
              ISI
            
          
        
        )
      
    
    ⁡
    
      (
      D
      )
    
  
  =
  
    [
    
      
        
          R
          0
          
            (
            
              
                G
                1
              
              ,
              1
            
            )
          
        
        ⁡
        
          (
          D
          )
        
      
      ,
      ...
      ⁢
      
        
      
      ,
      
        
          R
          
            m
            1
          
          
            (
            
              
                G
                1
              
              ,
              1
            
            )
          
        
        ⁡
        
          (
          D
          )
        
      
      ,
      
        
          R
          0
          
            (
            
              
                G
                2
              
              ,
              2
            
            )
          
        
        ⁡
        
          (
          D
          )
        
      
      ,
      ...
      ⁢
      
        
      
      ,
      
        
          R
          
            m
            2
          
          
            (
            
              
                G
                2
              
              ,
              2
            
            )
          
        
        ⁡
        
          (
          D
          )
        
      
      ,
      ...
      ⁢
      
        
      
      ,
      
        
          R
          
            m
            
              L
              ISI
            
          
          
            (
            
              
                G
                
                  
                    L
                    ISI
                  
                  ,
                
              
              ⁢
              
                L
                ISI
              
            
            )
          
        
        ⁡
        
          (
          D
          )
        
      
    
    ]
  




has a rank k over the space of all formal series.

The above result allows for constructing convolutional space-frequency codes that realize the optimum tradeoff between transmission rate and diversity order for BPSK modulation with arbitrary coding rate, number of transmit antenna, and number of fading blocks. It is readily seen that this framework encompasses as a special case rate 1/n′ convolutional codes with bit or symbol interleaving across the transmit antennas and frequency fading blocks.
Similar to the space-time coding approach, rate 1/Lt convolutional codes are considered, wherein the same transmission throughput is achieved. The output sequence from the ith arm Yi(D) is assigned to the ith antenna. The input assigned to each antenna 207 is then distributed across the different fading blocks using a periodic bit interleaver 209. The design of interleaver 209 depends largely on whether the number of resolvable paths is available at the transmitter 200. In the case in which this information is available at the transmitter 200, the interleaver mapping function π is defined as 



  
    
      π
      ⁡
      
        (
        i
        )
      
    
    =
    
      
        [
        
          i
          
            L
            
              I
              ⁢
              
                
              
              ⁢
              S
              ⁢
              
                
              
              ⁢
              I
            
          
        
        ]
      
      +
      
        
          N
          
            L
            
              I
              ⁢
              
                
              
              ⁢
              S
              ⁢
              
                
              
              ⁢
              I
            
          
        
        ⁢
        
          
            (
            i
            )
          
          
            L
            
              I
              ⁢
              
                
              
              ⁢
              S
              ⁢
              
                
              
              ⁢
              I
            
          
        
      
    
  
  ,




where ( )m refers to the modulo m operation, 0≦i≦N−1, and N is the code word length, which is assumed to be a multiple of LISI.

In the absence of the prior information on the number of resolvable paths in the channel 103, an interleaving scheme that is capable of exploiting all the frequency diversity, whenever available, for an arbitrary unknown number of paths is needed. In the special case in which the number of paths is restricted to LISI=2r (for any arbitrary integer r) and the maximum possible number of paths LISI(max) is known at the transmitter 200, the following construction for the universal interleaving map is provided: 



  
    
      π
      ⁡
      
        (
        i
        )
      
    
    =
    
      
        
          ∑
          
            k
            =
            0
          
          
            
              log
              2
            
            ⁡
            
              (
              
                L
                
                  I
                  ⁢
                  
                    
                  
                  ⁢
                  S
                  ⁢
                  
                    
                  
                  ⁢
                  I
                
                
                  (
                  max
                  )
                
              
              )
            
          
        
        ⁢
        
          
            a
            k
          
          ⁢
          
            N
            
              2
              
                k
                +
                1
              
            
          
        
      
      +
      
        [
        
          i
          
            L
            
              I
              ⁢
              
                
              
              ⁢
              S
              ⁢
              
                
              
              ⁢
              I
            
            
              (
              max
              )
            
          
        
        ]
      
    
  
  ,
  
    

  
  ⁢
  
    
      a
      k
    
    =
    
      (
      
        
          
            
              (
              i
              )
            
            ⁢
            
              L
              
                I
                ⁢
                
                  
                
                ⁢
                S
                ⁢
                
                  
                
                ⁢
                I
              
              
                (
                max
                )
              
            
          
          -
          
            
              ∑
              
                j
                =
                0
              
              
                k
                -
                1
              
            
            ⁢
            
              
                a
                j
              
              ⁢
              
                2
                j
              
            
          
        
        
          2
          k
        
      
      )
    
  




This interleaving scheme distributes the input sequence periodically among the LISI fading blocks for any LISI=2r and LISI≦LISI(max). In practical applications, LISI(max) may be chosen to be larger than the maximum number of resolvable paths expected in this particular application, and hence, the transmitter 200 does not need feedback from the receiver 300. This does not result in any loss of performance. If the number of paths is not a power of two, then the diversity advantage is lower bounded by that achieved with the number of paths equal to LISI(approx)) such that LISI(approx)=2r<LISI.

Table 3 shows the diversity advantage that is achieved by the optimal free distance codes when used as space-frequency codes in this scenario. Specifically, Table 3 lists the diversity advantage for BPSK algebraic space-frequency codes with optimal free distance for MIMO frequency selective fading channels.













TABLE 3








d for
d for
d for
d for


Lt
ν
Connection Polynomials
LISI = 1
LISI = 2
LISI = 3
LISI = 4





















2
2
5, 7
2
4
5
6



3
64, 74
2
4
6
7



4
46, 72
2
4
6
8



5
65, 57
2
4
6
8



6
554, 744
2
4
6
8


3
3
54, 64, 74
3
4
—
—



4
52, 66, 76
3
3
5
—



5
47, 53, 75
3
—
—
—



6
554, 624, 764
3
—
—
—


4
4
52, 56, 66, 76
4
—
—
—



5
53, 67, 71, 75
4
—
—
—


5
5
75, 71, 73, 65, 57
5
—
—
—









While, the codes in Table 3 may not realize the maximum possible diversity advantage under all circumstances, these codes a compromise between the diversity advantage and coding gain.

The OFDM based approach addresses the need for a lower complexity maximum likelihood receiver 300. This approach recognizes the fact that the maximum likelihood decoder 317 complexity in the OFDM approach does not increase exponentially with the number of resolvable paths, contrary to the space-time coding approach. It should be noted that this does not mean, however, that complexity of the decoder 317 does not depend on the number of paths. As shown in Table 3, as the number of paths increases, the codes with larger constraint lengths are needed to efficiently exploit the diversity available in the channel 103. Unlike the space-time coding approach, it is possible to trade diversity advantage for a reduction in complexity by choosing a code with a small constraint length. This trade-off is not possible in the space-time coding approach because, irrespective of the constraint length of the code, the complexity of the (ML) decoder 305 grows exponentially with the number of resolvable paths. The OFDM based approach, however, provides a relatively lower diversity advantage over the space-time coding approach.
The maximum transmit diversity advantage achieved in a BPSK OFDM MIMO wireless system with Lt transmit antennas 207 and LISI resolvable paths/antenna supporting a throughput of 1 bps/Hz is LISI(Lt−1)+1. It is clear that the maximum diversity advantage under this approach is lower as compared to the space-time coding approach (i.e, LtLISI). The results in Tables 1 and 3 compare the diversity advantage achieved by space-time codes and space-frequency codes for different values of Lt and LISI. As will be evident from the discussion below, this loss in diversity advantage may not always lead to a performance loss in the frame error rate range of interest.
FIGS. 4A–4H show graphs of simulation results of the channel codes, in accordance with the various embodiments of the present invention. Specifically, these figures show the simulated frame error rate performance results for the two coding approaches, concentrating on the codes presented in Tables 1, 2, and 3. In all cases, the frame length corresponds to 100 simultaneous transmissions from all antennas 207. Joint maximum likelihood decoding and equalization that accounts for the ISI nature of the channel is assumed at the receiver (e.g., 300 and 311). In most cases, the simulated frame error rates were restricted to less than 1% because of the practical significance of this range and to limit the simulation time.
FIGS. 4A–4G report the performance of the two proposed approaches in BPSK systems with different numbers of transmit antennas Lt, receive antennas Lr, resolvable paths LISI, and receiver trellis complexity. The number of states in the figures represents the maximum likelihood decoder trellis complexity. For the OFDM approach, this number is equal to the number of states in the underlying convolutional codes; however, for the space-time coding approach, this number accounts for the additional complexity dictated by the ISI nature of the channel. In the figures, the single carrier approach with space-time coding is referred to as (STC), whereas the OFDM approach with space-frequency coding is referred to as (SFC).
In FIGS. 4A and 4B, the gain in performance of the two approaches are shown with respect to an increasing number of resolvable paths. In the single carrier approach, this improvement provides a concomitant increase in receiver complexity as the number of states in the maximum likelihood receiver grows exponentially with the number of resolvable paths. In contrast, for the space-frequency coding approach, the performance improvement does not entail any increase in complexity. It is noted that the improvement in performance in the SFC approach is marginal when LISI increases from one to two because, as shown in Table 1; the diversity advantage of the 4-state code used is the same in both scenario.
FIGS. 4C–4F provides a comparison between the STC and SFC approaches. It is shown that when the same code is used in both schemes, the STC approach always provides a gain in performance, however, at the expense of higher receiver complexity. Whereas, if the receiver complexity is fixed in both approaches, the SFC approach sometimes offers better performance. This may seem in contrary to the intuition based on the superiority of the STC approach in terms of diversity advantage; this seeming contradiction can be attributed to two reasons. First, the same receiver complexity allows the SFC approach to utilize more sophisticated codes that offer larger coding gains. Second, the effect of the STC superior diversity advantage may only become apparent at significantly larger signal-to-noise ratios. This observation, however, indicates that the SFC approach may yield superior performance in some practical applications.
FIG. 4G highlights the importance of careful design in optimizing the diversity advantage. In this figure, the 4-state (5,7) optimal free distance SFC is compared with the 4-state (6,7) in a system with Lt=−2, Lr=I, and LISI=2,3. As reported in Table 1, the (5,7) code achieves d=2,3 for LISI=2,3, respectively. Whereas, the (6,7) code achieves d=3 in both codes; it is noted that in the LISI, d=3 is the maximum possible diversity advantage for this throughput. As shown in the figure, for the LISI=2 case, the superior diversity advantage of the (6,7) is apparent in the steeper frame error rate curve slope. This results in a gain of about 1 dB at 0.01 frame error rate. On the other hand, for the LISI=3 case, it is shown that the (5,7) code exhibits a superior product distance that accounts for about 1 dB gain compared with the (6,7) code.
The above construct has applicability in a number of communication systems; for example, the developed channel 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 the channel codes, according to the various embodiments 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 an encoder 203 (as shown in FIG. 2) that generates space-time or space-frequency codes. 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. Alternatively, each of the terminals 501 and 503 may be configured to operate using space-frequency codes. As mentioned previously, the choice of space-time codes versus space-frequency codes depends largely on the trade-off between receiver complexity and the desired diversity advantage.
FIG. 6 shows a diagram of a computer system that can perform the processes of encoding and decoding of the channel codes, in accordance with the embodiments 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 and space-frequency 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. The two approaches of designing space-time codes and space-frequency codes optimally exploits both the spatial and frequency diversity available in the channel.
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] E. Teletar. Capacity of Multi-Antenna Gaussian Channels. Technical Report, AT&T-Bell Labs, June 1995.
    [2] G. J. Foschini and M. Gans. On the Limits of Wireless Communication in a Fading Environment When Using Multiple Antennas. Wireless Personal Communication, 6:311–335, March 1998.
    [3] 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.
    [4] 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.
    [5] G. J. Foschini. Layered Space-Time Architecture for Wireless Communication in Fading Environments When Using Multiple Antennas. Bell Labs Tech. J., 2, Autumn 1996.
    [6] S. Lin and Jr. D. J. Costello. Error Control Coding: Fundamentals and Applications. Prentice-Hall, New Jersey, 1983.

## Claims

1. A method for transmitting encoded signals over a communication channel of a communication system, the method comprising:
receiving a message signal; and
generating a code word in response to the message signal for transmission over the communication channel via a plurality of transmit antennas, the code word having a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel, the code word achieving a diversity based upon the number of transmit antennas and the number of ISI paths.

2. The method according to claim 1, wherein the code word in the generating step satisfies a baseband rank criterion such that rank(fISI(c)−fISI(e)) is maximized over all pairs of distinct code words c, eεC, C being an Lt×l linear space-time code, Lt representing the number of transmit antennas, wherein 



  
    
      
        f
        ⁡
        
          (
          c
          )
        
      
      
        I
        ⁢
        
          
        
        ⁢
        S
        ⁢
        
          
        
        ⁢
        I
      
    
    =
    
      [
      
        
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            
              0
              _
            
          
          
            ...
          
          
            
              0
              _
            
          
        
        
          
            
              0
              _
            
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            ...
          
          
            
              0
              _
            
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            
              0
              _
            
          
          
            
              0
              _
            
          
          
            ⋯
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
        
      
      ]
    
  
  ,




0 being an Lt×1 all zero vector.

3. The method according to claim 2, wherein rank(fISI(c)−fISI(e))=LtLISI for all pairs of distinct code words C, eεC, and LISI represents the number of ISI paths.

4. The method according to claim 2, wherein the construction in the generating step further defines an ISI code word matrix as follows: 



  
    
      c
      ISI
    
    =
    
      [
      
        
          
            c
          
          
            
              0
              _
            
          
          
            ⋯
          
          
            0
          
        
        
          
            0
          
          
            c
          
          
            ⋯
          
          
            0
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            0
          
          
            0
          
          
            ⋯
          
          
            c
          
        
      
      ]
    
  
  ,




wherein f(cISI)≠f(c)ISI, the diversity being based upon f(cISI)−f(eISI)=f(c)ISI−f(e)ISI.

5. The method according to claim 4, wherein the construction in the generating step further defines an ISI channel binary rank criterion such that C has an underlying binary code C of length N=Ltl operating in the ISI environment and l≧LtLISI, LISI representing the number of ISI paths.

6. The method according to claim 5, wherein, for every non-zero code word c corresponding to cISI of full rank LtLISI over a binary field F, the diversity of the space-time code C is LtLISI.

7. The method according to claim 1, wherein the construction in the generating step further defines M1, M2, . . . , MLt as binary matrices of dimension k×l,l≧k, and C is an Lt×l linear space-time code of dimension k and includes code word matrices defined as follows: 



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




wherein x denotes an arbitrary k-tuple of information bits associated with the message signal, and Lt<l, Lt representing the number of transmit antennas.

8. The method according to claim 7, wherein the construction in the generating step further defines Mn,m=└OLt×(m−1)MnOLt×(LISI+1−m)┘, OLt×(m−1) being an Lt×(m−1) all zero matrix, for BPSK transmission, the diversity is LtLISI, if and only if M1,1, M2,1, . . . , MLtLISI, ∀a1, a2, . . . ,aLtεF: M=a1M1,1⊕a2M2,1⊕ . . . ⊕aLtLISIMLtLISI is of full rank unless a1= . . . aLtLISI=0, F being a binary field, the code word being drawn from 



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

9. The method according to claim 1, further comprising:
modulating the code word using at least one of BPSK (binary phase-shift keying) modulation and QPSK (quadrature phase-shift keying) modulation.

10. An apparatus for encoding signals for transmission over a communication channel of a communication system, the apparatus comprising:
a source configured to output a message signal; and
an encoder configured to generate code word in response to the message signal for transmission over the communication channel via a plurality of transmit antennas, the code word having a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel, the code word achieving a diversity based upon the number of transmit antennas and the number of ISI paths.

11. The apparatus according to claim 10, wherein the code word satisfies a baseband rank criterion such that rank(fISI(c)−fISI(e)) is maximized over all pairs of distinct code words c, eεC, C being an Lt×l linear space-time code, Lt representing the number of transmit antennas, wherein 



  
    
      
        f
        ⁡
        
          (
          c
          )
        
      
      ISI
    
    =
    
      [
      
        
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            
              0
              _
            
          
          
            ⋯
          
          
            
              0
              _
            
          
        
        
          
            
              0
              _
            
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            ⋯
          
          
            
              0
              _
            
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            
              0
              _
            
          
          
            
              0
              _
            
          
          
            ⋯
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
        
      
      ]
    
  
  ,




0 being an Lt×1 all zero vector.

12. The apparatus according to claim 11, wherein rank(fISI(c)−fISI(e))=LtLISI for all pairs of distinct code words c, eεC, and LISI represents the number of ISI paths.

13. The apparatus according to claim 11, wherein the construction further defines an ISI code word matrix as follows: 



  
    
      c
      ISI
    
    =
    
      [
      
        
          
            c
          
          
            
              0
              _
            
          
          
            ⋯
          
          
            0
          
        
        
          
            0
          
          
            c
          
          
            ⋯
          
          
            0
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            0
          
          
            0
          
          
            ⋯
          
          
            c
          
        
      
      ]
    
  
  ,




wherein f(cISI)≠f(c)ISI, the diversity being based upon f(cISI)−f(eISI)=f(c)ISI−f(e)ISI.

14. The apparatus according to claim 13, wherein the construction further defines an ISI channel binary rank criterion such that C has an underlying binary code C of length N=Ltl operating in the ISI environment and l≧LtLISI, LISI representing the number of ISI paths.

15. The apparatus according to claim 14, wherein, for every non-zero code word c corresponding to cISI of full rank LtLISI over a binary field F, the diversity of the space-time code C is LtLISI.

16. The apparatus according to claim 10, wherein the construction further defines M1, M2, . . . , MLt as binary matrices of dimension k×l,l≧k, and C is an Lt×l linear space-time code of dimension k and includes code word matrices defined as follows: 



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




wherein x denotes an arbitrary k-tuple of information bits associated with the message signal, and Lt<l, Lt representing the number of transmit antennas.

17. The apparatus according to claim 16, wherein the construction further defines Mn,m=└OLt×(m−1)MnOLt×(LISI+1−m)┘, OLt×(M−1) being an Lt×(m−1) all zero matrix, for BPSK transmission, the diversity is LtLISI, if and only if M1,1, M2,1, . . . , MLtLISI, ∀a1, a2, . . . , aLtεF: M=a1M1,1⊕a2M2,1⊕ . . . ⊕aLtLISIMLtLISI is of full rank k unless a1= . . . aLtLISI=0, F being a binary field, the code word being drawn from 



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

18. The apparatus according to claim 10, further comprising:
a modulator configured to modulate the code word using at least one of BPSK (binary phase-shift keying) modulation and QPSK (quadrature phase-shift keying) modulation.

19. An apparatus for encoding signals for transmission over a communication channel of a communication system, the apparatus comprising:
means for receiving a message signal; and
means for generating a code word in response to the message signal for transmission over the communication channel via a plurality of transmit antennas, the code word having a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel, the code word achieving a diversity based upon the number of transmit antennas and the number of ISI paths.

20. The apparatus according to claim 19, wherein the code word satisfies a baseband rank criterion such that rank(fISI(c)−fISI(e)) is maximized over all pairs of distinct code words C, eεC, C being an Lt×l linear space-time code, Lt representing the number of transmit antennas, wherein 



  
    
      
        f
        ⁡
        
          (
          c
          )
        
      
      ISI
    
    =
    
      [
      
        
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            
              0
              _
            
          
          
            ⋯
          
          
            
              0
              _
            
          
        
        
          
            
              0
              _
            
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            ⋯
          
          
            
              0
              _
            
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            
              0
              _
            
          
          
            
              0
              _
            
          
          
            ⋯
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
        
      
      ]
    
  
  ,




0 being an Lt×1 all zero vector.

21. The apparatus according to claim 20, wherein rank(fISI(c)−fISI(e))=LtLISI for all pairs of distinct code words c, eεC, and LISI represents the number of ISI paths.

22. The apparatus according to claim 20, wherein the construction further defines an ISI code word matrix as follows: 



  
    
      c
      ISI
    
    =
    
      [
      
        
          
            c
          
          
            
              0
              _
            
          
          
            ⋯
          
          
            0
          
        
        
          
            0
          
          
            c
          
          
            ⋯
          
          
            0
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            0
          
          
            0
          
          
            ⋯
          
          
            c
          
        
      
      ]
    
  
  ,




wherein f(cISI)≠f(c)ISI, the diversity being based upon f(cISI)−f(eISI)=f(c)ISI−f(e)ISI.

23. The apparatus according to claim 22, wherein the construction further defines an ISI channel binary rank criterion such that C has an underlying binary code C of length N=Ltl operating in the ISI environment and l≧LtLISI, LISI representing the number of ISI paths.

24. The apparatus according to claim 23, wherein, for every non-zero code word c corresponding to cISI of full rank LtLISI over a binary field F, the diversity of the space-time code C is LtLISI.

25. The apparatus according to claim 19, wherein the construction further defines M1, M2, . . . , MLt as binary matrices of dimension k×l,l≧k, and C is an Lt×l linear space-time code of dimension k and includes code word matrices defined as follows: 



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




wherein x denotes an arbitrary k-tuple of information bits associated with the message signal, and Lt<l, Lt representing the number of transmit antennas.

26. The apparatus according to claim 25, wherein the construction further defines Mn,m=└OLt×(m−1)MnOLt×(LISI+1−m)┘, OLt×(m−1) being an Lt×(m−1) all zero matrix, for BPSK transmission, the diversity is LtLISI, if and only if M1,1, M2,1, . . . , MLtLISI, ∀a1, a2, . . . , aLtεF: M=a1M1,1⊕a2M2,1⊕ . . . ⊕aLtLISIMLtLISI is of full rank k unless a1=. . . aLtLISI=0, F being a binary field, the code word being drawn from 



  
    c
    ISI
  
  =
  
    
      [
      
        
          
            
              
                x
                _
              
              ⁢
              
                M
                
                  1
                  ,
                  1
                
              
            
          
        
        
          
            
              
                x
                _
              
              ⁢
              
                
              
              ⁢
              
                M
                
                  1
                  ,
                  2
                
              
            
          
        
        
          
            ⋮
          
        
        
          
            
              
                x
                _
              
              ⁢
              
                
              
              ⁢
              
                M
                
                  
                    L
                    i
                  
                  ,
                  
                    L
                    ISI
                  
                
              
            
          
        
      
      ]
    
    .

27. The apparatus according to claim 19, further comprising:
means for modulating the code word using at least one of BPSK (binary phase-shift keying) modulation and QPSK (quadrature phase-shift keying) modulation.

28. A communication system for transmitting encoded signals over a communication channel, the system comprises:
a transmitter including,
a source configured to output a message signal,
an encoder configured to generate a code word in response to the message signal,
a modulator configured to modulate the code word for transmission over the communication channel, and
a plurality of transmit antennas configured to transmit the modulated code word over the communication channel, the code word having a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel, the code word achieving a diversity based upon the number of transmit antennas and the number of ISI paths; and

a receiver configured to receive the transmitted code word via a plurality of receive antennas.

29. The system according to claim 28, wherein the code word satisfies a baseband rank criterion such that rank(fISI(c)−fISI(e)) is maximized over all pairs of distinct code words c, eεC, C being an Lt×l linear space-time code, Lt representing the number of transmit antennas, wherein 



  
    
      
        f
        ⁡
        
          (
          c
          )
        
      
      ISI
    
    =
    
      [
      
        
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            
              0
              _
            
          
          
            ...
          
          
            
              0
              _
            
          
        
        
          
            
              0
              _
            
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            ...
          
          
            
              0
              _
            
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            
              0
              _
            
          
          
            
              0
              _
            
          
          
            ...
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
        
      
      ]
    
  
  ,




0 being an Lt×1 all zero vector.

30. The system according to claim 29, wherein rank(fISI(c)−fISI(e))=LtLISI for all pairs of distinct code words c, eεC, and LISI represents the number of ISI paths.

31. The system according to claim 29, wherein the construction further defines an ISI code word matrix as follows: 



  
    
      c
      ISI
    
    =
    
      [
      
        
          
            c
          
          
            
              0
              _
            
          
          
            ...
          
          
            0
          
        
        
          
            0
          
          
            c
          
          
            ...
          
          
            0
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            0
          
          
            0
          
          
            ...
          
          
            c
          
        
      
      ]
    
  
  ,




wherein f(cISI)≠f(c)ISI, the diversity being based upon f(cISI)−f(eISI)=f(c)ISI−f(e)ISI.

32. The system according to claim 31, wherein the construction further defines an ISI channel binary rank criterion such that C has an underlying binary code C of length N=Ltl operating in the ISI environment and l≧LtLISI, LISI representing the number of ISI paths.

33. The system according to claim 32, wherein, for every non-zero code word c corresponding to cISI of fall rank LtLISI over a binary field F, the diversity of the space-time code C is LtLISI.

34. The system according to claim 28, wherein the construction further defines M1, M2, . . . , MLt as binary matrices of dimension k×l,l≧k, and C is an Lt×l linear space-time code of dimension k and includes code word matrices defined as follows: 



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




wherein x denotes an arbitrary k-tuple of information bits associated with the message signal, and Lt<l, Lt representing the number of transmit antennas.

35. The system according to claim 34, wherein the construction further defines Mn,m=└OLt×(m−1)MnOLt×(LISI+1−m)┘, OLt×(m−1) being an Lt×(m−1) all zero matrix, for BPSK transmission, the diversity is LtLISI, if and only if M1,1, M2,1, . . . , MLtLISI, ∀a1, a2, . . . , aLtεF: M=a1M1,1⊕a2M2,1⊕ . . . ⊕aLtLISIMLtLISI is of full rank unless a1=. . . aLtLISI=0, F being a binary field, the code word being drawn from 



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

36. The system according to claim 28, wherein the modulator modulates the code word using at least one of BPSK (binary phase-shift keying) modulation and QPSK (quadrature phase-shift keying) modulation.

37. A waveform signal for transmission over a communication channel of a communication system, the waveform signal comprising:
a code word that is based upon a message signal, the code word being generated for transmission over the communication channel via a plurality of transmit antennas, wherein the code word has a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel, the code word achieving a diversity based upon the number of transmit antennas and the number of ISI paths.

38. The signal according to claim 37, wherein the code word satisfies a baseband rank criterion such that rank(fISI(c)−fISI(e)) is maximized over all pairs of distinct code words C, eεC, C being an Lt×l linear space-time code, Lt representing the number of transmit antennas, wherein 



  
    
      
        f
        ⁡
        
          (
          c
          )
        
      
      ISI
    
    =
    
      [
      
        
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            
              0
              _
            
          
          
            ...
          
          
            
              0
              _
            
          
        
        
          
            
              0
              _
            
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            ...
          
          
            
              0
              _
            
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            
              0
              _
            
          
          
            
              0
              _
            
          
          
            ...
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
        
      
      ]
    
  
  ,




0 being an Lt×1 all zero vector.

39. The signal according to claim 38, wherein rank(fISI(c)−fISI(e))=LtLISI for all pairs of distinct code words c, eεC, and LISI represents the number of ISI paths.

40. The signal according to claim 38, wherein the construction further defines an ISI code word matrix as follows: 



  
    
      c
      ISI
    
    =
    
      [
      
        
          
            c
          
          
            
              0
              _
            
          
          
            ...
          
          
            0
          
        
        
          
            0
          
          
            c
          
          
            ...
          
          
            0
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            0
          
          
            0
          
          
            ...
          
          
            c
          
        
      
      ]
    
  
  ,




wherein f(cISI)≠f(c)ISI, the diversity being based upon f(cISI)−f(eISI)=f(c)ISI−f(e)ISI.

41. The signal according to claim 40, wherein the construction further defines an ISI channel binary rank criterion such that C has an underlying binary code C of length N=Ltl operating in the ISI environment and l≧LtLISI, LISI representing the number of ISI paths.

42. The signal according to claim 41, wherein, for every non-zero code word c corresponding to cISI of full rank LtLISI over a binary field F, the diversity of the space-time code C is LtLISI.

43. The signal according to claim 38, wherein the code word is modulated using at least one of BPSK (binary phase-shift keying) modulation and QPSK (quadrature phase-shift keying) modulation.

44. The signal according to claim 37, wherein the construction further defines M1, M2, . . . , MLt as binary matrices of dimension k×l,l≧k, and C is an Lt×l linear space-time code of dimension k and includes code word matrices defined as follows: 



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




wherein x denotes an arbitrary k-tuple of information bits associated with the message signal, and Lt<l, Lt representing the number of transmit antennas.

45. The signal according to claim 44, wherein the construction further defines Mn,m=└OLt×(m−1)MnOLt×(LISI+1−m)┘, OLt×(m−1) being an Lt×(m−1) all zero matrix, for BPSK transmission, the diversity is LtLISI, if and only if M1,1, M2,1, . . . , MLtLISI, ∀a1, a2, . . . , aLtεF: M=a1M1,1⊕a2M2,1⊕ . . . ⊕aLtLISIMLtLISI is of full rank unless a1=. . . aLtLISI=0, F being a binary field, the code word being drawn from 



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

46. 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, the one or more sequences of one or more instructions including instructions which, when executed by one or more processors, cause the one or more processors to perform the steps of:
receiving a message signal; and
generating a code word in response to the message signal for transmission over the communication channel via a plurality of transmit antennas, the code word having a construction that defines a plurality of paths associated with an intersymbol interference (ISI) environment of the communication channel, the code word achieving a diversity based upon the number of transmit antennas and the number of ISI paths.

47. The computer-readable medium according to claim 46, wherein the code word in the generating step satisfies a baseband rank criterion such that rank(fISI(c)−fISI(e)) is maximized over all pairs of distinct code words c, eεC, C being an Lt×l linear space-time code, Lt representing the number of transmit antennas, wherein 



  
    
      
        f
        ⁡
        
          (
          c
          )
        
      
      ISI
    
    =
    
      [
      
        
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            
              0
              _
            
          
          
            ...
          
          
            
              0
              _
            
          
        
        
          
            
              0
              _
            
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
          
            ...
          
          
            
              0
              _
            
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            
              0
              _
            
          
          
            
              0
              _
            
          
          
            ...
          
          
            
              f
              ⁡
              
                (
                c
                )
              
            
          
        
      
      ]
    
  
  ,




0 being an Lt×1 all zero vector.

48. The computer-readable medium according to claim 47, wherein rank(fISI(c)−fISI(e))=LtLISI for all pairs of distinct code words c, eεC, and LISI represents the number of ISI paths.

49. The computer-readable medium according to claim 47, wherein the construction in the generating step further defines an ISI code word matrix as follows: 



  
    
      c
      ISI
    
    =
    
      [
      
        
          
            c
          
          
            
              0
              _
            
          
          
            ⋯
          
          
            0
          
        
        
          
            0
          
          
            c
          
          
            ⋯
          
          
            0
          
        
        
          
            ⋮
          
          
            ⋮
          
          
            ⋰
          
          
            ⋮
          
        
        
          
            0
          
          
            0
          
          
            ⋯
          
          
            c
          
        
      
      ]
    
  
  ,




wherein f(cISI)≠f(c)ISI, the diversity being based upon f(cISI)−f(eISI)=f(c)ISI−f(e)ISI.

50. The computer-readable medium according to claim 49, wherein the construction in the generating step further defines an ISI channel binary rank criterion such that C has an underlying binary code C of length N=Ltl operating in the ISI environment and l≧LtLISI, LISI representing the number of ISI paths.

51. The computer-readable medium according to claim 50, wherein, for every non-zero code word c corresponding to cISI of full rank LtLISI over a binary field F, the diversity of the space-time code C is LtLISI.

52. The computer-readable medium according to claim 46, wherein the construction in the generating step further defines M1, M2, . . . , MLt as binary matrices of dimension k×l,l≧k, and C is an Lt×l linear space-time code of dimension k and includes code word matrices defined as follows: 



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




wherein x denotes an arbitrary k-tuple of information bits associated with the message signal, and Lt<l, Lt representing the number of transmit antennas.

53. The computer-readable medium according to claim 52, wherein the construction in the generating step further defines Mn,m=└OLt×(m−1)MnOLt×(LISI+1−m)┘, OLt×(m−1) being an Lt×(m−1) all zero matrix,
for BPSK transmission, the diversity is LtLISI, if and only if M1,1, M2,1, . . . , MLtLISI, ∀a1, a2, . . . , aLtεF: M=a1M1,1⊕a2M2,1⊕ . . . ⊕aLtLISIMLtLISI is of fall rank unless a1=. . . aLtLISI=0, F being a binary field, the code word being drawn from 



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

54. The computer-readable medium according to claim 46, wherein the one or more processors further perform the step of:
modulating the code word using at least one of BPSK (binary phase-shift keying) modulation and QPSK (quadrature phase-shift keying) modulation.