US5414738A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Maximum likelihood paths comparison decoder
Assignee: Zarbana Digital Fund LLC
•
Filing: 1993-11-09
•
Granted: 1995-05-09
•
Expires: 2013-11-09
Abstract
Abstract There is described an apparatus and method for decoding signals produced by a communication system employing cascading or concatenation of error control codes that contain, for example, short memory convolution codes. A novel inner decoder and method is described which is a modified Viterbi decoder that generates soft decisions by using a subset of the operations performed by a normal, hard decision, Viterbi decoder. Results of simulation tests show that the performance of the novel decoder provides a bit error rate performance that matches the theoretical bit error rate for the various signal to noise ratios, which performance is better than decoders previously available. Several implementations are described and compared.
Inventors
- 👤 Richard A. Bienz
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 08:56
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/65; H03M13/6502; H03M13/27; H03M13/2703; H03M13/29; H03M13/37; H03M13/39; H03M13/41; H03M13/4107
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
208 words
A method for decoding information coded by an encoder having a memory length of m bits and transmitted through a noisy channel, said method comprising the steps of: comparing the transmitted information to all possible predetermined output states of the encoder to determine for each bit received through the channel a first 2 m set of metric sums representing the likelihood that a one was input to the encoder, and a second 2 m set of metric sums representing the likelihood that a zero was input to the encoder; passing the first 2 m set of metric sums through a first trellis decoder to produce a first output; passing the second 2 m set of metric sums through a second trellis decoder to produce a second output; selecting a first maximum metric sum from the first output and a second maximum metric sum from the second output; and subtracting the first and second maximum metric sums from each other to determine a difference therebetween having a sign and magnitude, wherein the sign of the difference indicates the relative likelihood that a one or zero was encoded by the encoder and the magnitude of the difference indicates the probability that such one or zero was encoded by the encoder.
Claim 2
Independent Claim
208 words
A method for decoding information coded by an encoder having a memory length of m bits and transmitted through a noisy channel, said method comprising the steps of: comparing the transmitted information to all possible predetermined output states of the encoder to determine for each bit received through the channel a first 2 m set of metric sums representing the likelihood that a one was input to the encoder, and a second 2 m set of metric sums representing the likelihood that a zero was input to the encoder; passing the first 2 m set of metric sums through a first trellis decoder to produce a first output; passing the second 2 m set of metric sums through a second trellis decoder to produce a second output; selecting a first maximum metric sum from the first output and a second maximum metric sum from the second output; and subtracting the first and second maximum metric sums from each other to determine a difference therebetween having a sign and magnitude, wherein the sign of the difference indicates the relative likelihood that a one or zero was encoded by the encoder and the magnitude of the difference indicates the probability that such one or zero was encoded by the encoder.
Claim 3
Dependent Claim
26 words
The method of claim 1 wherein a difference of positive sign indicates that a one is relatively more likely to have been encoded by the encoder.
Claim 4
Dependent Claim
26 words
The method of claim 1 wherein a difference of negative sign indicates that a one is relatively more likely to have been encoded by the encoder.
Claim 5
Dependent Claim
20 words
The method of claim 1 wherein at least one of the passing steps is carried out using a Viterbi decoder.
Claim 6
Independent Claim
225 words
An apparatus for decoding information coded by an encoder having a memory length of m bits and transmitted through a noisy channel, comprising: an input add-compare-select decoder for receiving the transmitted information and producing a first output containing information on the likelihood that an encoded bit was a one and a second output containing information on the likelihood that the encoded bit was a zero; a first multiplicity of sequentially connected add-compare-select decoders, the first thereof receiving the first output and the last thereof producing a first further output; a second multiplicity of sequentially connected add-compare-select decoders, the first thereof receiving the second output and the last thereof producing a second further output; a first selector for receiving the first further output and selecting therefrom a first maximum sum of probabilities that the encoded bit was a one; a second selector for receiving the second further output and selecting therefrom a second maximum sum of probabilities that the encoded bit was a zero; and a subtractor for determining sign and magnitude of a difference between the first and second maximum sum of probabilities, wherein the sign of the difference indicates whether a one or zero was relatively more likely to have been encoded by the encoder and the magnitude of the difference indicates the probability that such one or zero was encoded by the encoder.
Claim 7
Independent Claim
225 words
An apparatus for decoding information coded by an encoder having a memory length of m bits and transmitted through a noisy channel, comprising: an input add-compare-select decoder for receiving the transmitted information and producing a first output containing information on the likelihood that an encoded bit was a one and a second output containing information on the likelihood that the encoded bit was a zero; a first multiplicity of sequentially connected add-compare-select decoders, the first thereof receiving the first output and the last thereof producing a first further output; a second multiplicity of sequentially connected add-compare-select decoders, the first thereof receiving the second output and the last thereof producing a second further output; a first selector for receiving the first further output and selecting therefrom a first maximum sum of probabilities that the encoded bit was a one; a second selector for receiving the second further output and selecting therefrom a second maximum sum of probabilities that the encoded bit was a zero; and a subtractor for determining sign and magnitude of a difference between the first and second maximum sum of probabilities, wherein the sign of the difference indicates whether a one or zero was relatively more likely to have been encoded by the encoder and the magnitude of the difference indicates the probability that such one or zero was encoded by the encoder.
Claim 8
Dependent Claim
39 words
The apparatus of claim 5 wherein a difference of positive sign indicates that a one was more likely encoded by the encoder and a difference of negative sign indicates that a zero was more likely encoded by the encoder.
Claim 9
Dependent Claim
39 words
The apparatus of claim 5 wherein a difference of negative sign indicates that a one was more likely encoded by the encoder and a difference of positive sign indicates that a zero was more likely encoded by the encoder.
Claim 10
Dependent Claim
21 words
The apparatus of claim 5 wherein at least one of the first and second multiplicity of decoders comprises a Viterbi decoder.
Claim 11
Independent Claim
181 words
A method for decoding information coded by a convolutional encoder having a memory length of m bits and transmitted through a noisy channel, said method comprising the steps of: processing the transmitted information through at least one trellis decoder to produce, for each input data bit to the encoder, (i) a first 2 m set of metric sums representing the likelihood that a one was input to the encoder, and (ii) a second 2 m sets of metric sums representing the likelihood that a zero was input to the encoder; selecting from the first 2 m set of metric sums a first maximum metric sum; selecting from the second 2 m set of metric sums a second maximum metric sum; and subtracting the first and second maximum metric sums from each other to determine a sign and magnitude of a difference therebetween, wherein the sign of the difference indicates the relative likelihood that a one or zero was encoded by the encoder and the magnitude of the difference indicates the probability that such one or zero was encoded by the encoder.
Claim 12
Independent Claim
181 words
A method for decoding information coded by a convolutional encoder having a memory length of m bits and transmitted through a noisy channel, said method comprising the steps of: processing the transmitted information through at least one trellis decoder to produce, for each input data bit to the encoder, (i) a first 2 m set of metric sums representing the likelihood that a one was input to the encoder, and (ii) a second 2 m sets of metric sums representing the likelihood that a zero was input to the encoder; selecting from the first 2 m set of metric sums a first maximum metric sum; selecting from the second 2 m set of metric sums a second maximum metric sum; and subtracting the first and second maximum metric sums from each other to determine a sign and magnitude of a difference therebetween, wherein the sign of the difference indicates the relative likelihood that a one or zero was encoded by the encoder and the magnitude of the difference indicates the probability that such one or zero was encoded by the encoder.
Claim 13
Dependent Claim
18 words
The method of claim 9 wherein the processing step comprises processing the transmitted information through multiple trellis decoders.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-05-08 | 1998-11-07 | 1999-05-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-05-08 | 2002-11-07 | 2003-05-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-05-08 | 2006-11-07 | 2007-05-09 | $7700.00 | Window Closed / Lapsed |