# Patent

## Title
Fast square root algorithm for MIMO equalization

## Abstract

Systems and methodologies are described that facilitate equalization of received signals in a wireless communication environment. Using multiple transmit and/or receive antennas and MIMO technology, multiple data streams can be transmitted within a single tone. During equalization, receivers can separate data received within a tone into individual data streams. The equalization process generally is computationally expensive. Equalizer functions include the inverse operation, which can be computed using the fast square root method; however, the fast square root method involves large numbers of computations for a set of matrices, where the size of a matrix in the set of matrices increases with the number of transmit or receive antennas. Utilizing a modification of the fast square root method, a subset of the elements of the matrices can be selected and updated to reduce the number and/or complexity of computations.

## Background
CLAIMS OF PRIORITY UNDER 35 U.S.C. §120
This application for patent claims the benefit of U.S. Provisional Application Ser. No. 60/979,184 filed on Oct. 11, 2007, and entitled “LOW-COMPLEXITY IMPLEMENTATION OF FAST SQUARE ROOT ALGORITHM FOR MIMO-MMSE.” The entirety of this application is expressly incorporated herein by reference.
This application for patent is a continuation-in-part of U.S. patent application Ser. No. 12/041,616, filed on Mar. 3, 2008, and entitled “FAST SQUARE ROOT ALGORITHM FOR MIMO EQUALIZATION”, which claims the benefit of U.S. Provisional Application Ser. No. 60/896,039 filed on Mar. 21, 2007, and entitled “MIMO-MMSE EQUALIZATION USING FAST SQUARE ROOT ALGORITHM.” The entirety of these applications is expressly incorporated herein by reference.


BACKGROUND
I. Field
The subject specification relates generally to wireless communications, and, more particularly, to facilitation of equalization of a wireless signal communicated within a multiple-input multiple-output (MIMO) operation.
II. Background
Wireless communication systems are widely deployed to provide various types of communication content such as voice, video, data, and so on. These systems may be multiple-access systems capable of supporting simultaneous communication of multiple terminals with one or more base stations. Multiple-access communication relies on sharing available system resources (e.g., bandwidth and transmit power). Examples of multiple-access systems include code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, and orthogonal frequency division multiple access (OFDMA) systems.
Communication between a terminal in a wireless system (e.g., a multiple-access system) and a base station is effected through transmissions over a wireless link comprised of a forward link and a reverse link. Such communication link may be established via a single-input-single-output (SISO), multiple-input-single-output (MISO), or a multiple-input-multiple-output (MIMO) system. A MIMO system consists of transmitter(s) and receiver(s) equipped, respectively, with multiple (NT) transmit antennas and multiple (NR) receive antennas for data transmission. SISO and MISO systems are particular instances of a MIMO system. A MIMO channel formed by NT transmit and NR receive antennas may be decomposed into NV independent channels, which are also referred to as spatial channels, where NV≦min{NT,NR}. Each of the NV independent channels corresponds to a dimension. The MIMO system can provide improved performance (e.g., higher throughput, greater capacity, or improved reliability) if the additional dimensionalities created by the multiple transmit and receive antennas are utilized.
In a MIMO communication system, as NT and NR increases, the efficiency of equalization algorithm degrades due to the increased size of matrices involved in the computation. Thus, there is a need for an efficient equalization in wireless devices and base station that operated with a MIMO configuration.
SUMMARY
The following presents a simplified summary of one or more aspects in order to provide a basic understanding of such aspects. This summary is not an extensive overview of all contemplated aspects, and is intended to neither identify key or critical elements of all aspects nor delineate the scope of any or all aspects. Its sole purpose is to present some concepts of one or more aspects in a simplified form as a prelude to the more detailed description that is presented later.
In accordance with one or more aspects and corresponding disclosure thereof, various aspects are described in connection with facilitating equalization. Access points and terminals can include multiple transmit and/or receive antennas and utilize MIMO technology to enhance performance. Using MIMO technology, multiple data streams can be transmitted within a single tone. During equalization, receivers separate data received within a tone into individual data streams. In general, the equalization process is computationally intensive. An equalizer matrix is computed for each tone within a tile using an equalizer function. Such function typically utilizes an inverse operation, which can be computed using the fast square root method. However, the fast square root method involves a significant number of computations for a set of matrices, where size of involved matrices increases as the number of transmit or receive antennas is increased. A modification of the fast square root method can be used to reduce the number and/or complexity of computations. In such modification, only a portion of the fast square root matrices are updated. In addition, fast square root matrices can be modified to reduce dynamic range requirements during processing.
In an aspect, a method for facilitating equalization in a receiver chain in a wireless communication system is described, the method comprising: generating an equalizer matrix for a tone of a received signal, the equalizer matrix is a function of an inverse matrix computed based at least in part upon a partial update of a subset of elements of a fast square root matrix; and equalizing the tone as a function of the equalizer matrix. Performing the partial update of the subset of elements of the fast square root matrix may involve determining a rotation matrix in accordance with a Householder reflection approach.
In another aspect, a device that that facilitates equalization of a signal in a wireless environment is disclosed, the device comprising: means for generating an equalizer matrix utilizing a modified fast square root method that updates a subset of the fast square root matrix during iterative processing; and means for separating at least one data stream in a received signal utilizing the equalizer matrix. Updating the subset of the fast square root matrix during iterative processing may involve determining a rotation matrix in accordance with a Householder reflection approach.
In a further aspect, the subject specification discloses an apparatus that facilitates equalization in a wireless communication environment, the apparatus comprising: a processor configured to compute an inverse matrix based at least in part upon an iterative partial update of a fast square root matrix, to compute an equalizer matrix as a function of the inverse matrix, and to obtain at least one data stream from a received signal utilizing the equalizer matrix; and a memory coupled to the processor. Performing the iterative partial update of the fast square root matrix may involve determining a rotation matrix in accordance with a Householder reflection approach.
In a further yet aspect, the subject specification describes a computer program product including a computer-readable medium comprising: code for causing a computer to calculate an equalizer matrix for a tone of a received signal, wherein calculation of the equalizer matrix is based upon iterative partial update of a fast square root matrix; and code for causing a computer to equalize the received signal as a function of the equalizer matrix. Performing the partial update of the subset of elements of the fast square root matrix may involve determining a rotation matrix in accordance with a Householder reflection approach
To the accomplishment of the foregoing and related ends, the one or more aspects comprise the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative aspects. These aspects are indicative, however, of but a few of the various ways in which the principles described herein may be employed and the described aspects are intended to include their equivalents.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of an example system that equalizes signals in accordance with one or more aspects presented herein.
FIG. 2 illustrates an example methodology for equalizing a received signal in accordance with one or more aspects presented herein.
FIG. 3 is a block diagram of an equalizer that utilizes modified fast square root algorithm in accordance with one or more aspects presented herein.
FIG. 4 is a block diagram of an initialization process for a fast square root method pre-array matrix in accordance with one or more aspects presented herein.
FIG. 5 illustrates an example methodology for equalizing a received signal utilizing a modified fast square root method in accordance with one or more aspects presented herein.
FIG. 6 depicts block diagrams of equalization processes in accordance with one or more aspects presented herein.
FIG. 7 depicts block diagrams of additional equalization processes in accordance with one or more aspects presented herein.
FIG. 8 depicts block diagrams of further equalization processes in accordance with one or more aspects presented herein.
FIG. 9 presents a graph depicting results of equalization utilizing using the modified fast square root method in accordance with one or more aspects presented herein.
FIG. 10 is an illustration of an example wireless communication system in accordance with one or more aspects presented herein.
FIG. 11 is an illustration of an example wireless communication environment that can be employed in conjunction with the various systems and methods described herein.
FIG. 12 is an illustration of an example system that facilitates equalization in accordance with one or more aspects presented herein.



DETAILED DESCRIPTION
Various aspects are now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects. It may be evident, however, that such aspect(s) may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing one or more aspects.
As used in this application, the terms “component,” “system,” and the like are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a communications device and the device can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers. Also, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems by way of the signal).
In addition, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or”. That is, unless specified otherwise, or clear from context, “X employs A or B” is intended to mean any of the natural inclusive permutations. That is, if X employs A; X employs B; or X employs both A and B, then “X employs A or B” is satisfied under any of the foregoing instances. In addition, the articles “a” and “an” as used in this application and the appended claims should generally be construed to mean “one or more” unless specified otherwise or clear from context to be directed to a singular form.
Furthermore, various aspects are described herein in connection with a terminal. A terminal can also be called a system, a user device, a subscriber unit, subscriber station, mobile station, mobile device, remote station, access point, base station, remote terminal, access terminal, user terminal, terminal, user agent, or user equipment (UE). A terminal can be a cellular telephone, a cordless telephone, a Session Initiation Protocol (SIP) phone, a wireless local loop (WLL) station, a PDA, a handheld device having wireless connection capability, or other processing device connected to a wireless modem.
Turning now to the Figures, FIG. 1 illustrates a system 100 that performs equalization of a received signal in a wireless system capable of utilizing multiple receive and/or transmit antennas. In systems utilizing MIMO technology, multiple data streams can be transmitted over a single subcarrier, where each data stream is transmitted from a different antenna. At the receiver, the data streams can be separated, in a process referred to herein as equalization, to provide for communication. The terms data stream and layer are used interchangeably herein. Also, the rank of a signal or transmission is equal to the number of layers of the transmission, where the maximum rank of a transmission is equal to the lesser of the number of transmit antennas or receive antennas. Generally, equalization is a computationally expensive process. Reduction of number and complexity of computations required for equalization can decrease power required to operate a receiver, increasing battery life for a device utilizing the receiver. In addition, a chip or hardware component that performs fewer or less complex operations can be reduced in size, providing room for additional hardware or reductions in the size of the terminal that utilizes the component.
An equalizer component 102 can be used to separate the received data streams. In particular, equalizer component can be a minimum mean square error (MMSE) equalizer. Although the MMSE equalizer components and operations described herein can be used where the rank, or number of layers, of the transmission is equal to one, in such cases performance may be less efficient. When the rank is equal to one, equalization component can utilize alternative processes, such as maximum ratio combining (MRC) equalization. Alternatively, a separate MRC equalization component (not shown) can be utilized.
The received signal for a tone or subcarrier, n, can be represented as follows:
ti x(n)=H(n)s(n)+v(n)
Here, v(n) is a MR×1 noise vector with:




  
    R
    vv
  
  =
  
    
      
        E
        n
      
      ⁡
      
        [
        
          
            v
            ⁡
            
              (
              n
              )
            
          
          ⁢
          
            
              v
              ⁡
              
                (
                n
                )
              
            
            *
          
        
        ]
      
    
    =
    
      [
      
        
          
            
              σ
              1
              2
            
          
          
            0
          
          
            
              
            
          
          
            0
          
        
        
          
            0
          
          
            
              σ
              2
              2
            
          
          
            
              
            
          
          
            
              
            
          
        
        
          
            
              
            
          
          
            
              
            
          
          
            ...
          
          
            0
          
        
        
          
            0
          
          
            
              
            
          
          
            0
          
          
            
              σ
              
                M
                R
              
              2
            
          
        
      
      ]
    
  




H(n) is a MR×MT matrix that represents the MIMO channel. H(n) can be denoted as follows:





  
    H
    ⁡
    
      (
      n
      )
    
  
  =
  
    
      [
      
        
          
            
              
                H
                1
              
              ⁡
              
                (
                n
                )
              
            
          
        
        
          
            
              
                H
                2
              
              ⁡
              
                (
                n
                )
              
            
          
        
        
          
            
              
                H
                3
              
              ⁡
              
                (
                n
                )
              
            
          
        
        
          
            ...
          
        
        
          
            
              
                H
                
                  M
                  R
                
              
              ⁡
              
                (
                n
                )
              
            
          
        
      
      ]
    
    =
    
      [
      
        
          
            
              
                h
                11
              
              ⁡
              
                (
                n
                )
              
            
          
          
            
              
                h
                12
              
              ⁡
              
                (
                n
                )
              
            
          
          
            ...
          
          
            
              
                h
                
                  1
                  ⁢
                  
                    
                  
                  ⁢
                  
                    M
                    T
                  
                
              
              ⁡
              
                (
                n
                )
              
            
          
        
        
          
            
              
                h
                21
              
              ⁡
              
                (
                n
                )
              
            
          
          
            
              
                h
                22
              
              ⁡
              
                (
                n
                )
              
            
          
          
            ...
          
          
            ...
          
        
        
          
            ...
          
          
            ...
          
          
            ...
          
          
            ...
          
        
        
          
            
              
                h
                
                  
                    M
                    R
                  
                  ⁢
                  1
                
              
              ⁡
              
                (
                n
                )
              
            
          
          
            ...
          
          
            ...
          
          
            
              
                h
                
                  
                    M
                    R
                  
                  ⁢
                  
                    M
                    T
                  
                
              
              ⁡
              
                (
                n
                )
              
            
          
        
      
      ]
    
  




The transmit symbol is represented by MT×1 vector s(n):





  
    s
    ⁡
    
      (
      n
      )
    
  
  =
  
    [
    
      
        
          
            
              s
              1
            
            ⁡
            
              (
              n
              )
            
          
        
      
      
        
          
            
              s
              2
            
            ⁡
            
              (
              n
              )
            
          
        
      
      
        
          ...
        
      
      
        
          ...
        
      
      
        
          
            
              s
              
                M
                T
              
            
            ⁡
            
              (
              n
              )
            
          
        
      
    
    ]
  




Normalized channel matrix elements ĥij(n), and scaled received signal elements {circumflex over (x)}i(n), can be represented as follows:




  
    
      
        
          
            h
            ^
          
          ij
        
        ⁡
        
          (
          n
          )
        
      
      =
      
        
          
            h
            
              i
              ,
              j
            
          
          ⁡
          
            (
            n
            )
          
        
        ⁢
        
          
            σ
            min
          
          
            σ
            i
          
        
      
    
    ,
    
      i
      =
      1
    
    ,
    2
    ,
    
      ...
      ⁢
      
        
      
      ⁢
      
        M
        R
      
    
  




  
    
      
        
          
            x
            ^
          
          i
        
        ⁡
        
          (
          n
          )
        
      
      =
      
        
          
            x
            i
          
          ⁡
          
            (
            n
            )
          
        
        ⁢
        
          
            σ
            min
          
          
            σ
            i
          
        
      
    
    ,
    
      i
      =
      1
    
    ,
    2
    ,
    
      ...
      ⁢
      
        
      
      ⁢
      
        M
        R
      
    
  



Here, σmin2 is the minimum interference variance across all receive antennas. For a given tile, σmin2 in is a fixed parameter. In addition, normalized channel elements, ĥij(n), where j is greater than the rank, or number of MIMO layers in the transmission, are set to zero. It is noted that a tile as referred to herein is a time frequency region that comprises a predetermined number of successive tones for a fixed number of successive OFDM symbols. For instance, a tile can include 128 symbols over 16 tones or channels. Symbols can include data symbols as well as pilot symbols, which can be used as references to determine performance, e.g., a channel estimate.

Equalizer component 102 can (i) utilize channel and interference information to equalize received signals and generate equalized symbols; (ii) process received signals on a per tile basis; (iii) generate an equalizer matrix for each tone within a tile, where the received signal for a tone can be separated into individual data streams utilizing the equalizer matrix. The equalized symbols can be denoted as follows:

{tilde over (s)}(n)=G(n){circumflex over (x)}(n)

Here, {tilde over (s)}(n) represents normalized equalized symbols for tone n, G(n) is the equalizer matrix, and {circumflex over (x)}(n) is the received signal for tone n.

Equalizer component 102 includes an equalizer matrix component 104 that generates the equalizer matrix G(n) and an equalization component 106 that produces equalized symbols as a function of the equalizer matrix. The equalizer matrix component 104 can utilize channel and interference information (e.g., channel and interference estimates) related to the tile considered to generate the equalizer matrix. As used herein, a channel estimate is an estimate of the response of a wireless channel from a transmitter to a receiver. Channel estimation is typically performed by transmitting pilot symbols within the tiles that are known a priori by both the transmitter and receiver. Interference can result from multiple transmitters transmitting their pilot signals simultaneously. Such transmitters can be located at different access points within a wireless environment, or can be different antennas of the same access point. Pilot interference degrades the quality of the channel estimate. The power of the interference for the time-frequency region or tile is estimated and referred to herein as the interference estimate. Equalization component 106 can utilize the resulting equalizer matrix to process received signals and generate equalized symbols.
In general, computations required to generate the equalizer matrix are complex and increase rapidly as the number of transmit or receive antennas increases. The equalizer is a MT×MR matrix, where MT is the effective number of transmit antennas at the access point and MR is the number of receive antennas at the access terminal. The equalizer matrix can be represented as follows:

G(n)=Λ(n)−1[Ĥ(n)*Ĥ(n)+σmin2]−1Ĥ(n)*

for tone n. The equalizer matrix can be rewritten as follows:

G(n)=Λ(n)−1P(n)Ĥ(n)*

P(n) represents the inverse matrix, defined as follows:

P(n)=[Ĥ(n)*Ĥ(n)+σmin2I]−1 

where Ĥ(n) corresponds to a normalized H(n) matrix. Term Λ(n) is a matrix of signal to interference-plus-noise ratio values (SINRs) and can be represented as follows:





  
    Λ
    ⁡
    
      (
      n
      )
    
  
  =
  
    [
    
      
        
          
            
              λ
              1
            
            ⁡
            
              (
              n
              )
            
          
        
        
          0
        
        
          
            
          
        
        
          0
        
      
      
        
          0
        
        
          
            
              λ
              2
            
            ⁡
            
              (
              n
              )
            
          
        
        
          
            
          
        
        
          
            
          
        
      
      
        
          
            
          
        
        
          
            
          
        
        
          ...
        
        
          0
        
      
      
        
          
            
          
        
        
          
            
          
        
        
          0
        
        
          
            
              λ
              R
            
            ⁡
            
              (
              n
              )
            
          
        
      
    
    ]
  




Where λj(n) is defined in terms of the diagonal matrix elements of P(n):

λj(n)=1−Pjj(n).

Typically, the inverse matrix P(n) is computed using the fast square root method. The fast square root method utilizes a set of matrices, described in detail below, to perform recursive computations that can be used to obtain the inverse matrix. However, the matrices used within the common fast square root method contain terms that are unnecessary for computation of the inverse matrix. Consequently, a modified fast square root method can be utilized to efficiently perform the matrix inversion, using modified matrices and recursions to reduce or minimize the number of required calculations. Equalizer matrix component 104 can utilize such modified fast square root method to reduce computational expense (e.g., runtime, memory) and facilitate equalizer matrix generation. Details of the modified fast square root method are discussed below.
Equalizer component 102 can also include a logging component 108 that records demodulated symbols and additional information. The logging packet can include additional data, such as an identifier for the hardware block generating the logging packet, a forward link system frame number, an identifier for the serving sector, a number of tiles logged in the packet, a tile index, a number of symbols logged for one tile, the number of layers, the complex estimated symbol output for each layer and SINRs per layer. In an aspect, data can be logged once per forward link frame.
FIG. 2 presents a flowchart of an example method 200 that facilitates equalization of a transmitted tile. At act 202, channel and interference data for a tile are obtained. In particular, channel estimates can be generated based upon pilot symbols included within a tile. Separate channel matrices Ĥ(n) are generated for each received tone n. Consequently, for each modulation symbol, a vector of channel matrices corresponding to the received tile is obtained. Similarly, interference information corresponding to the received tile is also obtained.
At 204, a determination can be made as to whether the rank of the transmission is equal to one. If yes, MMSE equalization may not be the most efficient process for equalization. Accordingly, the signal can be equalized using an alternative process, such as MRC equalization at 206. If no, an equalizer matrix can be generated for a tone utilizing a modified fast square root method at 208. The modified fast square root method can utilize matrices of the standard fast square root method. However, only a subset of the elements of the matrices need be updated. Consequently, for each iteration of the recursive calculation, a fraction of the common fast square root method calculations are performed, resulting in significantly fewer computations. The generated equalizer matrices can be used to generate equalized symbols for the tone at 210.
At act 212, a determination is made as to whether there are additional tones in the tile to be equalized. If yes, the process returns to 208, where an equalizer matrix is generated for the next tone. If no, the process terminates for the particular tile. At 214, demodulated data symbols can be logged. In particular, an MMSE logging packet can include MMSE demodulated (estimated) data symbols from one or more tiles from the same frame. In an aspect, data can be logged once per forward link frame. The logging packet can include additional data, such as an identifier for the hardware block generating the logging packet, a forward link system frame number, an identifier for the serving sector, number of tiles logged in the packet, a tile index, a number of symbols logged for a tile, a number of layers, a complex estimated symbol output for each layer and SINRs per layer. Methodology 200 can be repeated for multiple received tiles.
FIG. 3 illustrates an equalizer component 102 that utilizes a simplified, efficient equalization procedure. Equalizer component 102 can include an inverse matrix component 300 that computes an inverse matrix P(n) utilizing a modification of the common fast square root method as it is known in the art. The fast square root method utilizes a set of matrices, referred to herein as the fast square root matrices or the pre-array and post-array matrices. Inverse matrix component 300 can include an initialization component 302 that performs operations to initialize the fast square root method matrices. An array update component 304 can modify or update the elements of the pre-array and post-array during iterative processing. In particular, only a subset of the elements is necessary for inverse matrix computation. Consequently, array update component 304 can update a subset of the pre-array and post-array matrices. An inverse matrix update component 306 can generate the inverse matrix according to the modified fast square method. The generated equalizer matrix can be utilized by equalization component 106, and the results logged by logging component 108.
Consider a QR decomposition of the channel matrix augmented with minimum interference variance σmin and identity matrix I:




  
    [
    
      
        
          
            
              H
              ^
            
            ⁡
            
              (
              n
              )
            
          
        
      
      
        
          
            
              σ
              min
            
            ⁢
            I
          
        
      
    
    ]
  
  =
  
    
      
        Q
        ⁡
        
          (
          n
          )
        
      
      ⁢
      
        R
        ⁡
        
          (
          n
          )
        
      
    
    =
    
      
        [
        
          
            
              
                
                  Q
                  a
                
                ⁡
                
                  (
                  n
                  )
                
              
            
          
          
            
              
                
                  Q
                  2
                
                ⁡
                
                  (
                  n
                  )
                
              
            
          
        
        ]
      
      ⁢
      
        R
        ⁡
        
          (
          n
          )
        
      
    
  




Here, Qa has dimensions MT×MR and Q has dimensions (MT+MR)×MT. Using the QR decomposition, the equalizer matrix can be written as follows:

G(n)=Λ(n)−1R(n)−1Qa*(n)

where R(n)−1=P(n)1/2 and Qa*(n)=P(n)*1/2Ĥ(n)*. This equation can also be expressed as follows:

G(n)=Λ(n)−1P(n)1/2P(n)*1/2Ĥ(n)*

Such expression can be computed more efficiently than the previous equation. Here, P(n)1/2 can be computed as follows:





  
    
      
        P
        
          |
          i
        
      
      ⁡
      
        (
        n
        )
      
    
    
      1
      /
      2
    
  
  =
  
    
      [
      
        
          
            ∑
            
              j
              =
              1
            
            i
          
          ⁢
          
            
              
                
                  H
                  ^
                
                j
              
              ⁡
              
                (
                n
                )
              
            
            ⁢
            
              
                
                  
                    H
                    ^
                  
                  j
                
                ⁡
                
                  (
                  n
                  )
                
              
              *
            
          
        
        +
        
          
            σ
            min
            2
          
          ⁢
          I
        
      
      ]
    
    
      
        -
        1
      
      /
      2
    
  




where Ĥj(n) is the j-th row of Ĥ(n). Matrices P(n)1/2 and Qa*(n) can be obtained using recursive processing of the following fast square root matrices:




  
    
      
        [
        
          
            
              1
            
            
              
                
                  
                    
                      H
                      ^
                    
                    i
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
                ⁢
                
                  
                    
                      P
                      
                        |
                        
                          i
                          -
                          1
                        
                      
                    
                    ⁡
                    
                      (
                      n
                      )
                    
                  
                  
                    1
                    /
                    2
                  
                
              
            
          
          
            
              0
            
            
              
                
                  
                    P
                    
                      |
                      
                        i
                        -
                        1
                      
                    
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
                
                  1
                  /
                  2
                
              
            
          
          
            
              
                -
                
                  e
                  i
                
              
            
            
              
                
                  B
                  
                    i
                    -
                    1
                  
                
                ⁡
                
                  (
                  n
                  )
                
              
            
          
        
        ]
      
      ⁢
      
        Θ
        i
      
    
    =
    
      [
      
        
          
            
              r
              
                e
                ,
                i
              
              
                1
                /
                2
              
            
          
          
            0
          
        
        
          
            
              K
              
                p
                ,
                i
              
            
          
          
            
              
                
                  P
                  
                    |
                    i
                  
                
                ⁡
                
                  (
                  n
                  )
                
              
              
                1
                /
                2
              
            
          
        
        
          
            
              -
              
                e
                i
              
            
          
          
            
              
                B
                i
              
              ⁡
              
                (
                n
                )
              
            
          
        
      
      ]
    
  




  
    
      
        
          P
          
            |
            0
          
          
            1
            /
            2
          
        
        ⁡
        
          (
          n
          )
        
      
      =
      
        
          1
          σ
        
        ⁢
        
          I
          
            MT
            ×
            MT
          
        
      
    
    ,
    
      
        
          B
          0
        
        ⁡
        
          (
          n
          )
        
      
      =
      
        0
        
          MR
          ×
          MT
        
      
    
  



P|01/2(n) is initialized to an identity matrix IMT×MT, with dimensions MT×MT, multiplied by 1/σ. B0(n) is initialized to a zero matrix with dimensions MR×MT. Here, ei is the i-th unit vector of dimension MR and Ĥi(n) is the i-th row of Ĥ(n).

P(n)1/2 can be calculated by generating and updating the matrices for i=1, 2, 3 . . . MR. After MR iterations, P(n)1/2=P|MR−1(n)1/2 and Qa(n)=BMR(n). It is computationally more demanding to calculate P(n)1/2 and Qa(n) to be used in the equalizer expression:

G(n)=Λ(n)−1R(n)−1Qa*(n)

Instead only P(n)1/2 need be computed and the rewritten equalizer expression can be used:

G(n)=Λ(n)−1P(n)1/2P(n)*1/2Ĥ(n)*

Required computations can also be reduced by decreasing the dynamic requirements for the computations. Typically, during initialization of the fast square root method, the identity matrix IMT×MT is multiplied by 1/σ,




  
    
      P
      
        
        0
      
      
        1
        /
        2
      
    
    ⁡
    
      (
      n
      )
    
  
  =
  
    
      1
      
        σ
        ⁢
        
          
        
      
    
    ⁢
    
      
        I
        
          MT
          ×
          MT
        
      
      .
    
  




Such an operation can result in relatively large numbers and dynamic ranges for initialization. This large dynamic range can require additional bits to maintain data and perform calculations. The dynamic range can be avoided by a simple multiplication by interference. In particular, the pre-array and post-array matrices can be updated using the following expression:

{circumflex over (P)}|f(n)1/2=P|f(n)1/2σmin 

Initialization component 302 and array update component 304 can utilize the described modification to facilitate processing. The following description of the modified fast square root method utilizes this feature to reduce dynamic ranges. However, the computations for the modified square root method using a partial update of the fast square root matrices can be performed without utilizing this feature.

A subset of the fast square root matrices can be updated to compute {circumflex over (P)}|i(n)1/2. In particular, during iterative processing only partial fast square root matrices are updated:



  
    
      
        [
        
          
            
              
                σ
                min
              
            
            
              
                
                  
                    
                      H
                      ^
                    
                    i
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
                ⁢
                
                  
                    
                      
                        P
                        ^
                      
                      
                        
                        
                          i
                          -
                          1
                        
                      
                    
                    ⁡
                    
                      (
                      n
                      )
                    
                  
                  
                    1
                    /
                    2
                  
                
              
            
          
          
            
              0
            
            
              
                
                  
                    
                      P
                      ^
                    
                    
                      
                      
                        i
                        -
                        1
                      
                    
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
                
                  1
                  /
                  2
                
              
            
          
        
        ]
      
      ⁢
      
        Θ
        i
      
    
    =
    
      [
      
        
          
            
              
                r
                
                  e
                  ,
                  i
                
                
                  1
                  /
                  2
                
              
              ⁢
              
                σ
                min
              
            
          
          
            0
          
        
        
          
            
              
                K
                ^
              
              
                p
                ,
                i
              
            
          
          
            
              
                
                  
                    P
                    ^
                  
                  
                    
                    i
                  
                
                ⁡
                
                  (
                  n
                  )
                
              
              
                1
                /
                2
              
            
          
        
      
      ]
    
  




  
    
      
        
          P
          ^
        
        
          
          0
        
        
          1
          /
          2
        
      
      ⁡
      
        (
        n
        )
      
    
    =
    
      I
      
        MT
        ×
        MT
      
    
  



Here, {circumflex over (P)}|i(n)1/2=P|i(n)1/2σmin. Here, {circumflex over (P)}|01/2(n) is initialized to the identity matrix IMT×MT. The fast square root matrix utilized in the recursive process:





  X
  =
  
    [
    
      
        
          
            σ
            min
          
        
        
          
            
              
                
                  H
                  ^
                
                i
              
              ⁡
              
                (
                n
                )
              
            
            ⁢
            
              
                
                  
                    P
                    ^
                  
                  
                    
                    
                      i
                      -
                      1
                    
                  
                
                ⁡
                
                  (
                  n
                  )
                
              
              
                1
                /
                2
              
            
          
        
      
      
        
          0
        
        
          
            
              
                
                  P
                  ^
                
                
                  
                  
                    i
                    -
                    1
                  
                
              
              ⁡
              
                (
                n
                )
              
            
            
              1
              /
              2
            
          
        
      
    
    ]
  




is referred to as the pre-array matrix, X. While the second fast square root matrix:





  Y
  =
  
    [
    
      
        
          
            
              r
              
                e
                ,
                i
              
              
                1
                /
                2
              
            
            ⁢
            
              σ
              min
            
          
        
        
          0
        
      
      
        
          
            
              K
              ^
            
            
              p
              ,
              i
            
          
        
        
          
            
              
                
                  P
                  ^
                
                
                  
                  i
                
              
              ⁡
              
                (
                n
                )
              
            
            
              1
              /
              2
            
          
        
      
    
    ]
  




is referred to as the post-array matrix, Y. The inverse matrix, {circumflex over (P)}|i(n)1/2, can be recursively computed utilizing these modified fast square root matrices or arrays.

FIG. 4 depicts a representation of an initialization process for a pre-array matrix. During initialization of the pre-array matrix, vector a can be computed utilizing the following equation:

a=Ĥi(n){circumflex over (P)}|i−1(n)1/2 

Such a computation can be performed using the following example pseudocode:
















for k = 1 : MT,



  accC = 0



  for m = 1 : MT,



    accC = accC + ĥi,m(n){circumflex over (P)}|i−1,(m,k)(n)



  end;



  ak = accC;



end;










Diagram 400 depicts example operations for calculating vector a. Initialization component 302 can also initialize {circumflex over (P)}|01/2(n) to the identity matrix IMT×MT. In addition, initialization component 302 can initialize the post-array to the pre-array, as follows:





  Y
  =
  
    X
    =
    
      [
      
        
          
            
              
                s
                f
              
              ⁢
              
                σ
                min
              
            
          
          
            a
          
        
        
          
            0
          
          
            
              
                
                  
                    P
                    ^
                  
                  
                    
                    
                      i
                      -
                      1
                    
                  
                
                ⁡
                
                  (
                  n
                  )
                
              
              
                1
                /
                2
              
            
          
        
      
      ]
    
  




Here, sf is an input power of two scaling factors that can be implemented with a right-shift operation.

Array update component 304 can update the pre-array matrix, rotation matrix Θi, and post-array matrix during iterative processing of the square root method. In particular, during processing, for each receive antenna i=1, 2 . . . MR the pre-array matrix can be computed, the rotation and post-array matrices can be updated and an element of the inverse matrix can be generated. Array update component 304 can compute the (MT+1)×(MT+1) rotation matrix Θi and update the post-array matrix, as a function of the rotation matrix and pre-array, Y=XΘi.
The rotation matrix Θi may be determined in accordance with a Householder reflection approach. This may involve performing the following operations:




  
    
      
        
          Θ
          i
        
        =
        
          I
          -
          
            2
            ⁢
            
              
            
            ⁢
            z
            ⁢
            
              
            
            ⁢
            
              z
              *
            
          
        
      
    
    
      
        (
        1
        )
      
    
  
  
    
      
        u
        =
        
          
            [
            
              
                x
                1
              
              ,
              ...
              ⁢
              
                
              
              ,
              
                x
                
                  
                    M
                    T
                  
                  +
                  1
                
              
            
            ]
          
          *
        
      
    
    
      
        (
        2
        )
      
    
  
  
    
      
        α
        =
        
          
          u
          
        
      
    
    
      
        (
        3
        )
      
    
  
  
    
      
        v
        =
        
          u
          +
          
            α
            ⁢
            
              
            
            ⁢
            
              e
              1
            
          
        
      
    
    
      
        (
        4
        )
      
    
  
  
    
      
        z
        =
        
          v
          
            
            v
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




where └x1, . . . , xMT+1┘ is the first row of the pre-array X in that iteration.

Inverse matrix update component 306 can update the inverse matrix based upon the iterative computation of the post-array matrix as follows:

{circumflex over (P)}|i(n)1/2=Y2:MT,2:MT 

Array update component 304 can utilize the computed inverse matrix to update selected portions of the pre-array matrix. Equalizer generator component 104 can utilize the inverse matrix to compute the equalizer matrix, which is used by the equalization component 106 to perform equalization of the received signal.

FIG. 5 illustrates an example method 500 for computing an inverse matrix. A variation of the fast square root method which reduces computational complexity can be utilized. At act 502, the pre-array and post-array matrices are initialized in preparation for computation of the inverse matrix. In addition, counter variable i representing receive antennas can be initialized (e.g., i=1). Pre-array matrix can be initialized based upon computation of vector a:

a=Ĥi(n){circumflex over (P)}|i−1(n)1/2 

The post-array matrix can be initialized to the pre-array matrix.

After initialization, the post-array and pre-array matrices are iteratively updated for the number of receive antennas. At 504, a rotation matrix is computed for the iteration. The rotation matrix Θ may be computed in accordance with a Householder reflection approach, as described above.
The post-array can be updated based upon the rotation matrix and the pre-array matrix (e.g., Y=XΘi) at act 506. At act 508, the inverse matrix can be updated as a function of a post-array matrix (e.g., {circumflex over (P)}|i(n)1/2=Y2:MT,2MT). Elements of the pre-array matrix are updated based upon the inverse matrix at act 510.
At act 512, a determination is made as to whether processing has been completed for each receive antenna (e.g., i<MR). If processing is not complete, at act 514 the variable i for the receive antennas is incremented, and processing continues at act 504, where the rotation matrix is computed for the next receive antenna. If processing has been completed for each receive antenna, an inverse matrix has been computed and can be used to generate an equalizer matrix to perform equalization of a signal.
Referring now to FIGS. 6, 7 and 8, diagrams illustrating calculation of equalized symbols are depicted. Equalized symbols can be denoted as follows:

{tilde over (s)}(n)=G(n){circumflex over (x)}(n)

Here, {tilde over (s)}(n) represents normalized, equalized symbols for tone n, G(n) is the equalizer matrix, and {circumflex over (x)}(n) is the scaled, received signal for tone n. Diagram 600 illustrates operations to scale input signal, {circumflex over (x)}(n). The following example pseudocode can be used to normalize the received signal by a scaling vector αi:

for i=1: MR,

{circumflex over (x)}i(n)=xi(n)×αi 

end;
Here, αi can be denoted as follows:




  
    
      α
      i
    
    =
    
      
        σ
        min
      
      
        σ
        i
      
    
  
  ,
  
    i
    =
    1
  
  ,
  2
  ,
  
    3
    ⁢
    
      
    
    ⁢
    ...
    ⁢
    
      
    
    ⁢
    
      M
      R
    
  




As discussed above, the equalizer matrix can be denoted as follows:

G(n)=Λ(n)−1P(n)1/2P(n)1/2Ĥ(n)*

Resulting in the following equation for equalized symbols:

{tilde over (s)}(n)=Λ(n)−1P(n)1/2P(n)*1/2Ĥ(n)*{circumflex over (x)}(n)

Equalized symbols can be computed in stages, as shown in FIGS. 6, 7 and 8. In particular, in a first stage a vector d can be computed as follows:

d=Ĥ(n)*{circumflex over (x)}(n)

Diagram 602 illustrates operations that can be used to generate vector d. The following example pseudocode can be used to generate d:
















for j = 1 : MT,



  accC = 0



  for i = 1 : MR,



    accC = accC + ĥ*i,j(n) * {circumflex over (x)}i(n)



  end;



  dj = accC



end;










During the second stage, an R×1 vector e, can be computed as follows:




  e
  =
  
    
      1
      
        s
        f
      
    
    ⁢
    
      γ
      min
    
    ⁢
    
      
        P
        ⁡
        
          (
          n
          )
        
      
      
        *
        
          1
          /
          2
        
      
    
    ⁢
    d
  




Here, sf is a scaling factor and γmin is a normalization factor. Diagram 604 illustrates operations that can be used to generate vector e. Normalization factor γmin can be computed as follows:





  
    γ
    min
    2
  
  =
  
    1
    
      σ
      min
      2
    
  




Diagram 606 depicts a bit-exact implementation for computing γ2mim. The following operation can be performed once per tile:





  
    σ
    min
  
  =
  
    1
    
      
        γ
        min
        2
      
    
  




Diagram 608 depicts a bit exact implementation for computing σmin. The following example pseudocode can be used to generate e as follows:
















for j = 1 : MT,









accC = 0



for m = 1 : j,









accC = accC + conj[{circumflex over (P)}m, j(n)1/2] * dm









end;



 







  
    e
    j
  
  =
  
    
      acc
      C
    
    ×
    
      γ
      min
    
    ×
    
      1
      
        s
        f
      
    
  







 









end;










During stage three, an R×1 vector f can be computed as follows:




  f
  =
  
    
      1
      
        s
        f
      
    
    ⁢
    
      γ
      min
    
    ⁢
    
      
        P
        ⁡
        
          (
          n
          )
        
      
      
        1
        /
        2
      
    
    ⁢
    e
  




Here, sf is a scaling factor and γmin is a normalization factor. Normalization factor γmin can be computed as described above. Diagram 702 depicts operations that can be used to generate vector f. The following example pseudocode can also be used to generate f:
















for j = 1 : MT,









accC = 0



for m = j : MT,









accC = accC + {circumflex over (P)}j, m(n)1/2 * em









end;



 







  
    f
    j
  
  =
  
    
      acc
      C
    
    ×
    
      γ
      min
    
    ×
    
      1
      
        s
        f
      
    
  







 









end;










During the final stage an R×1 vector of the equalized signal ŝj can be generated as follows:

ŝj=βjfj j=1,2, . . . MT 

Diagram 704 depicts operations for computing the equalized symbol ŝj and the following example pseudocode can be used to generate such equalized symbols:
















for j = 1 : MT,



  ŝj = βj * fj



end;










Here, βj can be utilized for bias correction, where βj can be obtained from the diagonal matrix elements of {circumflex over (P)}(n), computed as:





  
    
      
        P
        ^
      
      jj
    
    ⁡
    
      (
      n
      )
    
  
  =
  
    
      ∑
      
        m
        =
        1
      
      R
    
    ⁢
    
      
    
    ⁢
    
      
        
          
            
              
                P
                ^
              
              
                j
                ,
                m
              
            
            ⁡
            
              (
              n
              )
            
          
          
            1
            /
            2
          
        
        ⁡
        
          [
          
            
              
                
                  P
                  ^
                
                
                  j
                  ,
                  m
                
              
              ⁡
              
                (
                n
                )
              
            
            
              1
              /
              2
            
          
          ]
        
      
      *
    
  




Diagram 800 depicts operations to compute {circumflex over (P)}jj(n). The following exemplary pseudocode can be used to obtain the diagonal elements:
















for k = 1 : MT,



  accC = 0



  for m = 1 : MT,



    accC = accC + ĥi,m(n){circumflex over (P)}|i−1,(m,k)(n)



  end;



  ak = accC;



end;










Where βj can be expressed as follows:





  
    
      β
      j
    
    =
    
      
        
          1
          
            1
            -
            
              
                
                  P
                  ^
                
                
                  j
                  ,
                  j
                
              
              ⁡
              
                (
                n
                )
              
            
          
        
        ⁢
        
          
        
        ⁢
        j
      
      =
      1
    
  
  ,
  2
  ,
  
    ...
    ⁢
    
      
    
    ⁢
    R
  




Diagram 802 depicts operations for computing βj. The MMSE post-processing SINRs can be used for the weighting the log-likelihood ratios (LLR) and are readily obtained from the diagonal elements of the P matrix computed:





  
    
      λ
      j
    
    =
    
      
        
          min
          ⁡
          
            [
            
              
                
                  1
                  
                    
                      
                        P
                        ^
                      
                      jj
                    
                    ⁡
                    
                      (
                      n
                      )
                    
                  
                
                -
                1
              
              ,
              255
            
            ]
          
        
        ⁢
        
          
        
        ⁢
        j
      
      =
      1
    
  
  ,
  2
  ,
  
    ...
    ⁢
    
      
    
    ⁢
    R
  




Diagram 804 depicts operations for computing λj.

Turning now to FIG. 9, results of a simulation of equalization that utilizes using the modified fast square root method are illustrated. A preliminary simulation can be performed to validate bit-widths, utilizing four transmit and receive antennas. Noise variance per receive antenna can be varied (e.g., 0. −3, −6 and −10 dB), with respect to a mean SNR range of 0 dB to 30 dB. Channel matrix, H, elements are assumed to be IID Gaussian with a mean of zero and variance of one. Inputs of channel elements and received signal are assumed to be scaled by a factor of 1⁄4. The normalized mean squared error (MSE) between bit-accurate and floating-point output(s) can be computed as follows:



  
    
      NMSE
      ⁡
      
        [
        
          
            s
            ^
          
          ⁡
          
            (
            n
            )
          
        
        ]
      
    
    =
    
      
        
          E
          
            j
            ,
            n
          
        
        ⁡
        
          [
          
            1
            -
            
              
              
                
                  
                    
                      s
                      ^
                    
                    j
                    float
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
                
                  
                    
                      s
                      ^
                    
                    j
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
              
              
            
          
          ]
        
      
      2
    
  




  
    
      NMSE
      ⁡
      
        [
        
          Λ
          ⁡
          
            (
            n
            )
          
        
        ]
      
    
    =
    
      
        
          E
          
            j
            ,
            n
          
        
        ⁡
        
          [
          
            1
            -
            
              
              
                
                  
                    λ
                    j
                    float
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
                
                  
                    λ
                    j
                  
                  ⁡
                  
                    (
                    n
                    )
                  
                
              
              
            
          
          ]
        
      
      2
    
  



Graph 900 can be generated using a fixed-point simulation (e.g., using Matlab fixed point toolbox). Here, the x-axis 902 represents the signal to noise ratio (SNR), while the y-axis 904 represents the normalized MSE. It should be noted that the per-layer SINR (at the output of a MMSE receiver) is at least 6 dB below the receive SNR per antenna. For example, at 30 dB SNR, the per-layer SINR is less than 24 dB. Typically, for IID channels MIMO channels, the per-layer SNIR can be much smaller than 24 dB. Accordingly, a normalized MSE of −25 dB may be acceptable.

It will be appreciated that inferences can be made regarding classification of terminal, etc. As used herein, the term to “infer” or “inference” refers generally to the process of reasoning about or inferring states of the system, environment, and/or user from a set of observations as captured via events and/or data. Inference can be employed to identify a specific context or action, or can generate a probability distribution over states, for example. The inference can be probabilistic—that is, the computation of a probability distribution over states of interest based on a consideration of data and events. Inference can also refer to techniques employed for composing higher-level events from a set of events and/or data. Such inference results in the construction of new events or actions from a set of observed events and/or stored event data, whether or not the events are correlated in close temporal proximity, and whether the events and data come from one or several event and data sources.
FIG. 10 is an illustration of a system 1000 that facilitates equalization in a communication environment in accordance with various aspects. System 1000 comprises an access point 1002 with a receiver 1010 that receives signal(s) from one or more terminals 1004 through one or more receive antennas 1006, and transmits to the one or more terminals 1004 through a one or more transmit antennas 1008. In one or more aspects, receive antennas 1006 and transmit antennas 1008 can be implemented using a single set of antennas. Receiver 1010 can receive information from receive antennas 1006 and is operatively associated with a demodulator 1012 that demodulates received information. Receiver 1010 can be an MMSE-based receiver, or some other suitable receiver for separating out terminals assigned thereto, as will be appreciated by one skilled in the art. According to various aspects, multiple receivers can be employed (e.g. one per receive antenna), and such receivers can communicate with each other to provide improved estimates of user data. Access point 1002 further comprises an equalizer component 1022, which can be a processor distinct from, or integral to, receiver 1010. Equalizer component 1022 can utilize the modified fast square root method as described hereinbefore to reduce the complexity of computations required to equalize received signals.
Demodulated symbols are analyzed by a processor 1014. Processor 1014 is coupled to a memory 1016 that stores information related to equalization, such as the equalizer function, equalizer matrices, and any other data related to equalization. It will be appreciated that the data store (e.g., memories) components described herein can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. By way of illustration, and not limitation, nonvolatile memory can include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM), which acts as external cache memory. By way of illustration and not limitation, RAM is available in many forms such as synchronous RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), and direct Rambus RAM (DRRAM). The memory 1010 of the subject systems and methods is intended to comprise, without being limited to, these and any other suitable types of memory. Receiver output for each antenna can be jointly processed by receiver 1010 and/or processor 1014. A modulator 1018 can multiplex the signal for transmission by transmitter 1020 via transmit antennas 1008 to terminals 1004.
Referring to FIG. 11, one embodiment of a transmitter and receiver in a multiple access wireless communication system is illustrated, 1100. At transmitter system 1110, traffic data for a number of data streams is provided from a data source 1112 to a transmit (TX) data processor 1114. In an embodiment, each data stream is transmitted over a respective transmit antenna. TX data processor 1114 formats, codes, and interleaves the traffic data for each data stream based on a particular coding scheme selected for that data stream to provide coded data. In some embodiments, TX data processor 1114 applies preceding weights to the symbols of the data streams based upon the user and the antenna from which the symbols are being transmitted. In some embodiments, the preceding weights may be generated based upon an index to a codebook generated at the transceiver, 1154 and provided as feedback to the transceiver, 1122, which has knowledge of the codebook and its indices. Further, in those cases of scheduled transmissions, the TX data processor 1114 can select the packet format based upon rank information that is transmitted from the user.
The coded data for each data stream may be multiplexed with pilot data using OFDM techniques. The pilot data is typically a known data pattern that is processed in a known manner and may be used at the receiver system to estimate the channel response. The multiplexed pilot and coded data for each data stream is then modulated (e.g., symbol mapped) based on a particular modulation scheme (e.g., BPSK, QPSK, M-PSK, or M-QAM) selected for that data stream to provide modulation symbols. The data rate, coding, and modulation for each data stream may be determined by instructions performed by processor 1130. As discussed above, in some embodiments, the packet format for one or more streams may be varied according to the rank information that is transmitted from the user.
The modulation symbols for all data streams are then provided to a TX MIMO processor 1120, which may further process the modulation symbols (e.g., for OFDM). TX MIMO processor 1120 then provides NT modulation symbol streams to NT transceivers (TMTR) 1122a through 1122t. In certain embodiments, TX MIMO processor 1120 applies preceding weights to the symbols of the data streams based upon the user to which the symbols are being transmitted to and the antenna from which the symbol is being transmitted from that user channel response information.
Each transceiver, 1122 receives and processes a respective symbol stream to provide one or more analog signals, and further conditions (e.g., amplifies, filters, and upconverts) the analog signals to provide a modulated signal suitable for transmission over the MIMO channel. NT modulated signals from transceivers 1122a through 1122t are then transmitted from NT antennas 1124a through 1124t, respectively.
At receiver system 1150, the transmitted modulated signals are received by NR antennas 1152a through 1152r and the received signal from each antenna 1152 is provided to a respective transceiver, (RCVR) 1154. Each transceiver 254 conditions (e.g., filters, amplifies, and downconverts) a respective received signal, digitizes the conditioned signal to provide samples, and further processes the samples to provide a corresponding “received” symbol stream.
An RX data processor 1160 then receives and processes the NR received symbol streams from NR transceivers 1154 based on a particular receiver processing technique to provide NT “detected” symbol streams. The processing by RX data processor 1160 is described in further detail below. Each detected symbol stream includes symbols that are estimates of the modulation symbols transmitted for the corresponding data stream. RX data processor 1160 then demodulates, deinterleaves, and decodes each detected symbol stream to recover the traffic data for the data stream. The processing by RX data processor 1160 is complementary to that performed by TX MIMO processor 1120 and TX data processor 1114 at transmitter system 1110.
The channel response estimate generated by RX processor 1160 may be used to perform space, space/time processing at the receiver, adjust power levels, change modulation rates or schemes, or other actions. RX processor 1160 may further estimate the signal-to-noise-and-interference ratios (SINRS) of the detected symbol streams, and possibly other channel characteristics, and provides these quantities to a processor 1170. RX data processor 1160 or processor 1170 may further derive an estimate of the “operating” SINR for the system. Processor 1170 then provides estimated (CSI), which may comprise various types of information regarding the communication link and/or the received data stream. For example, the CSI may comprise only the operating SINR. The CSI is then processed by a TX data processor 1178, which also receives traffic data for a number of data streams from a data source 1176, modulated by a modulator 1180, conditioned by transceivers 1154a through 1154r, and transmitted back to transmitter system 1110.
At transmitter system 1110, the modulated signals from receiver system 1150 are received by antennas 1124, conditioned by receivers 1122, demodulated by a demodulator 1140, and processed by a RX data processor 1142 to recover the CSI reported by the receiver system. The reported quantized information e.g. CQI is then provided to processor 1130 and used to (1) determine the data rates and coding and modulation schemes to be used for the data streams and (2) to generate various controls for TX data processor 1114 and TX MIMO processor 1120.
The techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the processing units (e.g., controllers 1120 and 1160, TX and RX processors 1114 and 1142, and so on) for these techniques may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, other electronic units designed to perform the functions described herein, or a combination thereof.
Referring now to FIG. 12, an example system 1200 that enables the equalization of received signals utilizing a modification of the square root method according to aspects described herein is illustrated. System 1200 includes a logical grouping 1210 of electronic components that can act in conjunction to achieve said equalization. In an aspect, logical grouping 1210 includes an electronic component 1215 can generate an equalizer matrix for each tone or subcarrier of a received signal. The equalizer matrix is generated using an equalizer function that is based at least in part upon an inverse matrix. The inverse matrix can be computed using a modification of the fast square root method, where only a portion of the fast square root matrix is updated during iterative processing. This partial update reduces required computations and improves performance. In addition, dynamic requirements for processing can be reduced by modifying initialization of the fast square root matrix as a function of interference variance. In addition, logic grouping 1210 includes electronic component 1225 can utilize a generated equalizer matrix to separate one or more data streams included within a subcarrier of the received signal. Each subcarrier can be equalized using the corresponding equalizer matrix. Once separated the individual data streams can be separately processed to obtain data symbols. Furthermore, an electronic component 1235 can equalize the received signal utilizing a maximum ratio combining equalization when the signal contains a single data stream.
System 1200 can also include a memory 1240 that retains instructions for executing functions associated with electrical components 1215, 1225 and 1235, as well as measured and computed data that may be generated during executing such functions. While shown as being external to memory 1240, it is to be understood that one or more of electronic components 1215, 1225 and 1235 can reside within memory 1240.
Methodologies for performing equalization are illustrated in the subject description (FIG. 2 and FIG. 5). It is noted that while for purposes of simplicity of explanation, the methodologies are shown and described as a series of acts, it is to be understood and appreciated that the methodologies are not limited by the order of acts, as some acts may, in accordance with one or more aspects, occur in different orders and/or concurrently with other acts from that shown and described herein. For example, those skilled in the art will understand and appreciate that a methodology could alternatively be represented as a series of interrelated states or events, such as in a state diagram. Moreover, not all illustrated acts may be utilized to implement a methodology in accordance with one or more aspects.
For a software implementation, the techniques described herein may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in memory units and executed by processors. The memory unit may be implemented within the processor or external to the processor, in which case it can be communicatively coupled to the processor via various means as is known in the art.
Moreover, various aspects or features described herein may be implemented as a method, apparatus, or article of manufacture using standard programming and/or engineering techniques. The term “article of manufacture” as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. For example, computer readable media can include but are not limited to magnetic storage devices (e.g., hard disk, floppy disk, magnetic strips . . . ), optical disks (e.g. compact disk (CD), digital versatile disk (DVD) . . . ), smart cards, and flash memory devices (e.g., card, stick, key drive . . . ).
What has been described above includes examples of one or more aspects. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the aforementioned aspects, but one of ordinary skill in the art may recognize that many further combinations and permutations of various aspects are possible. Accordingly, the described aspects are intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims. Furthermore, to the extent that the terms “includes” or “including” or any variation thereof is employed in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term “comprising” as “comprising” is interpreted when employed as a transitional word in a claim.

## Claims

1. A method for facilitating equalization in a receiver chain in a wireless communication system, the method comprising:
generating, with a processor, an equalizer matrix for a tone of a received signal, wherein the equalizer matrix is a function of an inverse matrix computed based at least in part upon a partial update of a subset of elements of a fast square root matrix, wherein the fast square root matrix is specified as a function of an interference variance; and
equalizing, with the processor the tone as a function of the equalizer matrix;
wherein performing the partial update of the subset of elements of the fast square root matrix comprises determining a rotation matrix in accordance with a Householder reflection approach.

2. The method of claim 1, wherein the fast square root matrix is a pre-array matrix.

3. The method of claim 1, wherein the fast square root matrix is a post-array matrix.

4. The method of claim 1, further comprising modifying, with the processor, the fast square root matrix so as to reduce the dynamic range requirements.

5. The method of claim 1, further comprising performing, with the processor, maximum ratio combining equalization when a single data stream is contained within the received signal.

6. The method of claim 1, further comprising generating, with the processor, a logging packet that includes symbols derived from the equalized tone.

7. An apparatus that facilitates equalization in a wireless communication environment, the apparatus comprising:
a processor configured to compute an inverse matrix based at least in part upon an iterative partial update of a fast square root matrix, to compute an equalizer matrix as a function of the inverse matrix, and to obtain at least one data stream from a received signal utilizing the equalizer matrix, wherein the fast square root matrix is specified as a function of an interference variance; and
a memory coupled to the processor;
wherein performing the iterative partial update of the fast square root matrix comprises determining a rotation matrix in accordance with a Householder reflection approach.

8. The apparatus of claim 7, wherein the fast square root matrix is at least one of a pre-array matrix or a post array matrix.

9. The apparatus of claim 7, wherein the processor is further configured to reduce a dynamic range requirement of the fast square root matrix.

10. The apparatus of claim 7, wherein the processor is further configured to perform a maximum ratio combining equalization when the received signal includes a single data stream.

11. A device that that facilitates equalization of a signal in a wireless environment, the device comprising:
means for generating an equalizer matrix utilizing a modified fast square root method that updates a subset of the fast square root matrix during iterative processing, wherein the fast square root matrix is specified as a function of an interference variance; and
means for separating at least one data stream in a received signal utilizing the equalizer matrix;
wherein updating the subset of the fast square root matrix during iterative processing comprises determining a rotation matrix in accordance with a Householder reflection approach.

12. The device of claim 11, wherein the fast square root matrix is at least one of a pre-array matrix or a post-array matrix.

13. The device of claim 11, further comprising:
means for modifying the fast square root matrix so as to reduce the dynamic range requirements.

14. The device of claim 11, further comprising means for equalizing the received signal utilizing a maximum ratio combining equalization when the signal contains a single data stream.

15. A computer program product including a non-transitory computer-readable medium comprising:
code for causing a computer to calculate an equalizer matrix for a tone of a received signal, wherein calculation of the equalizer matrix is based upon iterative partial update of a fast square root matrix, wherein the fast square root matrix is specified as a function of an interference variance; and
code for causing a computer to equalize the received signal as a function of the equalizer matrix;
wherein performing the partial update of the subset of elements of the fast square root matrix comprises determining a rotation matrix in accordance with a Householder reflection approach.

16. The computer program product of claim 15, wherein the fast square root matrix is at least one of a pre-array matrix or a post-array matrix.

17. The computer program product of claim 15, the non-transitory computer-readable medium further comprising:
code for causing a computer to modify the fast square root matrix so as to reduce the dynamic range requirements.

18. The computer program product of claim 15, the non-transitory computer-readable medium further comprising:
code for causing a computer to equalize the received signal utilizing maximum ratio combining equalization when the signal contains a single data stream.