Patent EP0751625A2 successfully refreshed from Google Patents.
EP0751625A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Viterbi decoder with L=2 best decoding paths
Assignee: Nokia Oyj
•
Filing: 1996-06-25
•
Granted: —
•
Expires: 2016-06-25
Abstract
Abstract This invention teaches a method, and circuits that operate in accordance with the method, for decoding data received from a communications channel. The method includes the steps of: (a) receiving a modulated communications signal that conveys block encoded data having at least a data field and a syndrome data field; and (b) determining transition metrics and path metrics for the block encoded data. The step of determining path metrics includes a step of retaining path metrics only for a Maximum-Likelihood (ML) path and for a second best ML path. The method further includes a step of: (c) decoding the block encoded data by performing either a full or a partial traceback operation for both the ML path metrics and also for the second best ML path metrics. In a full traceback there is obtained from the ML path a first plurality of detected bits representing the data field, a second plurality of detected bits from the ML path representing the syndrome data field, a third plurality of detected bits from the second best ML path representing the data field, and a fourth plurality of detected bits from the second best ML path representing the syndrome data field. A next step (d) determines a syndrome from the first plurality of detected bits, and then compares the determined syndrome to the second plurality of detected bits. Upon a match a next step (e) outputs the first plurality of detected bits as a received frame of data. If the step of comparing the determined syndrome to the second plurality of detected bits does not indicate a match, the method instead: (f) determines a syndrome from the third plurality of detected bits; (g) compares the determined syndrome to the fourth plurality of detected bits and, upon a match, (h) outputs the third plurality of detected bits as a received frame of data.
Inventors
- 👤 Stash Czaja
- 👤 Ilkka Niva
- 👤 Jim Robertson
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-26 19:08
CPC Classifications
H; H04; H04B; H04B7/00; H03; H03M; H03M13/00; H03M13/37; H03M13/39; H03M13/41; H03M13/4161; H03M13/4169; H03M13/29; H03M13/2933; H03M13/4115; H03M13/03; H03M13/05; H03M13/09
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
255 words
A method for decoding data received from a communications channel, comprising the steps of: receiving a modulated communications signal that conveys encoded data having at least a data field and a syndrome data field; determining transition metrics and path metrics for the encoded data, the step of determining path metrics including a step of retaining path metrics only for a Maximum-Likelihood (ML) path and a second best ML path; decoding the encoded data by performing a traceback operation for both the ML path metrics and also for the second best ML path metrics to obtain from the ML path a first plurality of detected bits representing the data field, a second plurality of detected bits from the ML path representing the syndrome data field, a third plurality of detected bits from the second best ML path representing the data field, and a fourth plurality of detected bits from the second best ML path representing the syndrome data field; determining a syndrome from the first plurality of detected bits; comparing the determined syndrome to the second plurality of detected bits and, upon a match, outputting the first plurality of detected bits as a received frame of data; else, if the step of comparing the determined syndrome to the second plurality of detected bits does not indicate a match; determining a syndrome from the third plurality of detected bits; comparing the determined syndrome to the fourth plurality of detected bits and, upon a match, outputting the third plurality of detected bits as a received frame of data.
Claim 2
Dependent Claim
32 words
A method as claimed in claim 1, further comprising a step of using the first plurality of detected bits to determine a symbol error rate statistic for the received modulated communications signal.
Claim 3
Independent Claim
31 words
A method as claimed in any preceding claim, wherein the step of performing a traceback operation performs the operation as one of a full traceback operation and a partial traceback operation.
Claim 4
Independent Claim
17 words
A method as claimed in any preceding claim, wherein the modulated communications signal conveys block encoded data.
Claim 5
Independent Claim
21 words
A method as claimed in any one of claims 1 to 3, wherein the modulated communications signal conveys continuous encoded data.
Claim 6
Dependent Claim
326 words
A radiotelephone adapted for decoding data received from a communications channel, comprising: a receiver for receiving a modulated communications signal that conveys block encoded data having at least a data field and a syndrome data field; a demodulator for demodulating the received communications signal, the demodulator having an output providing a digital data stream representing the block encoded data; a decoder having an input coupled to said output of said demodulator for decoding the block encoded data, said decoder comprising, means for calculating transition metrics and path metrics for the block encoded data; a memory for retaining path metrics only for a Maximum-Likelihood (ML) path and a second best ML path; means for performing a traceback operation for both the retained ML path metrics and also for the second best ML path metrics and for storing in a first buffer a first plurality of bits detected from the ML path that represent the data field, for storing in a second buffer a second plurality of bits detected from the ML path that represent the syndrome data field, for storing in a third buffer a third plurality of bits detected from the second best ML path that represent the data field, and for storing in a fourth buffer a fourth plurality of bits detected from the second best ML path that represent the syndrome data field; means for determining a syndrome from the first plurality of detected bits and for comparing the determined syndrome to the second plurality of detected bits and, upon a match, for outputting the first plurality of detected bits as a received frame of data; said determining means being responsive to a condition wherein said comparing means does not indicate a match for determining a syndrome from the third plurality of detected bits and for comparing the determined syndrome to the fourth plurality of detected bits and, upon a match, outputting the third plurality of detected bits as a received frame of data.
Claim 7
Dependent Claim
23 words
A radiotelephone as claimed in claim 6, wherein said traceback means performs one of a partial traceback operation and a full traceback operation.
Claim 8
Independent Claim
29 words
A method or a radiotelephone as claimed in any preceding claim, wherein the received modulated communications signal is a phase modulated, direct spread, code division multiple access communications signal.
Claim 9
Independent Claim
18 words
A method or a radiotelephone as claimed in any preceding claim, wherein the syndrome corresponds to a CRC.
Claim 10
Independent Claim
326 words
A method for operating a radiotelephone for decoding data received from a phase modulated, direct spread, code division multiple access communications channel, comprising the steps of: receiving a modulated communications signal that conveys a frame of encoded data having at least a speech data field and a syndrome data field; demodulating the received communications signal to generate digital data representing the encoded data; determining transition metrics and path metrics for the encoded data, the step of determining path metrics including a step of retaining path metrics only for a Maximum-Likelihood (ML) path and a second best ML path; decoding the encoded data by performing a partial traceback operation for both the ML path metrics and also for the second best ML path metrics to obtain from the ML path a first plurality of detected bits representing the speech data field, a second plurality of detected bits from the ML path representing the syndrome data field, a third plurality of detected bits from the first plurality of detected bits of length equal to a number of bits in the frame, less a traceback length, that is concatenated with data field bits from the second best path of length equal to the traceback length, less the syndrome bits plus any tail bits; and a fourth plurality of bits from the second best path representing the syndrome data field; determining a syndrome from the first plurality of detected bits; comparing the determined syndrome to the second plurality of detected bits and, upon a match, outputting the first plurality of detected bits as a received frame of speech data; else, if the step of comparing the determined syndrome to the second plurality of detected bits does not indicate a match; determining a second syndrome from the third plurality of detected bits; comparing the second syndrome to the fourth plurality of detected bits and, upon a match, outputting the third plurality of detected bits as a received frame of speech data.
Claim 11
Dependent Claim
34 words
A method as claimed in claim 10, further comprising a step of using at least the first plurality of detected bits to determine a symbol error rate statistic for the received modulated communications signal.
Claim 12
Dependent Claim
27 words
A method as claimed in claim 10 or claim 11, wherein the frame contains 192 bits, and wherein the partial traceback length is equal to 54 bits.
Claim 13
Independent Claim
124 words
A method for decoding encoded data received from a communications channel, comprising the steps of: constructing a trellis organized as x states by y transitions for received encoded data comprised of x bits; preserving in a survivor path memory only those path metrics that correspond to a Maximum-Likely path and a second best Maximum-Likely path through the trellis; and decoding the path metrics corresponding to the Maximum-Likely path and, if an acceptable error rate is obtained, outputting decoded data that corresponds to the Most-Likely path; else, if an acceptable error rate is not obtained, decoding the path metrics corresponding to the second best Maximum-Likely path and, if an acceptable error rate is obtained, outputting decoded data that corresponds to the second best Most-Likely path.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.