Abstract:
Reduced State Sequence Equalizer (RSSE) is implemented using a butterfly hardware accelerator ( 58 ) in the form of a butterfly to increase the efficiency of computing branch metrics ( 24 ) and the ACS (add, compare and select) function ( 26 ).

Description:
CROSS-REFERENCE To RELATED APPLICATIONS  
       [0001]    Not Applicable 
     
    
     STATEMENT OF FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT  
       [0002] Not Applicable 
     
    
     
       BACKGROUND OF THE INVENTION  
         [0003]    1. Technical Field  
           [0004]    This invention relates in general to communications and, more particularly, to a method and apparatus for optimizing RSSE calculations.  
           [0005]    2. Description of the Related Art  
           [0006]    Compared to binary modulation commonly used in 2G standards, advanced wireless communication systems may use high-level modulation schemes. From a system point of view, this results in spectral efficiency at the expense of an increase of Inter-Symbol Interference (ISI).  
           [0007]    In order to mitigate ISI, efficient equalizers need to be implemented on the receiver side. The optimal solution to this problem is known as Maximum Likelihood Sequence Estimation (MLSE). The goal of this method is to subtract every possible sequence of L constellation points weighted by the channel estimation factors from the received symbol vector in order to determine the most probable symbols. L corresponds to the channel estimation length.  
           [0008]    The concept behind MLSE is to choose the minimum error square between the received symbol y k  and every possible linear combination of the last L symbols â k-i  weighted by the channel response samples h i , all values being complex. In a mathematical form, the approximated symbol frame of length L frame  is given by:  
           a   _     ^     =     arg        {       min       a   _     ^              ∑     k   =   0         L   frame     -   1                       (              y   k     -       ∑     i   =   0       L   -   1                         h   i              a   ^       k   -   i            (   s   )                  2     )         }                             
 
           [0009]    This inner term of the equation, the branch metric, can be rewritten as:  
                y   k     -       ∑     i   =   1       L   -   1                         h   i              a   ^       k   -   i            (   s   )           -       h   0              a   ^     k          (   s   )                2                         
 
           [0010]    The branch metric (bm) is composed by three terms. The first one is the soft value of the received symbol, the second one is the estimated contribution of the ISI coming from the L-1 preceding symbols and the third one is the supposed received symbol multiplied by a channel coefficient.  
           [0011]    The â k-i (s) for i=1, . . . ,L−1 fully determine a state of the MLSE in a trellis representation. Thus, the number of possible combinations or states, taking into account that â k-i (s) belongs to a set of M symbols and that K=L−1 with the channel response being of length L, is equal to M K . Furthermore, M transitions output each state. This makes MLSE too complicated for implementation in terminals receivers.  
           [0012]    A more adapted method, the Reduced State Sequence Equalizer (RSSE) is derived from MLSE. The simplification lies in the reduction of the number of states. Like for the MLSE, the RSSE method consists in minimizing a sum of square values (branch metrics) among all the symbols of the frame under consideration. Therefore, a trellis structure is well adapted to carry out this task. Compared to convolutional decoding, there are, for the general case, no redundancy properties among the branch metrics.  
           [0013]    For each symbol received, i.e. on trellis transition, the following units are executed: (1) Branch Metric Computation (BMC) Unit: Compute individually one branch metric per transition, (2) Add Compare and Select (ACS) Unit. With more than two transitions per state and (3) Post-Processing. Current implementations do not use generic structure to perform the BMC and ACS functions. Each branch metric is computed, added to the previous state value and the minimum path is selected for all next states.  
           [0014]    While RSSE requires only a fraction of calculations required by MLSE, it still is computation intensive, using significant processing resources. Therefore, a need has arisen for a method and apparatus for performing RSSE computations efficiently.  
         BRIEF SUMMARY OF THE INVENTION  
         [0015]    In the present invention, a sequence of probable symbols is generated from a sequence of received symbols using Reduced State Sequence Estimation. Butterfly circuitry computes terms sm 1 ′=min{sm 1 +m,sm 2 −m} and sm 2 ′=min{sm 1 −m, sm 2 +m}. Path metrics are computed between a first state and a second state responsive to the received symbols and reference constellation symbols and a best scenario path is determined at the second state using said butterfly circuitry.  
           [0016]    The present invention allows branch metric and the accumulate, compare and select (ACS) functions to be aided by use of a butterfly hardware accelerator available to support Viterbi decoding.  
       
    
    
     BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS  
       [0017]    For a more complete understanding of the present invention, and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:  
         [0018]    [0018]FIGS. 1 a - d  illustrate four different possible cosets for 8PSK modulation;  
         [0019]    [0019]FIG. 2 illustrates a trellis structure for an 8PSK 2-state RSSE and its decomposed version for butterfly execution;  
         [0020]    [0020]FIG. 3 illustrates a butterfly structure;  
         [0021]    [0021]FIG. 4 illustrates a block diagram showing the operation of an RSSE equalizer improved by hardware acceleration;  
         [0022]    [0022]FIG. 5 illustrates how a Butterfly structure can be used to compute branch metrics;  
         [0023]    [0023]FIG. 6 illustrates a π/8 counterclockwise rotation of a 8PSK constellation to produce symbols which can be accelerated by a Butterfly structure;  
         [0024]    [0024]FIG. 7 illustrates how 2 Butterfly structures can be used to compute branch metrics relative to all constellation symbols of the rotated 8-PSK constellation; and  
         [0025]    [0025]FIG. 8 illustrates a block diagram of a mobile communication device using a DSP with the accelerated RSSE.  
     
    
     DETAILED DESCRIPTION OF THE INVENTION  
       [0026]    The present invention is best understood in relation to FIGS.  1 - 8  of the drawings, like numerals being used for like elements of the various drawings.  
         [0027]    The Reduced State Sequence Equalizer (RSSE) is derived from the MLSE. In its most complicated form, it is equivalent to the MLSE and in its most simplified form to the DFE (Decision Feedback Equalization). Thus, its complexity is comprised between the MLSE complexity and the DFE complexity.  
         [0028]    The RSSE principle restricts the number of possible combination of past symbols to be tested by regrouping them inside so-called cosets. A coset is a collection of one or more symbols of the signal set. All symbols of the constellation need to be in one and only one coset. The i th  coset at time n-k is represented by A i (k). J k-i  is the number of cosets at time n-k and is naturally comprised between 1 and the number of symbols of the signal set:  1≦J   k ≦M for ═k. Furthermore, the analysis here below is restricted to values of J k  equal to power of 2, e.g. for a 8-PSK constellation we have J k  ε[1,2,4,8], and decreasing or equal values of J k  for increasing values of k: J k ≦J k-1 . This last restriction means that the older the symbol of the ISI sum, the less cosets at that time.  
         [0029]    [0029]FIGS. 1 a - d  illustrates four different possible cosets for 8-PSK modulation. As stated above, the idea behind the RSST is to reduce the number of states of the MLSE. Thus, while a MLSE implementation would have M K  states, the RSSE implementation would have  
         ∏     k   =   0       L   -   2                       J   k                             
         [0030]    states, where  
         1   ≤       ∏     k   =   0       L   -   2                       J   k       ≤     M   K       ,                         
 
         [0031]    while both the MLSE and RSSE implementation have M branch metrics outputting every state. In the RSSE, the number of states is given by  
         ∏   k                       J   k     .                           
 
         [0032]    In the MLSE, J k  is always equal to the number M of symbols in the constellation.  
         [0033]    The RSSE selects the best symbol sequence by minimizing the sum of each Square Euclidean Distance of the estimated ISI term subtracted from the received samples. At each transition, each previous state issues branch metrics related to every symbol a i  belonging to the reference constellation that reach the next states where the symbol is contained in the coset A j .  
         [0034]    [0034]FIG. 2 illustrates a trellis structure for an 8PSK 2-state RSSE. One sees that in FIG. 2, the number of states is smaller than the number of branches per state and thus parallel transitions occur (four per state transition).  
         [0035]    The branch metric between states is  
             b   m          (     s   ,       a   ^     k       )       =              y   k     -       ∑     i   =   0       L   -   1                         h   i              a   ^       k   -   i            (   s   )           -     f        (   s   )              2       ,                         
 
         [0036]    where f(s) may include any corrective terms to compensate for the reduced symbol set.  
         [0037]    Many digital signal processors include one or more hardware accelerators (HWAs). A possible HWA is the butterfly-HWA for trellis calculations in Viterbi decoding. The butterfly structure is shown functionally in FIG. 3. The butterfly structure computes:  
           sm   1 ′=min{ sm   1   +m, sm   2   −m}  and 
           sm   2 ′=min{ sm   1   −m, sm   2   +m}   
         [0038]    Hardware accelerators can be of a number of different varieties. In some cases, the HWA can be implemented as a specific instruction that is an extension of the ISA (Instruction Set Architecture) which executes a complex function. The hardware that supports the instruction may be part of the processing core or coupled to the processing core. There may also be variations on the computations shown above.  
         [0039]    For purposes of discussion, it will be assumed that the butterfly structure has the following restrictions: (1) the branch metrics of a butterfly are symmetric, (2) the branch metrics entering a state are of opposite sign and (3) the branch metrics are real values. Thus, the branch metric has to be a linear function for at least the part containing the parameter corresponding to the bm (the symbol for the equalizer). If not, the structure behind the HWA may not be fully used.  
         [0040]    [0040]FIG. 4 illustrates a block diagram  20  showing the operation of the RSSE equalizer, indicating areas, which can be improved by the butterfly structure hardware. In block  22 , parameters and trellis metrics initialization is performed. In block  24 , the branch metrics are computed, using the benefit of acceleration from the butterfly structure. These operations are described in greater detail below. In block  26 , the compare and select at the next states are performed, again with the benefit of the butterfly structure. In block  28 , the different parameters are updated for computation of the following symbol. The loop of blocks  24  through  28 : is repeated for a frame length. Upon completion of a frame, the traceback occurs in block  30  to determine the most likely sequence of symbols.  
         [0041]    The following describes modification of the general RSSE methods to allow use of the butterfly structure. As described above:  
         bm        (     s   ,       a   ^     k       )       =              y   k     -       ∑     i   =   0       L   -   1                         h   i              a   ^       k   -   i            (   s   )           -     f        (   s   )              2                           
 
         [0042]    The equation can be rewritten as:  
         bm        (     s   ,       a   ^     k       )       =                y   k     -       ∑     i   =   1       L   -   1                         h   i              a   ^       k   -   i            (   s   )           -       h   0            a   ^     k       -     f        (   s   )              2     =              S   _     -       h   0            a   ^     k              2                 with                   S   _       =       [       y   k     -       ∑     i   =   1       L   -   1                         h   i              a   ^       k   -   i            (   s   )           -     f        (   s   )         ]     .                           
 
         [0043]    Thus, bm(s, â k )=∥ S −h 0 â k ∥ 2 ∥ 2 +∥h 0 â k ∥ 2 −2Re{h 0 â k   S *}. Without loss of generality, we can set the coefficient h 0 =1 and for 8PSK constellation ∥a k ∥ 2  is equal to 1. Consequently,  
           bm ( s,â   k )= ∥ S ∥   2 −2 Re[h   0   â   k     S   *]. 
         [0044]    For a given state, the ∥ S ∥ 2  is constant. Differences come from the targeted symbol â k . The branch metric can be decomposed further by inserting the real and imaginary parts of the right terms: â k =a x +j·a y , h 0 =h x +j·h y  and  S =S x +j·S y Thus:  
           bm ( s, â   k )=∥ S ∥ 2 −2[ a   x ( h   x   S   x   +h   y   S   y )+ a   y ( h   x   S   y   −h   y   S   x )], or more concisely: 
           bm ( s, â   k )=∥ S ∥ 2 −2[ a   x   Re{h   0   * S }+a   y    Im{h   0   *  S }]   
         [0045]    Taking into account that h and  S are related to the initiating state and not to the symbol, the equation can be rewritten as:  
           bm ( s, â   k )=∥ S ∥ 2 −2[ a   x ( s )+ a   y ( s )+ a   y ( s )]=∥   S ∥   2 −2 a   x ( s )−2 a   y ( s ),with 
           a   x ( s )= a   x   Re{h   0   * S }  and  a   y ( s )= a   y   Im{h   0   * S }.   
         [0046]    Examining this expression, it can be seen that the branch metric is composed by three terms, the first one is equal for every branch coming out of one state, the second and third are linear combinations of h 0 , the  S  term (both determined by the state) and respectively the real and the imaginary parts of the symbol under consideration.  
         [0047]    All the terms depend on the initiating state s. This excludes any use of a butterfly structure with two different states (since the butterfly structure has a m, -m,-m, m symmetry relation). Thus, the only solution is to use one butterfly to compute four transitions issued from one state. This would represent two butterflies per RSSE initiating state for an 8-PSK Constellation.  
         [0048]    The RSSE applied to the 8PSK constellation, as defined in FIG. 1 a - d,  has an interesting property: each coset with more than one symbol always has a symbol and its opposite. This is easily understandable by looking at FIGS. 1 a - d.  Furthermore, the 4 diagonal symbols (the ones in the coset A 1 (k) in FIG. 1 c ) have coordinates equal to (±u,±u) where u=cos(π/4). As shown above, the branch metric may be decomposed in three terms with the two last terms being a linear function of the real and imaginary parts of the symbol under consideration. This second property allows use of the butterfly by conceptually changing the notion of bm for the equalizer. The constant part ∥ S ∥ 2  of the RSSE bm and the positive or negative version of 2a x (s) are added to the old state value in order to define two Trellis states. The branch metric is equal to 2a y (s).  
         [0049]    As shown graphically in FIG. 5, the Butterfly structure can be used to compute branch metrics by setting the butterfly HWA values as follows:  
           sm   1   =sm   old   +∥ S ∥   2 −2 a   x ( s ) 
           sm   2   =sm   old   +∥ S ∥   2 +2 a   x ( s ) 
           m= 2 a   y ( s ) 
         [0050]    The butterfly structure computes the transition corresponding to four diagonal symbols of the 8PSK constellation by adding and subtracting their real and imaginary components. The minimum of the two branch metrics determines the best symbol for each coset. It should be noted however, that in this form the butterfly structure is applicable only to cosets that have the symbols with coordinates (±a x , ±a y ), a x  and a y  being two real numbers.  
         [0051]    Also as shown in FIG. 5, in this form, only the two diagonal cosets can be computed by the butterfly structure.  
         [0052]    A way to use the butterfly structure for the computation of all minimums of two value cosets in 8-PSK constellations is to operate a change of referential. The role of the equalizer is to produce hard decisions. A change of referential will therefore not affect the other parts of the DBB (digital baseband). A π/8 counterclockwise rotation of the constellation shows interesting properties concerning the 8-PSK constellation symbols. As shown in FIG. 6, a π/8 counterclockwise rotation produces symbols that are determined by only two real values α and β.  
         [0053]    After the rotation, there are two, four-symbol groups ({A 0 (k), A 3 (k)} and {A 1 (k), A 2 (k)}) that fulfill butterfly conditions exposed above. Thus, the butterfly structure can be used for all transitions and minimum computations in such a configuration as shown in FIG. 7.  
         [0054]    Using a π/8 counterclockwise rotation (any rotation of (2k+1)*π/8, where k is an integer can be used), the butterfly HWA can be applied with the following values:  
         [0055]    For the first butterfly of symbol groups {A 0 (k),A 3 (k)}:  
           a   x ( s )=β Re{h   0   * S }  and  a   y ( s )=α Im{h   0   * S }   
           sm   1   =sm   old   +∥ S ∥   2 −2β Re{h* S }   
           sm   2   =sm   old   +∥ S ∥   2 +2 βRe{h* S }   
           m= 2 αIm{h* S }   
         [0056]    For the second butterfly of symbol groups {A 1 (k),A 2 (k)} 
           a   x ( s )=α Re{h   0   * S }  and  a   y ( s )=β Im{h   0   * S }   
           sm   1   =sm   old   +∥ S ∥   2 −2 αRe{h* S }   
           sm   2   =sm   old   +∥ S ∥   2 +2 αRe{h* S }   
           m= 2 βIm{h* S }   
         [0057]    with α=cos(π/8), β=sin(π/8) and 
           Re{h* S }=h   x   S   x   +h   y   S   y  and  Im{h* S }=h   x   S   y   −h   y   S   x   
         [0058]    A pseudo-code implementation for a modified 8PSK 2-state RSSE method is provided below:  
                                                   Initialize (Rotation of y n , h k )           Repeat L times {            For each RSSE state (2 times) {             Compute S and ||S|| 2 .             Compute h*S Re{} and Im{}.             For each butterfly (2 times) {              Compute sm 1  and sm 2                Compute bm             }            }            Perform 8 Butterflies.           Update. } End repeat L times           Traceback (TBD)                      
 
         [0059]    The π/8 rotation method has some implications: (1) π/8 rotation of received samples y i , (2) π/8 rotation of channel estimation h k  and (3) only applicable when J k ≦M/2 and when the constellation coset have symbols of opposite signs.  
         [0060]    Using a butterfly structure in the RSSE method can significantly reduce the computing resources needed for RSSE calculations, while having no effect on the performance of the RSSE function.  
         [0061]    It should also be noted that the RSSE method described above could be used in either a loss-less or a loss variation. In the loss-less variation, both y (received symbol sample vector) and reference constellation symbols are rotated by angle equal to (2k+1)*π/8 with k being a whole number. The angle may vary depending upon the number of symbols in the constellation.  
         [0062]    In the loss variation, both y (received symbol sample vector) and reference constellation symbols are rotated by angle equal to (2k+1)*π/8. Then, either the reference constellation or y is rotated by an angle a bit higher or a bit smaller than the first one. The error is proportional to the absolute difference of the rotation angle between y and the reference constellation symbols.  
         [0063]    [0063]FIG. 8 illustrates a block diagram of a mobile communication device  50  using a DSP 60 for communications support. Information is received over antenna  52 , which is converted to symbols y k  by digital baseband circuitry  54 . The symbols are received by the DSP 56, which rotates the received symbols and/or reference constellation symbols, to generate branch metrics using the hardware accelerators  58  in support of RSSE processing as described above. A memory subsystem  60  and input/output subsystem  62  support the processing core.  
         [0064]    An alternative way to the constellation rotation solution discussed above in connection with the computation of the four axis symbols (cosets A 0  and A 2  in FIG. 5) is to consider these symbols in the form of a k =a l ·e −jπ/4 . Thus, we get a k   x (s)=a l   s Re{e −jπ/4 h 0 * S } and a k   y (s)=a l   y Im{e −jπ/4 h 0 * S }, where a l   x  and a l   y  are coordinates of a diagonal symbol (in coset A 1  and A 3  in FIG. 5). In these expressions, (±a x , ±a y ) properties for axis symbols are assured and therefore butterfly structures can be used. Real and Imaginary parts are modified by the multiplication of the e −jπ/4  coefficient.  
         [0065]    Although the Detailed Description of the invention has been directed to certain exemplary embodiments, various modifications of these embodiments, as well as alternative embodiments, will be suggested to those skilled in the art. The invention encompasses any modifications or alternative embodiments that fall within the scope of the Claims.