Turbo code decoder with controlled probability estimate feedback

• US 6,223,319 B1
• Filed: 08/20/1998
• Issued: 04/24/2001
• Est. Priority Date: 08/20/1998
• Status: Expired due to Term

• Current Assignee: General Electric Company
• Original Assignee: General Electric Company
• Inventors: Anderson, John Bailey, Ross, John Anderson Fergus, Van Stralen, Nick Andrew, Hladik, Stephen Michael
• Primary Examiner(s): Chung, Phung M.
• Application Number:
  US09/137,257
• Time in Patent Office: 978 Days
• Field of Search: 714/755, 714/756, 714/746, 714/786
• US Class Current: 714/755
• CPC Class Codes: H03M 13/2957 Turbo codes and decoding
• CPC Class Codes: H03M 13/3905 Maximum a posteriori probability [MAP] decoding or approximations thereof based on trellis or lattice decoding, e.g. forward-backward algorithm, log-MAP decoding, max-log-MAP decoding
• CPC Class Codes: H03M 13/3933 Decoding in probability domain
• CPC Class Codes: H03M 13/6577 Representation or format of variables, register sizes or word-lengths and quantization
• CPC Class Codes: H03M 13/658 Scaling by multiplication or division

Abstract

A feedback control for a turbo decoder controls the feedback between component decoders by modifying updated a priori probabilities calculated by one component decoder and used as inputs to another component decoder during the decoding process, resulting in a significant performance advantage. A feedback control switch selects either previously estimated a posteriori probabilities, modifications of these values, or neutral values as a priori probabilities utilized by the next component decoder.

Claims

1. A method for decoding turbo codes, comprising:

iteratively calculating forward and backward state probabilities and a posteriori state transition probabilities for component code words of turbo codes according to a MAP decoding process;

feeding back the a posteriori state transition probabilities as a priori state transition probabilities for use in decoding other component code words comprising the turbo code words, the initial a priori state transition probability comprising a predetermined value, each subsequent a priori state transition probability being based on previous a posteriori probability estimates.

2. The method of claim 1 wherein the subsequent a priori state transition probability estimates comprise either the latest available a posteriori probability estimates, modified a posteriori probability estimates, or neutral values, or a combination thereof.

3. The method of claim 1, further comprising the step of utilizing an iteration index and providing modified a posteriori estimates as a function of the iteration index.

4. The method of claim 1 wherein the modified a posteriori probability estimates (AP_mod) are calculated from the a posteriori estimates (AP) as follows:

${\mathrm{AP}}_{\mathrm{mod}}=\frac{\mathrm{AP}+0.5}{2}.$

5. The method of claim 1 wherein the modified a posteriori probability estimates are calculated using a modified soft limiter function.

6. The method of claim 1 wherein the MAP decoding process comprises a logarithmic MAP decoding process.

7. The method of claim 1, comprising utilizing the a posteriori state transition probabilities as the a priori state transition probabilities for the previous decoding iteration for all forward and backward state probability calculations, and switching in neutral values for calculating modified symbol transition probabilities, which are used in all a posteriori transition probability calculations, except for the final iteration wherein the method comprises switching back in the a posteriori state transition probability from the previous decoding iteration as the a priori information for all terms comprising the final a posteriori transition probability calculation.

8. The method of claim 1 wherein the forward and backward state probabilities and the a posteriori state transition probabilities for the component code words are independently controlled.

9. A decoder for decoding turbo codes, comprising:

a state transition probability calculator for iteratively calculating forward and backward state probabilities and a posteriori state transition probabilities for component code words of turbo codes according to a MAP decoding process;

a feedback control for feeding back the a posteriori state transition probabilities as a priori state transition probabilities for use in decoding other component code words comprising the turbo code words, the initial a priori state transition probability comprising a predetermined value, each subsequent a priori state transition probability being based on previous a posteriori probability estimates.

10. The decoder of claim 9 wherein the feedback control provides subsequent a priori state transition probability estimates as either the latest available a posteriori probability estimates, modified a posteriori probability estimates, or neutral values, or a combination thereof.

11. The decoder of claim 9, further comprising an iteration index counter, the feedback control providing modified a posteriori estimates as a function of an iteration index.

12. The decoder of claim 9 wherein the state transition probability calculator calculates the modified a posteriori probability estimates (AP_mod) from the a posteriori estimates (AP) as follows:

${\mathrm{AP}}_{\mathrm{mod}}=\frac{\mathrm{AP}+0.5}{2}.$

13. The decoder of claim 9 wherein the state transition probability calculator further comprises a modified soft limiter for calculating the modified a posteriori probability estimates.

14. The decoder of claim 9 wherein the MAP decoding process comprises a logarithmic MAP decoding process.

15. The decoder of claim 9 wherein the state transition probability calculator utilizes the a posteriori state transition probabilities as the a priori state transition probabilities calculated in the previous decoding iteration for all forward and backward state probability calculations, and further comprises switch means for switching in neutral values for calculating modified symbol transition probabilities, which are used in all a posteriori transition probability calculations, except for the final iteration wherein the switch means switches back in the a posteriori state transition probability from the previous decoding iteration as the a priori information for all terms comprising the final a posteriori transition probability calculation.

16. The decoder of claim 9 wherein the forward and backward state probabilities and the a posteriori state transition probabilities for the component code words are independently controlled.

17. A method for decoding turbo codes, comprising:

iteratively calculating forward and backward state probabilities and a posteriori state transition probabilities for component code words of turbo codes according to a MAP decoding process;

feeding back the a posteriori state transition probabilities as a priori state transition probabilities for use in decoding other component code words comprising the turbo code words, including providing a predetermined value as the initial a priori state transition probability, and including selecting as subsequent a priori state transition probability estimates either the latest available a posteriori probability estimates, modified a posteriori probability estimates, or neutral values, or combinations thereof;

independently controlling the forward and backward state probabilities and the a posteriori state transition probabilities for the component code words of the turbo codes.