# Patent

## Title
Multi-stream maximum-likelihood demodulation based on bitwise constellation partitioning

## Abstract

A method of decoding a signal includes receiving multiple data symbols corresponding to multiple transmitted data symbols. The method further includes selecting one candidate data symbol from multiple candidate data symbols corresponding to the multiple transmitted data symbols. The method further includes determining a global optimum candidate value for the selected one candidate data symbol. The method further includes grouping all possible values of the selected one candidate data symbol into two or more bit groups. The method further includes selecting a bit group from the two or more bit groups that does not include the global optimum value. The method further includes determining a local optimum candidate value from values in the selected bit group. The method further includes calculating a likelihood value for a bit in the selected one candidate data symbol based at least in part on the determined global and local optimum candidate values.

## Background
CROSS REFERENCE TO RELATED APPLICATION
This application claims the benefit of U.S. Provisional Patent App. No. 61/093,601 entitled “MIMO Soft ML Demodulation Based on Bit-Wise Constellation Partitioning,” filed on Sep. 2, 2008, the disclosure of which is hereby expressly incorporated herein by reference.


FIELD OF TECHNOLOGY
The present disclosure relates generally to multi-antenna wireless systems and, more particularly, to a multi-stream maximum-likelihood demodulation.
BACKGROUND
An ever-increasing number of relatively inexpensive, low power wireless data communication services, networks and devices have been made available over the past number of years, promising near wire speed transmission and reliability. Various wireless technology is described in detail in the 802 IEEE Standards, including for example, the IEEE Standard 802.11a (1999) and its updates and amendments, the IEEE Standard 802.11g (2003), and the IEEE Standard 802.11n now in the process of being adopted, all of which are collectively incorporated herein fully by reference. These standards have been or are in the process of being commercialized with the promise of 54 Mbps or higher data rate, making them a strong competitor to traditional wired Ethernet and the more common “802.11b” or “WiFi” 11 Mbps mobile wireless transmission standard.
Generally speaking, transmission systems compliant with the IEEE 802.11a and 802.11g or “802.11a/g” as well as the 802.11n standards achieve their high data transmission rates using Orthogonal Frequency Division Multiplexing (OFDM) encoded symbols mapped up to a 64 quadrature amplitude modulation (QAM) multi-carrier constellation. Generally speaking, the use of OFDM divides the overall system bandwidth into a number of frequency sub-bands or channels, with each frequency sub-band being associated with a respective sub-carrier. Data upon each sub-carrier may be modulated with a modulation scheme such as QAM, phase shift keying, etc. Thus, each frequency sub-band of the OFDM system may be viewed as an independent transmission channel within which to send data, thereby increasing the overall throughput or transmission rate of the communication system.
Generally, transmitters used in the wireless communication systems that are compliant with the aforementioned 802.11a/802.11g/802.11n standards as well as other standards such as the 802.16 IEEE Standard, perform multi-carrier OFDM symbol encoding (which may include error correction encoding and interleaving), convert the encoded symbols into the time domain using Inverse Fast Fourier Transform (IFFT) techniques, and perform digital to analog conversion and conventional radio frequency (RF) upconversion on the signals. These transmitters then transmit the modulated and upconverted signals after appropriate power amplification to one or more receivers, resulting in a relatively high-speed time domain signal with a large peak-to-average ratio (PAR).
Likewise, the receivers used in the wireless communication systems that are compliant with the aforementioned 802.11a/802.11g/802.11n and 802.16 IEEE standards generally include an RF receiving unit that performs RF downconversion and filtering of the received signals (which may be performed in one or more stages), and a baseband processor unit that processes the OFDM encoded symbols bearing the data of interest. Generally, the digital form of each OFDM symbol presented in the frequency domain is recovered after baseband downconversion, conventional analog to digital conversion and Fast Fourier Transformation of the received time domain analog signal. Thereafter, the baseband processor performs frequency domain equalization (FEQ) and demodulation to recover the transmitted symbols. The recovered and recognized stream of symbols is then decoded, which may include deinterleaving and error correction using any of a number of known error correction techniques, to produce a set of recovered signals corresponding to the original signals transmitted by the transmitter.
In wireless communication systems, the RF modulated signals generated by the transmitter may reach a particular receiver via a number of different propagation paths, the characteristics of which typically change over time due to the phenomena of multi-path and fading. Moreover, the characteristics of a propagation channel differ or vary based on the frequency of propagation. To compensate for the time varying, frequency selective nature of the propagation effects, and generally to enhance effective encoding and modulation in a wireless communication system, each receiver of the wireless communication system may periodically develop or collect channel state information (CSI) for each of the frequency channels, such as the channels associated with each of the OFDM sub-bands discussed above. Generally speaking, CSI is information defining or describing one or more characteristics about each of the OFDM channels (for example, the gain, the phase and the SNR of each channel). Upon determining the CSI for one or more channels, the receiver may send this CSI back to the transmitter, which may use the CSI for each channel to precondition the signals transmitted using that channel so as to compensate for the varying propagation effects of each of the channels.
To further increase the number of signals which may be propagated in the communication system and/or to compensate for deleterious effects associated with the various propagation paths, and to thereby improve transmission performance, it is known to use multiple transmit and receive antennas within a wireless transmission system. Such a system is commonly referred to as a multiple-input, multiple-output (MIMO) wireless transmission system and is specifically provided for within the 802.11n IEEE Standard now being adopted. Various other standards and projects, such as the 802.16 standard, or WiMAX, and the Long Term Evolution (LTE) project, support MIMO techniques. Generally speaking, the use of MIMO technology produces significant increases in spectral efficiency and link reliability of IEEE 802.11, IEEE 802.16, and other systems, and these benefits generally increase as the number of transmit and receive antennas within the MIMO system increases.
In addition to the frequency sub-channels created by the use of OFDM, a MEMO channel formed by the various transmit and receive antennas between a particular transmitter and a particular receiver includes a number of independent spatial channels. As is known, a wireless MIMO communication system can provide improved performance (e.g., increased transmission capacity) by utilizing the additional dimensionalities created by these spatial channels for the transmission of additional data. Of course, the spatial channels of a wideband MIMO system may experience different channel conditions (e.g., different fading and multi-path effects) across the overall system bandwidth and may therefore achieve different SNRs at different frequencies (i.e., at the different OFDM frequency sub-bands) of the overall system bandwidth. Consequently, the number of information bits per modulation symbol (i.e., the data rate) that may be transmitted using the different frequency sub-bands of each spatial channel for a particular level of performance may differ from frequency sub-band to frequency sub-band.
The transmitters and receivers in the wireless communication system may each be capable of using a variety of modulation schemes. For example, some modulations schemes may provide a higher bit rate than other schemes (e.g., 64-QAM vs. 16-QAM). Typically, modulation schemes that provide a higher bit rate may be more sensitive to channel impairments, such as noise, as compared to modulation schemes with a lower bit rate.
Different modulation/demodulation schemes have various degrees of complexity, and complexity of a given demodulation technique may affect the complexity of a receiver. Higher complexity of a demodulation technique generally requires more complexity on the receiver, e.g., more, larger, and/or more expensive processing modules and/or components. Higher complexity of a demodulation technique may also lead to an increase in processing time.
SUMMARY
The present disclosure provides methods and apparatus decoding a signal transmitted via a multiple input multiple output (MIMO) communication channel.
In one embodiment, a method of decoding a signal transmitted via a multiple input multiple output (MIMO) communication channel includes receiving a data symbol vector including multiple data symbols corresponding to multiple transmitted data symbols. The method further includes selecting one of the multiple candidate data symbols, where the multiple candidate data symbols define a candidate vector, and where the multiple candidate data symbols correspond to the multiple transmitted data symbols. The method further includes determining a global optimum candidate value for the selected one candidate data symbol for a given set of values corresponding to all of the multiple candidate data symbols but the selected one candidate data symbol, the global optimum candidate value minimizing a distance value corresponding to a distance between the received data symbol vector and a channel matrix multiplied with the candidate vector, without calculating the distance value. The method further includes calculating a likelihood value for a bit in all of the multiple candidate data symbols but the selected one candidate data symbol based at least in part on the determined global optimum candidate value.
In various implementations, one or more of the following features may be included. The method may include calculating the distance value, and calculating the likelihood value for the bit may include calculating the likelihood value based at least in part on the calculated distance value. The method may include grouping all possible values of the selected one candidate data symbol into two or more bit groups, where each of the two or more bit groups includes values of the selected one candidate data symbol with at least one common bit. The method may further include selecting a bit group from the two or more bit groups that does not include the global optimum value. The method may further include determining a local optimum candidate value from values in the selected bit group for the selected one candidate data symbol for a given set of values corresponding to all of the plurality of candidate data symbols but the selected one candidate data symbol, the local optimum candidate value minimizing a distance value corresponding to a distance between the received data symbol vector and the channel matrix multiplied with the candidate vector, without calculating the distance value. The method may further include calculating a likelihood value for a bit in the selected one candidate data symbol based at least in part on the determined local optimum candidate value.
In another embodiment, a method of decoding a signal transmitted via a multiple input multiple output (MIMO) communication channel includes receiving a data symbol vector including multiple data symbols corresponding to multiple transmitted data symbols. The method further includes selecting one of multiple candidate data symbols, where the multiple candidate data symbols define a candidate vector, and where the multiple candidate data symbols correspond to the multiple transmitted data symbols. The method further includes grouping all possible values of the selected one candidate data symbol into two or more bit groups. The method further includes selecting a bit group from the two or more bit groups. The method further includes determining a local optimum candidate value from values in the selected bit group for the selected one candidate data symbol for a given set of values corresponding to all of the multiple candidate data symbols but the selected one candidate data symbol, the local optimum candidate value minimizing a distance value corresponding to a distance between the received data symbol vector and a channel matrix multiplied with the candidate vector, without calculating the distance value. The method further includes calculating a likelihood value for a bit in the selected one candidate data symbol based at least in part on the determined local optimum candidate value.
In another embodiment, a device for decoding a signal transmitted via a multiple input multiple output (MIMO) communication channel generally includes a multi-stream maximum-likelihood (ML) demodulator that calculates a likelihood value based on a received data symbol vector and a decoder that decodes the received data symbol vector based at least in part on the calculated likelihood value. More specifically, the ML demodulator is configured to receive a data symbol vector including multiple data symbols corresponding to a multiple transmitted data symbols. The ML demodulator is further configured to select one of multiple candidate data symbols, where the multiple candidate data symbols define a candidate vector, and where the multiple candidate data symbols correspond to the multiple transmitted data symbols. The ML demodulator is further configured to determine a global optimum candidate value for the selected one candidate data symbol for a given set of values corresponding to all of the multiple candidate data symbols but the selected one candidate data symbol, the global optimum candidate value minimizing a distance value corresponding to a distance between the received data symbol vector and a channel matrix multiplied with the candidate vector, without calculating the distance value. The ML demodulator is further configured to calculate a likelihood value for a bit in all of the multiple candidate data symbols but the selected one candidate data symbol based at least in part on the determined global optimum candidate value.
In various implementations, one or more of the following features may be included. The multi-stream ML demodulator may be further configured to group all possible values of the selected one candidate data symbol into two or more bit groups, where each of the two or more bit groups includes values of the selected one candidate data symbol with at least one common bit. The multi-stream ML demodulator may be further configured to select a bit group from the two or more bit groups that does not include the global optimum value. The multi-stream ML demodulator may be further configured to determine a local optimum candidate value from values in the selected bit group for the selected one candidate data symbol for a given set of values corresponding to all of the plurality of candidate data symbols but the selected one candidate data symbol. The local optimum candidate value may minimize a distance value corresponding to a distance between the received data symbol vector and the channel matrix multiplied with the candidate vector. The multi-stream ML demodulator may be configured to determine the local optimum candidate value without calculating the distance value. The multi-stream ML demodulator may be further configured to calculate a likelihood value for a bit in the selected one candidate data symbol based at least in part on the determined local optimum candidate value.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of an example wireless communication system;
FIG. 2A is a block diagram of an example transmitting device;
FIG. 2B is a block diagram of another example transmitting device;
FIG. 3A is an example constellation set for a 4-QAM scheme;
FIG. 3B is an example constellation set for a 16-QAM scheme;
FIG. 4 is a block diagram of an example receiving device having a multi-stream maximum-likelihood (ML) demodulator;
FIG. 5 is a flow diagram of an example multi-stream ML method;
FIGS. 6A-6D are example constellation sets illustrating a multi-stream ML demodulation method;



Like reference numbers and designations in the various drawings indicate like elements. Furthermore, when individual elements are designated by references numbers in the form Nn, these elements may be referred to in the collective by N. For example, FIGS. 2A and 2B illustrate transmitting devices 200a and 200b that may be referred to collectively as transmitting device(s) 200.
DETAILED DESCRIPTION
FIG. 1 is a block diagram of an example wireless communication system 100 in which multiple devices, e.g., a transmitting device 102 and a receiving device 106 may communicate with each other via a shared wireless communication channel 104. Each of the devices 102 and 106 may be, for example, a base station or a mobile station equipped with a set of antennas 110-114 and 120-124, respectively. Although the wireless communication system 100 illustrated in FIG. 1 includes two devices, the wireless communication system 100 may, of course, include any number of devices, each equipped with the same or a different number of antennas (e.g., 1, 2, 3, 4 antennas and so on).
Furthermore, although the wireless communication system 100 illustrated in FIG. 1 includes a transmitting device 102 and a receiving device 106, devices in the wireless communication system 100 may generally operate in multiple modes (e.g., a transmit mode and a receive mode). In application to a high-definition (HD) television, for example, the HD television may operate solely as a wireless receiver, but not as a wireless transmitter. On the other hand, if a given device is a mobile station in a WiMAX communication network or a lap top computer having an IEEE Standard 802.11n compliant wireless transceiver, the device may operate in both, a transmit mode and a receive mode. Accordingly, in some embodiments, antennas 110-114 and 120-124 may support both transmission and reception. Alternatively, or additionally, a given device may include separate transmit antennas and separate receive antennas.
Different numbers of spatial streams 130 may be transmitted between the antennas 110-114 and 120-124 in various embodiments and/or configurations of the transmitting device 102 and/or the receiving device 104. Typically, the number S of spatial streams 130 associated with a shared communication channel 106 is less than or equal to minimum of the number NT of transmit antennas 110-114 and the number NR of receive antennas 120-124 (i.e., S=min(NT,NR)) The streams 130 may be defined in a variety of way, e.g., according to various multiple-input and multiple-output (MIMO) modes or schemes, including those known in the art. For example, the transmitting device 102 may use the antennas 110-114 to improve channel diversity by transmitting multiple copies of the same symbol via several streams. Alternatively, the transmitting device 102 may transmit different symbols via each of the antennas 110-114 to increase throughput. As yet another alternative, the transmitting device 102 may operate in a mixed MIMO mode to improve both channel diversity and throughput.
The transmitting device 102 and the receiving device 106 may communicate using a single frequency or multiple frequencies (i.e., the number of frequency channels K≧1). When K is more than one, the communication channel 104 thus includes K carriers or subcarriers C1, C2, . . . , CK, each associated with a particular frequency at which the devices 102 and 106 may communicate. In some embodiments, the wireless communication system 100 may use an OFDM technique, and the subcarriers C1, C2, . . . CK may be selected to be mutually orthogonal (i.e., to minimize cross-talk between each pair of subcarriers). However, the wireless communication system 100 could also use any other frequency division multiplexing technique.
The receiving device 106 may be configured to perform a multi-stream ML demodulation technique to be described in more detail below. Before describing the multi-stream demodulation techniques in detail, it is helpful to briefly explain how signals may be modulated.
FIGS. 2A-2B are block diagrams of example transmitting devices 200. The transmitting devices 200 may be utilized in the wireless communication system 100 as the transmitting device 102, for example. It will be understood, however, that the wireless communication system 100 may alternatively use another transmitting device 102.
Referring to FIG. 2A, the transmitting device 200a may generally convert a sequence of information bits into signals appropriate for transmission through a wireless channel (e.g., channel 104). More specifically, the transmitting device 200a may include an encoder 220a (e.g., a convolution encoder) that encodes information bits, and a modulator 230a that modulates the encoded bits into data symbols, which are mapped and converted to signals appropriate for transmission via transmit antennas 210a-218a. The transmitting device 200a may include various additional modules that, for ease of explanation, are not shown in FIG. 2A. For example, the transmitting device 200a may include an interleaver that interleaves the encoded bits to mitigate burst errors. The transmitting device 200a may further include an analog radio frequency (RF) front end for performing frequency upconversion, various filters, power amplifiers, and so on.
The modulator 230a may include a bit-to-symbol mapper 232a that maps encoded bits into multiple data symbols, and a symbol-to-stream mapper 234a that maps the multiple data symbols into multiple parallel data streams. For example, the modulator 230a may generate S parallel data streams that may be represented by a data symbol vector x=[x1, x2, . . . , xS], and each individual symbol xs in the data symbol vector x may be a symbol representative of W bits (bs,1, bs,2, . . . , bs,W). Accordingly, a given bit bs,n is the n-th bit in a data symbol of the s-th stream.
For ease of explanation, in the examples presented herein, streams and symbols have a one-to-one correspondence. That is, a single stream is associated with a single symbol and vice versa. Accordingly, the words “streams” and “symbols” may be used interchangeably. However, it should be understood that a given stream, for example, may have a number of associated symbols and vice versa.
In some embodiments, the modulator 230a may use QAM to map bits to symbols in a QAM signal constellation set, where the symbols are differentiated from one another by phase and/or magnitude. For example, FIG. 3A illustrates a 4-QAM constellation set 300a in an in phase (I) and quadrature phase (Q) plane. In this case, constellation points 302a-302d are distinguishable only by phase. Each constellation point 302 represents a different two-bit symbol: 302a may represent “00,” 302b may represent “01,” 302c may represent “10,” and 302d may represent “11.” However, other bit to symbol mappings may be utilized.
Similarly, FIG. 3B illustrates a 16-QAM constellation set 300b, where four-bit sequences correspond to symbols. Here, both the amplitude and the phase of constellation points 304 may vary. FIG. 3B illustrates a mapping, where each constellation point 304 represents a different four-bit symbol: 304a may represent “1101,” 304b may represent “1100,” 304c may represent “1110,” 304d may represent “1111,” and so on. However, as discussed in reference to FIG. 3B, other mappings may be utilized.
In general, a W-bit symbol xs may be mapped according to an M-QAM signal set, where M=2W. Thus, as illustrated in FIG. 3A, if the modulator 230a uses the 4-QAM modulation scheme, or a quadrature phase-shift keying (QPSK) modulation scheme, the modulator 230a will have a signal alphabet size of M=22=4 (i.e., 4 constellation points), and will map 2-bit pairs into the 4 constellation points. If the modulator 230a uses a 64-QAM scheme, the modulator 230a will have an alphabet size of M=26=64 (i.e., 64 constellation points) and will map 6-bit segments into the 64 constellation points.
It should be noted that although the transmitting device 200a described with reference to FIG. 2A includes a common encoder chain (an encoder 220a, an interleaver (not shown), a modulator 230a, etc.), a transmitting device 200 may include different encoder chains for different streams. For example, as illustrated in FIG. 2B, each stream generated by the transmitting device 200b may correspond to a separate encoder chain. Other transmitting devices, such as those supporting the WiMAX standards, for example, may support both a single-encoder option and a two-encoder option for a two-transmit-antenna configuration. In general, the number of encoders and/or encoder chains may be less than or equal to the number of transmitted streams S.
FIG. 4 is a block diagram of an example receiving device 400 capable of demodulating and decoding signals from one or more transmitting devices using a multi-stream maximum-likelihood (ML) demodulation scheme. The receiving device 400 may be utilized in the wireless communication system 100 as the receiving device 106, for example. It will be understood, however, that the wireless communication system 100 may alternatively use another receiving device 106. Similarly, the receiving device 400 may receive and demodulate multiple streams transmitted by a device such as the transmitting device 200a of FIG. 2A or the transmitting device 200b of FIG. 2B or some other transmitting device.
Generally, the receiving device 400 may receive information via multiple receive antennas 402-408 and demodulate and decode the received information to estimate the information that was sent by a transmitting device. The receiving device 400 processes received information utilizing a model, such as:

y=Hx+z, 

where





  
    
      y
      =
      
        [
        
          
            
              
                y
                1
              
            
          
          
            
              
                y
                2
              
            
          
          
            
              ⋮
            
          
          
            
              
                y
                
                  N
                  R
                
              
            
          
        
        ]
      
    
    ;
    
      H
      =
      
        [
        
          
            
              
                h
                
                  1
                  ,
                  1
                
              
            
            
              
                h
                
                  1
                  ,
                  2
                
              
            
            
              ...
            
            
              
                h
                
                  1
                  ,
                  S
                
              
            
          
          
            
              
                h
                
                  2
                  ,
                  1
                
              
            
            
              
                h
                
                  1
                  ,
                  2
                
              
            
            
              ...
            
            
              
                h
                
                  2
                  ,
                  S
                
              
            
          
          
            
              ⋮
            
            
              ⋮
            
            
              ⋮
            
            
              ⋮
            
          
          
            
              
                h
                
                  
                    N
                    R
                  
                  ,
                  1
                
              
            
            
              
                h
                
                  
                    N
                    R
                  
                  ,
                  2
                
              
            
            
              ...
            
            
              
                h
                
                  
                    N
                    R
                  
                  ,
                  S
                
              
            
          
        
        ]
      
    
    ;
    
      x
      =
      
        [
        
          
            
              
                x
                1
              
            
          
          
            
              
                x
                2
              
            
          
          
            
              ⋮
            
          
          
            
              
                x
                S
              
            
          
        
        ]
      
    
    ;
    
      z
      =
      
        [
        
          
            
              
                z
                1
              
            
          
          
            
              
                z
                2
              
            
          
          
            
              ⋮
            
          
          
            
              
                z
                
                  N
                  R
                
              
            
          
        
        ]
      
    
  
  ,




in which y represents, in vector from, the receive signal, H represents the MIMO communication channel, x represents, in vector form, the estimated transmit signal, z represents the noise vector, and NR is the number of receive antennas. More precisely, yr is a received signal at antenna r, and zr is noise at an antenna r.

The MIMO communication channel H includes channel gain parameters hr,s representing channel gain in a stream s at a receive antenna r. In at least some of the embodiments, each channel gain hr,s is a complex number that incorporates an amplitude factor and a phase shift factor. In other words, each hr,s parameter may represent an attenuation coefficient associated with a certain propagation path as used in, for example, a Rayleigh fading channel model. The receiving device 400 may estimate the parameters hr,s, and parameters associated with the noise z using any technique, including known techniques.
With continued reference to FIG. 4, the receiving device 400 includes a multi-stream maximum-likelihood (ML) demodulator 442 that may calculate, based on the received symbols y1, y2, . . . , yNR, likelihood values L(bs,1), L(bs,2), . . . , L(bs,W) of the transmitted bits bs,1, bs,2, . . . , bs,W. The receiving device 400 also includes a decoder 444 that may use the likelihood values L(bs,1), L(bs,2), . . . , L(bs,W) calculated by the ML demodulator 442 to estimate the transmitted information bits bs,1, bs,2, . . . , bs,W. Because the ML demodulator 442 outputs likelihood values for bits, and not the bits themselves, the ML demodulator 442 is called a “soft” demodulator. By contrast, demodulators that output bits are called “hard-decision demodulators,” or simply “hard demodulators.”
As illustrated in FIG. 4, the multi-stream ML demodulator 442 may include various modules and/or components. For example, the multi-stream ML demodulator 442 may include a likelihood value calculator 454 for calculating likelihood values L(bs,1), L(bs,2), . . . , L(bs,W). The multi-stream ML demodulator 442 may further include a symbol slicer 452 that performs various symbol slicing operations (e.g., QAM slicing), including known symbols slicing operations. Still further, the multi-stream ML demodulator 442 may include a channel estimator 448 to estimate the MIMO communication channel H and a noise estimator 446 for generating noise estimate information, including, for example, the variance of the noise σz2.
The multi-stream ML demodulator 442, in some embodiments, or in some modes of operation, may not include one or more of the modules 446-454 or, alternatively, may not use each of the modules 446-454 in demodulating the received signals. Further, it will be appreciated that some of the modules 446-454 may be combined. Still further, the multi-stream ML demodulator 442 and/or the receiving device 400 may include additional components and/or modules that, for ease of explanation, are not shown in FIG. 4. For example, the receiving device 400 may include a linear equalizer, e.g., a zero-forcing equalizer, that may be used by the multi-stream ML demodulator 442 to estimate the transmitted data values, xs from the received signal ys by assuming the noise vector z is zero. Additionally the receiving device 400 may include a deinterleaver that rearranges scattered bits and restores the proper bit sequence, an analog RF front end that performs frequency downconversion, various filters, power amplifiers, and so on.
Different components and/or modules of the receiving device 400 may be implemented as hardware, a processor executing software instructions, a processor implementing firmware instructions, or some combination thereof. For example, some or all of the components may be custom integrated circuits, application-specific integration circuits (ASICs), etc., communicatively coupled by electrical busses. In this case, the receiving device 400 optionally may include bypass busses (not shown) to bypass some of the components if the currently active MIMO mode does not require certain operations, such as processing multiple presentations of a symbol encoded according to a space-time encoding scheme.
In order to calculate the likelihood values L(bs,1), L(bs,2), . . . , L(bs,W) for the received symbols, the multi-stream ML demodulator 442 may calculate a log-likelihood ratio (LLR) for each bit bs,1, bs,2, . . . , bs,W. The LLR of a given bit bs,n may be an indication of whether the bit bs,n is more likely to be 1 or 0, and it may be calculated as follows:




  
    
      
        
          L
          ⁡
          
            (
            
              b
              
                s
                ,
                n
              
            
            )
          
        
        =
        
          
            log
            ⁡
            
              (
              
                
                  P
                  ⁢
                  
                    {
                    
                      
                        y
                        ❘
                        
                          b
                          
                            s
                            ,
                            n
                          
                        
                      
                      =
                      1
                    
                    }
                  
                
                
                  P
                  ⁢
                  
                    {
                    
                      
                        y
                        ❘
                        
                          b
                          
                            s
                            ,
                            n
                          
                        
                      
                      =
                      1
                    
                    }
                  
                
              
              )
            
          
          =
          
            
              log
              ⁡
              
                (
                
                  P
                  ⁢
                  
                    {
                    
                      
                        y
                        ❘
                        
                          b
                          
                            s
                            ,
                            n
                          
                        
                      
                      =
                      1
                    
                    }
                  
                
                )
              
            
            -
            
              log
              ⁡
              
                (
                
                  P
                  ⁢
                  
                    {
                    
                      
                        y
                        ❘
                        
                          b
                          
                            s
                            ,
                            n
                          
                        
                      
                      =
                      0
                    
                    }
                  
                
                )
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




where P{y|bs,n=0} is the probability that the bit bs,n is equal to 0 and P{y|bs,n=1} is the probability that the bit bs,n is equal to 1. If the calculated L(bs,n) is a relatively large positive number, the probability that the bit bs,n is equal to 1 may be much greater than the probability that the bit bs,n is equal to 0, and the decoder 444 may therefore conclude that bit bs,n is equal to 1. Likewise, if the calculated L(bs,n) is a large negative number, the probability that the bit bs,n is equal to 0 may be much greater than the probability that the bit bs,n is equal to 1, and the decoder 444 may therefore conclude that bit bs,n is equal to 0. If the calculated L(bs,n) is neither a large positive number nor a large negative number, the decoder 444 may need to perform additional processing to estimate the value of bit bs,n. As explained above, the receiving device 400 may receive more than one representation of bit bs,n, e.g., via different ones of the receive antennas 402-408. Accordingly, the decoder 444 may use multiple LLRs corresponding to multiple representations of the same bit bs,n to estimate the value of bit bs,n.

In order to estimate the probability that bit bs,n is equal to 1 and the probability that bit bs,n is equal to 0, the multi-stream ML demodulator 442 may use the following equations:




  
    
      
        
          P
          ⁢
          
            {
            
              
                y
                ❘
                
                  b
                  
                    s
                    ,
                    n
                  
                
              
              =
              1
            
            }
          
        
        =
        
          
            ∑
            
              x
              ∈
              
                χ
                
                  s
                  ,
                  n
                
                
                  (
                  1
                  )
                
              
            
          
          ⁢
          
            exp
            ⁡
            
              (
              
                -
                
                  
                    
                      
                      
                        |
                        
                          y
                          -
                          Hx
                        
                      
                      
                    
                    2
                  
                  
                    σ
                    z
                    2
                  
                
              
              )
            
          
        
      
    
    
      
        (
        2
        )
      
    
  
  
    
      
        
          P
          ⁢
          
            {
            
              
                y
                ❘
                
                  b
                  
                    s
                    ,
                    n
                  
                
              
              =
              0
            
            }
          
        
        =
        
          
            ∑
            
              x
              ∈
              
                χ
                
                  s
                  ,
                  n
                
                
                  (
                  0
                  )
                
              
            
          
          ⁢
          
            exp
            ⁡
            
              (
              
                -
                
                  
                    
                      
                      
                        y
                        -
                        Hx
                      
                      
                    
                    2
                  
                  
                    σ
                    z
                    2
                  
                
              
              )
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




where, as in equation (1), x is a vector of estimated transmitted symbols x1, x2, . . . , xS, Xs,n(1) is a set of all possible data symbol vectors x with bit bs,n equal to 1 (where bs,n is the n-th bit of s-th stream), xs,n(0) is a set of all possible data symbol vectors x with bit bs,n equal to 0, y represents, in vector form, the received symbols y1, y2, . . . , yNR, represents the MIMO communication channel, and σz2 represents the variance of the noise.

Combining equations (1)-(3), the LLR of a given bit bs,n in a given stream s may be calculated as:




  
    
      
        
          L
          ⁡
          
            (
            
              b
              
                s
                ,
                n
              
            
            )
          
        
        =
        
          
            log
            (
            
              
                ∑
                
                  x
                  ∈
                  
                    χ
                    
                      s
                      ,
                      n
                    
                    
                      (
                      1
                      )
                    
                  
                
              
              ⁢
              
                exp
                ⁡
                
                  (
                  
                    -
                    
                      
                        
                          
                          
                            y
                            -
                            Hx
                          
                          
                        
                        2
                      
                      
                        σ
                        z
                        2
                      
                    
                  
                  )
                
              
            
            )
          
          -
          
            log
            (
            
              
                ∑
                
                  x
                  ∈
                  
                    χ
                    
                      s
                      ,
                      n
                    
                    
                      (
                      0
                      )
                    
                  
                
              
              ⁢
              
                exp
                ⁡
                
                  (
                  
                    -
                    
                      
                        
                          
                          
                            y
                            -
                            Hx
                          
                          
                        
                        2
                      
                      
                        σ
                        z
                        2
                      
                    
                  
                  )
                
              
            
            )
          
        
      
    
    
      
        (
        4
        )
      
    
  




and L(bs,n) may be approximated as:





  
    
      
        
          L
          ⁡
          
            (
            
              b
              
                s
                ,
                n
              
            
            )
          
        
        ≈
        
          
            1
            
              σ
              z
              2
            
          
          [
          
            
              
                min
                
                  x
                  ∈
                  
                    χ
                    
                      s
                      ,
                      n
                    
                    
                      (
                      0
                      )
                    
                  
                
              
              ⁢
              
                
                  
                  
                    y
                    -
                    Hx
                  
                  
                
                2
              
            
            -
            
              
                min
                
                  x
                  ∈
                  
                    χ
                    
                      s
                      ,
                      n
                    
                    
                      (
                      1
                      )
                    
                  
                
              
              ⁢
              
                
                  
                  
                    y
                    -
                    Hx
                  
                  
                
                2
              
            
          
          ]
        
      
    
    
      
        (
        5
        )
      
    
  




Accordingly, the LLR of a given bit bs,n may be calculated based on the distances ∥y−Hx∥2. More specifically, the LLR of a given bit bs,n may be calculated based on the difference between the smallest distance ∥y−Hx∥2 for a set of all possible data symbols xs with bs,n equal to 0 and the smallest distance ∥y−Hx∥2 for a set of all possible data symbols xs with bs,n equal to 1.

Calculating the LLR of a given bit L(bs,n) in accordance with equation (5) requires a calculation of ∥y−Hx∥2 for every constellation point in the constellation set in order to determine the smallest distance. Moreover, if there are multiple streams, a calculation of ∥y−Hx∥2 is required for every constellation point for every stream. Therefore, if a receiving device receives S streams, for example, and each stream is represented by W bits and modulated using an M-QAM scheme (where M=2W), the receiving device will need to perform MS calculations of ∥y−Hx∥2 to demodulate the received S streams in accordance with equation (5).
In practice, it may be burdensome for a receiving device to calculate ∥y−Hx∥2 for every constellation point and for every streams. As the number of streams S and/or the number of bits W in a data symbol increases (i.e., as M increases), performing these calculations may require escalating complexity on the receiving device (e.g., more, larger, and/or more expensive processing modules and/or components). Performing these calculations may also lead to an increase in processing time. Accordingly, in order to reduce complexity, it is advantageous to utilize a demodulation technique that performs fewer than MS calculations of ∥y−Hx∥2 when calculating LLRs for received data corresponding to multiple streams.
FIG. 5 is a flow diagram illustrating an example multi-stream ML method 500 for calculating LLRs for received data. For ease of explanation, FIG. 5 will be described with reference to FIGS. 1-4. It will be understood, however, that the method 500 for calculating LLRs may be utilized with systems and devices other than those illustrated in FIGS. 1-4. Furthermore, for clarity and ease of explanation, the multi-stream ML method 500 for calculating LLRs illustrated in FIG. 5 will also be explained with reference to 16-QAM constellation diagrams in FIGS. 6A-6D. However, it will be understood that the multi-stream ML method 500 for calculating LLRs is not limited to 16-QAM, to QAM, or to any particular modulation scheme.
Before explaining FIG. 5 in detail, it is noted that equation (5) may be written as follows:




  
    
      
        
          L
          ⁡
          
            (
            
              b
              
                s
                ,
                n
              
            
            )
          
        
        ≈
        
          {
          
            
              
                
                  
                    
                      1
                      
                        σ
                        z
                        2
                      
                    
                    ⁡
                    
                      [
                      
                        
                          
                            
                              
                                min
                                
                                  
                                    (
                                    
                                      
                                        x
                                        2
                                      
                                      ,
                                      ...
                                      ⁢
                                      
                                        
                                      
                                      ,
                                      
                                        x
                                        S
                                      
                                    
                                    )
                                  
                                  ∈
                                  
                                    
                                      χ
                                      ~
                                    
                                    
                                      s
                                      ,
                                      n
                                    
                                    
                                      (
                                      0
                                      )
                                    
                                  
                                
                              
                              ⁢
                              
                                (
                                
                                  
                                    min
                                    
                                      
                                        x
                                        1
                                      
                                      ∈
                                      
                                        
                                          Q
                                          
                                            s
                                            ,
                                            n
                                          
                                          
                                            (
                                            0
                                            )
                                          
                                        
                                        ⋃
                                        
                                          Q
                                          
                                            s
                                            ,
                                            n
                                          
                                          
                                            (
                                            1
                                            )
                                          
                                        
                                      
                                    
                                  
                                  ⁢
                                  
                                    
                                      
                                      
                                        y
                                        -
                                        Hx
                                      
                                      
                                    
                                    2
                                  
                                
                                )
                              
                            
                          
                        
                        
                          
                            
                              -
                              
                                
                                  min
                                  
                                    
                                      (
                                      
                                        
                                          x
                                          2
                                        
                                        ,
                                        ...
                                        ⁢
                                        
                                          
                                        
                                        ,
                                        
                                          x
                                          S
                                        
                                      
                                      )
                                    
                                    ∈
                                    
                                      
                                        χ
                                        ~
                                      
                                      
                                        s
                                        ,
                                        n
                                      
                                      
                                        (
                                        1
                                        )
                                      
                                    
                                  
                                
                                ⁢
                                
                                  (
                                  
                                    
                                      min
                                      
                                        
                                          x
                                          1
                                        
                                        ∈
                                        
                                          
                                            Q
                                            
                                              s
                                              ,
                                              n
                                            
                                            
                                              (
                                              0
                                              )
                                            
                                          
                                          ⋃
                                          
                                            Q
                                            
                                              s
                                              ,
                                              n
                                            
                                            
                                              (
                                              1
                                              )
                                            
                                          
                                        
                                      
                                    
                                    ⁢
                                    
                                      
                                        
                                        
                                          y
                                          -
                                          Hx
                                        
                                        
                                      
                                      2
                                    
                                  
                                  )
                                
                              
                            
                          
                        
                      
                      ]
                    
                  
                  ,
                
              
              
                
                  
                    s
                    =
                    2
                  
                  ,
                  ...
                  ⁢
                  
                    
                  
                  ,
                  S
                
              
            
            
              
                
                  
                    
                      1
                      
                        σ
                        z
                        2
                      
                    
                    ⁡
                    
                      [
                      
                        
                          
                            
                              
                                min
                                
                                  
                                    (
                                    
                                      
                                        x
                                        2
                                      
                                      ,
                                      ...
                                      ⁢
                                      
                                        
                                      
                                      ,
                                      
                                        x
                                        S
                                      
                                    
                                    )
                                  
                                  ∈
                                  
                                    (
                                    
                                      
                                        
                                          χ
                                          ~
                                        
                                        
                                          s
                                          ,
                                          n
                                        
                                        
                                          (
                                          0
                                          )
                                        
                                      
                                      ⋃
                                      
                                        
                                          χ
                                          ~
                                        
                                        
                                          s
                                          ,
                                          n
                                        
                                        
                                          (
                                          1
                                          )
                                        
                                      
                                    
                                    )
                                  
                                
                              
                              ⁢
                              
                                (
                                
                                  
                                    min
                                    
                                      
                                        x
                                        1
                                      
                                      ∈
                                      
                                        Q
                                        
                                          s
                                          ,
                                          n
                                        
                                        
                                          (
                                          0
                                          )
                                        
                                      
                                    
                                  
                                  ⁢
                                  
                                    
                                      
                                      
                                        y
                                        -
                                        Hx
                                      
                                      
                                    
                                    2
                                  
                                
                                )
                              
                            
                          
                        
                        
                          
                            
                              -
                              
                                
                                  min
                                  
                                    
                                      (
                                      
                                        
                                          x
                                          2
                                        
                                        ,
                                        ...
                                        ⁢
                                        
                                          
                                        
                                        ,
                                        
                                          x
                                          S
                                        
                                      
                                      )
                                    
                                    ∈
                                    
                                      (
                                      
                                        
                                          
                                            χ
                                            ~
                                          
                                          
                                            s
                                            ,
                                            n
                                          
                                          
                                            (
                                            0
                                            )
                                          
                                        
                                        ⋃
                                        
                                          
                                            χ
                                            ~
                                          
                                          
                                            s
                                            ,
                                            n
                                          
                                          
                                            (
                                            1
                                            )
                                          
                                        
                                      
                                      )
                                    
                                  
                                
                                ⁢
                                
                                  (
                                  
                                    
                                      min
                                      
                                        
                                          x
                                          1
                                        
                                        ∈
                                        
                                          Q
                                          
                                            s
                                            ,
                                            n
                                          
                                          
                                            (
                                            0
                                            )
                                          
                                        
                                      
                                    
                                    ⁢
                                    
                                      
                                        
                                        
                                          y
                                          -
                                          Hx
                                        
                                        
                                      
                                      2
                                    
                                  
                                  )
                                
                              
                            
                          
                        
                      
                      ]
                    
                  
                  ,
                
              
              
                
                  s
                  =
                  1
                
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




where:

{tilde over (X)}s,n(0) is a set of all possible data symbols x2, . . . , xS with bs,n equal to 0;
{tilde over (X)}s,n(1) is a set of all possible data symbols x2, . . . , xS with bs,n equal to 1;
Qs,n(0) is a set of all possible data symbols x1 with bs,n equal to 0; and
Qs,n(1) is a set of all possible data symbols x1 with bs,n equal to 1.
Accordingly, LLRs for different data symbols x1, . . . , xS may be calculated separately. That is, referring to FIG. 5, when a receiving device (such as the receiving device 400 illustrated in FIG. 4) receives a data symbol vector y (block 510), the receiving device may define a candidate data symbol vector x of estimated transmitted data symbols x1, . . . , xS and calculate LLRs for bits in the data symbols x2, . . . , xS using one equation (block 530), and, separately, calculate the LLRs for the bits in the data symbol x1 using another equation (block 540). It should be noted that although equation (6) groups symbols x1, . . . , xS into two groups x2, . . . , xS and x1, other groupings are possible. For instance, any one of the symbols x1, . . . , xS may be grouped into one group, and the remaining symbols may be grouped into another group. Therefore, some example groupings include x1, . . . , xS-1 and xS; or x1, . . . , x1, x1+2, . . . , xS and x1+1.
In order to calculate the LLRs for bits in data symbols x2, . . . , xS, (block 530), the receiving device may generally determine an optimum global value of x1 (further referred to as {circumflex over (x)}1) for each possible combination of (x2, . . . , xS) that minimizes the distance ∥y−Hx∥2 (block 532). Because the determination of {circumflex over (x)}1 may be reduced to a one-dimensional problem, {circumflex over (x)}1 may be determined without performing any calculations of ∥y−Hx∥2. For example, {circumflex over (x)}1 for a given (x2, . . . , xS), i.e., {circumflex over (x)}1|(x2, . . . , xS) may be determined using a technique called Maximal Ratio Combining (MRC). In particular, {circumflex over (x)}1 may be determined as the value corresponding to the constellation point nearest to the normalized MRC output x1,MRC. More specifically, {circumflex over (x)}1|(x2, . . . , xS) may be determined as follows (it should be noted that no ∥y−Hx∥2 calculations are performed in calculating x1,MRC or {circumflex over (x)}1|(x2, . . . , xS)):




  
    
      
        
          
            
              
                
                  
                    
                      x
                      ^
                    
                    ❘
                    
                      (
                      
                        
                          x
                          2
                        
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        
                          x
                          S
                        
                      
                      )
                    
                  
                  =
                  
                  ⁢
                  
                    
                      
                        
                          arg
                          ⁢
                          
                            
                          
                          ⁢
                          min
                        
                        
                          
                            x
                            1
                          
                          ∈
                          Q
                        
                      
                      ⁢
                      
                        
                        
                          (
                          
                            y
                            -
                            
                              
                                h
                                2
                              
                              ⁢
                              
                                x
                                2
                              
                            
                            +
                            ...
                            ⁢
                            
                              
                            
                            +
                            
                              
                                h
                                s
                              
                              ⁢
                              
                                x
                                s
                              
                            
                          
                          )
                        
                        )
                      
                    
                    -
                    
                      
                        h
                        1
                      
                      ⁢
                      
                        x
                        1
                      
                    
                  
                
                
              
              2
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    arg
                    ⁢
                    
                      
                    
                    ⁢
                    min
                  
                  
                    
                      x
                      1
                    
                    ∈
                    Q
                  
                
                ⁢
                
                  
                    
                    
                      
                        h
                        1
                        H
                      
                      ⁡
                      
                        (
                        
                          
                            y
                            ~
                          
                          -
                          
                            
                              h
                              1
                            
                            ⁢
                            
                              x
                              1
                            
                          
                        
                        )
                      
                    
                    
                  
                  2
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    arg
                    ⁢
                    
                      
                    
                    ⁢
                    min
                  
                  
                    
                      x
                      1
                    
                    ∈
                    Q
                  
                
                ⁢
                
                  
                    
                    
                      
                        
                          
                            h
                            1
                            H
                          
                          ⁢
                          
                            y
                            ~
                          
                        
                        
                          
                            
                            
                              h
                              1
                            
                            
                          
                          2
                        
                      
                      -
                      
                        x
                        1
                      
                    
                    
                  
                  2
                
              
            
          
        
        
          
            
              =
              
              ⁢
              
                
                  
                    arg
                    ⁢
                    
                      
                    
                    ⁢
                    min
                  
                  
                    
                      x
                      1
                    
                    ∈
                    Q
                  
                
                ⁢
                
                  
                    
                    
                      
                        x
                        
                          1
                          ,
                          MRC
                        
                      
                      -
                      
                        x
                        1
                      
                    
                    
                  
                  2
                
              
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




where Q is a set of considered x1, {tilde over (y)}=y−(h2x2+ . . . +hSxS) and




  
    x
    
      1
      ,
      MRC
    
  
  =
  
    
      
        
          h
          1
          H
        
        ⁢
        
          y
          ~
        
      
      
        
          
          
            h
            1
          
          
        
        2
      
    
    .
  




Referring to the constellation diagram in FIGS. 6A-6D, if a 16-QAM scheme is used, once x1,MRC is calculated, the global optimum value {circumflex over (x)}1|(x2, . . . , xS) may be determined as the value of the constellation point on the constellation diagram 600 that is nearest to x1,MRC. For instance, FIG. 6A illustrates an example 16-QAM constellation diagram 600a for determining {circumflex over (x)}1|(x2, . . . , xS) based on x1,MRC. In the example illustrated in FIG. 6A, the nearest constellation point to x1,MRC is the constellation point corresponding to the value “0000.” Accordingly, in this example, the global optimum value {circumflex over (x)}1|(x2, . . . , xS) is “0000.”
It should be noted that determining the constellation point nearest to x1,MRC does not require a calculation of ∥y−Hx∥2 for each, or any, of the constellation points in the constellation diagram. Instead, more efficient techniques, such as slicing, may be used. That is, a constellation point is chosen based on decision boundaries, where the boundaries are located at the midpoints between any two adjacent constellation points. For example, referring to FIG. 6A, the receiving device may determine the constellation point nearest to x1,MRC by creating various boundaries 620-630 on the constellation diagram 600a and identifying the boundaries within which x1,MRC lies. For instance if x1,MRC lies within the boundaries 626, 628, 622 and 624, as illustrated in FIG. 6A, the receiving device may determine, based on these boundaries, that that the constellation point nearest to x1,MRC is the constellation point corresponding to the value “0000.”
Once optimum global values are determined for each possible combination of (x2, . . . , xS) (block 532), LLRs for bits in symbols x2, . . . , xS (i.e., L(bs,n), s=2, . . . , S) may be calculated at least in part based on the determined optimum global values {circumflex over (x)}1 (block 534). More precisely, LLRs for bits in symbols x2, . . . , xS (i.e., L(bs,n), s=2, . . . , S) may be calculated based on distances ∥y−Hx∥2 where x1|(x2, . . . , xS)={circumflex over (x)}1|(x2, . . . , xS). For each combination of (x2, . . . , xS), ∥y−Hx∥2 is calculated for only one possible value of x1, i.e., the optimum global value {circumflex over (x)}1, where x=[{circumflex over (x)}1|(x2, . . . , xS), x2, . . . , xS], instead of, for example, 16 possible values of x1 in the case of 16-QAM (block 533). In other words, the calculation of {circumflex over (x)}1 reduces the number of candidates for x1, e.g., from 16 to 1 in the case 16-QAM. Once ∥y−Hx∥2 is calculated for all MS-1 combinations of (x2, . . . , xS) and the corresponding global value {circumflex over (x)}1|(x2, . . . , xS), the LLR may be calculated based on equation (6), for example, by choosing the minimum ∥y−Hx∥2.
Referring to FIG. 5, in order to calculate the LLRs for bits in data symbol x1, (block 540), the receiving device may first group all possible values of x1 into bit groups (block 542). That is, the receiving device may create one bit group that includes all possible values of x1 with the first bit equal to 0, another bit group that includes all possible values of x1 with the first bit equal to 1, a third bit group that includes all possible values of x1 with the second bit equal to 0, a fourth bit group that includes all possible values of x1 with the second bit equal to 1, and so on. For example, FIGS. 6A-6D illustrate example 16-QAM constellation diagrams 600 that are divided into bit groups 610-617. The constellation diagram 600a in FIG. 6A is divided into one bit group 610 that includes all possible values of x1 with the first bit equal to 1 and one bit group 611 that includes all possible values of x1 with the first bit equal to 0. Likewise, the constellation diagram 600b in FIG. 6B is divided into one bit group 612 that includes all possible values of x1 with the second bit equal to 1 and one bit group 613 that includes all possible values of x1 with the second bit equal to 0; the constellation diagram 600c in FIG. 6C is divided into one bit group 614 that includes all possible values of x1 with the third bit equal to 1 and one bit group 615 that includes all possible values of x1 with the third bit equal to 0; and the constellation diagram 600d in FIG. 6D is divided into one bit group 616 that includes all possible values of x1 with the fourth bit equal to 1 and one bit group 617 that includes all possible values of x1 with the fourth bit equal to 0.
Once all possible values of x1 are grouped into bit groups (block 542), the receiving device may determine an optimum local value of x1 (further referred to as) {tilde over (x)}1) in each bit group for each possible combination of (x2, . . . , xS) (block 532). An optimum local value {tilde over (x)}1 in a given bit group for a given combination of (x2, . . . , xS) is a value of x1 in that bit group that minimizes the distance ∥y−Hx∥2. As before, because the determination of {tilde over (x)}1 may be reduced to a one-dimensional problem, {tilde over (x)}1 may be determined without performing any calculations of ∥y−Hx∥2, but instead using a technique such as slicing where the decision boundaries are determined based on M/2 points in the corresponding bit group, e.g., 8 points for 16QAM, instead of M points to find the optimum global value. That is, {tilde over (x)}1 in a given bit group may be determined as the value corresponding to the constellation point nearest to the normalized MRC output x1,MRC in that bit group.
Referring to the constellation diagram 600 in FIGS. 6A-6D, if a 16-QAM scheme is used, once x1,MRC is calculated, the local optimum value {tilde over (x)}1 in a given bit group may be determined as the value of the constellation point on the constellation diagram 600 and in the respective bit group that is nearest to x1,MRC. For instance, as illustrated in FIG. 6A, in the bit group 610 that includes all possible values of x1 with the first bit equal to 1, the nearest constellation point to x1,MRC is the constellation point corresponding to the value “1000.” Accordingly, in this example, the local optimum value {tilde over (x)}1 in the bit group 610 that includes all possible values of x1 with the first bit equal to 1 is “1000.” Likewise, as illustrated in FIG. 6B, in the bit group 612 that includes all possible values of x1 with the second bit equal to 1, the nearest constellation point to x1,MRC is the constellation point corresponding to the value “0100.” Accordingly, in this example, the local optimum value {tilde over (x)}1 in the bit group 612 that includes all possible values of x1 with the second bit equal to 1 is “0100.”
Once the optimum local values {tilde over (x)}1 are determined in each bit group and for each possible combination of (x2, . . . , xS) (block 544), LLRs for bits in symbol x1 may be calculated at least in part based on the determined optimum local values {tilde over (x)}1 (block 546). More precisely, LLRs for bits in symbol x1 may be calculated based on distances ∥y−Hx∥2 where x1|(x2, . . . , xS)={tilde over (x)}1|(x2, . . . , xS) for each bit group. For each combination of (x2, . . . , xS), ∥y−Hx∥2 is calculated only once for every bit group, where x=[{tilde over (x)}1|(x2, . . . , xS), x2, . . . , xS], instead of, for example, 16 times in the case of 16-QAM (block 545). Here, when the n-th bit of the optimum global value {circumflex over (x)}1 is 1 (or 0), then the optimum local value {tilde over (x)}1 of the bit group 1 (or 0) of the n-th bit is the same as the optimum global value since the optimum global value is the closest point irrespective of bit grouping. Thus, it is not necessary to find the optimum local values for the S bit groups. Consequently, the steps of calculating {tilde over (x)}1 and {circumflex over (x)}1 reduce the number of candidates for x1, e.g., from 16 to 5 (1 {circumflex over (x)}1+4{tilde over (x)}1's) in the case 16-QAM. More generally, the reduction in the number of calculations of ∥y−Hx∥2 (and, thus, the reduction in complexity) due to the multi-stream ML demodulation method 500 described with respect to FIG. 5 may be (M−(1+W))MS-1. Once ∥y−Hx∥2 is calculated for all MS-1 combinations of (x2, . . . , xS) and the corresponding (1+W)x1(1{circumflex over (x)}1+W{tilde over (x)}1's), the LLR may be calculated based on equation (6), for example, by choosing the minimum ∥y−Hx∥2.
Example multi-stream ML demodulation techniques have been described above, but other implementations are also possible. For example, the multi-stream ML demodulation techniques have been described in reference to a wireless communication model where y=Hx+z. However, multi-stream ML demodulation techniques may be used with systems using other communication models. As one example, a receiving device may use the described the multi-stream ML demodulation techniques in conjunction with techniques for QR decomposition of matrix H, such as known QR decomposition techniques. Such a receiving device could use the following model for example:

{tilde over (y)}=Q*y=Q*Hx+Q*z=Rx+{tilde over (z)}  (8)

where * denotes a complex conjugate.

The model of equation (8) has a similar form as the y=Hx+z model, except that the matrix R is an upper triangular matrix. 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
          
        
      
    
    ]
  
  .




This feature of matrix R may further lower the complexity of the multi-stream ML demodulation techniques described above because of the form of the matrix R since the computations at the elements of zero in R are not required. Similar to QR decomposition technique, other linear processing techniques can be applied to y.

At least some of the various blocks, operations, and techniques described above may be implemented using hardware, a processor executing firmware instructions, a processor executing software instructions, or any combination thereof. When implemented using a processor executing firmware or software instructions, the software or firmware may be stored in any computer readable memory such as on a magnetic disk, an optical disk, or other storage medium, in a RAM or ROM or flash memory, processor, hard disk drive, optical disk drive, tape drive, etc. Likewise, the software or firmware may be delivered to a user or a system via any known or desired delivery method including, for example, on a computer readable disk or other transportable computer storage mechanism or via communication media. Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, radio frequency, infrared and other wireless media. Thus, the software or firmware may be delivered to a user or a system via a communication channel such as a telephone line, a DSL line, a cable television line, a fiber optics line, a wireless communication channel, the Internet, etc. (which are viewed as being the same as or interchangeable with providing such software via a transportable storage medium). The software or firmware may include machine readable instructions that are capable of causing one or more processors to perform various acts.
Although the forgoing text sets forth a detailed description of numerous different embodiments, it should be understood that the scope of the patent is defined by the words of the claims set forth at the end of this patent. The detailed description is to be construed as exemplary only and does not describe every possible embodiment because describing every possible embodiment would be impractical, if not impossible. Numerous alternative embodiments could be implemented, using either current technology or technology developed after the filing date of this disclosure, which would still fall within the scope of the claims.

## Claims

1. A method of decoding a signal transmitted via a multiple input multiple output (MIMO) communication channel, the method comprising:
receiving a data symbol vector comprising a plurality of data symbols corresponding to a plurality of transmitted data symbols;
selecting one of a plurality of candidate data symbols, the plurality of candidate data symbols defining a candidate vector, wherein the plurality of candidate data symbols corresponds to the plurality of transmitted data symbols;
grouping all possible values of the selected one candidate data symbol into two or more bit groups;
selecting a bit group from the two or more bit groups;
determining a local optimum candidate value from values in the selected bit group for the selected one candidate data symbol for a given set of values corresponding to all of the plurality of candidate data symbols but the selected one candidate data symbol, the local optimum candidate value minimizing a distance value corresponding to a distance between the received data symbol vector and a channel matrix multiplied with the candidate vector, without calculating the distance value; and
calculating a likelihood value for a bit in the selected one candidate data symbol based at least in part on the determined local optimum candidate value.

2. The method of claim 1, wherein determining the local optimum candidate value comprises determining a Maximal Ratio Combining (MRC) value for the selected one candidate data symbol.

3. The method of claim 2, wherein determining the local optimum candidate value further comprises determining a nearest value of the selected one candidate data symbol in the selected bit group to the MRC value for the selected one candidate data symbol without calculating a distance value between the nearest value of the selected one candidate data symbol in the selected bit group and the MRC value for the selected one candidate data symbol.

4. The method of claim 1, wherein each value in a given one of the two or more bit groups includes one bit that has the same value across all values in the given bit group.

5. A method of decoding a signal transmitted via a multiple input multiple output (MIMO) communication channel, the method comprising:
receiving a data symbol vector comprising a plurality of data symbols corresponding to a plurality of transmitted data symbols;
selecting one of a plurality of candidate data symbols, the plurality of candidate data symbols defining a candidate vector, wherein the plurality of candidate data symbols corresponds to the plurality of transmitted data symbols;
determining a global optimum candidate value for the selected one candidate data symbol for a given set of values corresponding to all of the plurality of candidate data symbols but the selected one candidate data symbol, the global optimum candidate value minimizing a distance value corresponding to a distance between the received data symbol vector and a channel matrix multiplied with the candidate vector, without calculating the distance value; and
calculating a likelihood value for a bit in all of the plurality of candidate data symbols but the selected one candidate data symbol based at least in part on the determined global optimum candidate value.

6. The method of claim 5, further comprising calculating the distance value, and wherein calculating the likelihood value for the bit comprises calculating the likelihood value based at least in part on the calculated distance value.

7. The method of claim 5, wherein determining the global optimum candidate value comprises determining a normalized Maximal Ratio Combining (MRC) value for the selected one candidate data symbol.

8. The method of claim 7, wherein determining the global optimum candidate value further comprises determining a nearest value of the selected one candidate data symbol to an MRC value for the selected one candidate data symbol without calculating the distance between the nearest value of the selected one candidate data symbol and the MRC value for the selected one candidate data symbol.

9. The method of claim 8, wherein determining the nearest value of the selected one candidate data symbol to the MRC value for the selected one candidate data symbol comprises using a slicing technique.

10. The method of claim 5, wherein calculating the likelihood value for the bit in all of the plurality of candidate data symbols but the selected one candidate data symbol comprises calculating a log-likelihood ratio (LLR).

11. The method of claim 5, further comprising:
grouping all possible values of the selected one candidate data symbol into two or more bit groups, wherein each of the two or more bit groups includes values of the selected one candidate data symbol with at least one common bit;
selecting a bit group from the two or more bit groups that does not include the global optimum value;
determining a local optimum candidate value from values in the selected bit group for the selected one candidate data symbol for a given set of values corresponding to all of the plurality of candidate data symbols but the selected one candidate data symbol, the local optimum candidate value minimizing a distance value corresponding to a distance between the received data symbol vector and the channel matrix multiplied with the candidate vector, without calculating the distance value; and
calculating a likelihood value for a bit in the selected one candidate data symbol based at least in part on the determined local optimum candidate value.

12. The method of claim 11, wherein the local optimum candidate value is a value selected from the selected bit group that does not include the global optimum candidate value, the local optimum candidate value being a value in the selected bit group that is nearest to a Maximal Ratio Combining (MRC) value for the selected one candidate data symbol.

13. The method of claim 11, wherein determining the local optimum candidate value further comprises determining a nearest value of the selected one candidate data symbol to the MRC value for the selected one candidate data symbol without calculating a distance value between the nearest value of the selected one candidate symbol and the MRC value for the selected one candidate symbol.

14. A device for decoding a signal transmitted via a multiple input multiple output (MIMO) communication channel, comprising:
a multi-stream maximum-likelihood (ML) demodulator configured to:
receive a data symbol vector comprising a plurality of data symbols corresponding to a plurality of transmitted data symbols;
select one of the plurality of candidate data symbols, the plurality of candidate data symbols defining a candidate vector, wherein the plurality of candidate data symbols corresponds to the plurality of transmitted data symbols;
determine a global optimum candidate value for the selected one candidate data symbol for a given set of values corresponding to all of the plurality of candidate data symbols but the selected one candidate data symbol, the global optimum candidate value minimizing a distance value corresponding to a distance between the received data symbol vector and a channel matrix multiplied with the candidate vector, without calculating the distance value; and
calculate a likelihood value for a bit in all of the plurality of candidate data symbols but the selected one candidate data symbol based at least in part on the determined global optimum candidate value; and

a decoder that decodes the received data symbol vector based at least in part on the calculated likelihood value.

15. The device of claim 14, wherein the multi-stream ML demodulator is further configured to determine a normalized Maximal Ratio Combining (MRC) value for the selected one candidate data symbol.

16. The device of claim 15, wherein the multi-stream ML demodulator is configured to generate the global optimum value by determining a nearest value of the selected one candidate data symbol to the MRC value for the selected one candidate data symbol without calculating the distance between the nearest value of the selected one candidate data symbol and the MRC value for the selected one candidate data symbol.

17. The device of claim 16, wherein the multi-stream ML demodulator is configured to use a slicing technique to determine the nearest value of the selected one candidate data symbol to the MRC value for the selected one candidate data symbol.

18. The device of claim 14, wherein the multi-stream ML demodulator is further configured to:
group all possible values of the selected one candidate data symbol into two or more bit groups, wherein each of the two or more bit groups includes values of the selected one candidate data symbol with at least one common bit;
select a bit group from the two or more bit groups that does not include the global optimum value;
determine a local optimum candidate value from values in the selected bit group for the selected one candidate data symbol for a given set of values corresponding to all of the plurality of candidate data symbols but the selected one candidate data symbol, the local optimum candidate value minimizing a distance value corresponding to a distance between the received data symbol vector and the channel matrix multiplied with the candidate vector, without calculating the distance value; and
calculate a likelihood value for a bit in the selected one candidate data symbol based at least in part on the determined local optimum candidate value.

19. The device of claim 18, wherein the local optimum candidate value is a value selected from the selected bit group that does not include the global optimum candidate value, the local optimum candidate value being a value in the selected bit group that is nearest to a Maximal Ratio Combining (MRC) value for the selected one candidate data symbol.

20. The device of claim 19, wherein the multi-stream ML demodulator is configured to determine the local optimum candidate value by determining a nearest value of the selected one candidate data symbol to the MRC value for the selected one candidate data symbol without calculating a distance value between the nearest value of the selected one candidate symbol and the MRC value for the selected one candidate symbol.