Abstract:
In the method of erasure decoding of acknowledgement (ACK)/negative acknowledgement (NACK) feedback information, a state of received ACK/NACK feedback information for associated sent data is detected based on at least one threshold derived using an objective function. The objective function includes at least a first term representing an affect on data throughput for at least one possible type of error in detecting a state of the received ACK/NACK feedback information.

Description:
BACKGROUND OF THE INVENTION  
       [0001]     The Ack/Nack (acknowledgment/negative acknowledgement) fields in the R-ACKCH (reverse link acknowledgement channel) in CDMA2001x EV-DV or UL HS-DPCCH (up link high speed—dedicated physical control channel) in UMTS are error controlled independently by repetition block code. In CDMA2001x EV-DV, the R-ACKCH contains 1-bit Ack/Nack per 1.25 ms PCG (power control group) with symbol repetition of 24 times. In UMTS, the acknowledgement bit is repetition coded to 10 bits and transmits in one slot. An Ack sent in response to a received transmission indicates the transmission was properly received. A Nack in response to a transmission indicates the transmission was not properly received. In response to an Ack, the transmitter transmits the next data for transmission. In response to a Nack, however, the transmitter retransmits the Nacked transmission or other redundancy version depending on the HARQ protocol type. The Ack/Nack fields in EV-DV and HSDPA are both DTX (i.e., transmitter power set at zero) when no Ack/Nack data is transmitted. Since the R-ACKCH and HS-PDCCH field are not error free, it is important to evaluate the reliability of each received Ack/Nack information.  
         [0002]     To improve reliability, a three-state decoding mechanism is included in the rake receiver design of channel elements to support EV-DV and HSDPA (high speed data packet access) for UMTS. The three state decoding mechanism adds a new state of erasure to erase any unreliable feedback information. The unreliable feedback information is caused by information corruption through unreliable radio channel or no Ack/Nack being sent because of the missed detection of the DL (down link) high speed data. Currently, two thresholds are set to define whether feedback information qualifies as an Ack, a Nack, or an erasure. When the power level of the received feedback information falls below the first threshold, the feedback information is judged to be an Ack. When the feedback information is greater than a second threshold, which is greater than the first threshold, the feedback information is judged to be a Nack. And, when the power of the feedback information falls between the first and second thresholds, inclusive, the feedback information undergoes erasure. Erasure results in considering the erased feedback information as a Nack.  
         [0003]     The merit of the three-state decoding strategy is to erase any unreliable feedback information to minimize throughput damaging errors. For example, when a Nack is decoded as an Ack, the receiver losses data, and must make a separate request for retransmission. And, if an Ack is considered a Nack, then needless retransmission of data takes place. Both of these errors will impact the system throughput. The three-state decoding strategy is to erase any unreliable feedback information rather than to pass it to the HARQ protocol. This particularly helps mitigate against the more damaging throughput error of considering a Nack as an Ack. However, the erasure of the feedback information has the setback of loosing the desired feedback information, and the consequence of the Ack/Nack erasure is the re-transmission of the downlink high-speed data information at the HARQ. Thus, it is important to determine how to properly erase the feedback information. As will be appreciated, this involves properly determining the thresholds for the Ack/Nack.  
       SUMMARY OF THE INVENTION  
       [0004]     The present invention provides a method of erasure decoding of acknowledgement (ACK)/negative acknowledgement (NACK) feedback information.  
         [0005]     In one exemplary embodiment of the method, the erasure decoding thresholds, which are used to detect Ack, Nack or erasure, have been optimized for throughput performance. In an exemplary embodiment, at least one threshold is derived based on the affect on data throughput for at least one possible type of error in detecting a state of the received ACK/NACK feedback information. For example, one possible type of error is missed detection of a NACK. In this example, the affect is represented as a cost of an average number of total bits to be retransmitted if a NACK is missed in detection. In another exemplary embodiment, the at least one threshold is derived based on the affect on data throughput if the state of the received ACK/NACK feedback information is correctly detected. 
     
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0006]     The present invention will become more fully understood from the detailed description given herein below and the accompanying drawings, wherein like elements are represented by like reference numerals, which are given by way of illustration only and thus are not limiting of the present invention and wherein:  
         [0007]      FIG. 1  illustrates the three state binary erasure channel transition trellis;  
         [0008]      FIG. 2  illustrates he testing hypothesis of the received signal detection through AWGN (a white Gaussian noise) channel N( 0 ,σ 2 ), which has a zero mean and variance σ 2 ; and  
         [0009]      FIG. 3  illustrates the results the optimized threshold for the 3-state Ack/Nack erasure decoding using numerical analysis according to the present invention.  
     
    
     DETAILED DESCRIPTION OF EMBODIMENTS  
       [0010]     A Universal Mobile Telecommunications System (UMTS) typically includes a radio access network, referred to as a UMTS terrestrial radio access network (UTRAN). The UTRAN may interface with a variety of separate core networks (CN). The core networks in turn may communicate with other external networks (ISDN/PSDN, etc.) to pass information to and from a plurality of wireless users, or user equipments (UEs), that are served by radio network controllers (RNCs) and base transceiver stations (BTSs, also referred to as Node Bs), within the UTRAN, for example.  
         [0011]     Although the following description of the present invention is based on the UMTS network, it should be noted that the exemplary embodiments shown and described herein are meant to be illustrative only and not limiting in any way. For example, the present invention is equally applicable to CDMA2001x EV-DV. As such, various modifications will be apparent to those skilled in the art.  
         [0012]     Where used below, base transceiver station (BTS) and Node-B are synonymous and may describe equipment that provides data connectivity between a packet switched data network (PSDN) such as the Internet, and one or more mobile stations. Additionally where used below, the terms user, user equipment (UE), subscriber, mobile, mobile station and remote station are synonymous and describe a remote user of wireless resources in a wireless communication network.  
         [heading-0013]     Analysis of the Reliability Matrix for the Ack/Nack Field  
         [0014]     As discussed in the Background, H-ARQ requires the Ack/Nack feedbacks from a UE to determine the necessity of retransmission (H-ARQ has normal error control operation to compensate the frame error caused by fading channel if the Ack/Nack feedbacks are error free). The average data throughput (D) of the H-ARQ function at any specific frame per user considered by the Node B is as follows,  
             D   =         N   Total     K     ⁢     P     Ack   ,   K       ⁢       ∏     j   =   1       K   -   1       ⁢     (       P     Nack   ,   j       +     P     Erasure   ,   j         )                 (   1   )             
 
 where N total  is the number of information bits for the given packet in a H-ARQ operation, K is the total number of transmissions for a successful H-ARQ operation, P Nackj  is the probability of a negative acknowledgement (Nack) for a j-th transmission decoded by the BTS for retransmission, P Ack,K  is the probability of an acknowledgement (Ack) decoded by the BTS and consideration of a successful HARQ operation at the k-th transmisssion, and P Erasurej  is the probability of an erasure of a j-th transmission decided by the BTS when the received Ack/Nack field is considered unreliable. Accordingly, a retransmission could be caused by reception of a negative acknowledgement or feedback information erasure. The frame error detected by the UE would be the same as that transmitted from the BTS if no error is detected in the Ack/Nack report. The illustration of the three state binary erasure channel transition trellis is shown in  FIG. 1 . 
 
         [0016]     In  FIG. 1 , P fej  is the probability of the DL PDCH/HS-PDSCH (down link packet data channel/high speed-packet data shared channel) frame error at j-th transmission, and P mj  is the probability of the missed detection of the DL PDCCH/HS-SCCH (down link packet data control channel/high speed shared control channel). The HARQ protocol at the mobile generates the negative acknowledgement, acknowledgement, and nothing (null) based on the CRC check results of received DL PDCH/HS-PDSCH or no reception with probabilities P fej , 1-P fej -P mj  and P mj , respectively, at a j-th transmission of a specific packet. P e1 , P e2 , and P e3  are defined as the transition probabilities from the transmitted information at the mobile (s) to the received information at the BTS (r) in the following,
 
P e1 =P(r=Nack|s=Ack)
 
P e2 =P(r=Ack|s=Nack)
 
P e3 =P(r=Nack|s=Null)  (2)
 
 P erasure1 , P erasure2 , and P erasure3  are the transition probabilities of the erasure at the receiver when the mobile sends the acknowledgement, negative acknowledgement, or nothing, respectively. P Nackj , P Ackj , and P erasurej  are the probabilities of negative acknowledgement, acknowledgement, and erasure decoding output at the BTS receiver for the j-th transmission, respectively. The probabilities of the negative acknowledgement, acknowledgement, and erasure at the BTS may be formulated as the following:
 
 P   Nack,j   =P   fe,j (1 −P   e2   −P   erasure2 )+(1 −P   fe,j   −P   m,j )P e1   +P   m,j   P   e3   (3)
 
 P   Ack,j =(1 −P   fe,j   −P   m,j )(1 −P   e1   −P   erasure1 )+ P   fe,j   P   e2   +P   m,j (1 −P   e3   −P   erasure3 )  (4)
 
 P   erasure,j   =P   fe,j   P   erasure2   +P   m,j   P   erasure3 +(1 −P   fe,j   −P   m,j ) P   erasure1   (5)
 
 Risk Function for the Ack/Nack Detection 
 
         [0019]     The definition of throughput for a HARQ operation in equation (1) does not capture the penalty of the missed detection of a negative acknowledgment. As discussed in the Background, the purpose of erasure decoding is to minimize the probability of this missed detection and to minimize the detection error caused by the probability of no Ack/Nack being sent. If the probability of the erasure is high, based on the set thresholds, the probability of error in the Ack/Nack field is small. Since an erased Ack/Nack bit has the result of retransmission, the high erasure probability also has a high cost in terms of throughput. Thus, this cost needs to be incorporated in the data throughput analysis. To accomplish this, an objective function, referred to herein as a risk function, of a HARQ operation that accounts for the affects of missed detection of a negative acknowledgement is provided as follows,
 
 R=C   f   N   f   P   missed=detection   −C   c   D   (6)
 
         [0020]     where C f  is the throughput cost of falsely detecting a Nack as an Ack, (−C c ) is the throughput cost of correctly detecting an Ack, N f  is the number of bits of the missed detected packet, and P missed=detection  is the probability of the missed detection, which equals P fe,K  times P e2 . The first term of the risk function is the cost of the average number of total bits to be retransmitted when the negative acknowledgement is missed in detection. The 2 nd  term of the risk function is the added value (negative risk) of the data throughput when an acknowledgement is correctly detected in the feedback information. The Risk function in equation (6) is defined as the difference between the cost of the missed detection of a negative acknowledgement to trigger retransmission and the negative cost of the average data throughput. Substituting equation (1) into the risk function results in the following:  
             R   =         C   f     ⁢     N   f     ⁢     P     fe   ,   K       ⁢     P     e   ⁢           ⁢   2         -           C   c     ⁢     N   Total     ⁢     P     Ack   ,   K         K     ⁢       ∏     j   =   1       K   -   1       ⁢     (       P     Nack   ,   j       +     P     Erasure   ,   j         )                   (   7   )             
 
 Statistical Modelling of Ack/Nack Detection 
 
         [0022]     The detection of the Ack/Nack field may be modeled as the detection of the received signals through a radio channel. The testing hypothesis of the received signal detection through AWGN (a white Gaussian noise) channel N( 0 ,σ 2 ), which has a zero mean and variance σ 2 , is shown in  FIG. 2 .  
         [0023]     The probability of erasure in the decoding of the feedback information is determined by the thresholds for detecting Ack and Nack. In  FIG. 2 , A and −B are the mean soft output of the accumulated Negative acknowledgement and Acknowledgement symbols, respectively. Also in  FIG. 2 , x and −y are the thresholds for detecting Ack/Nack or determining erasure. The decoding has three hypotheses in the testing hypothesis as follows, 
        H 0 : Positive acknowledgement (bit “1” with signal power amplitude “−B”) is sent     H 1 : Negative acknowledgement (bit “0” with signal power amplitude “A”) is sent     H 2 : No acknowledgement is sent.        
 
         [0027]     The transition probabilities of error receptions (P e1 , P e2 , and P e3 ) and erasure receptions P erasure1 , P erasure2 , and P erasure3  in AWGN are as follows,  
               P     e   ⁢           ⁢   1       =       P   ⁡     (       r   ≥   x     ❘     H   0       )       =         ∫   x   ∞     ⁢       1         2   ⁢   π       ⁢   σ       ⁢     e     -       (     t   +   B     )       2   ⁢     σ   2             ⁢     ⅆ   t         =     Q   ⁡     (       x   +   B     σ     )                   (   8   )                 P     e   ⁢           ⁢   2       =       P   ⁡     (       r   ≤   y     ❘     H   1       )       =         ∫   ∞     -   y       ⁢       1         2   ⁢   π       ⁢   σ       ⁢     e     -       (     t   -   A     )       2   ⁢     σ   2             ⁢     ⅆ   t         =     1   -     Q   ⁡     (         -   y     -   A     σ     )                     (   9   )                 P     e   ⁢           ⁢   1       =       P   ⁡     (       r   ≥   x     ❘     H   2       )       =         ∫   x   ∞     ⁢       1         2   ⁢   π       ⁢   σ       ⁢     e     t     2   ⁢     σ   2           ⁢     ⅆ   t         =     Q   ⁡     (     x   σ     )                   (   10   )                 P     erasure   ⁢           ⁢   1       =       P   ⁡     (         -   y     ≤   r   &lt;   x     ❘     H   0       )       =         ∫     -   y     x     ⁢       1         2   ⁢   π       ⁢   σ       ⁢     e     -       (     t   +   B     )       2   ⁢     σ   2             ⁢     ⅆ   t         =       Q   ⁡     (         -   y     +   B     σ     )       -     Q   ⁡     (       x   +   B     σ     )                     (   11   )                 P     erasure   ⁢           ⁢   2       =       P   ⁡     (         -   y     ≤   r   &lt;   x     ❘     H   1       )       =         ∫     -   y     x     ⁢       1         2   ⁢   π       ⁢   σ       ⁢     e     -       (     t   -   A     )       2   ⁢     σ   2             ⁢     ⅆ   t         =       Q   ⁡     (         -   y     -   A     σ     )       -     Q   ⁡     (       x   -   A     σ     )                     (   12   )                 P     erasure   ⁢           ⁢   3       =       P   ⁡     (         -   y     ≤   r   &lt;   x     ❘     H   2       )       =         ∫     -   y     x     ⁢       1         2   ⁢   π       ⁢   σ       ⁢     e     t     2   ⁢     σ   2           ⁢     ⅆ   t         =       Q   ⁡     (       -   y     σ     )       -     Q   ⁡     (     x   σ     )                     (   13   )             
 
         [0028]     The erasure decoding risk function R could be optimized by partial differentiation of the risk function R with respect to the two erasure thresholds x and y as shown in equation (14) below.  
                 ∂   R         ∂   x     ⁢     ∂   y         =   0           (   14   )             
 
         [0029]     Equations (8), (9), (10), (11), (12), and (13) are then substituted into equations (3), (4), and (5) to get the probabilities of acknowledgement P Ackj, , negative acknowledgement P Nackj , and erasure P erasurej  of a j-th transmission through an AWGN channel. The risk function R for the signals through the AWGN channel may then be obtained by plugging the results of P Nackj, , P Ackj , and P erasurej  into equation (7). The risk function R of signal detection through the AWGN channel becomes a function of the two erasure thresholds x and y. Under the further assumption that the second threshold x equals the first threshold y, the risk function may be expressed as shown in equation (15) below.  
             R   =         C   f     ⁢     P     fe   ,   K       ⁢       N   Total     ⁡     (     1   -     Q   ⁡     (         -   y     -   A     σ     )         )         -           C   c     ⁢     N   Total       K     ⁢     {           [       (     1   -     Q   ⁡     (         -   y     +   B     σ     )         )     +       P     m   ,   K       ⁡     (       Q   ⁡     (         -   y     +   B     σ     )       -     Q   ⁡     (       -   y     σ     )         )       +                       P     fe   ,   K       ⁡     (       Q   ⁡     (         -   y     +   B     σ     )       -     Q   ⁡     (         -   y     -   A     σ     )         )       ]     ×                 ∏     j   =   1       K   -   1       ⁢     [       Q   ⁡     (         -   y     +   B     σ     )       +       P     fe   ,   j       ⁡     (       Q   ⁡     (         -   y     -   A     σ     )       -     Q   ⁡     (         -   y     +   B     σ     )         )       +                       P     m   ,   j       ⁡     (       Q   ⁡     (       -   y     σ     )       -     Q   ⁡     (         -   y     +   B     σ     )         )       ]           }                 (   15   )             
 
         [0030]     From equation (15) it can be seen that the risk function R is a function of the erasure threshold y only. Thus, the optimization of the risk function R may obtained by differentiating the risk function with respect to the threshold y alone. The results of this optimization are shown in the following,  
                   ⅆ   R       ⅆ   y       =           N     Total   ,   i             2   ⁢   π       ⁢   σ       [         -     C   f       ⁢     P     fe   ,   K       ⁢     ⅇ     -         (       -   y     -   A     )     2       2   ⁢     σ   2               +         C   c     K     ⁢       Z   1     ⁡     (       Z   2     +       Z   3     ⁢     Z   4         )           ]     =       0   ⁢     
     ⁢   where   ⁢     
     ⁢     Z   1       =         ∏     j   =   1       K   -   1       ⁢       {         (     1   -     P     fe   ,   j       -     P     m   ,   j         )     ⁢     Q   ⁡     (         -   y     +   B     σ     )         +       P     fe   ,   j       ⁢     Q   ⁡     (         -   y     -   A     σ     )         +       P     m   ,   j       ⁢     Q   ⁡     (       -   y     σ     )           }     ⁢     
     ⁢     Z   2         =         (     1   -     P     m   ,   K       -     P     fe   ,   K         )     ⁢     ⅇ     -         (       -   y     +   B     )     2       2   ⁢     σ   2               +       P     fe   ,   K       ⁢     ⅇ     -         (       -   y     -   A     )     2       2   ⁢     σ   2               +       P     m   ,   K       ⁢     ⅇ     -         (     -   y     )     2       2   ⁢     σ   2                         ⁢     
     ⁢       Z   3     =         [         (     1   -     P     m   ,   K       -     P     fe   ,   K         )     ⁢     Q   ⁡     (         -   y     +   B     σ     )         +       P     fe   ,   K       ⁢     Q   ⁡     (         -   y     -   A     σ     )         +       P     m   ,   k       ⁢     Q   ⁡     (       -   y     σ     )         -   1     ]     ⁢     
     ⁢     Z   4       =       ∑     n   =   1       K   -   1       ⁢       (         (     1   -     P     m   ,   n       -     P     fe   ,   n         )     ⁢     ⅇ     -         (       -   y     +   B     )     2       2   ⁢     σ   2               +       P     fe   ,   n       ⁢     ⅇ     -         (       -   y     -   A     )     2       2   ⁢     σ   2               +       P     m   ,   n       ⁢     ⅇ     -         (     -   y     )     2       2   ⁢     σ   2                 )       (         (     1   -     P     m   ,   n       -     P     fe   ,   n         )     ⁢     Q   ⁡     (         -   y     +   B     σ     )         +       P     fe   ,   n       ⁢     Q   ⁡     (         -   y     -   A     σ     )         +       P     m   ,   n       ⁢     Q   ⁡     (       -   y     σ     )           )                     (   16   )             
 
         [0031]     There is no close form solution for y in equation (16). Accordingly, a numerical method is carried out for determining y. Namely, the results of equation (16) for a range of possible y values at a desired resolution are generated, and the y value that produces the result closest to zero is selected as the y value. The x threshold value is then set equal to the selected y value.  
         [0032]     As will be appreciated, the optimized value of y is also a function of the variables K, P mj , and P fe . The number of transmissions K in a HARQ depends on the power setting of the DL scheduled transmission and the radio channel condition at the time. The probabilities of the frame error rate P fe  for DL high speed data and missed detection of DL indication channel P mj  for the j-th transmission are considered constant in the static channel modelling. Accordingly, the system designer may utilize the method of the present invention as a tool for adapting the erasure thresholds for a given system, or even a particular service area of a system.  
         [heading-0033]     Numerical Results  
         [0034]     The following is a demonstration, through numerical analysis, of the optimized threshold for the 3-state Ack/Nack erasure decoding. The static parameters in the number analysis are as follows, 
        P m =0.01     P f,1 =0.05 and P f,2 =0.005     Absolute Acknowledgement power=Absoulte Negative acknowledgement power (B=A).     Average Transmission per H-ARQ (K)=2        
 
         [0039]     The results of the numerical analysis are shown in  FIG. 3  for three curves with C f =2 C c , C f =4 C c , and C f =6 C c . The results in  FIG. 3  show that higher block SNR (signal-to-noise ratio) has lower erasure thresholds when the cost of missed detection C f  is relatively higher than the cost of the correct throughput C c .  
         [0040]     The invention being thus described, it will be obvious that the same may be varied in many ways. Such variations are not to be regarded as a departure from the spirit and scope of the invention, and all such modifications as would be obvious to one skilled in the art are intended to be included within the scope of the present invention.