# Patent

## Title
System and method for communicating data symbols via wireless doubly-selective channels

## Abstract

A method for decoding data symbols modulated with a corresponding codeword from a constellation set of codewords expands the constellation set of codewords with a set of basis functions to produce a basis-expanded constellation set and projects projecting a received modulated data symbol onto orthogonal complements of the basis expanded constellation set to obtain a set of distance metric of a generalized likelihood ratio test (GLRT) for each codeword of the constellation set. The set of basis functions includes a Fourier exponential basis function in a frequency domain, a Legendre polynomial basis function in a time domain, and a Fourier-Legendre product basis function in the frequency domain. The method selects a codeword corresponding to a minimal distance metric or a maximal correlation metric and decodes the data symbol from the received modulated data symbol using the codeword.

## Background
FIELD OF THE INVENTION
This invention relates generally to digital communications, and more particularly to transmitting high-speed data via wireless doubly-selective channels.
BACKGROUND OF THE INVENTION
In wireless communications, doubly-selective channels are subject to time-varying fading and multi-path delays. Time-varying fading has a specific Doppler power spectrum, causing time-selective channels and inter-carrier interference (ICI). Multi-path delays have a certain delay power spectrum, causing frequency-selective channels and inter-symbol interference (ISI). This is a particular problem in a wideband wireless network with mobile transceivers, e.g. in vehicular communications networks and cellular networks.
Adaptive equalization and pilot symbols are typically used to compensate for ISI and ICI. For example, pilot symbols or training sequences are inserted in packets transmitted to a receiver in order to estimate channel state information (CSI) of wireless links. The estimated CSI is used for equalization of ISI and ICI. However, the pilot symbols inherently reduce the spectral efficiency and data transmission rate, given restricted resources of radio frequency that is suited for mobile communications. Moreover, the pilot symbols are only effective for slow fading channels. In addition, channel estimation to obtain instantaneous CSI is considerably difficult in doubly-selective fading channels due to the presence of both ISI and ICI, even with pilot symbols.
A basis expansion model (BEM) has been used to approximate singly-selective fading channels, i.e., either time-varying or multi-path channels, to realize semi-blind transmissions for mobile wireless communications, see, e.g., U.S. Pat. No. 7,280,604 B2. The BEM is used in conjunction with an iterative semi-blind equalizer based on an expectation-and-maximization (EM) procedure for joint data detection and CSI estimation. With help of a forward error correction (FEC) code, the BEM can realize quasi non-coherent communications with a small number of pilot symbols without performance degradation. However, that method still relies on pilot symbols to obtain an initial CSI estimation and FEC soft-decision decoding feedbacks, which can make a receiver more complicated.
Differential space-time coding (DSTC) has been used to realize non-coherent communications and to provide diversity gain to be robust against channel fading, see, e.g., U.S. Pat. No. 7,567,623 B2, U.S. Pat. No. 7,508,808 B2, and U.S. Pat. No. 7,397,866 B2. The non-coherent communications do not need to use any pilot symbols, and higher spectral efficiency can be maintained because of no communications overhead. DSTC is realized by Grassmannian orthogonal matrix, see, e.g., U.S. Pat. No. 6,801,579 B1, U.S. Pat. No. 7,864,876 B2, and US 2002/0163892 A1. However, DSTC does not perform well in fast time-varying channels, where channel coherence time is very short to exploit the orthogonal feature of the Grassmannian matrix. To solve this problem, the BEM and DSTC can be simultaneously used with generalized likelihood-ratio test (GLRT) equalization, see, e.g., U.S. Pat. No. 8,059,747. With BEM, non-coherent communications can be realized even for fast time-varying fading channels and for high-speed data rate transmissions. This method and system can be extended to doubly-selective fading channels by introducing multi-dimensional BEM, in which two different kinds of basis functions over time and frequency domain are used to deal with doubly-selective fading channels.
However, the BEM itself is susceptive to some hardware imperfections, such as timing offset and carrier offset. For example, the timing and carrier offsets can be caused by hardware impairments, such as inaccuracy of a clock circuit including, e.g., a crystal oscillator. Such offsets are undesired for a number of applications, and can be compensated for by a specially designed synchronization process. For example, U.S. Pat. No. 7,961,697 B2 describes a method for synchronizing clocks between the receiver and transmitter using pre-defined training sequences in synchronization packets. However, transmission of the synchronization packets causes additional communications overhead, which is an undesirable or even unacceptable for a number of applications.
Accordingly, there is a need for a method for non-coherent transmission for doubly-selective channels accounting for timing offset and carrier offset of the transmission without relying on any pilots or training sequences for synchronization and channel estimation.
SUMMARY OF THE INVENTION
The embodiments of the invention provide a method and a system for non-coherent wireless telecommunications accepting timing and carrier offsets via multiple-input multiple-output (MIMO) doubly-selective channels, that are subject to time-varying fading and multi-path delays for radio transceivers equipped with multiple antennas. Time-varying fading causes inter-carrier interference (ICI) and multi-path delays create inter-symbol interference (ISI). The method realizes non-coherent MIMO communications that can avoid using pilot symbols for estimating channel state information (CSI) of wireless links even in the presence of ICI and ISI. To account for ICI and ISI, one embodiment uses a multi-dimensional basis expansion model (BEM) to cope with doubly-selective fading channels, and a blind equalization based on generalized likelihood ratio test (GLRT).
The issue of timing and carrier offsets for GLRT with BEM is resolved by some embodiments of the invention, which are based on a realization that statistical dependency of the channels used in recovery of the transmitted data can be modified with statistical dependency of distribution of the timing and carrier offsets. In such a manner, the statistical recovery of the transmitted data considers the probable offsets values without using any additional synchronization data.
Some embodiments of the invention are based on additional realization that the statistics of the timing and carrier offsets resemble the statistics of the distribution of the Doppler frequency of the received signals. This is because the autocorrelation function of timing and carrier offsets can be well approximated by Taylor-Maclaurin series expansion. To that end, it was realized that the distribution of the offsets values has a Legendre polynomial basis. Accordingly, some embodiments of the invention modify the statistical dependency of the channels used in recovery of the transmitted data with the polynomial basis.
The BEM uses a conditional channel covariance, which is based on the Legendre polynomial basis in a time domain, and on a Fourier exponential basis in a frequency domain. To account for the timing offset, some embodiments modify the Fourier basis in the frequency domain of the BEM with a Legendre polynomial basis, and use the Fourier-Legendre product basis for the frequency domain. Also, some embodiments account for the carrier offset by increasing the number of Legendre polynomial basis functions considered in the time domain of the BEM. To that end, high-speed non-coherent MIMO communications can be realized with a significant tolerance against all the ISI, ICI, timing offset, and carrier offset, even without using pilot symbols.
In one embodiment, the GLRT blind equalization can be modified to take noise and signal uncertainty into account. For example, the null-space projection for space-time demodulation is replaced with a quasi null-space projection, whose demodulation metric is generated as a function of noise and signal variances as well as basis-expanded signal block.
Accordingly, one embodiment discloses a method for decoding data symbols received at a receiver via doubly-selective fading channel in a multiple-input multiple output (MIMO), and wherein each data symbol is space-time modulated with a corresponding codeword from a constellation set of codewords, wherein each codeword in the constellation set is a complex-valued matrix of size N-by-L, where N is a number of transmitting antennas and L is a length of transmission.
The method includes expanding the constellation set of codewords with a set of basis functions to produce a basis-expanded constellation set, wherein the set of basis functions includes a Fourier exponential basis function in a frequency domain, a Legendre polynomial basis function in a time domain, and a Fourier-Legendre product basis function in the frequency domain, wherein the Fourier-Legendre product basis function is a function of element-wise products of the Legendre polynomial basis function and the Fourier exponential basis function over the frequency domain; projecting a received modulated data symbol onto orthogonal complements of the basis expanded constellation set to obtain a set of distance metric of a generalized likelihood ratio test (GLRT) for each codeword of the constellation set; selecting a codeword corresponding to a minimal distance metric or a maximal correlation metric; and decoding the data symbol from the received modulated data symbol using the codeword.
Another embodiment discloses a receiver having a set of antennas for receiving a radio frequency (RF) signal from a transmitter via doubly-selective fading channel, wherein the RF signal includes a sequence of data symbols, each data symbol is space-time modulated with a corresponding codeword from a constellation set of codewords, wherein each codeword in the constellation set is a complex-valued matrix. The receiver comprises an RF circuit for down-converting the received RF signal from a carrier frequency to produce a baseband signal, wherein a carrier offset between the carrier frequency at the receiver and the carrier frequency at the transmitter generates additional noise at the receiver; a filter having a time-reversed impulse response of a filter of the transmitter for filtering the baseband signal to produce a filtered signal, wherein a time offset between a clock of the filter of the receiver and a clock of the filter of the transmitter generates additional inter-carrier interference (ICI) at the receiver; a space-time demodulator for demodulating the filtered signal using a generalized likelihood ratio test (GLRT) with multi-dimensional basis expansion model (BEM) to produce demodulated signal including the most likely estimation of the data symbols modulated with the corresponding codeword, wherein the GLRT uses a projector matrix that is an orthogonal null space of each codeword of the constellation set expanded with a set of basis functions including a Fourier exponential basis function in a frequency domain modified with a Legendre polynomial basis function; and a forward error correction (FEC) decoder for decoding the demodulated signal to produce an estimate of the transmitted data symbols.
Yet another embodiment discloses a system for communicating a radio frequency (RF) signal via a doubly-selective fading channel including a transmitter for producing the RF signal including a sequence of data symbols, each data symbol is space-time modulated with a corresponding codeword from a constellation set of codewords, wherein each codeword in the constellation set is a complex-valued matrix, and for transmitting the RF signal over the doubly-selective fading channel; and a receiver for receiving the RF signal and for demodulating the data symbols using a generalized likelihood ratio test (GLRT) with multi-dimensional basis expansion model (BEM), wherein the GLRT uses projector matrices orthogonal to each codeword of the constellation set expanded with a set of basis functions, wherein the set of basis functions includes a Fourier exponential basis function in a frequency domain, a Legendre polynomial basis function in a time domain, and a Fourier-Legendre product basis function in the frequency domain, wherein the Fourier-Legendre product basis function is a function of element-wise products of the Legendre polynomial basis function and the Fourier exponential basis function over the frequency domain.



BRIEF DESCRIPTION OF THE DRAWINGS 
FIG. 1 is a block diagram of a method and system for non-coherent communications via doubly-selective fading MIMO channels according to some embodiments of the invention;
FIGS. 2A and 2B are block diagrams of a method for blind equalization with space-time demodulation for flat fading channels using principles employed by some embodiments of the invention;
FIG. 3A is a block diagram of a method for blind equalization with space-time demodulation based on multi-dimensional basis expansion model (BEM) to account for statistical dependency of distribution of doubly-selective fading channels according to some embodiments of the invention;
FIG. 3B is a block diagram of a method for blind equalization with space-time demodulation based on multi-dimensional BEM to account for statistical dependency of distribution of timing and carrier offsets according to some embodiments of the invention;
FIG. 4 is a flow chart of a method for a linear-complexity blind equalization with space-time demodulation using successive null-projection block update according to some embodiments of the invention;
FIG. 5 is a block diagram of a transceiver according to some embodiments of the invention; and
FIGS. 6A, 6B and 6C are examples of the basis extension matrix used by some embodiments of the invention.



DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
System and Method Overview
FIG. 1 shows a block diagram of a method and a system for wireless communications between a transmitter 100 and a receiver 105 via a multiple-input multiple-output (MIMO) doubly-selective channel 150, that is subject to time-varying fading and multi-path delays for transceivers equipped with multiple antennas, according to some embodiments of the invention. The time-varying fading causes time-selective channels with inter-carrier interference (ICI), and the multi-path delays cause frequency-selective channels with inter-symbol interference (ISI). Some embodiments of the invention can transmit high-speed data even for the case where the transceivers move extremely fast, e.g., for cellular telephones carried in bullet trains and airplanes. Moreover, one embodiment of the invention can realize non-coherent transmissions, which do not rely on any pilot symbols or training sequences used for estimating channel state information (CSI).
At the transmitter 100, a sequence of data symbols 101, i.e., s, is encoded by a forward-error correction (FEC) encoder 110 to produce a sequence of encoded data symbols, i.e., c. The FEC encoder 110 can use capacity-approaching codes, e.g., low-density parity-check (LDPC) codes, turbo codes, repeat-accumulate codes, or other similar codes. For latency-critical applications, short-length FEC codes, e.g., Bose-Chaudhuri-Hocquenghem, Reed-Muller, Reed-Solomon, and Preparata codes, may apply. The FEC encoder 110 typically uses a generator matrix 111, i.e., G, which is multiplied by the data symbols s in an algebraic domain, e.g., with a non-binary Galois field or Lee ring. The encoded data c include some parity symbols appended by the generator matrix G so that the receiver 105 can recover the original data s as decoded data s′ 106 even in the presence of errors over the wireless networks.
The encoded data symbols c are block-wise modulated by a space-time modulator 120 to produce a sequence of modulated data symbols, i.e., x. The space-time modulator uses a Q-ary constellation set 121 of ={X1, X2, . . . , XQ}, wherein a codeword Xq is a complex-valued matrix of size N-by-L, where N is the number of transmitter antennas and L is the length of block transmissions. The modulation cardinality Q determines the maximum data rate; a bit per symbol rate is defined as log2(Q)/L. In some embodiments of the invention, the space-time modulator uses a Grassmannian block code such that each codeword is orthogonal to be Xq†Xq=IL, where [.]† denotes a conjugate transpose and IL is an identity matrix of size L.
The space-time modulation is based on a constellation set ={X1, X2, . . . , XQ} 121 using space-time coding (STC), such as space-time block code (STBC), space-frequency block code (SFBC), and space-time-frequency block code (STFBC). For example, the Grassmannian block code is realized by an exponential conformal mapping or by the Caylay transform of a skew-Hermitian matrix. The block code can also include quasi-unitary beta-distributed space-time modulations, and can be concatenated with trellis coding. For example, the Grassmannian block codes can enable non-coherent communications, in which no pilot symbols are required, because of the orthogonality of the block code. Therefore, the spectral efficiency loss due to pilot insertion overheads can be avoided. In one embodiment, a few pilot symbols with small overheads are optionally inserted to improve performance.
The sequence of modulated data symbols x are submitted into a band-pass filter 130 to produce a sequence of filtered symbols u by multiplying a precoding matrix 131, i.e., F. For example, one embodiment uses a root-raised cosine filter. In some embodiments of the invention, to suppress the impact of ISI, the precoding matrix F uses the discrete Fourier transform as a method of orthogonal-frequency-division multiplexing (OFDM), with or without cyclic prefix. For example, the precoding matrix based on the Fourier transform includes




  
    
      
        [
        F
        ]
      
      
        i
        ,
        j
      
    
    =
    
      
        1
        
          L
        
      
      ⁢
      
        exp
        ⁡
        
          (
          
            j
            ⁢
            
              
            
            ⁢
            2
            ⁢
            π
            ⁢
            
              
            
            ⁢
            
              ij
              /
              L
            
          
          )
        
      
    
  
  ,




wherein [.]i,j denotes the (i,j)-th element of a matrix and j=√{square root over (−1)} is an imaginary unit. In another embodiment, the other precoding and filtering with power and rate adaptation over space, time, and frequency domains can be applied concurrently. For example, unitary spatial precoding to reduce the impact of antenna correlation can be used in addition to the OFDM precoding.

The filtered symbols u are up-converted and amplified to the radio-frequency (RF) signal by an RF circuit 140 and transmitted via the channel by N transmitting antennas. The number of antennas N can be any arbitrary integer greater than or equal to one. The RF circuit produces the RF signal having a carrier frequency 141 of fc. As an example, the carrier frequency is about 2.4 GHz. The RF signals are transmitted to the receiver 105 through the wireless channel 150.
For wideband mobile communications, the wireless channel 150 is doubly-selective fading channel, in which time-varying fading causes time-selective channels with ICI and multi-path delays cause frequency-selective channels with ISI. From physics, the channel matrix H has some statistical property 151 in both time and frequency domains.
The channel statistics 151 over the time domain can be characterized by the Doppler power spectrum. For example, the relative velocity between the transmitter and the receiver can determine the maximum possible Doppler frequency as fD=fcv/c0, where fD is the maximum Doppler frequency, v is the relative velocity, and c0 is the speed of light in the air. For rich-scattering environments, the distribution of the Doppler frequency is modeled by Jakes model, in which the time-varying fading over the time domain has an auto-correlation function characterized by the zero-th order Bessel function of the first kind as J0 (2πfDτ), where τ is the time difference. In particular for mobile transceivers moving fast, e.g., in planes and bullet trains, the time-varying fading causes non-negligible time-selective channels with strong ICI.
Depending on environmental conditions such as locations, velocities, and materials of scattering objects, the channel matrix H has a specific delay power spectrum due to multi-path delays, which cause frequency-selective channels. In particular for wideband transmissions, the frequency-selective channels cause strong ISI. The channel statistics 151 over the frequency domain can be characterized by the delay power spectrum. For example, the delay power spectrum is modeled by an exponential decay, in which the average power of the multi-paths exponentially degrades as the delay increases.
With a set of receiving antennas and RF circuits 160, the receiver 105 receives the transmitted RF signals impaired by amplifier noise and channel fading during the transmission via the wireless channel 150. The number of receiving antennas is denoted as M, which can be any arbitrary integer grater than or equal to one. The receiver can include at least one processor for performing functions of one or multiple modules of the receiver.
The RF circuit 160 down-converts the received RF signal to produce a sequence of baseband received signals r, using a carrier frequency 161 of f′c. The receiver carrier frequency 161 is equal to the transmitter carrier frequency 141. However, having an identical carrier frequency at both the transmitter 100 and the receiver 105 is practically difficult due to hardware imperfection for clock circuits, e.g., crystal oscillators. The carrier offset has a certain statistical property 152 derived from the law of physics. For example, the uncertainty of carrier frequency for some crystal oscillators can be modeled by the Cauchy-Lorentz distribution. The offset between these carrier frequencies, i.e., δf=f′c−fc, creates an additional phase noise at the receiver. The issue of the carrier offset is addressed by the methods employed by some embodiments of the invention.
The baseband received signals r are passed through a receiver filter 170 to produce a sequence of filtered received signals y. The receiver filter 170 can be based on a matched filter, which has a time-reversed impulse response of the transmitter filter 130. For example, the receiver filter 170 uses a precoding matrix 171, which is a conjugate transpose of the transmitter precoding matrix F 131. When multiplying the precoding matrix with the baseband received signals r, the receiver needs a block-wise timing synchronization. Due to clock circuit imperfections and a propagation delay over the wireless channels, the timing synchronization is difficult to be achieved in practice. The timing offset has a certain statistical property 152, such as the Cauchy-Lorentz distribution. The uncertain timing offset creates an additional ICI. The issue of the timing offset is also addressed by the methods employed by some embodiments of the invention.
The filtered received signals y are submitted into a space-time demodulator 180 to produce a sequence of demodulated signals c′. The space-time demodulator 180 estimates the most likely data symbol c modulated by the space-time modulator 120. To realize non-coherent MIMO communications, the space-time demodulator performs blind equalization without knowledge of instantaneous channel state information H. For example, some embodiments of the invention use a generalized likelihood ratio test (GLRT) with multi-dimensional basis expansion model (BEM). The GLRT blind equalization uses a null-space projector set ={P1, P2, . . . , PQ} 181. The projector matrix is an orthogonal null space of each codeword of the space-time constellation set ={X1, X2, . . . , XQ} 121 such that Xq Pq=0 holds.
To account for doubly-selective fading channels, the projector matrix is generated by multi-dimensional BEM, which can use channel statistics knowledge 151. The multi-dimensional BEM is based on Legendre polynomial basis in the time domain, but on Fourier exponential basis in the frequency domain. In addition, to account for the timing and carrier offsets, the BEM is also based on the statistical knowledge of the offsets 152. For example, to account for the timing offset, some embodiments of the invention modify the Fourier basis of the frequency domain of the BEM with a product of the Legendre polynomial basis functions. Also, some embodiments of the invention account for the carrier offset by increasing the number of the Legendre basis functions considered in the time domain of the BEM.
The demodulated signals c′ are decoded by an FEC decoder 190 to produce the decoded data s′ 106 for the estimate of the transmitted data symbols s 101. For example, the FEC decoder uses belief propagation for LDPC codes. The belief propagation uses an iterative message-passing algorithm based on a sparse graph represented by a parity-check matrix Hp 191. The parity-check matrix Hp 191 is an algebraic null-space projection of the generator matrix G 111, such that HpG=0 over the Galois field or the Lee ring. The FEC decoder can correct some possible errors in the demodulated signals c′.
In one embodiment, the soft-decision information at the FEC decoder 190 is fed back 192 to the space-time demodulator 180 to refine the demodulated signals. This loop can iterate until a termination condition is reached. For example, the termination condition is based on the convergence of the data likelihood, or a predetermined number of iterations.
Space-Time Demodulation with GLRT
FIG. 2A shows a schematic of the space-time demodulation 180 for the non-coherent MIMO equalization based on GLRT having some principles employed by some embodiments of the invention. The method of FIG. 2A can demodulate space-time constellations without using any pilot symbols and training sequences, but is suboptimal for handling doubly-selective fading channels and timing/carrier offsets.
For the transmission via flat fading channels, the filtered signals y over L symbols can be expressed as

Y=HX+Z, 

where Y=[y1, y2, . . . , yL] is the filtered signal matrix of size M-by-L, X is the transmitted space-time modulation from the constellation set of , and Z is an additive noise matrix of the same size. In some embodiments, the transmitter and receiver precoding matrices over the time domain are unitary such that FF†=IL. The noise includes, e.g., thermal noise at the receiver amplifier, and can follow the circular-symmetry complex Gaussian distribution with a covariance of [ZZ†]=σ2IL. For the coherent communications, the receiver can estimate the instantaneous CSI matrix H by using pilot symbols or training sequences, and demodulates as follows





  
    
      q
      ′
    
    =
    
      arg
      ⁢
      
        
      
      ⁢
      
        
          min
          
            q
            ∈
            
              {
              
                1
                ,
                2
                ,
                ...
                ,
                Q
              
              }
            
          
        
        ⁢
        
          
            
            
              Y
              -
              
                HX
                q
              
            
            
          
          2
        
      
    
  
  ,




where the receiver searches for the most likely constellation having the minimum Euclidean distance.

The coherent communications require pilot symbols to estimate CSI. To avoid using pilot symbols, the space-time demodulator 210 employing GLRT uses the null-space projector set ={P1, P2, . . . , PQ} 181, and searches for the most likely data symbol of the received signal 213 corresponding to the minimum norm 217 over all possible norm metrics 214, 215, and 216 as follows




  
    
      q
      ′
    
    =
    
      arg
      ⁢
      
        
      
      ⁢
      
        
          min
          
            q
            ∈
            
              {
              
                1
                ,
                2
                ,
                ...
                ,
                Q
              
              }
            
          
        
        ⁢
        
          
            
            
              YP
              q
            
            
          
          2
        
      
    
  
  ,




where the null-space projector matrix 181 is orthogonal to each codeword constellation 121 such that XqPq=0 212. For example, the null-projector matrix can be generated 211 from the constellation as follows

Pq=IL−Xq†(XqXq†)−1Xq,

where the projector matrix is a size of L-by-L. Since the null-space projection is not unique, there are many other expressions. Moreover, the minimum possible size of null-space projection matrix is L-by-(L−N) because the codeword constellation already uses N basis vectors. Because of the orthogonality and in the absence of the noise, the GLRT norm metric becomes zero regardless of the values of the CSI matrix H.

Thus, the GLRT blind equalization can demodulate the data even without any CSI matrix knowledge. Because the receiver is impaired by the amplifier noise Z, in practice, the product of the filtered received signal block Y with the null-space projector matrix Pq can be non-zero, but still smaller than the product of Y with the other projector matrix of different constellation Pq, with a high probability.
FIG. 2B shows the space-time demodulator 220 employing the simplified GLRT, which does not need the null-space projector matrix ={P1, P2, . . . , PQ} but the constellation set ={X1, X2, . . . , XQ} 211 directly. If the codeword constellation is the Grassmannian manifold such that Xq†Xq=IL 222, the GLRT blind equalization can be simplified without any performance degradation. The simplified GLRT performs a correlator to search for the most likely data having the maximum norm 227 over all possible correlation metrics 224, 225, and 226 as follows




  
    q
    ′
  
  =
  
    arg
    ⁢
    
      
    
    ⁢
    
      
        min
        
          q
          ∈
          
            {
            
              1
              ,
              2
              ,
              ...
              ,
              Q
            
            }
          
        
      
      ⁢
      
        
          
            
            
              YX
              q
              †
            
            
          
          2
        
        .
      
    
  




Multi-Dimensional BEM for Doubly-Selective Fading Channels
Some embodiments of the invention are based on a recognition that the space-time demodulation of FIGS. 2A and 2B is suboptimal for handling time- and frequency-selective fading channels because the orthogonal feature cannot be exploited due to a shorter coherence time and coherence bandwidth. To solve this problem, the data symbols are decoded using GRLT equalization method with basis expansion model (BEM). With BEM, non-coherent communications can be realized even for fast time-varying fading channels or for dispersive frequency-selective fading channels.
However, this GRLT equalization method with BEM performs well for singly-selective fading channels not doubly-selective fading channels. Some embodiments of the invention use a multi-dimensional BEM to cope with doubly-selective fading channels, by introducing two different kinds of basis functions over time and frequency domains. These embodiments of the invention are based on a realization that the channel fluctuations over the time and frequency domains have a certain statistical dependency characterized by time-frequency auto-correlation functions and a few dominant basis functions in the channel statistics are sufficient for data recovery even without knowing the instantaneous CSI.
FIG. 3A shows a schematic of the space-time demodulator employing GLRT with multi-dimensional BEM according to some embodiments of the invention. The steps of the space-time demodulator 310 is based on the null-space projection as q′=arg minqε{1, 2, . . . , Q}∥YPq∥2, which is analogous to the space-time demodulator 210 in FIG. 2A, given the null-space projector set ={P1, P2, . . . , PQ} 332. This embodiment of the invention uses the channel statistics 151 to generate a different null-space projector set 332 by a basis expansion 331 for each codeword constellation 211. More specifically, the null-space projector matrix Pq is not only orthogonal to the space-time constellation Xq but also orthogonal to a basis-expanded constellation XqBd, where Bd is the d-th basis expansion matrix of size L-by-L. With the basis expansion matrices {B1, B2, . . . , BD} based on the channel statistics 151, the basis expansion 331 is carried out for each constellation Xq 211 to produce a full basis-expanded constellation X′q as follows:




  
    
      X
      q
      ′
    
    =
    
      
        [
        
          
            
              
                X
                q
              
            
          
          
            
              
                
                  X
                  q
                
                ⁢
                
                  B
                  1
                
              
            
          
          
            
              ⋮
            
          
          
            
              
                
                  X
                  q
                
                ⁢
                
                  B
                  D
                
              
            
          
        
        ]
      
      =
      
        
          (
          
            
              I
              
                D
                +
                1
              
            
            ⊗
            
              X
              q
            
          
          )
        
        ⁢
        B
      
    
  
  ,




where an operator  denotes a Kronecker product, and B is a full basis expansion matrix of size L(D+1)-by-L, comprising of {IL, B1, B2, . . . , BD}. The number D of basis expansion matrices depends on the channel statistics, but is constrained as N(D+1)<L due to the theoretical limitation of degrees of freedom in the null-space. The full basis-expanded constellation X′q is a size of N(D+1)-by-L. The null-space projector matrix Pq 332 is orthogonal to the full basis-expanded constellation X′q, e.g., as follows:

Pq=IL−X′q†(X′qX′q†)−1X′q,

where the projector matrix is a size of L-by-L.

The channel statistics 151 are based on physics and environments, and define the Doppler power spectrum and the delay power spectrum. According to the Doppler power spectrum, the channel varies in the time domain, whereas the channel varies in the frequency domain according to the delay power spectrum. The channel variations are based on a stochastic random process, but there is a statistical dependency over the time and frequency domains according to time-frequency auto-correlation functions. For the Jakes model, the time auto-correlation function can be expressed as the Bessel function, whose Taylor-Maclaurin series expansion is written as




  
    
      
        J
        0
      
      ⁡
      
        (
        
          2
          ⁢
          π
          ⁢
          
            
          
          ⁢
          
            f
            D
          
          ⁢
          τ
        
        )
      
    
    =
    
      
        
          ∑
          
            m
            =
            0
          
          ∞
        
        ⁢
        
          
            
              (
              
                -
                1
              
              )
            
            m
          
          ⁢
          
            
              (
              
                
                  π
                  ⁢
                  
                    
                  
                  ⁢
                  
                    f
                    D
                  
                  ⁢
                  τ
                
                
                  m
                  !
                
              
              )
            
            
              2
              ⁢
              
                
              
              ⁢
              m
            
          
        
      
      =
      
        1
        -
        
          
            (
            
              π
              ⁢
              
                
              
              ⁢
              
                f
                D
              
              ⁢
              τ
            
            )
          
          2
        
        +
        
          
            1
            4
          
          ⁢
          
            
              (
              
                π
                ⁢
                
                  
                
                ⁢
                
                  f
                  D
                
                ⁢
                τ
              
              )
            
            4
          
        
        +
        ...
      
    
  
  ⁢
  
    
  
  ,




which suggests that the stochastic random process can be well described by a set of polynomial basis functions for each term. The first constant term corresponds to the zero-th order polynomial function with an eigenvalue of L. And, the second quadratic term corresponds to the first order polynomial function with an eigenvalue of





  
    
      L
      6
    
    ⁢
    
      (
      
        
          L
          2
        
        -
        1
      
      )
    
    ⁢
    
      
        (
        
          π
          ⁢
          
            
          
          ⁢
          
            f
            D
          
          ⁢
          
            T
            s
          
        
        )
      
      2
    
  
  ,




where Ts is a symbol duration. Any arbitrary realization of the random time-varying channels can be expressed by a weighted sum of the Legendre basis functions. With the GLRT and BEM, no actual weight coefficients are needed to demodulate. Correspondingly, some embodiments of the invention use the discrete orthogonal Legendre polynomial (DOLP) basis functions in the time domain of BEM to account for time-varying fading channels.

For example, the m-th element of the n-th Legendre basis function is expressed as




  
    
      φ
      
        n
        ,
        m
      
    
    =
    
      
        
          
            
              (
              
                
                  2
                  ⁢
                  
                    
                  
                  ⁢
                  m
                
                +
                1
              
              )
            
            ⁢
            
              
                (
                
                  L
                  -
                  1
                
                )
              
              
                [
                m
                ]
              
            
          
          
            
              (
              
                L
                +
                m
              
              )
            
            
              [
              
                m
                +
                1
              
              ]
            
          
        
      
      ⁢
      
        
          ∑
          
            v
            =
            0
          
          m
        
        ⁢
        
          
            
              (
              
                -
                1
              
              )
            
            v
          
          ⁢
          
            (
            
              
                
                  m
                
              
              
                
                  v
                
              
            
            )
          
          ⁢
          
            (
            
              
                
                  
                    m
                    +
                    v
                  
                
              
              
                
                  v
                
              
            
            )
          
          ⁢
          
            
              n
              
                [
                v
                ]
              
            
            
              
                (
                
                  L
                  -
                  1
                
                )
              
              
                [
                v
                ]
              
            
          
        
      
    
  
  ,




where x[m]=x(x−1) . . . (x−m+1) is a factorial power. The basis expansion matrix 331 with the n-th Legendre basis function is generated as follows

Bn=F diag(φn,1,φn,2, . . . ,φn,L)F†,

where diag(.) denotes a diagonal matrix consisting of the arguments. Note that the precoder matrix F is multiplied to transform into the time domain. The Legendre basis function can approximate any realization of stochastic random process in the Jakes model up to reasonably fast fading channels, i.e., no more 10% maximum Doppler frequency normalized by block length. In one embodiment, the Legendre basis is modified to sinusoidal basis for extremely fast fading channels by calculating the dominant eigenvectors of the auto-correlation function. The time-domain basis (Legendre polynomial basis) is used to deal with ICI. For most fast fading channels, two-basis expansion is sufficient to address ICI.

As well as the time-domain basis expansion, the multi-dimensional BEM uses the frequency-domain basis expansion to account for ISI, according to the channel statistics 151. For exponentially decaying delay power spectrum, the auto-correlation function over the frequency domain can be expressed by the Fourier series as




  
    
      
        a
        -
        1
      
      
        
          a
          ⁢
          
            
          
          ⁢
          
            exp
            ⁡
            
              (
              
                j
                ⁢
                
                  
                
                ⁢
                2
                ⁢
                π
                ⁢
                
                  
                
                ⁢
                
                  fT
                  s
                
              
              )
            
          
        
        -
        1
      
    
    =
    
      
        (
        
          a
          -
          1
        
        )
      
      ⁢
      
        
          ∑
          
            m
            =
            0
          
          ∞
        
        ⁢
        
          
            a
            
              
                T
                s
              
              ⁢
              m
            
          
          ⁢
          
            exp
            ⁡
            
              (
              
                
                  -
                  j
                
                ⁢
                
                  
                
                ⁢
                2
                ⁢
                π
                ⁢
                
                  
                
                ⁢
                
                  fT
                  s
                
                ⁢
                m
              
              )
            
          
        
      
    
  
  ,




where





  a
  =
  
    10
    
      -
      
        α
        10
      
    
  




is the power delay profile at the symbol delay with a being the decay factor in dB. The above frequency-domain auto-correlation suggests that the stochastic random process over the frequency domain can be well approximated by a set of the Fourier exponential basis functions. The m-th element of the n-th Fourier basis function is expressed as





  
    
      ψ
      
        n
        ,
        m
      
    
    =
    
      
        1
        
          L
        
      
      ⁢
      
        exp
        ⁡
        
          (
          
            -
            
              
                j
                ⁢
                
                  
                
                ⁢
                2
                ⁢
                π
                ⁢
                
                  
                
                ⁢
                n
                ⁢
                
                  
                
                ⁢
                m
              
              L
            
          
          )
        
      
    
  
  ,




which is equivalent to the (n,m)-th entry of the Fourier transform matrix. In some embodiments of the invention, the basis expansion matrix 331 with the m-th Fourier basis function is generated as follows

Bm=diag(ψm,1,ψm,2, . . . ,ψm,L),

where the precoder matrix F is assumed to be the inverse Fourier transform matrix for OFDM such that the filtered received signal y is already transformed into the frequency domain.

Some embodiments of the invention use the multi-dimensional basis expansion 331 with both Legendre basis functions over the time domain and Fourier basis functions over the frequency domain depending on the channel statistics 151. To that end, the embodiments of the invention in FIG. 3A can account for both ISI and ICI in doubly-selective fading channels, by choosing dominant basis expansion matrices Bn to generate the full basis-expanded constellation X′q and the corresponding null-space projector matrix Pq.
In one embodiment, the channel statistics 331 provide the delay power spectrum, the Doppler power spectrum, the maximum Doppler frequency, or the root-mean-square multi-path delay. Notice that the actual maximum Doppler frequency does not change the basis functions expect for an unusual Doppler spectrum, but the required number of basis functions can change.
In another embodiment, the multi-dimensional basis expansion 331 uses the Legendre basis over the time domain, and the Fourier basis over the frequency domain regardless of the actual channel statistics. For example, predetermined number (e.g., 2 or 3) of Legendre basis and Fourier basis functions can be used for doubly-selective fading channels even without any knowledge of channel statistics. In one embodiment, considering a spatial auto-correlation function, the multi-dimensional BEM uses a set of basis functions over the spatial domain to deal with a spatial correlation caused by line-of-sight channels or antenna coupling.
Multi-Dimensional BEM for Timing and Carrier Offset Recovery
Although the embodiments in FIG. 3A can deal with doubly-selective fading channels, the performance can further degrade when there is timing offset and carrier offset. Some embodiments of the invention provide a method for non-coherent transmission via doubly-selective channels accounting for the timing offset and the carrier offset between the transmitter and the receiver. The embodiments are based on a realization that statistical dependency of the channels used in recovery of the transmitted data can be modified with statistical dependency of distribution of the timing and carrier offsets. In such a manner, the statistical recovery of the transmitted data considers the probable offsets values without using any additional exchange of synchronization data.
FIG. 3B shows a block diagram of the space-time demodulator 180 using a modified multi-dimensional basis expansion 341 that accounts for the statistical dependency of distribution of the timing and carrier offsets 152 according to some embodiments of the invention. The space-time demodulator provides the most likely data by finding a minimum norm value among all possible products of the filtered received signals block Y with corresponding projector matrices Pq 332. These steps are identical to the space-time demodulator 210 in FIG. 2A. Each projector matrix Pq 332 is produced based on the multi-dimensional basis expansion 341 of a corresponding constellation Xq 211 such that the product of the projector matrix Pq 332 with a full basis-expanded constellation X′q 341 is zero or near-zero within some precision digits.
To account for ISI and ICI in doubly-selective fading channels, the multi-dimensional basis expansion 341 first uses the channel statistics 151. For example, the Legendre basis functions and the Fourier basis functions are used in the time domain and the frequency domain, respectively. Next, in accordance with the realization that statistics of the timing and carrier offsets 152 resemble the statistics of the distribution of the Doppler frequency, further expand the constellation with other basis functions to account for the timing and carrier offsets. In that regard, the null-space projector matrices 332 are also modified to result in zero value products with the corresponding basis-expanded constellations.
The timing offset causes phase noise over the frequency domain, and the carrier offset causes phase rotation over the time domain. The statistics of both the timing offset and the carrier offset are usually based on hardware imperfection of clock circuits, e.g., phase-locked loop with crystal oscillators. The distribution of the timing offset can be the Cauchy-Lorentz distribution, the Gaussian distribution, the uniform distribution, 2-point, or 3-point distributions depending on the hardware and system. The phase noise over the frequency domain due to the timing offset has a certain auto-correlation function.
For example, the auto-correlation functions are expressed as




  
    E
    ⁡
    
      [
      
        exp
        ⁡
        
          (
          
            j
            ⁢
            
              
            
            ⁢
            2
            ⁢
            π
            ⁢
            
              
            
            ⁢
            f
            ⁢
            
              
            
            ⁢
            δ
          
          )
        
      
      ]
    
  
  =
  
    {
    
      
        
          
            
              
                exp
                ⁡
                
                  (
                  
                    
                      -
                      2
                    
                    ⁢
                    
                      
                        (
                        
                          π
                          ⁢
                          
                            
                          
                          ⁢
                          f
                          ⁢
                          
                            
                          
                          ⁢
                          Δ
                        
                        )
                      
                      2
                    
                  
                  )
                
              
              =
              
                1
                -
                
                  2
                  ⁢
                  
                    
                      (
                      
                        π
                        ⁢
                        
                          
                        
                        ⁢
                        f
                        ⁢
                        
                          
                        
                        ⁢
                        Δ
                      
                      )
                    
                    2
                  
                
                +
                ...
              
            
            ⁢
            
              
            
            ,
          
        
        
          
            Gaussian
            ,
          
        
      
      
        
          
            
              
                sin
                ⁢
                
                  
                
                ⁢
                
                  c
                  ⁡
                  
                    (
                    
                      2
                      ⁢
                      
                        
                      
                      ⁢
                      π
                      ⁢
                      
                        
                      
                      ⁢
                      f
                      ⁢
                      
                        
                      
                      ⁢
                      Δ
                    
                    )
                  
                
              
              =
              
                1
                -
                
                  
                    2
                    3
                  
                  ⁢
                  
                    
                      (
                      
                        π
                        ⁢
                        
                          
                        
                        ⁢
                        f
                        ⁢
                        
                          
                        
                        ⁢
                        Δ
                      
                      )
                    
                    2
                  
                
                +
                ...
              
            
            ⁢
            
              
            
            ,
          
        
        
          
            Uniform
            ,
          
        
      
      
        
          
            
              
                
                  cos
                  2
                
                ⁡
                
                  (
                  
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    f
                    ⁢
                    
                      
                    
                    ⁢
                    Δ
                  
                  )
                
              
              =
              
                1
                -
                
                  
                    (
                    
                      π
                      ⁢
                      
                        
                      
                      ⁢
                      f
                      ⁢
                      
                        
                      
                      ⁢
                      Δ
                    
                    )
                  
                  2
                
                +
                ...
              
            
            ⁢
            
              
            
            ,
          
        
        
          
            
              3
              ⁢
              Point
            
            ,
          
        
      
      
        
          
            
              
                cos
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    π
                    ⁢
                    
                      
                    
                    ⁢
                    f
                    ⁢
                    
                      
                    
                    ⁢
                    Δ
                  
                  )
                
              
              =
              
                1
                -
                
                  2
                  ⁢
                  
                    
                      (
                      
                        π
                        ⁢
                        
                          
                        
                        ⁢
                        f
                        ⁢
                        
                          
                        
                        ⁢
                        Δ
                      
                      )
                    
                    2
                  
                
                +
                ...
              
            
            ⁢
            
              
            
            ,
          
        
        
          
            
              2
              ⁢
              Point
            
            ,
          
        
      
    
  




for the Gaussian distribution with a standard deviation of , the uniform distribution, the 3-point distribution, and 2-point distribution with a maximum offset of , respectively. The Taylor-Maclaurin series expansion suggests that a stochastic random process of the phase noise for these different distributions can be well described by the Legendre polynomial basis functions as the Doppler frequency distribution of Jakes model. Comparing to the Jakes Doppler power spectrum, the phase noise due to the timing offset may have a different eigenvalue depending on the distribution, but the basis functions do not change for all different distributions.

From the above statistical viewpoint of the timing and carrier offsets, some embodiments of the invention introduce other basis functions, which are the element-wise product of the Legendre basis functions and the Fourier basis functions over the frequency domain. This new basis functions can account for ISI due to the frequency-selective channels and also phase noise due to the timing offset. The basis expansion matrix 341 for the new basis functions is expressed as

Bnm=diag(φn,1ψm,1,φn,2ψm,2, . . . ,φn,2ψm,L),

which is a diagonal matrix in the frequency domain, and the diagonal entry is a product of the n-th Legendre basis function φn and the m-th Fourier basis function ψm. To account for the phase noise due to the carrier offset, the methods do not introduce new basis functions, but the number of the Legendre basis functions can be increased in the time domain because the time-domain basis functions for both ICI and the carrier offset are the Legendre basis functions.

As a practical consequence of the method in FIG. 3B, the null-space projector matrix set  332 has specific properties. More specifically, the values of the projector matrix Pq are selected such that a product of the projector matrix Pq with the original constellation matrix Xq is zero, and products of the projector matrix Pq with the basis-expanded constellation matrix XqBd are also zero (within practical precision digits). For example, the projector matrix is generated as Pq=IL−X′q†(X′qX′q†)−1X′q for the full basis-expanded constellation X′q. The basis expansion matrix Bd is based on three kinds of basis functions; the Legendre basis function in the time domain to account for ICI and the carrier offset, the Fourier basis function in the frequency domain to account for ISI, and the Fourier-Legendre product basis function in the frequency domain to account for ISI and the timing offset.
Linear-Complexity Inflating-Block GLRT Blind Equalization
In some embodiments, the space-time modulator 120 uses differential space-time coding (DSTC) to generate the Q-ary Grassmannian constellations of size N-by-L. Suppose that the block length is relatively long to be a multiple of the number of antennas as L=N, where  is an integer greater than one. The DSTC provides a scalable method for a successive construction of the high-order long Grassmannian constellation by a smaller set of unitary matrices of size N-by-N. For example, the unitary constellation is obtained by an exponential mapping of a skew-Hermitian matrix as follows:

Um=exp(Σ[ck]Ak−[ck]*Ak†),

where exp(.) is a matrix exponential function, [.] is a standard quadrature-amplitude modulation (QAM), and Ak is a pre-defined matrix of size N-by-N. Alternatively, the unitary constellation is generated by a Caylay transform of a skew-Hermitian matrix. The cardinality of the unitary constellations can be reduced to





  
    Q
    ′
  
  =
  
    Q
    
      1
      
        L
        -
        1
      
    
  




to send a data rate of log2(Q)/L. The unitary matrix of size N-by-N is sequentially multiplied to construct the Grassmannian constellation Xq of size N-by-L as follows

Xq=[IN,U1,U1U2,U1U2U3, . . . ,Πm=1-1Um].

In some embodiments of the invention, with the above successive modulation based on unitary constellations, the space-time demodulator 180 is also simplified to have a linear complexity for blind equalization. The methods can reduce the computational complexity if the cardinality Q is extremely large to perform brute-force search over all possible norm metrics for GLRT.
FIG. 4 shows a flow chart of the successive space-time demodulation according to these embodiments of the invention. The methods of the space-time demodulation use a set of unitary constellation Um 121. The codeword is initialized as Xq=[IN, 0, 0, 0, . . . , 0] at the beginning. The codeword is first updated 410 as Xq=[IN, U1, 0, 0, . . . , 0] for the next symbol 430. This codeword is expanded 341 by the multi-dimensional BEM, which uses the Legendre basis functions, the Fourier basis functions, and the Fourier-Legendre product basis functions according to the channel statistics 151 and the timing/carrier offset statistics 152. Based on the full basis-expanded constellation X′q, the corresponding null-space projector matrix is generated 334, e.g., by

Pa=IL−X′q†(X′qX′q†)−1X′q.

The minimum norm metric is searched by the space-time demodulator employing GLRT 210, as q′=arg minqε{1, 2, . . . , Q′}∥YPq∥2, where the number of metric computations is greatly reduced from the original GLRT of Q to the successive GLRT of Q′.
To avoid discarding potential minimum values over the all cardinality of Q by hard decision, some embodiments retain a few candidates 420 as a method of soft-decision M-algorithm. For example, as well as the most likely data, which give the minimum norm metric, several data which also have small norm metrics are considered as candidates for the next symbols. The retained candidates are successively updated 410 by increasing the non-zero entry in the codeword constellation Xq. For example, the next codeword is updated as Xq=[IN, U1, U1 U2, 0, . . . , 0] for the second unitary matrix U2. The next symbol is not necessarily the consecutive symbol. In one embodiment, the next symbol is selected 430 depending on the expected signal power. For example, the next codeword can be updated reversely as Xq=[IN, U1, 0, . . . , 0, U2]. The successive GLRT computes the basis-expanded constellation and the null-space projector matrix in real-time, and the computational complexity for the minimum value search in GLRT can be reduced to a linear order.
In yet another embodiment, when precise channel statistics are available, the null space projection can be improved to generalized nulling with a noise variance and eigenvalues of the channel covariance. The multi-dimensional basis expansion provides an equivalent signal model as follows

Y=H′X′+Z′, 

where H′ is an equivalent channel matrix after basis expansion, and Z′ is an equivalent noise including the approximation error of the basis expansion. This embodiment uses the different metric for GLRT rather than ∥YPq∥2. For example, the modified GLRT uses the noise variance information if available as follows





  
    
      q
      ′
    
    =
    
      
        arg
        ⁢
        
          
        
        ⁢
        
          
            min
            
              q
              ∈
              
                {
                
                  1
                  ,
                  2
                  ,
                  ...
                  ,
                  Q
                
                }
              
            
          
          ⁢
          
            tr
            ⁡
            
              [
              
                
                  Y
                  †
                
                ⁢
                
                  
                    Y
                    ⁡
                    
                      (
                      
                        
                          
                            σ
                            2
                          
                          ⁢
                          
                            I
                            L
                          
                        
                        +
                        
                          
                            X
                            q
                            ′
                          
                          ⁢
                          
                            X
                            q
                            
                              ′
                              ⁢
                              
                                
                              
                              ⁢
                              †
                            
                          
                        
                      
                      )
                    
                  
                  
                    -
                    1
                  
                
              
              ]
            
          
        
      
      +
      
        log
        ⁢
        
          
        
        ⁢
        
          det
          ⁡
          
            [
            
              
                
                  σ
                  2
                
                ⁢
                
                  I
                  L
                
              
              +
              
                
                  X
                  q
                  ′
                
                ⁢
                
                  X
                  q
                  ′†
                
              
            
            ]
          
        
      
    
  
  ,




where tr[.] is a matrix trace, and det[.] is a matrix determinant. This metric is based on the maximum likelihood, and the performance can be improved by accounting for the noise variance.

FIG. 5 shows a block diagram of a transceiver 501 according to some embodiments of the invention. The transceiver 501 includes, e.g., a receiving 520, transmitting 530 circuits, a processor 510 for signal processing, and a memory 540 for storing encoding/decoding and modulating/demodulating data. For example, the memory can store 550 the constellation set used for modulating the data symbols. Additionally or alternatively, the memory can store the projectors matrices predetermined for demodulating the codewords according to various embodiments of the invention.
For example, the memory 540 stores 550 each projector matrix predetermined for the constellation set, such that a product of the projector matrix with the corresponding codeword is zero, and a product of the projector matrix with the corresponding codeword multiplied by a basis extension matrix is also zero. In some embodiments, the basis extension matrix includes a Legendre polynomial basis matrix, a Fourier exponential basis matrix, and a Fourier-Legendre product basis matrix.
FIGS. 6A, 6B and 6C show non-limiting examples of the basis extension matrix according to some embodiments of the invention. FIG. 6A shows an example of a Legendre polynomial basis matrix 610, wherein values on a diagonal of the Legendre polynomial basis matrix form a polynomial function. FIG. 6B shows an example of a Fourier exponential basis matrix 620, wherein values on a diagonal of the Fourier exponential basis matrix form a Fourier exponential function. FIG. 6C shows an example of a Fourier-Legendre product basis matrix 630, wherein values on a diagonal of the Fourier-Legendre product basis matrix are formed by an element-wise product of the Legendre polynomial basis and the Fourier exponential basis matrixes.
Although the invention has been described by way of examples of preferred embodiments, it is to be understood that various other adaptations and modifications can be made within the spirit and scope of the invention. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention.

## Claims

1. A method for decoding data symbols received at a receiver via doubly-selective fading channel in a multiple-input multiple output (MIMO), and wherein each data symbol is space-time modulated with a corresponding codeword from a constellation set of codewords, wherein each codeword in the constellation set is a complex-valued matrix of size N-by-L, where N is a number of transmitting antennas and L is a length of transmission, where N and L are non-zero positive integers, comprising:
expanding the constellation set of codewords with a set of basis functions to produce a basis-expanded constellation set, wherein the set of basis functions includes a Fourier exponential basis function in a frequency domain, a Legendre polynomial basis function in a time domain, and a Fourier-Legendre product basis function in the frequency domain, wherein the Fourier-Legendre product basis function is a function of element-wise products of the Legendre polynomial basis function and the Fourier exponential basis function over the frequency domain;
projecting a received modulated data symbol onto orthogonal complements of the basis expanded constellation set to obtain a set of distance metric of a generalized likelihood ratio test (GLRT) for each codeword of the constellation set;
selecting a codeword corresponding to a minimal distance metric or a maximal correlation metric; and
decoding the data symbol from the received modulated data symbol using the selected codeword.

2. The method of claim 1, wherein the expanding further comprises:
increasing a number of the Legendre polynomial basis functions considered in the time domain depending on statistics of carrier offset.

3. The method of claim 1, further comprising:
modifying the GLRT with a variance of noise of the channel and eigenvalues of covariance of the channel.

4. The method of claim 1, wherein the expanding of each codeword Xq from the constellation comprises:
determining a basis-expanded codeword X′q according to





  
    
      X
      q
      ′
    
    =
    
      
        [
        
          
            
              
                X
                q
              
            
          
          
            
              
                
                  X
                  q
                
                ⁢
                
                  B
                  1
                
              
            
          
          
            
              ⋮
            
          
          
            
              
                
                  X
                  q
                
                ⁢
                
                  B
                  D
                
              
            
          
        
        ]
      
      =
      
        
          (
          
            
              I
              
                D
                +
                1
              
            
            ⊗
            
              X
              q
            
          
          )
        
        ⁢
        B
      
    
  
  ,




where an operator  denotes a Kronecker product, and B is a full basis expansion matrix comprising {IL, B1, B2, . . . , BD}, wherein D is a number of basis expansion matrices constrained as N(D+1)<L, IL is an identity matrix of size L, wherein L is a length of a transmitted block, and N is a number of transmitting antennas, where N and L are non-zero positive integers.

5. The method of claim 1, wherein the projecting comprises:
determining, for each basis-expanded codeword X′q, a null-space projector matrix Pq orthogonal to the basis-expanded codeword X′q, according to


Pq=IL−X′q†(X′qX′q†)−1X′q,



wherein be Xq†Xq=IL, where [.]† denotes a conjugate transpose, IL is an identity matrix of size L, L is a length of a transmitted block, where L is a non-zero positive integer, and wherein the projector matrix is a size of L-by-L; and
projecting the received modulated data symbol onto each projector matrix to determine the codeword corresponding to the minimal distance metric.

6. The method of claim 1, wherein the Legendre polynomial basis function is modified to sinusoidal basis by calculating dominant eigenvectors of an auto-correlation function, wherein at least two-basis expansion terms of the Fourier exponential basis function and the Legendre polynomial basis function are selected for the expanding.

7. The method of claim 1, wherein the expanding comprises:
determining a basis expansion matrix Bn for an n-th Legendre polynomial basis function over the time domain according to


Bn=F diag(φn,1,φn,2, . . . ,φn,L)F†,



wherein F is a precoding matrix, [.]† denotes a conjugate transpose, wherein the precoding matrix is unitary such that FF†=IL, wherein IL is an identity matrix of size L, L is a length of a transmitted block, where L is a non-zero positive integer, diag(.) denotes a diagonal matrix of arguments, wherein the m-th element of the n-th Legendre polynomial basis function is




  
    
      φ
      
        n
        ,
        m
      
    
    =
    
      
        
          
            
              (
              
                
                  2
                  ⁢
                  
                    
                  
                  ⁢
                  m
                
                +
                1
              
              )
            
            ⁢
            
              
                (
                
                  L
                  -
                  1
                
                )
              
              
                [
                m
                ]
              
            
          
          
            
              (
              
                L
                +
                m
              
              )
            
            
              [
              
                m
                +
                1
              
              ]
            
          
        
      
      ⁢
      
        
          ∑
          
            v
            =
            0
          
          m
        
        ⁢
        
          
            
              (
              
                -
                1
              
              )
            
            v
          
          ⁢
          
            (
            
              
                
                  m
                
              
              
                
                  v
                
              
            
            )
          
          ⁢
          
            (
            
              
                
                  
                    m
                    +
                    v
                  
                
              
              
                
                  v
                
              
            
            )
          
          ⁢
          
            
              n
              
                [
                v
                ]
              
            
            
              
                (
                
                  L
                  -
                  1
                
                )
              
              
                [
                v
                ]
              
            
          
        
      
    
  
  ,




where x[m]=x(x−1) . . . (x−m+1) is a factorial power, and v is an integer number;
determining a basis expansion matrix Bm for an m-th Fourier exponential basis function according to


Bm=diag(ψm,1,ψm,2, . . . ,ψm,L),



wherein the n-th element of the m-th Fourier exponential basis function is




  
    
      ψ
      
        n
        ,
        m
      
    
    =
    
      
        1
        
          L
        
      
      ⁢
      
        exp
        ⁡
        
          (
          
            -
            
              
                j
                ⁢
                
                  
                
                ⁢
                2
                ⁢
                π
                ⁢
                
                  
                
                ⁢
                n
                ⁢
                
                  
                
                ⁢
                m
              
              L
            
          
          )
        
      
    
  
  ,




wherein exp(.) is an exponential function, j is an imaginary unit, π is a constant; and
determining a basis expansion matrix Bnm for the Fourier-Legendre product basis function according to


Bnm=diag(φn,1ψm,1,φn,2ψm,2, . . . ,φn,2ψm,L),



wherein the basis expansion matrix Bn,m is a diagonal matrix in the frequency domain, and a diagonal entry is an element-wise product of the n-th Legendre polynomial basis function φn and the m-th Fourier exponential basis function ψm.

8. The method of claim 7, wherein the projecting comprises:
determining, for each codeword Xq, a projector matrix Pq such that a product of the projector matrix Pq with the codeword Xq is zero, and products of the projector matrix Pq with the basis-expanded matrices XqBn, XqBm, and Xq Bnm are zero.

9. The method of claim 1, further comprising:
determining the constellation set as a Grassmannian constellation Xq of size N-by-L, wherein N is a number of transmitting antennas, where N and L are non-zero positive integers, L=N, and  is an integer greater than one, according to


Xq=[IN,U1,U1U2,U1U2U3, . . . ,Πm=1-1Um],



wherein



Um=exp(Σ[ck]Ak−[ck]*Ak†),



where exp(.) is a matrix exponential function, [.] is a quadrature-amplitude modulation, Ak is a pre-defined matrix of size N-by-N, IN is an identity matrix of size N, where [.]† denotes a conjugate transpose.

10. A receiver having a set of antennas for receiving a radio frequency (RF) signal from a transmitter via doubly-selective fading channel, wherein the RF signal includes a sequence of data symbols, each data symbol is space-time modulated with a corresponding codeword from a constellation set of codewords, wherein each codeword in the constellation set is a complex-valued matrix, comprising:
an RF circuit for down-converting the received RF signal from a carrier frequency to produce a baseband signal, wherein a carrier offset between the carrier frequency at the receiver and the carrier frequency at the transmitter generates additional noise at the receiver;
a filter having a time-reversed impulse response of a filter of the transmitter for filtering the baseband signal to produce a filtered signal, wherein a time offset between a clock of the filter of the receiver and a clock of the filter of the transmitter generates additional inter-carrier interference (ICI) at the receiver;
a space-time demodulator for demodulating the filtered signal using a generalized likelihood ratio test (GLRT) with multi-dimensional basis expansion model (BEM) to produce demodulated signal including the most likely estimation of the data symbols modulated with the corresponding codeword, wherein the GLRT uses a projector matrix that is an orthogonal null space of each codeword of the constellation set expanded with a set of basis functions including a Fourier exponential basis function in a frequency domain modified with a Legendre polynomial basis function; and
a forward error correction (FEC) decoder for decoding the demodulated signal to produce an estimate of transmitted data symbols.

11. The receiver of claim 10, wherein the set of basis functions includes a Fourier basis function, a Legendre polynomial basis function, and a function of pair-wise products of the Fourier and the Legendre polynomial basis functions.

12. The receiver of claim 10, wherein at least two Legendre polynomial basis functions are considered in the time domain.

13. The receiver of claim 10, wherein the space-time demodulator refines iteratively the demodulated signal using an output of the FEC decoder until a termination condition is reached.

14. The receiver of claim 10, further comprising:
a memory for storing the projector matrix predetermined for the constellation set, such that a product of the projector matrix with the corresponding codeword is zero, and a product of the projector matrix with the corresponding codeword multiplied by a basis extension matrix is zero, wherein the basis extension matrix includes a Legendre polynomial basis matrix, a Fourier exponential basis matrix, and a Fourier-Legendre product basis matrix, wherein values on a diagonal of the Legendre polynomial basis matrix form a polynomial function, wherein values on a diagonal of the Fourier exponential basis matrix form a Fourier exponential function, wherein values on a diagonal of the Fourier-Legendre products basis matrix are formed by an element-wise product of the Legendre polynomial basis and the Fourier exponential basis matrixes.

15. The receiver of claim 10, wherein the projector matrix Pq of a size of L-by-L is determined orthogonal to a basis-expanded codeword X′q corresponding to a codeword Xq according to


Pq=IL−X′q†(X′qX′q†)−1X′q,

wherein be Xq†Xq=IL, where [.]† denotes a conjugate transpose, IL is an identity matrix of size L, L is a length of a transmitted block, and wherein the basis-expanded codeword X′q is





  
    
      X
      q
      ′
    
    =
    
      
        [
        
          
            
              
                X
                q
              
            
          
          
            
              
                
                  X
                  q
                
                ⁢
                
                  B
                  1
                
              
            
          
          
            
              ⋮
            
          
          
            
              
                
                  X
                  q
                
                ⁢
                
                  B
                  D
                
              
            
          
        
        ]
      
      =
      
        
          (
          
            
              I
              
                D
                +
                1
              
            
            ⊗
            
              X
              q
            
          
          )
        
        ⁢
        B
      
    
  
  ,



where an operator  denotes a Kronecker product, and B is the basis expansion matrix comprising {IL, B1, B2, . . . , BD}, wherein D is a number of basis expansion matrices constrained as N(D+1)<L, IL is an identity matrix of size L, wherein L is a length of a transmitted block, and N is a number of transmitting antennas, where N and L are non-zero positive integers.

16. A system for communicating a radio frequency (RF) signal via a doubly-selective fading channel, comprising:
a transmitter for producing the RF signal including a sequence of data symbols, each data symbol is space-time modulated with a corresponding codeword from a constellation set of codewords, wherein each codeword in the constellation set is a complex-valued matrix, and for transmitting the RF signal over the doubly-selective fading channel; and
a receiver for receiving the RF signal and for demodulating the data symbols using a generalized likelihood ratio test (GLRT) with multi-dimensional basis expansion model (BEM), wherein the GLRT uses projector matrices orthogonal to each codeword of the constellation set expanded with a set of basis functions, wherein the set of basis functions includes a Fourier exponential basis function in a frequency domain, a Legendre polynomial basis function in a time domain, and a Fourier-Legendre product basis function in the frequency domain, wherein the Fourier-Legendre product basis function is a function of element-wise products of the Legendre polynomial basis function and the Fourier exponential basis function over the frequency domain.

17. The system of claim 16, wherein the transmitter comprises:
a forward-error correction (FEC) encoder for encoding the sequence of data symbols to produce a sequence of encoded data symbols;
a space-time modulator for a block-wise modulation of the encoded data symbols with the corresponding codeword from the constellation set of codewords to produce a sequence of modulated data symbols;
a band-pass filter for multiplying the modulated data symbols with a precoding matrix to produce a sequence of filtered symbols;
a transmitter RF circuit for up-converting and amplifying the filtered signal to produce the RF signal of a carrier frequency;
wherein the receiver comprises:
a receiver RF circuit for down-converting the received RF signal from the carrier frequency to produce a baseband signal, wherein a carrier offset between the carrier frequency at the receiver and the carrier frequency at the transmitter generates additional noise at the receiver;
a filter having a time-reversed impulse response of the band-pass filter of the transmitter for filtering the baseband signal to produce a filtered signal, wherein a timing offset between a clock of the filter of the receiver and a clock of the band-pass filter of the transmitter generates additional inter-carrier interference (ICI) at the receiver;
a space-time demodulator for demodulating the filtered signal using the GLRT generalized likelihood ratio test (GLRT) with multi-dimensional BEM to produce demodulated signal; and
a forward error correction (FEC) decoder for decoding the demodulated signal to produce an estimate of transmitted data symbols.

18. The system of claim 16, wherein at least two Legendre polynomial basis functions are considered in the time domain.

19. The system of claim 16, wherein the receiver includes a memory for storing each projector matrix predetermined for the constellation set, such that a product of the projector matrix with the corresponding codeword is zero, and a product of the projector matrix with the corresponding codeword multiplied by a basis extension matrix is zero, wherein the basis extension matrix includes a Legendre polynomial basis matrix, a Fourier exponential basis matrix, and a Fourier-Legendre product basis matrix, wherein values on a diagonal of the Legendre polynomial basis matrix form a polynomial function, wherein values on a diagonal of the Fourier exponential basis matrix form a Fourier exponential function, wherein values on a diagonal of the Fourier-Legendre product basis matrix are formed by a product of the Legendre polynomial basis and the Fourier exponential basis matrixes.

20. The system of claim 16, wherein a projector matrix Pq of a size of L-by-L is determined orthogonal to a basis-expanded codeword X′q corresponding to a codeword Xq according to


Pq=IL−X′q†(X′qX′q†)−1X′q,

wherein be Xq†Xq=IL, where [.]† denotes a conjugate transpose, IL is an identity matrix of size L, L is a length of a transmitted block, and wherein the basis-expanded codeword X′q is





  
    
      X
      q
      ′
    
    =
    
      
        [
        
          
            
              
                X
                q
              
            
          
          
            
              
                
                  X
                  q
                
                ⁢
                
                  B
                  1
                
              
            
          
          
            
              ⋮
            
          
          
            
              
                
                  X
                  q
                
                ⁢
                
                  B
                  D
                
              
            
          
        
        ]
      
      =
      
        
          (
          
            
              I
              
                D
                +
                1
              
            
            ⊗
            
              X
              q
            
          
          )
        
        ⁢
        B
      
    
  
  ,



where an operator  denotes a Kronecker product, and B is the basis expansion matrix comprising {IL, B1, B2, . . . , BD}, wherein D is a number of basis expansion matrices constrained as N(D+1)<L, IL is an identity matrix of size L, wherein L is a length of a transmitted block, and N is a number of transmitting antennas, where N and L are non-zero positive integers.