Abstract:
A methods comprising a hybrid early-termination strategy and an output selection procedure for iterative decoders are disclosed. The hybrid early-termination strategy combines the output-comparison-based method with the CRC-check-based method. The hybrid approach is far more superior in termination reliability in either of the two individual approaches, without their disadvantages. The hybrid termination strategy effectively and reliably terminates the iterative decoding process, cutting the majority of the computational load while eliminating the degradation in the bit error rate (BER) and frame-error-rate (FER) performance due to incorrectly terminated frames. The output selection procedure chooses the best possible decoded frame among those from all iterations, eliminating the iteration abnormality that is inherent in the iterative decoding approach, and improving the BER performance of the standard iterative decoders.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS  
       [0001]    This application is entitled to the benefit of Provisional Patent Application, application Ser. No. 60/227,168, filed Aug. 23, 2000. 
     
    
     
       BACKGROUND—FILED OF APPLICATION  
         [0002]    This invention relates to iterative decoding of encoded data in communication systems, specifically to reducing the amount of computations of decoding in an effective and reliable manner, and to improving the error rate performance of the decoder.  
         BACKGROUND—DESCRIPTION OF PRIOR ART  
         [0003]    Turbo codes have been shown to have excellent bit error rate (BER) performance even when the data rate runs close to the channel capacity. This has made the turbo codes the most popular choice for error control codes in today&#39;s sophisticated communications systems. In particular, turbo codes have been adopted by all standards for third generation (3G) wireless cell phone systems.  
           [0004]    [0004]FIG. 1 shows a typical turbo encoder. The encoder operates on the input data on a frame basis (Throughout this application, we use binary data for the purpose of simple illustration. Binary data takes only two values, namely, 0 and 1, or, in the convention of communication systems, 1 and −1. The principles in this application, however, expand and apply to other data format as well). A frame of data X=(x 0 ,x 1 , . . . , x L−1 ) is the input to the encoder and is encoded by an encoder E 1 . The same input X is also scrambled by an interleaver I, and then encoded by an encoder E 2 . The puncturing unit P rearranges X, and the outputs X P1  and X P2  of encoders E 1  and E 2  into a bit stream that is then punctured to form the output frame Y=(y 0 , y 1 , . . . , y M−1 ). The numbers L and M determine the code rate, r=L/M, of the turbo code.  
           [0005]    The complexity of an optimum decoder for any meaningful turbo code is far beyond the realm of implementation. Practical turbo decoders are all iterative type that is non-optimum but is believed to have the performance close to that of the optimum one. FIG. 2 shows an iterative decoder. The input frame Y is broken into X, X P1  and X P2  by a splitting unit S. The iteration decoding then proceeds as follows. An iteration cycle starts with a decoder D 1 . The inputs to decoder D 1  are X, X P1  and the de-interleaved extrinsic information (to be explained momentarily) X E2  from a decoder D 2 . At the first iteration, X E2  is initialized to zero. The output of decoder D 1  is the extrinsic information X E1  that indicates the likelihood of each bit in X to be zero or one. The extrinsic information is also called soft output, since it is a multi-bit value indicating how close the data bit is to zero or one. When decoder D 1  has finished, decoder D 2  starts decoding with inputs being interleaved X and X E1 , and X P2 . A full iteration ends when decoder D 2  is done. The output X E2  of decoder D 2  will be used by decoder D 1  in the next iteration. The interleaver I and the de-interleaver I −1  are to ensure the proper bit alignments.  
           [0006]    After certain number N of iterations (typically N=10˜20), the decoded frame is either correct, or the number of errors in the frame will not decrease with further iterations in a significant manner. The iteration process thus stops. X, X E1  and XE 2  are combined and a decision is made by a combining/decision unit C/D. The output of the C/D is the output of the iterative decoder.  
           [0007]    Iterative decoding is not limited to decoding of the turbo codes. Other codes such as product codes and low-density-parity-check codes also call for iterative decoding as a feasible implementation.  
           [0008]    Iterative decoding still requires tremendous amount of computations. For example, for data rate of 2 Mbits/s in 3G standard, it takes an iterative decoder about 10 10  basic operations per second with 10 iterations. Such a requirement far exceeds the capability of the general-purpose computer CPUs or digital signal processors (DSP) of today and even of near future. Special circuitry such as application-specific integrated circuits (ASIC) has to be designed to meet the demand on processing capacity.  
           [0009]    Even with ASIC implementation, the amount of processing dictates that the power dissipation of the circuit is huge. Turbo decoder alone, when operates at the high data rate, typically consumes more power than the rest of the receiver does in a 3G system. Most applications, especially wireless, are power limited; the device is generally powered by battery. Reduction in the power consumption directly translates to the extended battery life.  
           [0010]    Another problem with iterative decoders is iteration abnormality that is inherent in iterative type of decoders. A standard iterative decoder outputs the decoded frame of iteration N, except that when early-termination is used, the output is the decoded frame of the last iteration. Recall that the iterative decoding is non-optimum. While the BER improvement with the number of iterations is expected, it is not guaranteed. In fact, this rule of thumb breaks down when channel condition improves, i.e., the signal-to-noise ratio (SNR) is higher. It has been observed that the BER can actually get worse with more iterations, and for certain number of iterations, the BER gets worse with higher SNR. Such abnormality can be extremely annoying when incorporating turbo codes into communication systems, since efforts to improve the system performance, such as increasing the number of iterations and improving SNR, may meet with adverse result.  
           [0011]    The preceding paragraphs illustrate the some noted problems that iterative decoders possess. The rest of this section will discuss known prior arts to attack these problems.  
           [0012]    To reduce the amount of computations hence the power dissipation, an early-termination technique has been applied to the iterative decoder. This technique is based on the fact that not all frames need to go through all N iterations. Many frames become correct after first several iterations. For those frames the iteration can be terminated early so that the computation load for the rest of the iterations is saved. Since one can never know with absolute certainty that a decoded frame is correct unless he or she knows what has been transmitted, an indirect method (a correctness indicator) has to be used to indicate the correctness of a frame. Note that additional error is introduced due to the incorrect termination by the indicators.  
           [0013]    Depending upon the types of the indicators used, existing early-termination strategies fall into the following categories: output comparison, circular-redundant-code (CRC) check and SNR threshold on soft output. Output-comparison-based indicators compare certain characteristics of the decoded frames from consecutive iterations. For example, Hagenauer [1] looked at the cross-entropy of the two frames, where the cross entropy is a measure of similarity of two frames. The number of differing bits between the two frames is another indicator [2], and is called hard-decision-aided (HDA) method. The rational of this approach is that if the number of errors in a frame improves with iterations, so will the indicators. If the indicator shows that the two frames from two consecutive iterations do not change much, it would mean that the frame from current iteration is either (a) containing no errors, or (b) still having errors but unlikely to improve with further iterations. In either case it makes sense to stop the iteration process. Thus in the case of the cross-entropy method, if the cross-entropy goes below a threshold, one can conclude that further improvement is unlikely and the frame is correct. In the case of the HDA, if the number of the differing bits is zero, i.e., the two frames after hard-decision are identical, it is likely that the decoder has come to the correct frame.  
           [0014]    The performance of the comparison-based method is mixed. It achieves significant savings in computation, hence in power consumption, generally above 70%. BER and frame error rate (FER), however, degrades due to incorrect termination. For very long frames (about several thousands data bits or more), the degradation in BER is generally kept within 50%. The degradation in FER is more evident, typically more than doubled. For short frames (from below one hundred to one thousand data bits), the degradation is worse for both BER and FER. Simulation shows that the BER and FER with early-termination are 5 and 10 times more than the BER and FER without early-termination, respectively.  
           [0015]    The CRC-based early-termination method relies upon the CRC bits that are attached to the frame to detect if there are any errors in the frame. If the frame passes the CRC check, then the frame is declared to be correct. Use of CRC for error detection has long been practiced in communication systems. Its use in conjunction with the turbo decoder for early-termination was described in [3].  
           [0016]    The savings in computations of the CRC-based method is slightly higher than the output-comparison-based method, since it takes two frames from consecutive iterations for the latter to make a decision, and even the first frame is correct, it has to wait for the second frame to get the comparison result. The BER and FER performances of the CRC method depend upon the number of CRC bits. In general, if the number of CRC bits is c, the additional error rate caused by CRC-based early-termination is proportional to 2 −c . Thus the larger the c, the better the performance.  
           [0017]    Practical systems, however, put a limit on the number of CRC bits. For example, one of the 3G standards, UMTS, has c=24 for very large frames. For smaller frames, c is reduced to 16, 12 or 8. Significant degradation has been observed even for c=24. It is also not very economical to add many CRC bits to short frames. For example, UMTS has a frame size as small as 40 bits. It is a fairly high overhead for a 24-bit CRC to be in a 40-bit frame.  
           [0018]    SNR-threshold-based strategy is described in [4] and is summarizmed as follows. For binary data, there is some value E such that the soft output of decoder D 1  or D 2  is centered on either +E or −E, corresponding to +1 or −1. At early iterations, there is significant overlap between the two peaks in the distributions of the soft output. At later iterations where the decoded frame is more likely to be correct, the value E increases, the peaks narrow and become well separated. FIG. 3 shows this phenomenon. Since the distribution of the soft output can be approximated by the distribution of binary signaling with Gaussian noise, an estimated SNR from the soft output can be computed. The higher the soft output SNR, the more separated the peaks. The soft output SNR increases with the number of iterations. If the soft output SNR exceeds a preset threshold after certain iterations, the decoded frame is believed to be correct and the iteration process terminates.  
           [0019]    The performance of the SNR-threshold strategy depends a lot upon the chosen threshold. If the threshold is too small, the iteration will terminate too early, resulting unacceptable BER/FER. If the threshold is too high, the decoder may take extra iterations to exceed the threshold after the decoded frame becomes correct, and the benefit of early-termination diminishes. Thus choosing the threshold becomes an undesirable trade-off between the BER/FER and power consumption. Moreover, optimum thresholds change with channel conditions, so a fixed threshold may behave poorly in practice.  
           [0020]    In summary, existing early-termination strategies cause severe degradation in BER/FER performance, increase system overhead, or force a trade-off between BER/FER and power consumption. Some may not work well, or simply not work at all, in certain conditions. To the best knowledge of this applicant, the other problem, iteration abnormality, has not seen any effective solutions.  
         SUMMARY OF THE INVENTION  
         [0021]    The present invention relates to iterative decoding of an encoded frame of data. A hybrid early-termination method performs correctness test on the decoded frame and terminates the iteration process if the decoded frame is declared correct. In addition, an output selection procedure chooses one of the decoded frames if, during iterative decoding of an encoded frame of data, all of the decoded frames fail the correctness test.  
           [0022]    In accordance with embodiments of the present invention, the hybrid early-termination comprises output-comparison and parity-check. A decoded frame of current iteration is compared with the one of the previous iteration for “closeness test”. If the frame passes the closeness-test, it is subjected to parity-check, using the parity-check bits (CRC check bits are a special case of the parity-check bits) in the encoded frame. If the frame passes the parity-check, it is declared to be correct and the iteration process is terminated.  
           [0023]    A variation of the above implementation is that a decoded frame is parity-checked first. If it passes the parity-check, it is compared with a (typically, the latest) frame that also passed parity-check in previous iterations for closeness-test. The frame is declared to be correct if it passes both parity-check and closeness-test.  
           [0024]    A salient advantage of the hybrid early-termination is its high reliability. Since the iteration process terminates only if the decoded frame passes two independent tests, there is virtually no incorrect termination, thus eliminating the BER/FER degradation that is common in existing early-termination strategies. Hybrid early-termination also requires much fewer parity-check bits than the CRC-check-based early-termination does.  
           [0025]    In accordance with embodiments of the present invention, the output selection procedure comprises choosing one of decoded frames if all of the decoded frames fail the correctness-test. An “error indicator” is computed for each decoded frame to indicate the number of errors in the decoded frame. At the end of the iteration process, the decoded frame with a best error-indicator is chosen to be the output of the decoder. A best error-indicator is defined to be an error-indicator that meets certain criterion (criteria), such as the one that indicates that the decoded frame has least errors among frames from all iterations.  
           [0026]    The iteration abnormality phenomenon results from the fact that a standard iterative decoder always chooses the decoded frame of the last iteration as the decoder output. Study shows that the output selection procedure completely eliminates the iteration abnormality.  
         OBJECTS AND ADVANTAGES  
         [0027]    Accordingly, several objects and advantages of the present invention are:  
           [0028]    (a) to provide an early-termination method that accurately determines the correctness of a decoded frame;  
           [0029]    (b) to provide an early-termination method that reliably terminates the iteration process without degrading the BER/FER performance;  
           [0030]    (c) to provide an early-termination method that has minimum system overhead;  
           [0031]    (d) to provide an early-termination strategy that eliminates the undesirable trade-off between BER/FER and power consumption;  
           [0032]    (e) to provide an output selection procedure that eliminates the iteration abnormality that is inherent in the iterative decoders;  
           [0033]    (g) to provide an output selection procedure that improves the BER of the iterative decoder.  
           [0034]    Further objects and advantages will become apparent from a consideration of the ensuing description and drawings. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0035]    [0035]FIG. 1 shows a typical turbo encoder.  
         [0036]    [0036]FIG. 2 shows an iterative turbo decoder.  
         [0037]    [0037]FIG. 3 shows the separation of the peaks in the distribution of the soft output.  
         [0038]    [0038]FIG. 4 shows an exemplary implementation of the hybrid early-termination and output selection.  
         [0039]    [0039]FIG. 5 shows an exemplary implementation of storing decoded frames in output selection. 
     
    
     DETAILED DESCRIPTION  
       [0040]    The present application combines the output-comparison-based method and the CRC-based method to form a hybrid early-termination strategy that is extremely reliable and effective. In the comparison process, the present application compares the decoded frames between half iterations to further reduce the computational load. Referring to FIG. 2, one half iteration is defined to be a complete decoding operation by either decoder D 1  or decoder D 2 . The present application also uses error-detection codes (EDC) to provide a more general framework that includes CRC as a special case. Best error-detection codes can often be found outside the class of CRC codes, especially when the code length (frame size) is small.  
         [0041]    In accordance with embodiments of the present invention, an iterative decoder decodes an encoded frame that includes parity-check information, and terminates the iteration when either (a) the maximum number of iterations N has been reached, or (b) the decoded frames from the current iteration and the previous 0.5M iteration is sufficiently close by some “closeness measure” CM, and the current decoded frame passes the parity-check. The parameter M controls the separation in terms of half iterations between the two decoded frames in comparison. M satisfies 1≦M≦2N and M=1 is the best choice.  
         [0042]    In the case that the maximum number of iterations N has been reached, the iterative decoder computes an error-indicator EI for each decoded frame, and selects the frame with the lowest indicator as the decoder output.  
         [0043]    The closeness-measure CM defines how close the two decoded frames are. An example of CM for two frames F 1  and F 2  is CM HD , based on the hard-decisioned frames and defined as  
         [0044]    CM HD =number of differing bits in F 1  and F 2 .  
         [0045]    If F 1  and F 2  contain soft symbols, i.e., numbers that represent the likelihood value of the bits, a hard decision that converts the likelihood value to bit must be performed first before computing CM HD . Two frames are considered to be sufficiently close if CM HD ≦T HD , a threshold. An appropriate choice is T HD =0.  
         [0046]    Another example of CM is cross-entropy based CM CE , defined as  
         [0047]    CM CE =the cross-entropy between F 1  and F 2 .  
         [0048]    Approximate expressions for CM CE  are derived in [1] and [2]. Two frames are considered sufficiently close if CM CE ≦T CE , a cross-entropy threshold. T CE  is generally determined by simulations.  
         [0049]    Error-indicator E 1  is chosen to have strong correlations with the number of errors in the frame. It turns out from the simulation study that the following two choices, EI HD =CM HD  and EI CE =CM CE , yield extremely good results.  
         [0050]    [0050]FIG. 4 shows an exemplary implementation in accordance with an embodiment of the present invention, with M=1. Referring to FIG. 4, the decoding of a new frame begins at step  401 . At step  401 , the iteration counter i is set to zero. At step  402 , the first half iteration decoding is performed, and a decoded frame D 0  is stored. For the first half iteration, an error-indicator EI 0  is set to a very large number. This assumes that the error indicator is positively correlated with the number of errors in the frame; however, an error-indicator that has negative correlation with the number of errors in the frame can also be used, although the choice does not appear to be as natural. In this case, error-indicator EI 0  should be set to a very small number (or a negative number with a very large amplitude). Error-indicators with positive correlation are assumed in the rest of the description.  
         [0051]    The value that error-indicator EI 0  is set to depends upon the implementation. For example, if EI HD  is used, EI 0  can be set to the size of the frame, since this is the maximum value EI HD  can have. If EI CE  is used, EI 0  can be set to the maximum value that the implemented system can represent.  
         [0052]    Step  403  increments the iteration count i by 0.5 when M=1. Step  404  continues to perform the half iteration decoding, store decoded frame D i  and compute error-indicator EI i . At step  405 , a test compares whether i is greater than or equal to a prescribed value, i min. i min  controls at which iteration that early-termination mechanism starts to apply to iterative decoding, and is typically set to 0, in which case step  405  is not necessary. However there are some cases where it is believed the frame is unlikely to be correct in the first several iterations, thus there is no need for testing for early-termination until after i min  iterations. Storage of decoded frame D i  and error-indicator EI i  may not be necessary in step  404  before i min  iterations. If i min  iterations have not been reached, the method proceeds to step  403 .  
         [0053]    If the test of step  405  determines that i min  iterations have been reached, the method proceeds to step  406 . Step  406  computes closeness-measure CM to compare if decoded frames D i  and D i−0.5  are sufficiently close. Step  406  differs from existing arts such as the ones described in [1] and [2] in that the separation of the two frames can be as small as half iteration in the present invention while existing arts all use frames one full iteration apart. The computational load is further reduced to the minimum by the present invention. If the test of step  406  determines that D i  and D i−0.5  do not pass the closeness-test, the method proceeds to step  403 .  
         [0054]    If it is determined during step  406  that decoded frames D i  and D i−0.5  are sufficiently close, the method proceeds to step  407 . Step  407  checks the parity of decoded frame D i . If the test of  407  determines that decoded frame D i  passes the parity-check, the method proceeds to step  409 . Step  409  outputs decoded frame D i  and terminates the iteration process. The method proceeds to step  401  to start decoding of the next frame.  
         [0055]    If, however, the test of step  407  determines that decoded frame D i  does not pass the parity-check, the method proceeds to step  408 . Step  408  monitors if the maximum number of iterations, N, has been reached. If the test of step  408  determines that N iterations have not been reached, the method proceeds to step  403 .  
         [0056]    If, however, it is determined that N iterations have been reached, the method proceeds to step  410 . Step  410  chooses an index j such that error-indicator EI j  is the smallest one among all error-indicators El i , i min ≦i≦N, and selects decoded frame D j  as the output of the iterative decoder. The iterative decoding ends at the completion of step  410 . The method proceeds to step  401  to start decoding of the next frame.  
         [0057]    It appears that all decoded frames have to be stored in order to find the one with smallest EI. FIG. 5 shows an exemplary implementation that requires the storage of only one previously decoded frame. Step  501  initializes an error-indicator buffer EI min  to EI 0  and iteration counter i to zero. Step  502  performs half iteration decoding and computes error indicator EI i . Step  503  compares EI min  to EI i . If the comparison of step  503  determines that EI min  is less than EI i , the program control proceeds to step  505 .  
         [0058]    If it is determined during step  503  that EI min  is not less than EI i , the program control proceeds to step  504 . Step  504  updates error-indicator buffer EI min  and a decoded frame buffer D min  with EI i  and D i . The program control then proceeds to step  505 .  
         [0059]    Step  505  increments the iteration counter i by 0.5 when M=1. The program control proceeds to step  502 . At the end of the iteration process, decoded frame buffer D min  is the decoder output with the smallest EI.  
         [0060]    Step  503  shows that the buffer updates take place even if EI min =EI i . This guarantees that if there are multiple frames with the same best error-indicator value, the output selection procedure always selects the frame in the latest iteration, since a frame generally has fewer errors in a later iteration.  
         [0061]    There are possible variations from the foregoing implementation. To show one exemplary variation, recited below are two conditions for terminating the iteration process mentioned in the second paragraph of this section: (a) the maximum number of iterations N has been reached, or (b) the decoded frames from the current half iteration and the previous 0.5M iteration is sufficiently close by some “closeness measure” CM, and the current decoded frame passes the parity check.  
         [0062]    Implementation of condition (b) performs the closeness-test first and then the parity-check. Condition (b) can be replaced by the following: (b′) the current decoded frame passes the parity check, and is sufficiently close to, by some “closeness measure” CM, the last previously decoded frame that also passed the parity check.  
         [0063]    Implementation of condition (b′) performs the parity-check first and then the closeness-test. It may require an additional frame buffer to store the last previously decoded frame that also passed the parity-check. The advantage of using condition (b′) is that the BER/FER degradation can be further reduced.  
         [0064]    There are also implementation variations in the output selection procedure. For example, computing error-indicator EI involves two decoded frames. When error-indicator EI for a decoded frame is computed, either the preceding decoded frame or next decoded frame can be used as the other frame.  
         [0065]    The output procedure can be also made more elaborate. For example, when a frame with the best error-indicator EI is determined, a separate correctness-test, such as parity-check, can be performed on that frame and the other frame that is involved in the calculation of the best error-indicator EI. If one of them passes the test, it will be selected as the output frame.  
         [0066]    It is to be understood that the descriptions and variations shown and presented herein are merely illustrative of the principles of this application and that various modifications may be implemented by those skilled in the art without departing from the scope and the spirit of the application.  
         [0067]    It is to be further understood that the principles of this application also apply to decoding of error control codes other than turbo codes, such as product codes, low density parity check codes, etc., the decoding of which calls for iterative types of decoder.  
       REFERENCES  
       [0068]    [1] J. Hagemauer, E. Offer and L. Papke, “Iterative decoding of binary and convolutional codes”,  IEEE Transactions on Information Theory,  vol. 42, no. 2, pp. 429-445, March 1996.  
         [0069]    [2] R. Y. Shao, S. Lin and M. P. C. Fossorier, “Two simple stopping criteria for turbo decoding”,  IEEE Transactions on Communications,  vol. 47, no. 8, pp. 1117-1120, August 1999.  
         [0070]    [3] A. Shibutani, H. Suda and F. Adashi, “Complexity reduction of turbo decoding”,  IEEE VTS  50 th Vehicular Technology Conference,  Amsterdam, the Netherlands, pp. 1570-1574, September 1999.  
         [0071]    [4]  Using TMS 320 C 6416  Coprocessors: Turbo Coprocessor  (TCP), Application Report, p. 9, Texas Instruments, June 2001.