Patent US5134635A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5134635A Expired / Lapsed US ⏱️ 0.0 years remaining

Convolutional decoder using soft-decision decoding with channel state information

Assignee: Motorola Solutions Inc
•
Filing: 1990-07-30
•
Granted: 1992-07-28
•
Expires: 2010-07-30
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A convolutional decoder which assigns bit metrics to at least one bit of a symbol in a multilevel system. This decoder uses soft-decision Viterbi decoding with channel state information of a convolutionally-encoded communication transmitted using multilevel modulation.

Inventors

  • 👤 Daehyoung Hong
  • 👤 Steven C. Jasper
  • 👤 Mark R. Poulin

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 18:23
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/37; H03M13/39; H03M13/41

Claims Analysis

Total Claims: 48
Claim 1
Independent Claim 93 words
A convolutional decoder for decoding a data message comprised of a plurality of multilevel symbols, the decoder comprising: means for recovering at least one symbol representing a plurality of bits; means for assigning at least two bit metrics to at least one bit of said recovered at least one symbol, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; and means for determining a binary value for said at least one bit from said at least two bit metrics.
Claim 2
Dependent Claim 93 words
A convolutional decoder for decoding a data message comprised of a plurality of multilevel symbols, the decoder comprising: means for recovering at least one symbol representing a plurality of bits; means for assigning at least two bit metrics to at least one bit of said recovered at least one symbol, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; and means for determining a binary value for said at least one bit from said at least two bit metrics.
Claim 3
Dependent Claim 16 words
A convolutional decoder in accordance with claim 1 further comprising means for obtaining channel state information.
Claim 4
Dependent Claim 31 words
A convolutional decoder in accordance with claim 2 wherein said means for assigning further comprises means for combining said channel state information to calculate said assigned at least two bit metrics.
Claim 5
Dependent Claim 30 words
A convolutional decoder in accordance with claim 3 further comprising means for coupling said assigned at least two bit metrics to means for Viterbi decoding to recover the data message.
Claim 6
Dependent Claim 25 words
A convolutional decoder in accordance with claim 4 wherein said means for coupling further comprises means for de-interleaving said assigned at least two bit metrics.
Claim 7
Dependent Claim 22 words
A convolutional decoder in accordance with claim 1 wherein said means for assigning further comprises means for determining a modified Euclidean distance.
Claim 8
Independent Claim 94 words
A method of improved error correction in a convolutional decoder that decodes a data message comprised of a plurality of multilevel symbols, comprising the steps of: recovering at least one symbol representing a plurality of bits; assigning at least two bit metrics to at least one bit of said recovered at least one symbol, wherein a bit metric is a number reflecting a confidence level that said at least one bit is binary "1" or "0" and determining a binary value for said at least one bit from said at least two bit metrics.
Claim 9
Independent Claim 94 words
A method of improved error correction in a convolutional decoder that decodes a data message comprised of a plurality of multilevel symbols, comprising the steps of: recovering at least one symbol representing a plurality of bits; assigning at least two bit metrics to at least one bit of said recovered at least one symbol, wherein a bit metric is a number reflecting a confidence level that said at least one bit is binary "1" or "0" and determining a binary value for said at least one bit from said at least two bit metrics.
Claim 10
Dependent Claim 14 words
The method of claim 7 further including the step of obtaining channel state information.
Claim 11
Dependent Claim 24 words
The method of claim 8 further including the step of combining said channel state information to calculate said assigned at least two bit metrics.
Claim 12
Dependent Claim 26 words
The method of claim 9 further including the step of coupling said assigned at least two bit metrics and Viterbi decoding to recover the data message.
Claim 13
Dependent Claim 17 words
The method of claim 10 further including the step of de-interleaving said assigned at least two metrics.
Claim 14
Dependent Claim 15 words
The method of claim 7 further including the step of determining a modified Euclidean distance.
Claim 15
Dependent Claim 125 words
A digital receiver employing a convolutional decoder for decoding a data message comprised of a plurality of multilevel symbols, said digital receiver comprising: means for recovering at least one symbol representing a plurality of bits; means for assigning at least two bit metrics to at least one bit of said symbol, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; means for obtaining channel state information coupled to said means for assigning; means for combining said channel state information with at least one bit of said recovered at least one symbol; and means for determining a binary value for said at least one bit from said at least two bit metrics.
Claim 16
Dependent Claim 125 words
A digital receiver employing a convolutional decoder for decoding a data message comprised of a plurality of multilevel symbols, said digital receiver comprising: means for recovering at least one symbol representing a plurality of bits; means for assigning at least two bit metrics to at least one bit of said symbol, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; means for obtaining channel state information coupled to said means for assigning; means for combining said channel state information with at least one bit of said recovered at least one symbol; and means for determining a binary value for said at least one bit from said at least two bit metrics.
Claim 17
Dependent Claim 20 words
A digital receiver in accordance with claim 13 further comprising means for de-interleaving said assigned at least two bit metrics.
Claim 18
Dependent Claim 31 words
A digital receiver in accordance with claim 13 further comprising means for coupling said assigned at least two bit metrics to a means for Viterbi decoding to recover the data message.
Claim 19
Dependent Claim 187 words
A convolutional decoder for decoding a data message comprised of a plurality of multilevel symbols, the decoder comprising: means for obtaining at least one received symbol representing a plurality of bits; means for obtaining complex channel gain from said at least one received symbol; means, coupled to said means for obtaining said complex channel gain, for computing magnitude squared of said complex channel gain; means for computing a phase and amplitude corrected symbol from said at least one received symbol and said complex channel gain; means, coupled to said means for computing said phase and amplitude corrected symbol, for computing bit signals; means, coupled to said means for computing said magnitude squared of said complex channel gain and said means for computing said bit signals, for assigning at least two bit metrics to at least one bit of said at least one received symbol, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; and means for determining a binary value for said at least one bit from said at least two bit metrics.
Claim 20
Dependent Claim 187 words
A convolutional decoder for decoding a data message comprised of a plurality of multilevel symbols, the decoder comprising: means for obtaining at least one received symbol representing a plurality of bits; means for obtaining complex channel gain from said at least one received symbol; means, coupled to said means for obtaining said complex channel gain, for computing magnitude squared of said complex channel gain; means for computing a phase and amplitude corrected symbol from said at least one received symbol and said complex channel gain; means, coupled to said means for computing said phase and amplitude corrected symbol, for computing bit signals; means, coupled to said means for computing said magnitude squared of said complex channel gain and said means for computing said bit signals, for assigning at least two bit metrics to at least one bit of said at least one received symbol, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; and means for determining a binary value for said at least one bit from said at least two bit metrics.
Claim 21
Dependent Claim 20 words
A convolutional decoder in accordance with claim 16 further comprising means for de-interleaving said assigned at least two bit metrics.
Claim 22
Dependent Claim 22 words
A convulutional decoder in accordance with claim 16 further comprising means for Viterbi decoding of said assigned at least two bit metrics.
Claim 23
Independent Claim 169 words
A method of improved error correction in a convolutional decoder for decoding a data message comprised of a plurality of multilevel symbols, comprising the steps: obtaining at least one received symbol representing a plurality of bits; obtaining complex channel gain from said at least one received symbol; computing magnitude squared of said complex channel gain from said complex channel gain; computing a phase and amplitude corrected symbol from said at least one received symbol and said complex channel gain; computing bit signals from said computed phase and amplitude corrected symbol; assigning, responsive to said computing of said magnitude squared of said complex channel gain and said computing of said bit signals, at least two bit metrics to at least one bit of said at least one received symbol, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; and determining a binary value for said at least one bit from said at least two bit metrics.
Claim 24
Independent Claim 169 words
A method of improved error correction in a convolutional decoder for decoding a data message comprised of a plurality of multilevel symbols, comprising the steps: obtaining at least one received symbol representing a plurality of bits; obtaining complex channel gain from said at least one received symbol; computing magnitude squared of said complex channel gain from said complex channel gain; computing a phase and amplitude corrected symbol from said at least one received symbol and said complex channel gain; computing bit signals from said computed phase and amplitude corrected symbol; assigning, responsive to said computing of said magnitude squared of said complex channel gain and said computing of said bit signals, at least two bit metrics to at least one bit of said at least one received symbol, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; and determining a binary value for said at least one bit from said at least two bit metrics.
Claim 25
Dependent Claim 18 words
The method of claim 19 further including the step of de-interleaving said assigned at least two bit metrics.
Claim 26
Dependent Claim 20 words
The method of claim 19 further including the step of Viterbi decoding of said assigned at least two bit metrics.
Claim 27
Dependent Claim 111 words
A decoder for decoding a data message comprised of a plurality of multilevel symbols, the decoder comprising: means for obtaining at least one received symbol representing a plurality of bits; means for computing at least two bit signals for said obtained at least one received symbol; means, coupled to said means for computing, for assigning at least two bit metrics from said computed at least two bit signals, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; and means for determining a binary value for said at least one bit from said at least two bit metrics.
Claim 28
Dependent Claim 111 words
A decoder for decoding a data message comprised of a plurality of multilevel symbols, the decoder comprising: means for obtaining at least one received symbol representing a plurality of bits; means for computing at least two bit signals for said obtained at least one received symbol; means, coupled to said means for computing, for assigning at least two bit metrics from said computed at least two bit signals, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; and means for determining a binary value for said at least one bit from said at least two bit metrics.
Claim 29
Dependent Claim 15 words
A decoder in accordance with claim 22, further comprising means for obtaining channel state information.
Claim 30
Dependent Claim 28 words
A decoder in accordance with claim 23, wherein said means for computing further comprises means for combining said at least two bit signals with said channel state information.
Claim 31
Dependent Claim 19 words
A decoder in accordance with claim 22, further comprising means for de-interleaving said assigned at least two bit metrics.
Claim 32
Dependent Claim 21 words
A decoder in accordance with claim 22, further comprising means for Viterbi decoding of said assigned at least two bit metrics.
Claim 33
Dependent Claim 21 words
A decoder in accordance with claim 22, wherein said means for computing further comprises means for determining a modified Euclidean distance.
Claim 34
Dependent Claim 27 words
A decoder in accordance with claim 22, wherein said means for computing further comprises means for obtaining complex channel gain from said at least one received symbol.
Claim 35
Dependent Claim 34 words
A decoder in accordance with claim 28, wherein said means for computing further comprises means, coupled to said means for obtaining said complex channel gain, for computing magnitude squared of said complex channel gain.
Claim 36
Dependent Claim 35 words
A decoder in accordance with claim 29, wherein said means for computing further comprises means for computing a phase and amplitude corrected symbol from said at least one received symbol and said complex channel gain.
Claim 37
Dependent Claim 27 words
A decoder in accordance with claim 30, wherein said means for computing further comprises means for computing bit signals from said computed phase and amplitude corrected symbol.
Claim 38
Independent Claim 103 words
A method of decoding a data message comprised of a plurality of multilevel symbols, comprising the steps of: obtaining at least one received symbol representing a plurality of bits; computing at least two bit signals for said obtained at least one received symbol; assigning, responsive to said computing step, at least two bit metrics from said computed at least two bit signals, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; and determining a binary value for said at least one bit from said at least two bit metrics.
Claim 39
Independent Claim 103 words
A method of decoding a data message comprised of a plurality of multilevel symbols, comprising the steps of: obtaining at least one received symbol representing a plurality of bits; computing at least two bit signals for said obtained at least one received symbol; assigning, responsive to said computing step, at least two bit metrics from said computed at least two bit signals, wherein a bit metric is a number reflecting a confidence level that said at least one bit is a binary "1" or "0"; and determining a binary value for said at least one bit from said at least two bit metrics.
Claim 40
Dependent Claim 14 words
The method of claim 32, further comprising the step of obtaining channel state information.
Claim 41
Dependent Claim 26 words
The method of claim 33, wherein said computing step further comprises the step of combining said at least two bit signals with said channel state information.
Claim 42
Dependent Claim 18 words
The method of claim 32, further comprising the step of de-interleaving said assigned at least two bit metrics.
Claim 43
Dependent Claim 20 words
The method of claim 32, further comprising the step of Viterbi decoding of said assigned at least two bit metrics.
Claim 44
Dependent Claim 19 words
The method of claim 32, wherein said computing step further comprises the step of determining a modified Euclidean distance.
Claim 45
Dependent Claim 25 words
The method of claim 32, wherein said computing step further comprises the step of obtaining complex channel gain from said at least one received symbol.
Claim 46
Dependent Claim 27 words
The method of claim 38, wherein said computing step further comprises the step of computing magnitude squared of said complex channel gain from said complex channel gain.
Claim 47
Dependent Claim 33 words
The method of claim 39, wherein said computing step further comprises the step of computing a phase and amplitude corrected symbol from said at least one received symbol and said complex channel gain.
Claim 48
Dependent Claim 25 words
The method of claim 40, wherein said computing step further comprises the step of computing bit signals from said computed phase and amplitude corrected symbol.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-07-28 1996-01-27 1996-07-28 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-07-28 2000-01-27 2000-07-28 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-07-28 2004-01-27 2004-07-28 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag