Decoder utilizing soft information output to minimize error rates

• US 5,968,198 A
• Filed: 08/16/1996
• Issued: 10/19/1999
• Est. Priority Date: 08/16/1996
• Status: Expired due to Term

• Current Assignee: Unwired Planet LLC (JP Morgan Chase & Co)
• Original Assignee: Ericsson, Inc. (Telefonaktiebolaget LM Ericsson)
• Inventors: Hassan, Amer A., Balachandran, Kumar, Khayrallah, Ali S., Wang, Yi-Pin Eric, Ramesh, Rajaram
• Primary Examiner(s): Baker, Stephen M.
• Application Number:
  US08/699,101
• Time in Patent Office: 1,159 Days
• Field of Search: 371/37.01, 371/37.06, 371/35, 371/37.4, 371/37.11
• US Class Current: 714/752
• CPC Class Codes: H03M 13/09 Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
• CPC Class Codes: H03M 13/13 Linear codes
• CPC Class Codes: H03M 13/27 using interleaving techniques
• CPC Class Codes: H03M 13/2906 using block codes H03M13/2957 takes precedence
• CPC Class Codes: H03M 13/2933 using a block and a convolutional code H03M13/2957 takes precedence
• CPC Class Codes: H03M 13/3738 with judging correct decoding
• CPC Class Codes: H03M 13/456 wherein all the code words of the code or its dual code are tested, e.g. brute force decoding
• CPC Class Codes: H03M 13/6306 Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy H03M13/3761, H03M13/3769 and H03M13/635 take precedence
• CPC Class Codes: H03M 13/6331 Error control coding in combination with equalisation
• CPC Class Codes: H04L 1/0065 Serial concatenated codes
• CPC Class Codes: H04L 1/0071 Use of interleaving interleaving per se H03M13/27
• CPC Class Codes: H04L 1/1809 Selective-repeat protocols
• CPC Class Codes: H04L 1/1816 with retransmission of the same, encoded, message
• CPC Class Codes: H04L 25/067 providing soft decisions, i.e. decisions together with an estimate of reliability H04L25/068 and H04L25/069 take precedence; sequence estimation techniques H04L25/03178

Abstract

A coding system is disclosed wherein the receive side includes a decoder capable of producing, in addition to the hard information decoded output, either or both symbol and/or bit soft information values. For a certain information bit position, a value proportional to the joint probability that a received symbol and the set of all hypothesized transmitted codewords that led to the estimated or detected hard information output is calculated. The calculated probabilities with respect to plural codewords having a zero in that certain information bit position are compared to the calculated probabilities with respect to the plural codewords having a one in that certain information bit position. The result of the comparison provides an indication of whether the hard information output in that same information bit position is more likely a one or a zero. The output soft information values are further processed in comparison to a preset threshold, with instances exceeding the threshold triggering block rejections and/or retransmissions.

Claims

1. A decoding method, comprising the steps of:

comparing a received vector r with each one of a plurality of codewords y, each codeword having an associated hard information vector x;

selecting the codeword y closest to the received vector r;

outputting the hard information vector x corresponding to the selected codeword y; and

determining a reliability vector s for the output hard information vector x, the reliability vector s determined for each symbol location of the hard information vector x, as a function of each of the plurality of codewords y and the received vector r.

2. The method of claim 1 wherein the hard information vector x comprises a plurality of information bits, and wherein the step of determining comprises the steps of:

calculating values that are proportional to the probability of receiving the received vector r given the transmission of each of the plurality of codewords y;

for each of the plurality of information bits in the information vector x, comparing the calculated probabilities with respect to certain ones codewords y having a zero in a given information bit position to the calculated probabilities with respect to the same certain ones of codewords y having a one in that certain information bit position; and

identifying from the comparison an indication of whether the hard information output x in that same information bit position is more likely a one or a zero.

3. The method of claim 2 wherein the step of comparing comprises the steps of:

first summing the calculated values with respect to the certain ones of the codewords y having a zero in the given information bit position; and

second summing the calculated values with respect to the same certain ones of the certain codewords y having a one in the given information bit position.

4. The method of claim 3 wherein the step of comparing further comprises the steps of:

taking the ratio of the results of the first and second summing steps; and

taking a logarithm of the generated ratio.

5. The method of claim 4 wherein the step of identifying comprises the steps of:

indicating that a zero is more likely if the result of taking the logarithm of the generated ratio is greater than zero; and

indicating that a one is more likely if the result of taking the logarithm of the generated ratio is less than zero.

6. The method as in claim 2 further including the step of selecting the certain ones of the codewords y from the plurality of codewords y.

7. The method as in claim 6 wherein step of selecting comprises the step of choosing as the certain ones of the codewords y those ones of the plurality of codewords y closest to the received vector r.

8. The method as in claim 6 wherein the step of choosing selects those ones of the plurality of codewords y having a minimal Euclidean distance with respect to the received vector r.

9. The method as in claim 6 wherein the step of choosing selects those ones of the plurality of codewords y having a maximal correlation with respect to the received vector r.

10. The method of claim 1 wherein the step of determining comprises the steps of:

first minimizing the distance between the received vector r and certain ones of the codewords y having a zero in the given information bit position; and

second minimizing the distance between the received vector r and certain ones of the codewords y having a one in the given information bit position.

11. The method of claim 10 wherein the step of determining further comprises the step of subtracting the result of the first minimization from the result of the second minimization.

12. The method of claim 11 wherein the step of determining further comprises the steps of:

indicating that a zero is more likely if the result of subtraction is greater than zero; and

indicating that a one is more likely if the result of the subtraction is less than zero.

13. The method of claim 1 wherein the step of determining comprises the steps of:

first maximizing the correlation between the received vector r and certain ones of the codewords y having a zero in the given information bit position; and

second maximizing the correlation between the received vector r and certain ones of the codewords y having a one in the given information bit position.

14. The method of claim 13 wherein the step of determining further comprises the step of subtracting the result of the second maximization from the result of the first maximization.

15. The method of claim 14 wherein the step of determining further comprises the steps of:

indicating that a zero is more likely if the result of subtraction is greater than zero; and

indicating that a one is more likely if the result of the subtraction is less than zero.

16. The method as in claim 1 wherein plurality of codewords y comprise Hadamard codewords.

17. The method as in claim 1 wherein plurality of codewords y comprise Reed-Solomon codewords.

18. The method as in claim 1 further comprising the steps of:

processing the generated reliability vector s to identify the presence of errors;

comparing a number of the identified errors to a predetermined threshold; and

signaling for a rejection of the received data transmission if the number of identified errors exceeds the predetermined threshold.

19. The method of claim 18 further including the step of requesting re-transmission of the data if the number of identified errors exceeds the predetermined threshold.

20. A decoder, comprising:

means for comparing a received vector r with each one of a plurality of codewords y, each codeword having an associated hard information vector x, selecting the codeword y closest to the received vector r, and outputting the hard information vector x corresponding to the selected codeword y; and

means for determining a reliability vector s for the output hard information vector x, the reliability vector s determined for each symbol location of the hard information vector x as a function of each of the plurality of codewords y and the received vector r.

21. The decoder of claim 20 wherein the hard information vector x comprises a plurality of information bits, and wherein the means for determining comprises:

means for calculating values that are proportional to the probability of receiving the received vector r given the transmission of each of the plurality of codewords y; and

means for comparing, for each of the plurality of information bits in the information vector x, the calculated probabilities with respect to certain ones codewords y having a zero in a given information bit position to the calculated probabilities with respect to the same certain ones of codewords y having a one in that certain information bit position to identify whether the hard information output x in that same information bit position is more likely a one or a zero.

22. The decoder of claim 21 wherein the means for comparing comprises:

first means for summing the calculated values with respect to the certain ones of the codewords y having a zero in the given information bit position;

second means for summing the calculated values with respect to the same certain ones of the certain codewords y having a one in the given information bit position;

means for taking the ratio of the results of the first and second summing steps; and

means for taking a logarithm of the generated ratio.

23. The decoder of claim 22 further including:

means for indicating that a zero is more likely if the result of taking the logarithm of the generated ratio is greater than zero; and

means for indicating that a one is more likely if the result of taking the logarithm of the generated ratio is less than zero.

24. The decoder of claim 20 wherein the means for determining comprises:

first means for minimizing the distance between the received vector r and certain ones of the codewords y having a zero in the given information bit position;

second means for minimizing the distance between the received vector r and certain ones of the codewords y having a one in the given information bit position; and

means for subtracting the result of the first minimization from the result of the second minimization.

25. The decoder of claim 24 further including:

means for indicating that a zero is more likely if the result of subtraction is greater than zero; and

means for indicating that a one is more likely if the result of the subtraction is less than zero.

26. The decoder of claim 20 wherein the means for determining comprises:

first means for maximizing the correlation between the received vector r and certain ones of the codewords y having a zero in the given information bit position;

second means for maximizing the correlation between the received vector r and certain ones of the codewords y having a one in the given information bit position; and

means for subtracting the result of the second maximization from the result of the first maximization.

27. The decoder of claim 26 further including:

means for indicating that a zero is more likely if the result of subtraction is greater than zero; and

means for indicating that a one is more likely if the result of the subtraction is less than zero.

28. The decoder as in claim 20 wherein plurality of codewords y comprise Hadamard codewords.

29. The decoder as in claim 20 wherein plurality of codewords y comprise Reed-Solomon codewords.

30. The decoder as in claim 20 further comprising:

means for processing the generated reliability vector s to identify the presence of errors;

means for comparing a number of the identified errors to a predetermined threshold; and

means for signaling for a rejection of the received data transmission if the number of identified errors exceeds the predetermined threshold.

31. The decoder of claim 30 further including means for requesting re-transmission of the data if the number of identified errors exceeds the predetermined threshold.