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

Viterbi decoding method and apparatus thereof

Assignee: NEC Corp
•
Filing: 1999-07-14
•
Granted: 2002-06-18
•
Expires: 2019-07-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A Viterbi decoding apparatus decoding packet data, even at the case that next packet data are continuously inputted soon after the existing packet data, can correctly decode the last part of the existing packet data is provided. The Viterbi decoding apparatus provides a selector that switches a receiving clock synchronized with the packet data and a high speed clock being faster than the receiving clock. During the packet data are received, the selector supplies the receiving clock to a branch metric generator, an ACS (add, compare and select) circuit, a path metric register, a path memory and a trace back circuit. After the reception of the packet data is finished, the selector supplies the high speed clock to the branch metric generator, the ACS circuit, the path metric register and the path memory. With this, the Viterbi decoding apparatus of the present invention can decode the last part of the existing packet data correctly and quickly.

Inventors

  • 👤 Toshiya Todoroki

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 12:26
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/37; H03M13/39; H03M13/3961; H03M13/41; H03M13/4107; H03M13/4161; H03M13/4169

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 171 words
A Viterbi decoding method, which receiving data are inputted to, generates a branch metric from said receiving data, performs a ACS (add, compare and select) process for said branch metric, generates path metric values being plural states and selecting information, stores said selecting information, decides the most likelihood path based on the maximum path metric value, and traces back said stored selecting information based on said decided most likelihood path, and outputs decoded data, wherein: said receiving data are packet data, and comprising: a process, during said packet data are received, which performs generating said branch metric, said ACS process, deciding said most likelihood path and outputting said decoded data, based on a first operating clock synchronized with said packet data, and a process, at the time when the reception of said packet data is finished, which switches to a second operating clock being faster than said first operating clock, performs generating said branch metric and said ACS process and deciding said most likelihood path, based on said second operating clock.
Claim 2
Dependent Claim 171 words
A Viterbi decoding method, which receiving data are inputted to, generates a branch metric from said receiving data, performs a ACS (add, compare and select) process for said branch metric, generates path metric values being plural states and selecting information, stores said selecting information, decides the most likelihood path based on the maximum path metric value, and traces back said stored selecting information based on said decided most likelihood path, and outputs decoded data, wherein: said receiving data are packet data, and comprising: a process, during said packet data are received, which performs generating said branch metric, said ACS process, deciding said most likelihood path and outputting said decoded data, based on a first operating clock synchronized with said packet data, and a process, at the time when the reception of said packet data is finished, which switches to a second operating clock being faster than said first operating clock, performs generating said branch metric and said ACS process and deciding said most likelihood path, based on said second operating clock.
Claim 3
Dependent Claim 33 words
A Viterbi decoding method in accordance with claim 1 , comprising: a process, at the time when the reception of said packet data is finished, which inputs terminal data after said receiving data.
Claim 4
Dependent Claim 84 words
A Viterbi decoding method in accordance with claim 2 , comprising: a process, after the reception of said packet data is finished, examines whether the most likelihood path at the time merges into the state number “0” or not every one cycle of said second operating clock and traces back to the past the selecting information of the series connecting to said most likelihood path at the time when the most likelihood path merges into the state number “0” and outputs the decoded data.
Claim 5
Dependent Claim 291 words
A Viterbi decoding apparatus, comprising: a first selector which switches receiving data and terminal data and outputs the selected data; a branch metric generator which the output of said first selector is inputted to and obtains the metric of said inputted data; a path metric register which stores the accumulated metric of the survivor path; an ACS circuit which performs an ACS process based on the output of said branch metric generator and the output of said path metric register every symbol interval and outputs path metric values of plural states and selecting information; a most likelihood path state detector which detects a most likelihood path having the maximum path metric value from said path metric values of plural states; a path memory which stores the selecting information of said plural states every symbol interval; and a trace back circuit which traces back to the past said path memory for only “g” symbol every “g−f” symbols based on said most likelihood path and outputs “g−f” bits from finally reached bits as decoded data, wherein said receiving data are packet data, and a Viterbi decoding apparatus, selects said packet data by said first selector during said packet data are received and also drives said branch metric generator, said ACS circuit, said path metric register, said path memory and said trace back circuit by a first operating clock synchronized with said packet data; makes said first selector switch to said terminal data side at the time when the reception of said packet data is finished; and drives said branch metric generator, said ACS circuit, said path metric register and said path memory by a second operating clock being faster than said first operating clock after the reception of said packet data is finished.
Claim 6
Dependent Claim 291 words
A Viterbi decoding apparatus, comprising: a first selector which switches receiving data and terminal data and outputs the selected data; a branch metric generator which the output of said first selector is inputted to and obtains the metric of said inputted data; a path metric register which stores the accumulated metric of the survivor path; an ACS circuit which performs an ACS process based on the output of said branch metric generator and the output of said path metric register every symbol interval and outputs path metric values of plural states and selecting information; a most likelihood path state detector which detects a most likelihood path having the maximum path metric value from said path metric values of plural states; a path memory which stores the selecting information of said plural states every symbol interval; and a trace back circuit which traces back to the past said path memory for only “g” symbol every “g−f” symbols based on said most likelihood path and outputs “g−f” bits from finally reached bits as decoded data, wherein said receiving data are packet data, and a Viterbi decoding apparatus, selects said packet data by said first selector during said packet data are received and also drives said branch metric generator, said ACS circuit, said path metric register, said path memory and said trace back circuit by a first operating clock synchronized with said packet data; makes said first selector switch to said terminal data side at the time when the reception of said packet data is finished; and drives said branch metric generator, said ACS circuit, said path metric register and said path memory by a second operating clock being faster than said first operating clock after the reception of said packet data is finished.
Claim 7
Dependent Claim 94 words
A Viterbi decoding apparatus in accordance with claim 4 , further comprising: a second selector which switches said first operating clock and said second operating clock; a control circuit which controls said first selector and said second selector in order that said first selector selects said receiving data and said second selector selects said first operating clock corresponding to the input of a packet data starting pulse, and said first selector selects said terminal data and said second selector selects said second operating clock corresponding to the input of a packet data finishing pulse.
Claim 8
Dependent Claim 26 words
A Viterbi decoding apparatus in accordance with claim 4 , wherein: said path memory is a ring memory which stores said selecting information for “g+f” symbols.
Claim 9
Dependent Claim 92 words
A Viterbi decoding apparatus in accordance with claim 4 , wherein: said most likelihood path state detector, after the reception of said packet data is finished, examines whether the most likelihood path at the time merges into the state number “0” or not every one cycle of said second operating clock, and at the time when the most likelihood path merges into the state number “0”, said trace back circuit traces back to the past the selecting information of the series connecting to said most likelihood path and outputs the decoded data.
Claim 10
Dependent Claim 250 words
A Viterbi decoding apparatus, which provides a selector which switches receiving data and terminal data and outputs the selected data, a branch metric generator which the output of said selector is inputted to and obtains the metric of said inputted data, a path metric register which stores the accumulated metric of the survivor path, an ACS circuit which performs an ACS process based on the output of said branch metric generator and the output of said path metric register every symbol interval and outputs path metric values of plural states and selecting information, a most likelihood path state detector which detects a most likelihood path having the maximum path metric value from said path metric values of plural states, a path memory which stores the selecting information of said plural states every symbol interval, and a trace back circuit which traces back to the past said path memory for only “g” symbol every “g−f” symbols based on said most likelihood path and outputs “g−f” bits from finally reached bits as decoded data, wherein said receiving data are packet data, and a Viterbi decoding apparatus, selects said packet data by said selector during said packet data are received and also makes said selector switch to said terminal data side corresponding to that the reception of said packet data is finished and makes said branch metric generator set the branch metric corresponding to said terminal data, wherein said path memory is a ring memory which stores said selecting information of “2f+g” symbols.
Claim 11
Dependent Claim 250 words
A Viterbi decoding apparatus, which provides a selector which switches receiving data and terminal data and outputs the selected data, a branch metric generator which the output of said selector is inputted to and obtains the metric of said inputted data, a path metric register which stores the accumulated metric of the survivor path, an ACS circuit which performs an ACS process based on the output of said branch metric generator and the output of said path metric register every symbol interval and outputs path metric values of plural states and selecting information, a most likelihood path state detector which detects a most likelihood path having the maximum path metric value from said path metric values of plural states, a path memory which stores the selecting information of said plural states every symbol interval, and a trace back circuit which traces back to the past said path memory for only “g” symbol every “g−f” symbols based on said most likelihood path and outputs “g−f” bits from finally reached bits as decoded data, wherein said receiving data are packet data, and a Viterbi decoding apparatus, selects said packet data by said selector during said packet data are received and also makes said selector switch to said terminal data side corresponding to that the reception of said packet data is finished and makes said branch metric generator set the branch metric corresponding to said terminal data, wherein said path memory is a ring memory which stores said selecting information of “2f+g” symbols.

References Cited (Backward Citations)

US5424882A Cited
US5329537A Cited
US5710784A Cited
US5710756A Cited
US5878060A Cited
US5982818A Cited
US6317471B1 Cited
US5987638A Cited
US6199191B1 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2005-06-17 2005-12-17 2006-06-18 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2009-06-17 2009-12-17 2010-06-18 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2013-06-17 2013-12-17 2014-06-18 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag