# Patent

## Title
Wireless communications device performing block equalization based upon prior, current and/or future autocorrelation matrix estimates and related methods

## Abstract

A wireless communications device may include a wireless receiver for receiving signals comprising alternating known and unknown symbol portions, and a demodulator connected thereto. The demodulator may include a channel estimation module for generating respective channel estimates for a prior unknown symbol portion(s), current unknown symbol portion and for future unknown symbol portion(s). An autocorrelation module may generate autocorrelation matrices for the prior, current and future unknown symbol portions. A channel match filter module may generate respective channel matching coefficients for the prior and current/future unknown symbol portions, and a factorization module may divide the autocorrelation matrices into respective upper and lower autocorrelation matrices. A transformation module may transform the channel matching coefficients into upper and lower channel matching coefficients. A a back-substitution module may determine the current unknown symbol portion based upon the upper and lower autocorrelation matrices and channel matching coefficients for the current and prior/future unknown symbol portions.

## Background
FIELD OF THE INVENTION
The present invention relates to the field of wireless communications systems, and, more particularly, to wireless communications devices employing block-based channel equalization and related methods.
BACKGROUND OF THE INVENTION
High frequency (HF) radio channels, very-high frequency (VHF) radio channels and ultra-high frequency (UHF) radio channels all exhibit time and frequency dispersion (i.e., delay spread and Doppler spread) due to the presence of signal reflectors or scatterers in the environment, as well as the relative motion of transmitters and receivers. As a result, the channel experiences distortion which can cause transmitted symbols to be incorrectly interpreted at the receiving device. Doppler spreading can cause the delay spread (i.e., multipath) to vary with time. These phenomena typically require modems to employ equalization to track and compensate for the time-varying multipath channel.
Two general approaches for channel equalization are commonly used. The first is symbol-based equalization, where equalizer coefficients are maintained and updated for each symbol. The second approach is block equalization, in which the equalizer coefficients are instead maintained and updated for blocks of unknown data symbols, rather than individual symbols. In an article entitled “A Novel Block Equalization Design for Wireless Communication with ISI and Rayleigh Fading Channels” by Hwang et al., the authors note that a drawback of symbol based equalization is that it requires considerable computing overheads for updating the coefficients on a symbol-by-symbol basis. On the other hand, Hwang et al. point out that while block equalization may result in a significant decrease in complexity for performing coefficient updates, this approach requires some knowledge of the channel, which generally requires channel estimation.
The design proposed by Hwang et al. includes a matched filter, a channel estimator, and a block decision feedback equalizer (BDFE). The channel estimator, which is based on a revised recursive least squares (RLS) algorithm, adopts a “semi-blind” approach, in which an estimated channel impulse response h(n) is used later in both matched filtering and the BDFE update. The BDFE includes a noise whitener and a maximum-likelihood block detector followed by a symbol detector. The filter coefficients of the BDFE are calculated subject to the Cholesky factorization and are updated once for each data block. Hwang et al. implement the BDFE design as a systolic array on a field programmable gate array (FPGA).
Another approach to combat multipath can be found in the wideband networking waveform (WNW) which uses orthogonal frequency division multiplexing (OFDM). The WNW approach is based upon non-coherent parallel tone modem technology, and it does not use an equalizer but instead uses a guard time and forward error correction (FEC) to cope with delay spread/frequency selective fading. While this approach is fairly straightforward, it may not provide desired performance when faced with significant fading and interference, and it may also result in relatively high peak-to-average ratios in some circumstances.
Still another approach has been developed by Trellis Ware and ITT of San Diego, Calif., which utilizes 1.2 MHz bandwidth continuous phase modulation (CPM) with serial concatenated convolutional code, and a reduced state maximum likelihood sequence estimator (MLSE) equalizer. While this approach may have certain advantages, it requires significant complexity (especially for wider bandwidths). Also, relatively high bits/Hz ratios may not be achievable in certain applications.
Despite the advantages of the above-noted approaches, other block equalization techniques may be desirable for use with relatively wideband waveforms to provide high data rates despite multi-path and fading channel conditions.
SUMMARY OF THE INVENTION
In view of the foregoing background, it is therefore an object of the present invention to provide a wireless communications device which provides enhanced block equalization and related methods.
This and other objects, features, and advantages in accordance with the present invention are provided by a wireless communications device which may include a wireless receiver for receiving wireless signals comprising alternating known and unknown symbol portions. The wireless communications device may further include a demodulator connected to the wireless receiver. More particularly, the demodulator may include a channel estimation module for generating respective channel estimates for at least one prior unknown symbol portion and a current unknown symbol portion based upon adjacent known symbol portions. An autocorrelation module may be included for generating autocorrelation matrices for the at least one prior and current unknown symbol portions based upon respective channel estimates, and a channel match filter module may be included for generating channel matching coefficients for the current unknown symbol portion.
The demodulator may further include a factorization module for dividing the autocorrelation matrices into respective upper and lower autocorrelation matrices, and a transformation module for transforming the channel matching coefficients into upper and lower channel matching coefficients based upon the current and at least one prior upper and lower transformation matrices. By way of example, the determination of the upper and lower channel matching coefficients may be based upon a weighted average of at least one prior and current upper and lower transformation matrices. In addition, a back-substitution module may also be included for determining the current unknown symbol portion based upon the upper and lower autocorrelation matrices for the current and at least one prior unknown symbol portions, and the upper and lower channel matching coefficients for the current unknown symbol portion. By way of example, the determination may be made based upon a weighted average. The demodulator may therefore use channel estimates based upon a constant channel to simplify the factorization and transformation calculations, yet by using the weighted average of upper and lower diagonal autocorrelation and upper and lower transformation coefficient matrices from the current and prior unknown symbol portions, still provide block equalization with desired accuracy.
The transformation module may transform the channel matching coefficients into upper and lower channel matching coefficients based upon a weighted average of the current and at least one prior upper and lower transformation coefficient matrices, where weighting may be based upon proximity of respective channel estimates to unknown symbol portions. The upper and lower autocorrelation matrices for the current unknown symbol portion and at least one prior unknown symbol portions may be weighted based upon proximity of respective channel estimates to unknown symbol portions, for example. Additionally, each symbol in the current unknown symbol portion may have one of a plurality of discrete values, and the back-substitution module may determine nearest discrete values for symbols within the current unknown symbol portion.
Furthermore, the channel estimation module may further generate a channel estimate for at least one future unknown symbol portion. As such, the autocorrelation module may generate an autocorrelation matrix for the at least one future unknown symbol portion. In addition, the transformation module may transform the channel matching coefficients into upper and lower channel matching coefficients based upon the at least one future upper and lower transformation coefficient matrices. The back-substitution module may also determine the current unknown symbol portion based upon the upper and lower autocorrelation matrices for the at least one future unknown symbol portion. In some embodiments, the current unknown symbol portion may be determined based upon the upper and lower autocorrelation matrices and the upper and lower transformation coefficient matrices for the future unknown symbol portion(s) without the upper and lower autocorrelation matrices and upper and lower transformation coefficient matrices for the prior symbol portion(s) as well.
The demodulator may also include a signal energy removal module for removing a known signal energy quantity associated with the known symbol portions from the unknown symbol portions. Furthermore, the factorization module may divide the autocorrelation into the upper and lower autocorrelation matrices based upon various techniques, such as Cholesky factorization, Bareiss factorization, Levinson factorization, or Schur factorization, for example. Also, the demodulator may be implemented in a field-programmable gate array (FPGA), application specific integrated circuit (ASIC), or digital signal processor (DSP), for example.
A wireless communications method aspect of the invention may include receiving wireless signals comprising alternating known and unknown symbol portions, and generating respective channel estimates for at least one prior unknown symbol portion and a current unknown symbol portion based upon adjacent known symbol portions. Moreover, autocorrelation matrices may be generated for the at least one prior and current unknown symbol portions based upon respective channel estimates, and respective channel matching coefficients may be generated for the current unknown symbol portion based on at least one prior and current upper and lower transformation coefficient matrices. The method may further include dividing the autocorrelation matrices into respective upper and lower autocorrelation matrices, and transforming the channel matching coefficients into upper and lower channel matching coefficients. Additionally, the current unknown symbol portion may be determined based upon the upper and lower autocorrelation matrices for the current and at least one prior unknown symbol portions, and the upper and lower channel matching coefficients for the current unknown symbol portion (where upper and lower channel matching coefficients are generated using the current and at least one prior transformation coefficient matrices).



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a schematic block diagram of a wireless communications system comprising a plurality of wireless communications devices in accordance with the present invention.
FIG. 2 is a schematic block diagram of a prior art signal waveform having alternating known and unknown symbol portions to be demodulated using block equalization.
FIG. 3 is schematic block diagram of an embodiment of a wireless communications device of FIG. 1 including both transmission and reception circuitry.
FIG. 4 is a schematic block diagram of an alternate embodiment of a wireless communications device of FIG. 1.
FIGS. 5 and 6 are flow diagrams illustrating the demodulation method steps performed by a wireless communications device of FIG. 1.
FIG. 7 is a schematic block diagram of another wireless communications device in accordance with the present invention.
FIGS. 8 and 9 are flow diagrams illustrating the demodulation method steps performed by the wireless communications device of FIG. 7.



DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
The present invention will now be described more fully hereinafter with reference to the accompanying drawings, in which preferred embodiments of the invention are shown. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. Like numbers refer to like elements throughout, and prime and multiple prime notation are used to indicate similar elements in alternate embodiments.
The present invention is applicable to communication systems in general, but it is particularly concerned with communication systems which insert known sequences in a transmit (TX) waveform to track multi-path and/or fading communication channels (e.g., wireless communications, telephone lines, etc.), and to equalize the received (RX) waveform to remove the effects of the multi-path (i.e., inter-symbol interference (ISI)) from the received signal. The insertion of known sequences in the TX waveform allows for channel estimation and block equalization. This invention is applicable to high frequency (HF), very high frequency (VHF), ultra high frequency (UHF) and other wireless communication systems which have been designed to work under difficult multi-path and fading conditions, for example.
When known sequences are inserted in a TX waveform, the receive waveform may take the form of the received signal 30 shown in FIG. 2. The actual TX waveform includes an initial synchronization preamble portion 31, which is a set of known symbols (PK), followed by unknown data symbol (Un) portions 32, followed by another known symbol portion (K), etc., until the end of the transmission (i.e. PK Un K Un K Un K . . . Un K). This type of K-Un-K framing allows for the use of block equalization strategies in the receiver. Block equalizers have been found to provide very good performance on multi-path fading channels, as will be appreciated by those skilled in the art. In the illustrated example, the last half of the known symbols are used to compute channel estimates 33 (h1 and h2) on both sides of the unknown data symbols. If longer channel estimates are required, the length of channel estimate can be as long as the known symbols, but additional processing may be required to arrive at a channel estimate.
The mathematical operations (and associated equations) performed in accordance with the present invention will first be described, and the hardware/software used for implementing these operations will be described thereafter with reference to the equations for clarity of understanding. When a digital waveform encounters a multi-path fading channel, the output can be represented by the following equation:




  
    
      
        
          y
          i
        
        =
        
          
            
              ∑
              
                j
                =
                0
              
              
                L
                -
                1
              
            
            ⁢
            
              
                h
                j
              
              ⁢
              
                x
                
                  i
                  -
                  j
                
              
            
          
          +
          
            
              n
              i
            
            .
          
        
      
    
    
      
        (
        1
        )
      
    
  




The variable x represents samples of the original transmitted symbols (i.e., K, Un, K), h is the combination of the multi-path/fading channel and any other filters in TX/RX radio equipment and is of length L (for current time i), n is additive white Gaussian noise (AWGN) samples, and y is the received samples. For the purpose of describing this invention, the channel and channel estimate are assumed to be constant across the unknown frame, but this invention may also deal with interpolated channel estimates across the unknown symbol frame (i.e., a time varying channel).

If we channel-match filter the received waveform, the output of the system becomes:




  
    
      
        
          b
          i
        
        =
        
          
            ∑
            
              j
              =
              0
            
            
              L
              -
              1
            
          
          ⁢
          
            
              h
              
                -
                j
              
              *
            
            ⁢
            
              
                y
                
                  j
                  -
                  i
                
              
              .
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




The symbol * stands for complex conjugate operator. Letting L=4, K=8, U=8, and expanding the above equation into matrix form,





  
    
      
        
          
            [
            
              
                
                  
                    b
                    0
                  
                
              
              
                
                  
                    b
                    1
                  
                
              
              
                
                  
                    b
                    2
                  
                
              
              
                
                  
                    b
                    3
                  
                
              
              
                
                  
                    b
                    4
                  
                
              
              
                
                  
                    b
                    5
                  
                
              
              
                
                  
                    b
                    6
                  
                
              
              
                
                  
                    b
                    7
                  
                
              
            
            ]
          
          =
          
            
              [
              
                
                  
                    
                      R
                      0
                    
                  
                  
                    
                      R
                      1
                    
                  
                  
                    
                      R
                      2
                    
                  
                  
                    
                      R
                      3
                    
                  
                  
                    0
                  
                  
                    0
                  
                  
                    0
                  
                  
                    0
                  
                
                
                  
                    
                      R
                      
                        -
                        1
                      
                    
                  
                  
                    
                      R
                      0
                    
                  
                  
                    
                      R
                      1
                    
                  
                  
                    
                      R
                      2
                    
                  
                  
                    
                      R
                      3
                    
                  
                  
                    0
                  
                  
                    0
                  
                  
                    0
                  
                
                
                  
                    
                      R
                      
                        -
                        2
                      
                    
                  
                  
                    
                      R
                      
                        -
                        1
                      
                    
                  
                  
                    
                      R
                      0
                    
                  
                  
                    
                      R
                      1
                    
                  
                  
                    
                      R
                      2
                    
                  
                  
                    
                      R
                      3
                    
                  
                  
                    0
                  
                  
                    0
                  
                
                
                  
                    
                      R
                      
                        -
                        3
                      
                    
                  
                  
                    
                      R
                      
                        -
                        2
                      
                    
                  
                  
                    
                      R
                      
                        -
                        1
                      
                    
                  
                  
                    
                      R
                      0
                    
                  
                  
                    
                      R
                      1
                    
                  
                  
                    
                      R
                      2
                    
                  
                  
                    
                      R
                      3
                    
                  
                  
                    0
                  
                
                
                  
                    0
                  
                  
                    
                      R
                      
                        -
                        3
                      
                    
                  
                  
                    
                      R
                      
                        -
                        2
                      
                    
                  
                  
                    
                      R
                      
                        -
                        1
                      
                    
                  
                  
                    
                      R
                      0
                    
                  
                  
                    
                      R
                      1
                    
                  
                  
                    
                      R
                      2
                    
                  
                  
                    
                      R
                      3
                    
                  
                
                
                  
                    0
                  
                  
                    0
                  
                  
                    
                      R
                      
                        -
                        3
                      
                    
                  
                  
                    
                      R
                      
                        -
                        2
                      
                    
                  
                  
                    
                      R
                      
                        -
                        1
                      
                    
                  
                  
                    
                      R
                      0
                    
                  
                  
                    
                      R
                      1
                    
                  
                  
                    
                      R
                      2
                    
                  
                
                
                  
                    0
                  
                  
                    0
                  
                  
                    0
                  
                  
                    
                      R
                      
                        -
                        3
                      
                    
                  
                  
                    
                      R
                      
                        -
                        2
                      
                    
                  
                  
                    
                      R
                      
                        -
                        1
                      
                    
                  
                  
                    
                      R
                      0
                    
                  
                  
                    
                      R
                      1
                    
                  
                
                
                  
                    0
                  
                  
                    0
                  
                  
                    0
                  
                  
                    0
                  
                  
                    
                      R
                      
                        -
                        3
                      
                    
                  
                  
                    
                      R
                      
                        -
                        2
                      
                    
                  
                  
                    
                      R
                      
                        -
                        1
                      
                    
                  
                  
                    
                      R
                      0
                    
                  
                
              
              ]
            
            ⁡
            
              [
              
                
                  
                    
                      x
                      0
                    
                  
                
                
                  
                    
                      x
                      1
                    
                  
                
                
                  
                    
                      x
                      2
                    
                  
                
                
                  
                    
                      x
                      3
                    
                  
                
                
                  
                    
                      x
                      4
                    
                  
                
                
                  
                    
                      x
                      5
                    
                  
                
                
                  
                    
                      x
                      6
                    
                  
                
                
                  
                    
                      x
                      7
                    
                  
                
              
              ]
            
          
        
        ⁢
        
          

        
        ⁢
        
          where
          ⁢
          
            :
          
        
        ⁢
        
          

        
        ⁢
        
          
            R
            i
          
          =
          
            
              ∑
              
                j
                =
                0
              
              
                L
                -
                1
              
            
            ⁢
            
              
                h
                j
              
              ⁢
              
                
                  h
                  
                    i
                    -
                    j
                  
                  *
                
                .
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




It will be noted that the previous matrix equation only involves the Un symbols (i.e., variable xi in matrix). The effects of the known symbols (K) on both sides have already been removed. It should also be noted that R−i=Ri*, and that the matrix R is known as the channel autocorrelation matrix. Also, this matrix is banded (i.e., zeros on upper right hand and lower left hand of the matrix because the channel is only L taps long). Re-writing the above-noted matrix equation in compressed form and flipping sides provides the following:

 Rx=b,   (4)

where over-lined letters represent matrixes and the remaining quantities are vectors.

The goal of a block equalizer is to solve for the vector x and determine the best estimate of the Un symbols. There are several different approaches to solve for x such as Gaussian elimination, Cholesky, Bareiss, Levinson, Schur and other LU factorization techniques based on whether symmetry exists or does not exist in the R matrix (i.e., Gaussian Elimination if no symmetry due to interpolating the channel estimates across Un frame creating a time-varying auto-correlation matrix, Cholesky if Hermitian Symmetry, Bareiss or Levinson if Toeplitz). Also, some iterative techniques can be used to solve for x. An LU decomposition transforms Rx=b into two separate systems of equations, namely:

 Lxl=bl and Ūxu=bu,

bl=Blb and bu=Bub  (5)

where L is a lower triangular matrix and Ū is an upper triangular matrix, and bl and bu are the lower and upper channel matching coefficients that result from the application of the transformation coefficients Bu and Bl to b in order to maintain equivalence of original equation (4) (i.e., after left hand side of equation has been transformed into a lower diagonal or upper diagonal matrix, b vector (right hand side of equation) must also be transformed into appropriate new channel matching coefficients bl and bu. In accordance with the present invention, the vector x is solved for by performing a back-substitution algorithm (BSA) on both systems of equations, and the solution values for x are clamped to closest valid constellation points when the BSA is executed and the un-clamped values are saved for generation of soft information. This approach is significantly more efficient than computing the inverse of R and multiplying the equation above by R−1 to solve for x.

Referring initially to FIG. 1, a wireless communications system 19 comprising a plurality of wireless communications devices 20 in accordance with the present invention is now described. Each wireless communications device 20 illustratively includes a wireless receiver 21 and associated antenna 22 for receiving wireless signals 30 having alternating known and unknown symbol portions 31, 32, as discussed above with reference to FIG. 2, over a channel (HF, VHF, UHF, etc.). The device 20 further includes a demodulator systolic array 23 connected to the wireless receiver 21 for performing block equalization on the received wireless signals 30.
The demodulator systolic array 23 illustratively includes a channel estimation module 24 for generating respective channel estimates 33 (i.e., h1 and h2 and/or prior (hp) and future (hf)) for each unknown symbol portion 32 based upon the known symbol portions 31. It should be noted that only one channel estimate h2 or hf needs to be computed for each (Un, K) frame time, as all other channel estimates may be computed ahead of time and stored for later use. Various channel estimation techniques known in the art may be employed by the channel estimation module 24, such as recursive least square (RLS), least mean square (LMS) estimation, or cyclic correlation, for example.
The next module in the systolic array 23 is an autocorrelation module 25, which generates autocorrelation matrices R (see equation 4, above) for each unknown symbol portion 32 based upon the channel estimates 33, as will be appreciated by those skilled in the art. The autocorrelation module 25 may generate the autocorrelation matrices based upon the channel estimates 33, as well as a noise variance associated with the channel. More particularly, the main diagonal of the autocorrelation matrix R may be biased based upon the noise variance, which may either be a known quantity for the channel, or it may be determined using various known techniques, as will be appreciated by those skilled in the art.
Moreover, a channel match filter module 26 is included for generating respective channel matching coefficients b (see equation 2) for the unknown symbol portions 32. That is, the channel match filter module 26 performs channel match filtering of y to obtain b, as will be appreciated by those skilled in the art.
The demodulator systolic array 23 also illustratively includes a factorization module 27 for dividing the autocorrelation matrices into respective upper (Ū) and lower ( L) triangular autocorrelation matrices using an LU decomposition, as noted above. Moreover, a transformation module 28 similarly transforms the channel matching coefficients b into upper and lower channel matching coefficients bu, and bl (see equation 5, above).
The systolic array 23 further includes a back-substitution module 29 which determines the unknown symbol portions 32 based upon respective upper and lower autocorrelation matrices Ū, L and upper and lower channel matching coefficients bu, bl. Preferably, the back-substitution module 29 solves for the symbols in a given unknown symbol portion 32 using the upper autocorrelation matrix Ū and upper channel matching coefficients bu, and then using the lower autocorrelation matrix L and lower channel matching coefficients bl, and combining (i.e., averaging) the two. Of course, it should be noted that the order of solving could be reversed if desired (i.e., first solve using L, bl, and then Ū, bu).
The above technique may conceptually be considered as a “top-down” approach when solving using the upper autocorrelation triangular matrix, and a “bottom-up” approach when solving using the lower autocorrelation triangular matrix. By averaging the results of the top-down and bottom-up results, the errors that are induced in the BSA by clamping to the wrong symbol in the decision device (due to noise and/or multipath and fading) are reduced.
The factorization module 27 may implement a variety of techniques for determining the unknown symbol portions. By way of example, such techniques may include Gaussian elimination, Cholesky factorization, Bareiss factorization, and Levinson factorization. As noted above, other iterative techniques may also be used, as will be appreciated by those skilled in the art.
The demodulator systolic array 23 may advantageously be implemented in a variety of devices, such as a field-programmable gate array (FPGA) or an application specific integrated circuit (ASIC), for example. Because of the relative speed available with such devices, the demodulator systolic array 23 is advantageously suitable for use with wideband waveforms with widths of about 5 to 10 MHz, or higher, for example. Moreover, it will be appreciated by those skilled in the art that the demodulator systolic array 23 may advantageously exploit the channel estimate properties (i.e., zeros or banded properties) to provide power savings and/or increased multi-path capability and bandwidth.
It should be noted that the arrows between the modules in the demodulator systolic array 23 are generally meant to indicate the flow of module processing operations, not the data flow path between these modules. That is, in the accompanying schematic block diagrams and flow diagrams, the arrows are meant to generally illustrate the order in which operations may be performed for clarity of explanation. Moreover, it should also be noted that in some embodiments various operations may be performed in different orders or in parallel, instead of the exemplary order illustrated in the drawings. For example, the operations performed by the autocorrelation module 25 and the channel match filter module 26 may be performed in different orders or in parallel.
Turning now to FIG. 3, in certain embodiments the wireless communications device 20′ will include both transmit and receive components. More particularly, the transmit circuitry illustratively includes a forward error correction (FEC) encoder 50′ which receives a data stream to be transmitted, an interleaver 51′ downstream from the encoder, a modulator 52′ downstream from the interleaver, and a transmit (TX) digital low-pass filter 53′ is downstream from the modulator, as will be appreciated by those skilled in the art. Moreover, a digital up-converter 54′ is downstream from the transmit digital low-pass filter 53′, a radio transmit filter 55, is downstream from the digital up-converter, and a transceiver 56′ is downstream from the radio transmit filter for transmitting signals via an associated antenna 57′, as will also be appreciated by those skilled in the art.
The wireless communications device 20′ may further include additional receiver components illustratively including a radio receive (RX) filter 58′ downstream from the transceiver 56′, a digital down converter 59′ downstream from the radio receive filter, and a receive digital low-pass filter 60′ downstream from the digital down converter. The demodulator systolic array 23′ is downstream from the receive digital low-pass filter 60′, and it is followed by a deinterleaver 62′ and then a decoder 63′, which reproduces a received data stream. It should be noted that one or more of the above-noted transmit or receive components may also advantageously be implemented on the same FPGA/ASIC as the demodulator systolic array 23′, for example. In some embodiments, these components may also be implemented as software modules with a digital signal processor (DSP) as well, as will be appreciated by those skilled in the art.
Referring additionally to FIG. 4, in an alternate embodiment of the wireless communications device 20′ it may be desirable to include in the demodulator systolic array 23′ a signal energy removal module 40′ for removing a known signal energy quantity from the unknown symbol portions 32. That is, the known symbol portions 31 may introduce a certain amount of energy into the unknown symbol portions 32, particularly at the beginnings and endings thereof. Since this energy is a known quantity, it may be removed from the channel-matched filtered Un symbols using the autocorrelation coefficients, as will be appreciated by those skilled in the art (i.e., b array would be corrected by known symbols and proper autocorrelation matrix coefficients).
Wireless communications method aspects of the invention are now described with reference to FIGS. 5 and 6. Beginning at Block 70, wireless signals comprising alternating unknown and known symbol portions 32, 31 are received over a channel, at Block 71, and respective channel estimates 33 for each unknown symbol portion are generated based upon the known symbol portions (Block 72). The method further includes generating autocorrelation matrices R based upon the channel estimates 33, at Block 73. This may be done based upon a noise variance as well, as illustrated at Block 73′ in FIG. 6, as discussed above.
Respective channel matching coefficients b are generated for the unknown symbol portions 32, at Block 74, as discussed above. Further, the autocorrelation matrices R are divided into respective upper and lower autocorrelation matrices Ū, L, at Block 75, and the channel matching coefficients b are also transformed by the upper and lower transformation coefficients Bu, Bl, at Block 76 into bu and bl. The unknown symbol portions 32 are determined based upon an average of respective upper and lower autocorrelation matrices Ū, L and upper and lower channel matching coefficients bu, bl, at Block 77, thus concluding the illustrated method (Block 78).
The step of determining the unknown symbol portions 32 illustrated at Block 77 may include estimating the unknown symbol portions based upon respective upper autocorrelation matrices U and upper channel matching coefficients bu, at Block 80′ (FIG. 6), estimating the unknown symbol portions based upon respective lower autocorrelation matrices L and lower channel matching coefficients bl, at Block 81′, and averaging respective estimates for each unknown symbol portion, at Block 82′. The known signal energy may also be removed from unknown symbol portions 32 if desired, at Block 79′.
Turning now additionally to FIG. 7, an alternate embodiment of the wireless communications device 20′′ is now described. Generally speaking, to provide increased Doppler spread capability, channel estimates need to be interpolated across a plurality of unknown symbol portions 32. However, this eliminates symmetry in equation 4 noted above, and such loss of symmetry would otherwise require the use of Gaussian elimination to solve. Yet, Gaussian elimination requires a relatively high computational complexity, which may be prohibitive in many applications.
More particularly, when designing waveforms for use on multi-path fading channels, the length of the K symbols is related to the desired multi-path capability of the waveform (usually 2*MAX_MULTI_PATH-1), and the length of the Un symbols is determined by the Doppler spread (rate of fading) of the channel. For example, if we let K be 31 symbols long, we can then compute 16 channel estimate taps. Also, if we let the unknown symbol portion 32 be 256 symbols long, then for a waveform with 2400 symbols per second, channel estimates would be computed approximately once every 120 ms (256+31/2400) which would allow the waveform to work with up to 4 Hz of Doppler spread. However, even with slow fading rates (e.g., 1 Hz) it is unlikely that the channel estimate remains constant for the entire 120 ms (Un+K symbol length), and thus when equalizing higher order modulations (i.e., 16-QAM, 64-QAM) there would be performance degradation due to the assumption that the channel estimate was constant for the entire 120 ms.
Performance can be improved by interpolating the channel estimate across the 120 ms frames. For example, 16 different channel estimates could be interpolated using channel estimates at both ends, so that there would be a new channel estimate every 16 Un symbols. Yet, an undesired side effect of interpolation is that all the original symmetry that existed in the R matrix is lost, necessitating the use of the Gaussian elimination technique to solve for the L and Ū decomposition matrixes, as noted above. Again, this loss of symmetry significantly increases the computational complexity of solving for x.
The above-noted approach implemented in the wireless communications device 20 advantageously allows for enhanced accuracy and bandwidth capability whether symmetry is present or not. The wireless communications device 20′′ advantageously implements a technique which may be used in conjunction with the above-noted approach or separately to provide desired Doppler spread capability while maintaining symmetry with respect to the above-noted equation 4. As such, Gaussian elimination may be avoided, and techniques such as Cholesky, Bareiss, Levinson and other LU factorization techniques may instead be utilized.
The wireless communications device 20′′ illustratively includes a wireless receiver 21′′ and associated antenna 22′′ for receiving wireless signals comprising alternating known and unknown symbol portions 31, 32, as discussed above. A demodulator 23′′ is connected to the wireless receiver 21′′. The demodulator 23′′ may be implemented in a systolic array architecture, as described above, although it need not be in all embodiments. By way of example, the demodulator 23′′ may be implemented in an FPGA, ASIC, DSP, etc., as will be appreciated by those skilled in the art.
The demodulator 23′′ illustratively includes a channel estimation module 24′′ for generating respective channel estimates for one or more prior unknown symbol portions 32 and a current unknown symbol portion based upon adjacent known symbol portions 31. That is, the channel estimation module 24′′ generates channel estimates for each successive unknown symbol portion 32, and the channel estimates for prior unknown symbol portions are used in determining the current unknown symbol portion, as will be discussed further below.
An autocorrelation module 25′′ generates autocorrelation matrices R for the prior and current unknown symbol portions 32 based upon respective channel estimates, and a channel match filter module 26′′ may be included for generating channel matching coefficients b (upper and lower) for the current unknown symbol portions. The demodulator 23′′ further illustratively includes a factorization module 27′′ for dividing the autocorrelation matrices R into respective upper and lower autocorrelation matrices Ū, L, and a transformation module 28′′ for transforming the channel matching coefficients b into upper and lower channel matching coefficients bu, bl, as discussed above (i.e., see equation (5)).
As the upper and lower autocorrelation matrices Ū, L, and upper and lower channel matching coefficients bu, bl associated with each unknown symbol portion 32 are determined (where bu, bl are generated using current and prior transformation coefficients Bu and Bl , Ū and L are not only used by a back-substitution module 29′′ to determine the current unknown symbol portion, but they are also stored in a memory 69′′ for use in determining future unknown symbol portions. Also, the transformation coefficients Bu and Bl need to be stored in a memory. That is, the back-substitution module 29′′ determines the current unknown symbol portion 32 based upon a weighted average of the upper and lower autocorrelation matrices Ū, L, for the current and prior unknown symbol portions, and the upper and lower channel matching coefficients bu, bl for the current unknown symbol portions (where the current b is transformed into the upper and lower channel matching coefficient bu, bl by applying a weighted average of current and prior B and Bl transformation coefficient matrices). In other words, the demodulator 23′′ therefore advantageously uses channel estimates 33 based upon a constant channel to simplify the factorization and transformation calculations. Yet, by using the weighted average of the upper and lower autocorrelation matrix Ū, L and the upper and lower transformation coefficient matrix Bu and Bl from the current and prior unknown symbol portions 32, the non-constant nature of the channel may still be accounted for so that desired accuracy may still be achieved.
By way of example, the upper and lower autocorrelation matrices Ū, L and the upper and lower transformation coefficient matrices Bu and Bl for the current and prior unknown symbol portions 32 may be weighted based upon proximity of respective channel estimates 33 to unknown symbol portions, for example. A typical approach for interpolating is to use Wiener filters (see, e.g., Adaptive Filter Theory by Simon Haykin, Prentice Hall, 3rd edition, Dec. 27, 1995), or standard sample rate conversion interpolation. The proximity effect shows up because channel estimates that are closer to the desired interpolated channel estimate will be weighted more heavily than channel estimates that are farther away. How much weighting the farther away channel estimates get depends on whether the channel estimates are interpolating for a fading channel or a fixed channel. If the channel is not changing, a desirable interpolation scheme would be to average all channel estimates equally, but if the channel is changing quickly, the closest channel estimates are preferably weighted more heavily.
Additionally, each symbol in the current unknown symbol portion 32 may have one of a plurality of discrete values, and the back-substitution module may determine nearest discrete values (i.e., clamp to the nearest symbol value of the symbol alphabet such as 2-PSK, 4-PSK, etc.) for symbols within the current unknown symbol portion 32. In other words, the symbol estimates for the current unknown data portion 32 are clamped for use in the remainder of the BSA processing, while the unclamped values are stored in the memory 69′′ for use in future calculations such as soft decisions for FEC. As discussed above, the demodulator 23′′ may also include a signal energy removal module (not shown) for removing a known signal energy quantity associated with the known signal portions from the unknown symbol portions 32.
In some embodiments, the channel estimation module 24′′ may further generate a channel estimate for future unknown symbol portions in the same manner discussed above. As such, the autocorrelation module 25′′ may similarly generate an autocorrelation matrix R for the future unknown symbol portion(s), which are transformed into matrices Ū, L as discussed above. In a similar fashion, the transformation module will determine the upper and lower transformation coefficient matrices Bu and Bl for the future portion and then create a weighted average of current/prior/future transformation coefficient matrices to transform b into upper and lower channel matching coefficients bu and bl. Accordingly, the back-substitution module 29′′ may determine the current unknown symbol portion based upon the upper and lower autocorrelation matrices Ū, L for the future unknown symbol portion(s), as well as those for the prior and current symbol portions.
In still other embodiments, the back-substitution module 29′′ may determine the current unknown symbol portion based upon the upper and lower autocorrelation matrices Ū, L for the future unknown symbol portion(s) without using those for the prior symbol portion(s). It should be noted, however, that using future unknown/known symbol portions may require additional buffering and latency, so system requirements will drive whether future symbols can be used).
A wireless communications method aspect of the invention which may be performed by the wireless communications device 20′′ is now described with reference to FIG. 8. Beginning at Block 80′′, wireless signals comprising alternating known and unknown symbol portions 31, 32 are received, at Block 81′′, and respective channel estimates 33 for one or more prior and/or future unknown symbol portions and a current unknown symbol portion are generated based upon adjacent known symbol portions, at Block 82′′, as discussed above. Moreover, autocorrelation matrices R are generated for the prior and current unknown symbol portions 32 based upon respective channel estimates, at Block 83′′, and respective channel matching coefficients b are generated (Block 84′′) for the current unknown symbol portions.
The method may further include dividing the autocorrelation matrices Rinto respective upper and lower autocorrelation matrices Ū, L, at Block 85′′, and computing the transformation coefficients Bu, Bl which are used to transform b into upper and lower vectors bu, bl prior to the BSA algorithm, at Block 86′′. The current unknown symbol portion 32 is then determined based upon a weighted average of the upper and lower autocorrelation matrices Ū, L for the current and prior unknown symbol portions and the upper and lower channel matching coefficients bu, bl for the current unknown symbol portions, at Block 87′′, as discussed above, thus concluding the illustrated method (Block 88′′).
Further method aspects are now described with reference to FIG. 9. More particularly, a step of removing a known signal energy quantity from the unknown symbol portions 32 is performed prior to generating the channel matching coefficients 33, at Block 89′′′, as discussed above. Moreover, the determination of the current unknown symbol portion may include weighting the upper and lower autocorrelation matrices Ū, L and the upper and lower transformation coefficient matrices Bu and Bl for the current and prior unknown symbol portions 32 (Block 90′′′), based upon proximity of respective channel estimates to unknown symbol portions, as also noted above. Moreover, each symbol in the current unknown symbol portion 32 may be determined (i.e., clamped) to a nearest discrete value, at Block 91′′′, as further noted above. It should be noted that upper and lower autocorrelation matrices Ū, L and the upper and lower transformation coefficient matrices Bu and Bl for future unknown symbol portions may also be used in addition to those for the prior unknown symbol portions, as illustrated at Blocks 82′′′, 83′′′, 84′′′, and 90′′′, as described above.
To provide further accuracy in certain applications, the particular BSA used in the application may be performed in forward and backward directions to compute two different estimates of the unknown symbols. The unknown symbol estimates are the actual values of the unknown symbols computed by BSA. This value is stored for use at the end but is clamped to the closest valid symbol constellation point to proceed with the BSA algorithm, as noted above. The forward and backward unknown symbol estimates may then be averaged for use in the next steps of the demodulation process, as will be appreciated by those skilled in the art.
Many modifications and other embodiments of the invention will come to the mind of one skilled in the art having the benefit of the teachings presented in the foregoing descriptions and the associated drawings. Therefore, it is understood that the invention is not to be limited to the specific embodiments disclosed, and that modifications and embodiments are intended to be included within the scope of the appended claims.

## Claims

1. A wireless communications device comprising:
a wireless receiver for receiving wireless signals comprising alternating known and unknown symbol portions; and
a demodulator connected to said wireless receiver and comprising
a channel estimation module for generating respective channel estimates for at least one prior unknown symbol portion and a current unknown symbol portion based upon adjacent known symbol portions,
an autocorrelation module for generating autocorrelation matrices for the at least one prior and current unknown symbol portions based upon respective channel estimates,
a channel match filter module for generating respective channel matching coefficients for the current unknown symbol portion,
a factorization module for dividing the autocorrelation matrices into respective upper and lower autocorrelation matrices,
a transformation module for transforming the channel matching coefficients into upper and lower channel matching coefficients, and
a back-substitution module for determining the current unknown symbol portion based upon the upper and lower autocorrelation matrices for the current and at least one prior unknown symbol portions, and the upper and lower channel matching coefficients for the current unknown symbol portion.

2. The wireless communications device of claim 1 wherein said transformation module transforms the channel matching coefficients into the upper and lower channel matching coefficients based upon transformation coefficients.

3. The wireless communications device of claim 1 wherein said back substitution module determines the current unknown symbol portion based upon a weighted average of the upper and lower autocorrelation matrices for the current and at least one prior unknown symbol portions.

4. The wireless communications device of claim 3 wherein the upper and lower autocorrelation matrices for the current unknown symbol portion and at least one prior unknown symbol portion are weighted based upon proximity of respective channel estimates to unknown symbol portions.

5. The wireless communications device of claim 1 wherein said channel estimation module further generates a channel estimate for at least one future unknown symbol portion; wherein said autocorrelation module generates an autocorrelation matrix for the at least one future unknown symbol portion; and wherein said back-substitution module also determines the current unknown symbol portion based upon the upper and lower autocorrelation matrices for the at least one future unknown symbol portion.

6. The wireless communications device of claim 1 wherein each symbol in the current unknown symbol portion has one of a plurality of discrete values, and wherein said back-substitution module determines nearest discrete values for symbols within the current unknown symbol portion.

7. The wireless communications device of claim 1 wherein said demodulator further comprises a signal energy removal module for removing a known signal energy quantity from the unknown symbol portions.

8. The wireless communications device of claim 1 wherein said factorization module divides the autocorrelation matrices into the upper and lower autocorrelation matrices based upon Cholesky factorization.

9. The wireless communications device of claim 1 wherein said factorization module divides the autocorrelation matrices into the upper and lower autocorrelation matrices based upon Bareiss factorization.

10. The wireless communications device of claim 1 wherein said factorization module divides the autocorrelation matrices into the upper and lower autocorrelation matrices based upon Levinson factorization.

11. The wireless communications device of claim 1 wherein said factorization module divides the autocorrelation matrices into the upper and lower autocorrelation matrices based upon Schur factorization.

12. The wireless communications device of claim 1 wherein said demodulator comprises a field-programmable gate array (FPGA).

13. The wireless communications device of claim 1 wherein said demodulator comprises an application specific integrated circuit (ASIC).

14. The wireless communications device of claim 1 wherein said demodulator comprises a digital signal processor (DSP).

15. A wireless communications device comprising:
a wireless receiver for receiving wireless signals comprising alternating known and unknown symbol portions; and
a demodulator connected to said wireless receiver and comprising
a channel estimation module for generating respective channel estimates for at least one prior unknown symbol portion and a current unknown symbol portion based upon adjacent known symbol portions,
an autocorrelation module for generating autocorrelation matrices for the at least one prior and current unknown symbol portions based upon respective channel estimates,
a channel match filter module for generating respective channel matching coefficients for the current unknown symbol portion,
a signal energy removal module for removing a known signal energy quantity from the unknown symbol portions,
a factorization-module for dividing the autocorrelation matrices into respective upper and lower autocorrelation matrices,
a transformation module for transforming the channel matching coefficients into upper and lower channel matching coefficients, and
a back-substitution module for determining the current unknown symbol portion based upon a weighted average of the upper and lower autocorrelation matrices for the current and at least one prior unknown symbol portions, and the upper and lower channel matching coefficients for the current unknown symbol portion.

16. The wireless communications device of claim 15 wherein said transformation module transforms the channel matching coefficients into the upper and lower channel matching coefficients based upon transformation coefficients.

17. The wireless communications device of claim 15 wherein the upper and lower autocorrelation matrices for the current unknown symbol portion and at least one future unknown symbol portion are weighted based upon proximity of respective channel estimates to unknown symbol portions.

18. The wireless communications device of claim 15 wherein each symbol in the current unknown symbol portion has one of a plurality of discrete values, and wherein said back-substitution module determines nearest discrete values for symbols within the current unknown symbol portion.

19. The wireless communications device of claim 15 wherein said channel estimation module further generates a channel estimate for at least one future unknown symbol portion; wherein said autocorrelation module generates an autocorrelation matrix for the at least one future unknown symbol portion; and wherein said back-substitution module also determines the current unknown symbol portion based upon the upper and lower autocorrelation matrices for the at least one future unknown symbol portions.

20. A wireless communications method comprising:
receiving wireless signals comprising alternating known and unknown symbol portions;
generating respective channel estimates for at least one prior unknown symbol portion and a current unknown symbol portion based upon adjacent known symbol portions;
generating autocorrelation matrices for the at least one prior and current unknown symbol portions based upon respective channel estimates;
generating respective channel matching coefficients for the current unknown symbol portion;
dividing the autocorrelation matrices into respective upper and lower autocorrelation matrices;
transforming the channel matching coefficients into upper and lower channel matching coefficients; and
determining the current unknown symbol portion based upon the upper and lower autocorrelation matrices for the current and at least one prior unknown symbol portions and the upper and lower channel matching coefficients for the current unknown symbol portion.

21. The method of claim 20 wherein transforming comprises transforming the channel matching coefficients into the upper and lower channel matching coefficients based upon transformation coefficients.

22. The method of claim 20 wherein determining comprises determining the current unknown symbol portion based upon a weighted average of the upper and lower autocorrelation matrices and the upper and lower channel matching coefficients for the current and at least one prior unknown symbol portions.

23. The method of claim 22 wherein the upper and lower autocorrelation matrices and the upper and lower channel matching coefficients for the current unknown symbol portion and at least one prior unknown symbol portion are weighted based upon proximity of respective channel estimates to unknown symbol portions.

24. The method of claim 20 wherein generating the channel estimates comprises generating a channel estimate for at least one future unknown symbol portion; wherein generating the autocorrelation matrices comprises generating an autocorrelation matrix for the at least one future unknown symbol portion; and wherein determining comprises determining the current unknown symbol portion also based upon the upper and lower autocorrelation matrices for the at least one future unknown symbol portion.

25. The method of claim 20 wherein each symbol in the current unknown symbol portion has one of a plurality of discrete values, and wherein determining the current unknown symbol portion comprises determining nearest discrete values for symbols within the current unknown symbol portion.

26. The method of claim 20 further comprising removing a known signal energy quantity from the received signals prior to generating the channel matching coefficients.

27. A wireless communications method comprising:
receiving wireless signals comprising alternating known and unknown symbol portions;
generating respective channel estimates for at least one future unknown symbol portion and a current unknown symbol portion based upon adjacent known symbol portions;
generating autocorrelation matrices for the at least one future and current unknown symbol portions based upon respective channel estimates;
generating respective channel matching coefficients for the current unknown symbol portion;
dividing the autocorrelation matrices into respective upper and lower autocorrelation matrices;
transforming the channel matching coefficients into upper and lower channel matching coefficients; and
determining the current unknown symbol portion based upon the upper and lower autocorrelation matrices for the current and at least one future unknown symbol portions and the upper and lower channel matching coefficients for the current unknown symbol portion.

28. The method of claim 27 wherein transforming comprises transforming the channel matching coefficients into the upper and lower channel matching coefficients based upon transformation coefficients.

29. The method of claim 27 wherein determining comprises determining the current unknown symbol portion based upon a weighted average of the upper and lower autocorrelation matrices and the upper and lower channel matching coefficients for the current and at least one future unknown symbol portions.

30. The method of claim 29 wherein the upper and lower autocorrelation matrices and the upper and lower channel matching coefficients for the current unknown symbol portion and at least one future unknown symbol portion are weighted based upon proximity of respective channel estimates to unknown symbol portions.

31. The method of claim 27 wherein each symbol in the current unknown symbol portion has one of a plurality of discrete values, and wherein determining the current unknown symbol portion comprises determining nearest discrete values for symbols within the current unknown symbol portion.

32. The method of claim 27 further comprising removing a known signal energy quantity from the received signals future to generating the channel matching coefficients.