# Patent

## Title
Low complexity technique for log-likelihood ratio computation

## Abstract

Systems and methods for detecting data in a multiple input/multiple output signal. The method includes receiving a first signal associated with a first data value and a second signal associated with a second data value. A distance value between the received second signal and each possible second data value is calculated. Coordinates for a hypothetical first signal in light of a first possible second data value are calculated, and the first coordinate value is quantized to a nearest constellation point. A distance value between the received second signal and each possible second data value is calculated using the calculated constellation points. A determination is made of a log-likelihood ratio based on the determined distance values.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application claims priority from U.S. Provisional Patent Application No. 61/039,260, filed on Mar. 25, 2008, and entitled “A Low Complexity Technique for Log-Likelihood Ratio Computation in MIMO Systems,” the entirety of which is incorporated herein by reference.


FIELD
The technology described in this patent document relates generally to signal receivers and more particularly to likelihood ratio computation in signal receivers.
BACKGROUND
Multiple transmit/multiple receive (MIMO) antennas may be used to enhance communication data rates in standards that allow more than one spatial stream to be transmitted, such as WLAN (IEEE 802.11n), WiMax (IEEE 802.16e), 3G-LTE, etc. FIG. 1 is a block diagram 30 of a multiple spatial stream transmitter configuration. Transmit data 32 is provided as a stream of 1's and 0's to an encoder 34. The encoder 34 encodes the transmit data 32 with, for example, an error correcting code. The output of the encoder 34 is provided to a spatial stream splitter 36, which divides the bit stream from the encoder 34 into two spatial streams in some order. The two spatial streams are then propagated to a frequency modulator 38 which modulates the streams into symbols, which may be represented as a sequence of complex numbers. The frequency modulated signals are sent through a transmission channel, such as through the air, via one or more antennas 40.
Efficient detection/equalization of the transmitted signals is central to a MIMO receiver. FIG. 2 is a block diagram of a multiple spatial stream receiver configuration. Multiple spatial stream signals are received, such as via one or more antennas 52, from the transmission channel. The received multiple spatial stream signals may be represented by the equation: yk=Hsk+w, where yk represents an N×1 vector of received signals over N spatial streams at time k, H is a complex-valued N×2 matrix that represents a channel matrix identifying the combined effects of the transmission channel and spatial mapping of the transmitter on the transmitted signal, xk is an N×1 vector that represents transmitted data values that are sought to be recovered, and w represents noise. The above relationship pertains to a single frequency in a frequency-flat fading single-carrier modulated system or, alternatively, applies to individual frequency subcarriers or tones in an orthogonal frequency division multiplexing (OFDM) or similarly modulated system. The received multiple spatial streams are propagated to an equalizer/receiver 54 which calculates log-likelihood ratios (LLR(1) and LLR(2)) for each of the received spatial streams. The calculated log-likelihood ratios are ordered and combined by a log-likelihood ratio combiner 56 and made available to a decoder 58. The decoder 58 decodes the data received from the combiner 56 and generates output data 60.
In a two spatial stream system, each data symbol received, xi, where i=1 corresponds to data transmitted on a first spatial stream, and i=2 corresponds to data transmitted on a second spatial stream, maps to n bits {b1(i), b2(i), . . . bn(i)}. M=2n is the alphabet size of the underlying modulation, such as binary phase shift keying (BPSK), quadrature amplitude modulation (QAM), etc., and the set of all possible scalar constellation points may be represented by A. The log-likelihood ratio (LLR) for a bit bk(i) given a received vector y and a known channel matrix H may be represented as:




  
    
      L
      ⁡
      
        (
        
          b
          k
          
            (
            i
            )
          
        
        )
      
    
    =
    
      
        log
        ⁢
        
          
            P
            ⁡
            
              (
              
                
                  b
                  k
                  
                    (
                    i
                    )
                  
                
                =
                1
              
              )
            
          
          
            P
            ⁡
            
              (
              
                
                  b
                  k
                  
                    (
                    i
                    )
                  
                
                =
                0
              
              )
            
          
        
      
      =
      
        log
        ⁢
        
          {
          
            
              (
              
                
                  ∑
                  
                    x
                    ∈
                    
                      x
                      
                        k
                        ,
                        i
                      
                    
                  
                
                ⁢
                
                  e
                  
                    
                      
                        -
                        
                          
                            
                            
                              y
                              -
                              Hx
                            
                            
                          
                          2
                        
                      
                      /
                      s
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      σ
                      2
                    
                  
                
              
              )
            
            /
            
              (
              
                
                  ∑
                  
                    x
                    ∈
                    
                      
                        x
                        _
                      
                      
                        k
                        ,
                        i
                      
                    
                  
                
                ⁢
                
                  e
                  
                    
                      
                        -
                        
                          
                            
                            
                              y
                              -
                              Hx
                            
                            
                          
                          2
                        
                      
                      /
                      2
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      σ
                      2
                    
                  
                
              
              )
            
          
          }
        
      
    
  
  ,




where xk,i is the set of all possible x vectors with bk(i)=1, and xk,i is the set of all possible x vectors with bk(i)=0. In practice, the following simplification, called the Max-Log Approximation, is utilized:





  
    L
    ⁡
    
      (
      
        b
        k
        
          (
          i
          )
        
      
      )
    
  
  ≈
  
    
      
        min
        
          x
          ∈
          
            x
            
              k
              ,
              i
            
          
        
      
      ⁢
      
        
          
          
            y
            -
            Hx
          
          
        
        2
      
    
    -
    
      
        min
        
          x
          ⁢
          
            
          
          ∈
          
            
              x
              _
            
            
              k
              ,
              i
            
          
        
      
      ⁢
      
        
          
            
            
              y
              -
              Hx
            
            
          
          2
        
        .
      
    
  




There are several existing systems for detecting/equalizing received signals in multiple spatial stream systems. FIG. 3A is a block diagram 70 of a log-likelihood ratio calculator 72 that utilizes a linear equalizer 74. The linear equalizer 74 receives, via one or more antennas 76, a multi-spatial stream signal that has been transmitted through a channel and outputs a stream of log-likelihood ratios based on the received signals. For example, a zero-forcing equalizer is a linear equalizer that may be utilized, as illustrated in FIG. 3A. The zero-forcing equalizer seeks to recover the transmitted data values, xk, from the received signal, yk, that are modeled as, yk=Hxk+w, by assuming the noise vector is zero. Having a known channel effect matrix, H, enables calculation of data values, xk, to be recovered from the received signal, yk, as the data values are the only unknown remaining. While the zero-forcing equalizer has a simple design, the zeroing of the noise term makes the method prone to error as the noise term is almost certainly not zero in any real-world system.
FIG. 3B is a block diagram 80 of a log-likelihood ratio calculator 82 that utilizes a maximum-likelihood receiver 84. The maximum-likelihood receiver 84 receives a multi-spatial signal that has been transmitted through a channel, such as through the air, via one or more antennas 86, and outputs a stream of log-likelihood ratios based on the received signals. The maximum-likelihood receiver 84 is superior to most linear equalizers in error performance. However, maximum-likelihood receivers tend to be highly complex, such as having a complexity that grows exponentially with the number of spatial streams associated with the system.
FIG. 4A is a block diagram 100 of a maximum-likelihood receiver 102 that utilizes an exhaustive search methodology 104. The exhaustive search module 104 receives, via one or more antennas 106, a multi-spatial signal that has been transmitted through a channel and outputs a stream of log-likelihood ratios based on the received signals. In the exhaustive search methodology 104, the maximum likelihood receiver computes ∥y−Hx∥2 for all possible values of x. In a two spatial stream system, this results in M2 total distance computations. The maximum-likelihood receiver then computes log-likelihood ratios accordingly.
FIG. 4B is a diagram illustrating exemplary calculations for the exhaustive search methodology in a 4-QAM setting. A real/imaginary plot of a received signal is shown at 112. The exhaustive search methodology calculates the distance term, ∥y−Hx∥2, for each of the constellation points. FIG. 4B illustrates only six of the distance calculations 114 to six of the constellation points 116 for ease in viewing. However, the exhaustive search method would process distance calculations for all of the 16 constellation points resulting in 16 distance terms to be considered in calculating an LLR. This problem is further exacerbated in popular, more complex encoding schemes such as 16-QAM, which would require 256 distance calculations with 256 distance terms to be considered in calculating an LLR. This order M2, O(M2), complexity may introduce a significant bottleneck into the receiver system.
FIG. 5A is a block diagram 120 of a maximum-likelihood receiver 122 that utilizes a sphere decoding simplification 124. The sphere decoding methodology 124 receives a multi-spatial signal that has been transmitted through a channel, such as through the air, via one or more antennas 126, and outputs a stream of log-likelihood ratios based on the received signals. The sphere decoding methodology 124 seeks to simplify the complexity of the exhaustive search by limiting the amount of constellation points to which distance calculations are made and, consequently, the number of distance terms to be considered in calculating an LLR. FIG. 5B is a diagram 130 illustrating the sphere decoding simplification. In the sphere decoding technique, distance values, ∥y−Hx∥2, are only computed for those x such that Hx lies inside a sphere of radius D centered around the received signal, y (i.e., for x such that ∥y−Hx∥2≦D2). A real/imaginary plot of a received signal is shown at 132. As illustrated in FIG. 5B, the limitation of distance calculations 136 to constellation points 138 within a radius D 134 reduces the number of distance calculations and terms to be considered in LLR calculation to four. While this simplification may offer significant processing savings, it may have a detrimental effect on error performance. Because the set of constellation points 138 within radius D may not have constituent 1s and 0s at every bit location, as is evident in the first bit position where all four constellation points 138 contain ‘0’s at the first position, the LLR calculation formulas described above may have insufficient data to correctly calculate an LLR (e.g., the Max Log Approximation would not have any terms in xεxk,i from which to select a minimum).
SUMMARY
In accordance with the teachings provided herein, systems and methods are provided for detecting data in a received multiple input/multiple output signal transmitted by a transmitter over multiple spatial streams through a transmission channel. The system may include the step of receiving a first signal on a first spatial stream and a second signal on a second spatial stream, where the first signal is associated with one or more first data values, and the second signal is associated with one or more second data values. The system may further determine a distance value between the received second signal and each possible second data value, where the determining step includes calculating a first coordinate value that identifies coordinates for a hypothetical first signal in light of a first possible second data value and quantizing the first coordinate value to a nearest constellation point. The calculating step and quantizing step may be repeated for each possible second data value to generate a plurality of constellation points, where one constellation point is associated with each possible second data value. The system may determine a distance value between the received second signal and each possible second data value using the calculated constellation point associated with the possible second data value being considered, where one distance value is associated with each possible second data value. The system may then determine a log-likelihood ratio based on the determined distance value associated with each possible second data value.
The system may receive a channel matrix representing the combined effects of the transmission channel and spatial mapping of the transmitter on a transmitted signal, where elements of the received channel matrix are also utilized in the step of determining a distance value. The system may further decode the one or more second data values based on the calculated log-likelihood ratio
The steps of calculating a first coordinate value and quantizing the first coordinate may enable the determining a distance value step to be performed without an exhaustive search of all possible first signal values. The systems and methods may further include the step of performing a QR decomposition of the channel matrix, where a portion of the results of the QR decomposition are the elements of the received channel matrix utilized by the step of determining a distance value. The step of determining a distance value may utilize columns of the received channel matrix as the elements of the received channel matrix, where the step of determining a distance value does not utilize elements of a QR decomposition of the channel matrix. Additionally, the distance values may be calculated for a subset of the possible second data values.
The systems and methods may further include the steps of permutating the columns of the channel matrix by multiplying the channel matrix by a permutation matrix. The method may include the step of determining a second distance value between the received first signal and each possible first data value, where the determining step includes calculating a second coordinate value that identifies coordinates for a hypothetical second signal in light of a first possible data value and quantizing the second coordinate value to a nearest second constellation point. The calculating step and quantizing step may be repeated for each possible first data value to generate a plurality of second constellation points, where one second constellation point is associated with each possible first data value. The method may further include determining a second distance value between the received first signal and each possible first data value using elements of the permutated channel matrix and the calculated second constellation point associated with the possible first data value being considered, one second distance value being associated with each possible first data value. The method may determine a second log-likelihood ratio based on the determined second distance value associated with each possible second data value and decode the one or more first data values based on the determined second log-likelihood ratio.
The permutation matrix may be of the form




  P
  =
  
    
      [
      
        
          
            0
          
          
            1
          
        
        
          
            1
          
          
            0
          
        
      
      ]
    
    .
  




The complexity of the method of detecting data may be proportion to a size of the alphabet O(M). The method may detect data transmitted over more than one frequency tone, and the method may detect transmitted OFDM data.

As another example, a method of detecting data in a received multiple input/multiple output signal transmitted by a transmitter over multiple spatial streams through a transmission channel is provided, where the signal represents one of a plurality of alphabet symbols, where each alphabet symbol is associated with a plurality of data bit values. The method may include a step of receiving a first signal (y1) on a first spatial stream and a second signal (y2) on a second spatial stream, the first signal and the second signal being combined to form a y vector ([y1,y2]T), the first signal being associated with a first data value (x1) of the alphabet symbol with which the received multiple input/multiple output signal is associated, and the second signal being associated with a second data value (x2) of the alphabet symbol with which the received multiple input/multiple output signal is associated. The method may also receive a channel matrix (H) representing combined effects of the transmission channel and spatial mapping of the transmitter. The method may perform a QR decomposition of the channel matrix (H), such that H=QR, where the Q matrix is a unitary matrix and the R matrix is an upper diagonal matrix, where the R matrix may be represented as




  R
  =
  
    
      [
      
        
          
            
              r
              11
            
          
          
            
              r
              12
            
          
        
        
          
            0
          
          
            
              r
              22
            
          
        
      
      ]
    
    .
  




The method may transform the y vector to an s vector ([s1,s2]T) according to the relationship: s=QHy.

The method may determine a distance value between the received second signal (y2) and each possible second data value (x2), where the determination includes calculating a first coordinate value (F) according to the relationship: F=(s1−r12x2)/r11, quantizing the first coordinate value (F) to the nearest constellation point ({circumflex over (x)}|x2), and determining a distance value (∥y−Hx∥2) for the first possible second data value (x2) according to the relationship: ∥y−Hx∥2=|s2−r22x2|2+|s1−r11({circumflex over (x)}1|x2)−r12x2|2. The method may then repeat the calculating, quantizing, and determining steps for each of the possible second data values (x2) so that one distance value (∥y−Hx∥2) is associated with each possible second data value (x2). Further, the method may determine a log-likelihood ratio for the second data value (L(bkIi))) according to the relationship: L(bk(i))=min(∥y−Hx∥12)−min(∥y−Hx∥12), where ∥y−Hx∥12 are distance values associated with possible second data values where bk(i)=0 and ∥y−Hx∥22 are distance values associated with possible second data values where bk(i)=1. The method may also decode the second data value (x2) based on the determined log-likelihood ratio.
The method may further repeat the steps of performing, transforming, determining a distance value, determining a log-likelihood ratio, and decoding utilizing a modified channel matrix that is equal to the received channel matrix multiplied by a permutation matrix, the repeated steps utilizing a symbolic interchange between the first data value (x1) and the second data value (x2). The method may be performed such that the constellation point ({circumflex over (x)}1|x2) selected in the quantizing step fulfills the relationship: {circumflex over (x)}1|x2=arg min|s1−r11x1−r12x2|2, over all possible first data values (x1), without performing a search over all possible first data values (x1).
As a further example, a system is provided for detecting data in a received multiple input/multiple output signal transmitted by a transmitter over multiple spatial streams through a transmission channel. The system may include one or more antennas configured to receive a first signal associated with a first data value and a second signal associated with a second data value. A distance value determiner may be configured to calculate a distance value between the received second signal and each possible second data value. The distance value determiner may include a first coordinate value calculator configured to calculate coordinates for a hypothetical first signal in light of a first possible second data value and a quantizer configured to quantize the first coordinate value to a nearest constellation point, where the first coordinate value calculator and the quantizer may be configured to repeat their functions for each possible second data value. The distance value determiner also may include a distance calculator configured to calculate a distance value between the received second signal and each possible second data value using the calculated constellation points. The system may also includes a log-likelihood ratio determiner configured to determine a log-likelihood ratio based on the determined distance values.
As another example, a system for detecting data in a received multiple input/multiple output signal transmitted by a transmitter over multiple spatial streams through a transmission channel is provided, where the signal is associated with one of a plurality of alphabet symbols that make up an alphabet, each alphabet symbol being associated with a plurality of data bit values. The system may include means for receiving a first signal on a first spatial stream and a second signal on a second spatial stream, where the first signal is associated with one or more first data values of the alphabet symbol with which the received multiple input/multiple output signal is associated, and the second signal is associated with one or more second data values of the alphabet symbol with which the received multiple input/multiple output signal is associated. The system may also include means for receiving a channel matrix representing the combined effects of the transmission channel and spatial mapping of the transmitter on a transmitted signal. The system may further include means for determining a distance value between the received second signal and each possible second data value, where the means for determining include means for calculating a first coordinate value that identifies coordinates for a hypothetical first signal in light of a first possible second data value and means for quantizing the first coordinate value to a nearest constellation point. The means for calculating and means for quantizing may repeat their respective functions for each possible second data value to generate a plurality of constellation points, where one constellation point is associated with each possible second data value. The system may also include means for determining a distance value between the received second signal and each possible second data value using elements of the received channel matrix and the calculated constellation point associated with the possible second data value being considered, where one distance value is associated with each possible second data value. The system further include means for determining a log-likelihood ratio based on the determined distance value associated with each possible second data value and means for decoding the one or more second data values based on the calculated log-likelihood ratio.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of a multiple spatial stream transmitter configuration.
FIG. 2 is a block diagram of a multiple spatial stream receiver configuration.
FIG. 3A is a block diagram of a log-likelihood ratio calculator that utilizes a linear equalizer.
FIG. 3B is a block diagram of a log-likelihood ratio calculator that utilizes a maximum-likelihood receiver.
FIG. 4A is a block diagram of a maximum-likelihood receiver that utilizes an exhaustive search methodology.
FIG. 4B is a diagram illustrating exemplary calculations for the exhaustive search methodology.
FIG. 5A is a block diagram of a maximum-likelihood receiver that utilizes a sphere decoding simplification.
FIG. 5B is a diagram illustrating the sphere decoding simplification.
FIG. 6 is a block diagram of a maximum-likelihood receiver that utilizes a matrix decoder.
FIG. 7 is a block diagram illustrating internal components of a matrix decoder.
FIG. 8 is a diagram illustrating the calculation of a coordinate value and quantizing the coordinate value to the nearest constellation point.
FIG. 9 is a flow diagram illustrating a process for detecting data in a received multiple input/multiple output signal.
FIG. 10 illustrates an exemplary implementation of the present invention.



DETAILED DESCRIPTION
FIG. 6 is a block diagram 150 of a maximum-likelihood receiver 152 that utilizes a matrix decoder 154 able to perform an O(M) complexity distance and LLR calculation while offering substantially identical error performance as the exhaustive search methodology. The matrix decoder 154 receives, via one or more antennas 156, a first signal (on a first spatial stream) and a second signal (on a second spatial stream) that have been transmitted through a channel and outputs a stream of log-likelihood ratios based on the received signals. The received signals may be represented by the above described relationship: y=Hx+w, where y represents the received signals, x represents the data values sought to be extracted, H is a known channel effect and spatial mapping matrix, and w represents noise. In the two spatial stream case, y is a 2×1 vector ([y1, y2]T), x is a 2×1 vector ([x1, x2]T), H is a 2×2 vector, and w is a 2×1 vector.
FIG. 7 is a block diagram 160 illustrating example internal components of a matrix decoder 162. Prior to receiving data signals over the one or more antennas 163, matrix calculations are done with respect to the known channel matrix, H 164. As illustrated at 166, a QR decomposition of the H matrix may be performed on the H matrix such that H=QR. The Q matrix is a unitary matrix, and the R matrix is an upper diagonal matrix. In the case of a two spatial stream system, the R matrix may be represented as:




  R
  =
  
    
      [
      
        
          
            
              r
              11
            
          
          
            
              r
              12
            
          
        
        
          
            0
          
          
            
              r
              22
            
          
        
      
      ]
    
    .
  




A similar procedure is performed at 168, 170 using a permutated channel matrix. At 168, the channel matrix, H 164, is multiplied by a permutation matrix. In the case of a two spatial stream system, the permutation matrix may be represented as





  
    P
    =
    
      [
      
        
          
            0
          
          
            1
          
        
        
          
            1
          
          
            0
          
        
      
      ]
    
  
  ,




such that the columns of the channel matrix are swapped when multiplied by the permutation matrix.

The matrix decoder 162 executes over two paths 172, 174 that may operate in series or in parallel. The first path 172 calculates log-likelihood ratios 176 for data values associated with the second received spatial stream, and the second path 174 calculates log-likelihood ratios 178 for data values associated with the first received spatial stream. These log-likelihood ratios 176, 178 may be combined and decoded as illustrated above with respect to FIG. 2.
The first path 172 begins at a matrix transformer 180. In a two spatial stream case, the matrix transformer 180 receives the first spatial stream signal and the second spatial stream signal as a 2×1 vector ([y1, y2]T). The matrix transformer 180 transforms the received y vector according to the relationship s=QHy, resulting in a 2×1 s vector ([s1, s2]T).
Following the s transformation at 180, a minimum distance value is calculated at 182 for each of the M possible values of x2. In a two spatial stream system having an alphabet size of M, x1 will have M possible values, and x2 will have M possible values resulting in M2 constellation points. The minimum distance value calculated at 182 is calculated according to the formula:

∥y−Hx∥2=∥s−Rx∥2=|s2−r22x2|2+|s1−r11)({circumflex over (x)}1|x2)−r12x2|2 

for each possible x2 value. All of these values are known except for {circumflex over (x)}1|x2, which represents the constellation point nearest to a hypothetical x1 value given an x2 value. In other words {circumflex over (x)}1|x2 fulfills the relationship:





  
    
      
        x
        ^
      
      1
    
    |
    
      x
      2
    
  
  =
  
    arg
    ⁢
    
      
    
    ⁢
    
      
        min
        
          
            x
            1
          
          ∈
          A
        
      
      ⁢
      
        
          
            
            
              
                s
                1
              
              -
              
                
                  r
                  11
                
                ⁢
                
                  x
                  1
                
              
              -
              
                
                  r
                  12
                
                ⁢
                
                  x
                  2
                
              
            
            
          
          2
        
        .
      
    
  




To avoid an explicit evaluation of this relationship, which would result in a distance calculation of O(M2) complexity, a scaling/slicing procedure is performed with the same result as an explicit evaluation shown in FIG. 8.

FIG. 8 is a diagram 200 illustrating the calculation of a coordinate value and quantizing the coordinate value to the nearest constellation point. In the scaling/slicing procedure, a first coordinate value, F 202, is calculated according to the formula: F=(s1−r12x2)/r11. The calculated F value is a complex number. Following calculation of F, the distance calculator 182 quantizes F to the nearest constellation point 204. This nearest constellation point is selected as {circumflex over (x)}1|x2. For example, if F is calculated as 0.8+j0.3, and constellation points are located at (±1, ±j1), then the constellation point at 1+j1 would be selected as {circumflex over (x)}1|x2.
With reference back to FIG. 7, following selection of {circumflex over (x)}1|x2 for one of the possible values of x2, the above described distance formula:

∥y−Hx∥2=∥s−Rx∥2=|s2−r22x2|2+|s1−r11)({circumflex over (x)}1|x2)−r12x2|2.

is evaluated for the current value of x2. The scaling/slicing and distance calculation procedures are then repeated for the next possible x2 value. When distance values for all possible values of x2 have been calculated, a log-likelihood ratio may be calculated as shown at 184 for the data associated with the second spatial stream, x2, using one of the above described formulas, such as the Max Log Approximation. These calculated log-likelihood ratios are output as shown at 176.

A similar process is followed along the second path 174 to calculate log-likelihood ratios for data associated with the first spatial stream. Following permutation of the channel matrix, H, at 168, a QR decomposition is performed at 170 on the permutated channel matrix. The second path 174 begins at a second matrix transformer 186. In a two spatial stream case, the matrix transformer 186 receives the first spatial stream signal and the second spatial stream signal as a 2×1 vector ([y1, y2]T). The second matrix transformer 186 transforms the received y vector according to the relationship s=QHy, resulting in a 2×1 s vector ([s1, s2]T).
Following the s transformation at 186, a minimum distance value is calculated at 188 for each of the M possible values of x1 in a similar manner as was described with respect to x2 at 182. The minimum distance value calculated at 182 is calculated according to the formula:

∥y−Hx∥2=∥s−Rx∥2=|s2−r22x2|2+|s1−r11)({circumflex over (x)}1|x2)−r12x2|2.

All of these values are known except for {circumflex over (x)}2|x1, which represents the constellation point nearest to a hypothetical x2 value given an x1 value. In other words {circumflex over (x)}2|x1 fulfills the relationship:





  
    
      
        x
        ^
      
      2
    
    |
    
      x
      1
    
  
  =
  
    arg
    ⁢
    
      
    
    ⁢
    
      
        min
        
          
            x
            2
          
          ∈
          A
        
      
      ⁢
      
        
          
            
            
              
                s
                2
              
              -
              
                
                  r
                  22
                
                ⁢
                
                  x
                  2
                
              
              -
              
                
                  r
                  12
                
                ⁢
                
                  x
                  1
                
              
            
            
          
          2
        
        .
      
    
  




To avoid an explicit evaluation of this relationship, which would result in a distance calculation of O(M2) complexity, a scaling/slicing procedure is performed in a similar manner as described above with respect to FIG. 8.

Following selection of {circumflex over (x)}2|x1 for one of the possible values of x2 using the scaling/sliding technique, the above described distance formula:

∥y−Hx∥2=∥s−Rx∥2=|s2−r22x2|2+|s1−r11)({circumflex over (x)}1|x2)−r12x2|2,

is evaluated for the current value of x1. The scaling/slicing and distance calculation procedures are then repeated for the next possible x2 value. When distance values for all possible values of x1 have been calculated, a log-likelihood ratio may be calculated as shown at 190 for the data associated with the first spatial stream, x1, using one of the above described formulas, such as the Max Log Approximation. These calculated log-likelihood ratios are output as shown at 178.

The calculation and quantization steps of the scaling/slicing procedure are both O(1) operations resulting in a scaling/slicing procedure having an O(1) complexity. This is in contrast to the O(M) complexity of an explicit evaluation of the {circumflex over (x)}1|x2 and {circumflex over (x)}2|x1 formulas above. The O(1) scaling/slicing procedure makes the distance calculation step 182 operate at O(M) complexity. This is in contrast to the O(M2) complexity of the exhaustive search methodology described above, potentially offering large savings in required hardware and computation time as well as higher throughput. The process described with respect to FIG. 7 also offer the same error performance as the exhaustive search methodology, potentially offering significant error performance gains over other methods such as sphere decoding and zero forcing equalizers.
It should be noted that variations of the above described procedures may be implemented while still achieving successful operation. For example, the scaling/slicing operations for {circumflex over (x)}1|x2, and {circumflex over (x)}2|x1 may be performed using column values of the channel matrix, H, directly. Where h1 corresponds to the first channel matrix column, and h2 corresponds to the second channel matrix column in a two spatial stream context, {circumflex over (x)}1|x2 are sought that fulfill the relationship:




  
    
      
        
          x
          ^
        
        1
      
      |
      
        x
        2
      
    
    =
    
      arg
      ⁢
      
        
      
      ⁢
      
        
          min
          
            
              x
              1
            
            ∈
            A
          
        
        ⁢
        
          
            
            
              y
              -
              
                
                  h
                  1
                
                ⁢
                
                  x
                  1
                
              
              -
              
                
                  h
                  2
                
                ⁢
                
                  x
                  2
                
              
            
            
          
          2
        
      
    
  
  ,




which may be expanded to:





  
    
      
        x
        ^
      
      1
    
    |
    
      x
      2
    
  
  =
  
    arg
    ⁢
    
      
    
    ⁢
    
      
        min
        
          
            x
            1
          
          ∈
          A
        
      
      ⁢
      
        
          
            
            
              
                
                  h
                  1
                  H
                
                ⁢
                y
              
              -
              
                
                  h
                  1
                  H
                
                ⁢
                
                  h
                  1
                
                ⁢
                
                  x
                  1
                
              
              -
              
                
                  h
                  1
                  H
                
                ⁢
                
                  h
                  2
                
                ⁢
                
                  x
                  2
                
              
            
            
          
          2
        
        .
      
    
  




The scaling/slicing operation may then be performed by calculating an F coordinate value:

F=(h1Hy−h1Hh2)/h1Hh1,

and quantizing F to the nearest constellation point to select {circumflex over (x)}1|x2. Similar operations may be performed with respect to {circumflex over (x)}2|x1.

As another variation, distance values may be calculated for only a subset of the M possible values of x1 and x2 as illustrated, for example at 182 and 188 in FIG. 7, using the O(1) calculation techniques for {circumflex over (x)}1|x2 and {circumflex over (x)}2|x1. The selection of which distance values are to be calculated may be done by a variety of methods such as a sphere decoding method as described above or, for example, by selecting a number of points that minimize the expression: |s2−r22x2|2.
FIG. 9 is a flow diagram 210 illustrating a process for detecting data in a received multiple input/multiple output signal transmitted by a transmitter over multiple spatial streams through a transmission channel, the signal being associated with one of a plurality of alphabet symbols that make up an alphabet, each alphabet symbol being associated with a plurality of data bit values. At 212, first and second signals are received. The first signal is received on a first spatial stream, where the first signal is associated with one or more first data values of the alphabet signal with which the received multiple input/multiple output signal is associated. The second signal is received on a second spatial stream, where the second signal is associated with one or more second data values of the alphabet signal with which the received multiple input/multiple output signal is associated. At 214, a channel matrix is received that represents the combined effects of the transmission channel and spatial mapping of the transmitter on a transmitted signal.
At 216, a distance value is determined between the received second signal and each possible second data value. The determining step 216 includes calculating a first coordinate point that identifies coordinates for a hypothetical first signal in light of a first possible second data value and quantizing the first coordinate value to a nearest constellation point as depicted at 218. The calculating step and quantizing step are repeated for each possible second data value to generate a plurality of constellation points, where one constellation point is associated with each possible second data value. The determining step further includes a step of determining a distance value between the received second signal and each possible second data value using elements of the received channel matrix and the calculated constellation point associated with the possible second data value being considered as shown at 220. A determination of a log-likelihood ratio is then calculated at 222 based on the determined distance value associated with each possible second data value, and the one or more second data values are decoded based on the calculated log-likelihood ratio at 224. The order of these steps may be rearranged while still achieving successful results.
The above described concepts may be implemented in a wide variety of applications including those examples described herein below.
Referring now to FIG. 10, the present invention may be embodied in a device 480. The device 480 can be any device capable of wireless communication—e.g., a cellular phone, set top box, smart phone, computer system, and the like. The present invention may implement either or both signal processing and/or control circuits, which are generally identified in FIG. 10 at 484, a WLAN interface and/or mass data storage of the device 480. Signal processing and/or control circuits 484 and/or other circuits (not shown) of the device 480 may process data, perform coding and/or encryption, perform calculations, format data and/or perform any other function as required by an application for the device 480.
The device 480 may communicate with mass data storage 490 that stores data in a nonvolatile manner. Mass data storage 490 may include optical and/or magnetic storage devices for example hard disk drives HDD and/or DVD drives. The device 480 may be connected to memory 494 such as RAM, ROM, low latency nonvolatile memory such as flash memory and/or other suitable electronic data storage. The device 480 also may support connections with a WLAN via a WLAN network interface 496.
This written description uses examples to disclose the invention, including the best mode, and also to enable a person skilled in the art to make and use the invention. It should be noted that the systems and methods described herein may be equally applicable to other frequency modulation encoding schemes. The patentable scope of the invention may include other examples.

## Claims

1. A method of detecting data in a received multiple input/multiple output signal, the received multiple input/multiple output signal having been transmitted by a transmitter over multiple spatial streams through a transmission channel, the method comprising:
receiving a first signal on a first spatial stream and receiving a second signal on a second spatial stream, the first signal being associated with one or more first data values, the second signal being associated with one or more second data values;
receiving a channel matrix representing combined effects of the transmission channel and spatial mapping of the transmitter on a transmitted signal;
determining a distance value between the received second signal and each possible second data value, the determining of the distance value including:
calculating a first coordinate value that identifies coordinates for a hypothetical first signal in light of a first of the possible second data values;
quantizing the first coordinate value to a nearest constellation point;
repeating the calculating step and quantizing step for each of the possible second data values to generate a plurality of constellation points, one constellation point being associated with each of the possible second data values;
determining a distance value between the received second signal and each of the possible second data values using the generated constellation points associated with the possible second data values, one distance value being associated with each possible second data value, and further utilizing elements of the received channel matrix;

determining a log-likelihood ratio based on the determined distance value associated with each of the possible second data values;
permutating the columns of the channel matrix by multiplying the channel matrix by a permutation matrix;
determining a second distance value between the received first signal and each possible first data value, the determining for each possible first data value including:
calculating a second coordinate value that identifies coordinates for a hypothetical second signal in light of a first possible first data value;
quantizing the second coordinate value to a nearest second constellation point;
repeating the calculating step and quantizing step for each possible first data value to generate a plurality of second constellation points, one second constellation point being associated with each possible first data value;
determining a second distance value between the received first signal and each possible first data value using elements of the permutated channel matrix and the calculated second constellation point associated with the possible first data value being considered, one second distance value being associated with each possible first data value;

determining a second log-likelihood ratio based on the determined second distance value associated with each possible first data value; and
decoding the one or more first data values based on the determined second log-likelihood ratio.

2. The method of claim 1, further comprising:
decoding the one or more second data values based on the calculated log-likelihood ratio.

3. The method of claim 1, wherein the steps of calculating a first coordinate value and quantizing the first coordinate enable the determining a distance value step to be performed without an exhaustive search of all possible first signal values.

4. The method of claim 1, further comprising:
performing a QR decomposition of the channel matrix,
wherein a portion of results of the QR decomposition are the elements of the received channel matrix utilized by the step of determining a distance value.

5. The method of claim 1, wherein the step of determining a distance value utilizes columns of the received channel matrix as the elements of the received channel matrix;
wherein the step of determining a distance value does not utilize elements of a QR decomposition of the channel matrix.

6. The method of claim 1, wherein distance values are calculated for a subset of the possible second data values.

7. The method of claim 1, wherein the permutation matrix is




  P
  =
  
    
      [
      
        
          
            0
          
          
            1
          
        
        
          
            1
          
          
            0
          
        
      
      ]
    
    .

8. The method of claim 1, wherein a complexity of the method of detecting data is proportional to a size of an alphabet associated with the received multiple input/multiple output signal.

9. The method of claim 1, wherein the method detects data transmitted over more than one frequency tone.

10. The method of claim 9, wherein the method detects transmitted OFDM data.

11. A method of detecting data in a received multiple input/multiple output signal, the received multiple input/multiple output signal having been transmitted by a transmitter over multiple spatial streams through a transmission channel, the received multiple input/multiple output signal representing one of a plurality of alphabet symbols, each alphabet symbol being associated with a plurality of data bit values, the method comprising:
receiving a first signal (y1) on a first spatial stream and a second signal (y2) on a second spatial stream, the first signal and the second signal being combined to form a y vector ([y1, y2]T), the first signal being associated with a first data value (x1) of the alphabet symbol with which the received multiple input/multiple output signal is associated, the second signal being associated with a second data value (x2) of the alphabet symbol with which the received multiple input/multiple output signal is associated;
receiving a channel matrix (H) representing combined effects of the transmission channel and spatial mapping of the transmitter;
performing a QR decomposition of the channel matrix (H), such that H=QR, wherein Q matrix is a unitary matrix and R matrix is an upper diagonal matrix;
wherein the R matrix is





  
    R
    =
    
      [
      
        
          
            
              r
              11
            
          
          
            
              r
              12
            
          
        
        
          
            0
          
          
            
              r
              22
            
          
        
      
      ]
    
  
  ;



transforming the y vector to an s vector ([s1, s2]T) according to the relationship: s=QHy;
determining a distance value between the received second signal (y2) and each possible second data value (x2), the determining including:
calculating a first coordinate value (F) according to the relationship: F=(s1−r12x2)/r11;
quantizing the first coordinate value (F) to the nearest constellation point ({circumflex over (x)}|x2);
determining a distance value (∥y−Hx∥2) for the first possible second data value (x2) according to the relationship: ∥y−Hx∥2=|s2−r22x2∥2|s1−r11({circumflex over (x)}|x2)−r12x2|2;
repeating the calculating, quantizing, and determining steps for each of the possible second data values (x2) so that one distance value (∥y−Hx∥2) is associated with each possible second data value (x2);

determining a log-likelihood ratio for each bit in the second data value (L(bk(i))) according to the relationship: L(bk(i))=min(∥y−Hx∥12)−min(∥y−Hx∥22), where ∥y−Hx∥x22 are distance values associated with possible second data values where bk(i)=0 and ∥y−Hx∥22 are distance values associated with possible second data values where bk(i)=1;
decoding the second data value (x2) based on the determined log-likelihood ratio.

12. The method of claim 11, further comprising:
repeating the steps of performing, transforming, determining a distance value, determining a log-likelihood ratio, and decoding utilizing a modified channel matrix that is equal to the received channel matrix multiplied by a permutation matrix, the repeated steps utilizing a symbolic interchange between the first data value (x1) and the second data value (x2).

13. The method of claim 11, wherein the constellation point ({circumflex over (x)}|x2) selected in the step of quantizing the first coordinate value (F) fulfills the relationship: {circumflex over (x)}|x2=arg min|s1−r11x1−r12x2|2 over all possible first data values (x1), without performing a search over all possible first data values (x1).