← Back to Patent Explorer
US6199191B1 Expired / Lapsed US ⏱️ 0.0 years remaining

Viterbi decoding method and device thereof

Assignee: Canon Inc
•
Filing: 1998-06-11
•
Granted: 2001-03-06
•
Expires: 2018-06-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A Viterbi decoding method for decoding a received signal, doing an ACS process and a trace back process a first number of times, and doing the ACS process a second number of times and the trace back process the first number of times until the trace back process is complete for all of the bits to be decoded if the tracing back has not already been finished for all bits, the Viterbi decoding method further including: after the trace back processing has finished for all of the bits to be decoded, deciding a fame error based on the result of calculating a Hamming distance between the received signal and re-encoded decoded signal, and possibly changing the first number and/or the second number depending on value stored in a counter which signifies the condition of the frame error for the past several times.

Inventors

  • 👤 Jun Iwata

Bibliographic Details

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

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 132 words
An improved Viterbi decoding method for decoding a received signal by doing an ACS process and a trace back process a first number of times, and doing the ACS process a second number of times and the trace back process the first number of times until the trace back process is complete for all bits to be decoded, wherein the improvement comprises: after the trace back processing has finished for all of the bits to be decoded, deciding a frame error based on the result of calculating a Hamming distance between the received signal and a re-encoded decoded signal; and changing the first number or the second number based on the frame error and a value of a counter which signifies the condition of the frame error for the past several times.
Claim 2
Dependent Claim 132 words
An improved Viterbi decoding method for decoding a received signal by doing an ACS process and a trace back process a first number of times, and doing the ACS process a second number of times and the trace back process the first number of times until the trace back process is complete for all bits to be decoded, wherein the improvement comprises: after the trace back processing has finished for all of the bits to be decoded, deciding a frame error based on the result of calculating a Hamming distance between the received signal and a re-encoded decoded signal; and changing the first number or the second number based on the frame error and a value of a counter which signifies the condition of the frame error for the past several times.
Claim 3
Dependent Claim 45 words
A Viterbi decoding method as claimed in claim 1 , wherein the step for changing the first number or the second number changes them when there is no frame error and when the value of the counter is more than an upper limit threshold value.
Claim 4
Dependent Claim 47 words
A Viterbi decoding method as claimed in claim 1 , wherein the step for changing the first number or the second number does not change them when there is no frame error and when the value of the counter is less than the upper limit threshold value.
Claim 5
Dependent Claim 45 words
A Viterbi decoding method as claimed in claim 1 , wherein the step for changing the first number or the second number changes them when there is a frame error and when the value of the counter is less than a lower limit threshold value.
Claim 6
Dependent Claim 47 words
A Viterbi decoding method as claimed in claim 1 , wherein the step for changing the first number or the second number does not change them when there is a frame error and when the value of the counter is more than a lower limit threshold value.
Claim 7
Dependent Claim 43 words
A Viterbi decoding method as claimed in claim 1 , wherein the step for changing the first number or the second number changes them further based on an error flag value which signifies the presence or absence of errors in the previous frame.
Claim 8
Dependent Claim 45 words
A Viterbi decoding method as claimed in claim 6 , wherein the step for changing the first number or the second number, changes them when there is no frame error and when the value of the counter is more than an upper limit threshold value.
Claim 9
Dependent Claim 47 words
A Viterbi decoding method as claimed in claim 6 , wherein the step for changing the first number or the second number, does not change them when there is no frame error and when the value of the counter is less than a upper limit threshold value.
Claim 10
Dependent Claim 45 words
A Viterbi decoding method as claimed in claim 6 , wherein the step for changing the first number or the second number, changes them when there is a frame error and when the value of the counter is less than a lower limit threshold value.
Claim 11
Dependent Claim 47 words
A Viterbi decoding method as claimed in claim 6 , wherein the step for changing the first number or the second number, does not change them when there is a frame error and when the value of the counter is more than a lower limit threshold value.
Claim 12
Dependent Claim 139 words
An improved Viterbi decoding method for decoding a received signal by doing an ACS process and a trace back process a first number of times, and doing the ACS process a second number of times and the trace back process the first number of times until the trace back process is complete for all bits to be decoded, wherein the improvement comprises: a frame error determination unit for deciding a frame error based on the result of calculating a Hamming distance between the received signal and a re-encoded decoded signal; a frame error condition counter for counting the frame error for the past frame; and a controller for deciding whether the first number or the second number changes or not based on the result of the frame error determination unit and the value of the frame error condition counter.
Claim 13
Dependent Claim 139 words
An improved Viterbi decoding method for decoding a received signal by doing an ACS process and a trace back process a first number of times, and doing the ACS process a second number of times and the trace back process the first number of times until the trace back process is complete for all bits to be decoded, wherein the improvement comprises: a frame error determination unit for deciding a frame error based on the result of calculating a Hamming distance between the received signal and a re-encoded decoded signal; a frame error condition counter for counting the frame error for the past frame; and a controller for deciding whether the first number or the second number changes or not based on the result of the frame error determination unit and the value of the frame error condition counter.
Claim 14
Dependent Claim 131 words
A Viterbi decoding method for decoding a received signal by doing an ACS process and a trace back process a first number of times, and doing the ACS process a second number of times and the trace back process the first number of times until the trace back process is complete for all bits to be decoded, wherein the improvement comprises: after the trace back processing has finished for all of the bits to be decoded, deciding a frame error based on the result of calculating a Hamming distance between the received signal and a re-encoded decoded signal; and changing the first number and the second number based on the frame error and a value of a counter which signifies the condition of the frame error for the past several times.
Claim 15
Dependent Claim 131 words
A Viterbi decoding method for decoding a received signal by doing an ACS process and a trace back process a first number of times, and doing the ACS process a second number of times and the trace back process the first number of times until the trace back process is complete for all bits to be decoded, wherein the improvement comprises: after the trace back processing has finished for all of the bits to be decoded, deciding a frame error based on the result of calculating a Hamming distance between the received signal and a re-encoded decoded signal; and changing the first number and the second number based on the frame error and a value of a counter which signifies the condition of the frame error for the past several times.
Claim 16
Dependent Claim 43 words
A Viterbi decoding method as claimed in claim 12 , wherein the step for changing the first number and the second number changes them further based on an error flag value which signifies the presence or absence of errors in the previous frame.
Claim 17
Dependent Claim 139 words
An improved Viterbi decoding method for decoding a received signal by doing an ACS process and a trace back process a first number of times, and doing the ACS process a second number of times and the trace back process the first number of times until the trace back process is complete for all bits to be decoded, wherein the improvement comprises: a frame error determination unit for deciding a frame error based on the result of calculating a Hamming distance between the received signal and a re-encoded decoded signal; a frame error condition counter for counting the frame error for the past frame; and a controller for deciding whether the first number and the second number changes or not based on the result of the frame error determination unit and the value of the frame error condition counter.
Claim 18
Dependent Claim 139 words
An improved Viterbi decoding method for decoding a received signal by doing an ACS process and a trace back process a first number of times, and doing the ACS process a second number of times and the trace back process the first number of times until the trace back process is complete for all bits to be decoded, wherein the improvement comprises: a frame error determination unit for deciding a frame error based on the result of calculating a Hamming distance between the received signal and a re-encoded decoded signal; a frame error condition counter for counting the frame error for the past frame; and a controller for deciding whether the first number and the second number changes or not based on the result of the frame error determination unit and the value of the frame error condition counter.

References Cited (Backward Citations)

US5509020A Cited
US5537445A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2004-03-05 2004-09-04 2005-03-06 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2008-03-05 2008-09-04 2009-03-06 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2012-03-05 2012-09-04 2013-03-06 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag