Patent US5229767A successfully refreshed from Google Patents.
US5229767A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Decoder for convolutionally encoded information
Assignee: Motorola Solutions Inc
•
Filing: 1991-09-05
•
Granted: 1993-07-20
•
Expires: 2011-09-05
Abstract
Abstract In a Viterbi Algorithm decoder (204) as used to decode convolutionally encoded information, reliability information is developed for various path discard decisions made within the Viterbi Algorithm. These decisions are made for discard opportunities that impact one or more error detection windows (601). Based upon these metrics, a reliability factor sequence can be provided and compared against a fixed (or varying) threshold. When unreliability appears, appropriate action can be taken. For example, all of the information can be discarded, or only certain portions of the information can be discarded, as appropriate to the particular application.
Inventors
- 👤 Eric H. Winter
- 👤 Ira A. Gerson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 14:31
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/37; H03M13/39; H03M13/41
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
83 words
A method for decoding convolutionally encoded information, comprising the steps of: A) receiving a convolutionally encoded stream of information; B) providing a decoder; C) for a predetermined portion of the stream of information, using the decoder to identify a decoded information sequence; D) determining reliability for part, but not all, of the decoded information sequence, by considering, at least in part, reliability of path discard decisions; E) when the reliability is less than a predetermined threshold, taking a predetermined action in response thereto.
Claim 2
Independent Claim
83 words
A method for decoding convolutionally encoded information, comprising the steps of: A) receiving a convolutionally encoded stream of information; B) providing a decoder; C) for a predetermined portion of the stream of information, using the decoder to identify a decoded information sequence; D) determining reliability for part, but not all, of the decoded information sequence, by considering, at least in part, reliability of path discard decisions; E) when the reliability is less than a predetermined threshold, taking a predetermined action in response thereto.
Claim 3
Dependent Claim
24 words
The method of claim 1, wherein the predetermined portion of the stream of information represents a frame of the convolutionally encoded stream of information.
Claim 4
Dependent Claim
15 words
The method of claim 2 wherein the frame begins and ends with predetermined information values.
Claim 5
Dependent Claim
57 words
The method of claim 1 wherein the step of using the decoder includes the step of: C1) from time to time discarding a first information path in favor of a second information path; and C2) determining reliability for the first information path and the second information path; wherein the decoded information sequence includes the second information path.
Claim 6
Dependent Claim
35 words
The method of claim 4, wherein the step of determining reliability of the decoded information sequence includes the step of considering the reliability previously determined for the first information path and the second information path.
Claim 7
Dependent Claim
44 words
The method of claim 5, wherein the step of considering the reliability previously determined for the first information path and the second information path includes the step of comparing the determined reliability for each of the first and second information paths against one another.
Claim 8
Dependent Claim
27 words
The method of claim 1, wherein the part of the decoded information sequence for which reliability is determined comprises a predetermined portion of the decoded information sequence.
Claim 9
Dependent Claim
22 words
The method of claim 1, wherein reliability is determined for that part of the decoded information sequence that includes particularly critical information.
Claim 10
Dependent Claim
23 words
The method of claim 1, wherein the predetermined action includes discarding at least part of the information represented by the decoded information sequence.
Claim 11
Dependent Claim
25 words
The method of claim 1, wherein the predetermined action includes discarding all of the information contained within the predetermined portion of the stream of information.
Claim 12
Independent Claim
144 words
A method for decoding convolutionally encoded information, which convolutionally encoded information is provided on a frame-by-frame basis, comprising the steps of: A) receiving a frame of the convolutionally encoded information; B) providing a Viterbi Algorithm decoder; C) for the frame, using the Viterbi Algorithm decoder to identify a decoded information sequence by: i) from time to time discarding a first information path in favor of a second information path; ii) determining reliability for the first information path and the second information path; wherein the decoded information sequence includes the second information path; D) determining reliability for part, but not all, of the decoded information sequence by comparing the reliability for the second information path against the reliability for the first information path; E) when the reliability of the decoded information sequence is less than a predetermined threshold, taking a predetermined action in response thereto.
Claim 13
Independent Claim
144 words
A method for decoding convolutionally encoded information, which convolutionally encoded information is provided on a frame-by-frame basis, comprising the steps of: A) receiving a frame of the convolutionally encoded information; B) providing a Viterbi Algorithm decoder; C) for the frame, using the Viterbi Algorithm decoder to identify a decoded information sequence by: i) from time to time discarding a first information path in favor of a second information path; ii) determining reliability for the first information path and the second information path; wherein the decoded information sequence includes the second information path; D) determining reliability for part, but not all, of the decoded information sequence by comparing the reliability for the second information path against the reliability for the first information path; E) when the reliability of the decoded information sequence is less than a predetermined threshold, taking a predetermined action in response thereto.
Claim 14
Dependent Claim
41 words
The method of claim 11, wherein reliability for the first information path and the second information path is determined only when the first and second information paths are positioned to influence reliability within a predetermined window of the decoded information sequence.
Claim 15
Dependent Claim
23 words
The method of claim 12, wherein the predetermined window is positioned, with respect to the decoded information sequence, to include particularly critical information.
Claim 16
Dependent Claim
25 words
The method of claim 13, wherein the predetermined action includes discarding all of the information contained within the predetermined portion of the stream of information.
Claim 17
Dependent Claim
105 words
A decoder, comprising: A) input means for receiving a convolutionally encoded stream of information; B) Viterbi Algorithm decoder means operably coupled to the input means for: i) receiving the convolutionally encoded stream of information; ii) using a Viterbi Algorithm to identify a decoded information sequence for a predetermined portion of the stream of information; iii) determining reliability for part, but not all, of the decoded information sequence, by considering, at least in part, reliability of path discard decisions; C) control means operably coupled to the Viterbi Algorithm decoder means for receiving information regarding the reliability, and for automatically initiating a predetermined action in response thereto.
Claim 18
Dependent Claim
105 words
A decoder, comprising: A) input means for receiving a convolutionally encoded stream of information; B) Viterbi Algorithm decoder means operably coupled to the input means for: i) receiving the convolutionally encoded stream of information; ii) using a Viterbi Algorithm to identify a decoded information sequence for a predetermined portion of the stream of information; iii) determining reliability for part, but not all, of the decoded information sequence, by considering, at least in part, reliability of path discard decisions; C) control means operably coupled to the Viterbi Algorithm decoder means for receiving information regarding the reliability, and for automatically initiating a predetermined action in response thereto.
Claim 19
Dependent Claim
23 words
The decoder of claim 15, wherein the predetermined action includes discarding at least some of the information represented by the decoded information sequence.
Claim 20
Dependent Claim
152 words
A decoder, comprising: A) input means for receiving a convolutionally encoded stream of information; B) Viterbi Algorithm decoder means operably coupled to the input means for: i) receiving the convolutionally encoded stream of information; ii) using a Viterbi Algorithm to identify a decoded information sequence for a predetermined portion of the stream of information by: a) from time to time discarding a first information path in favor of a second information path; b) determining reliability for the first information path and the second information path; wherein the decoded information sequence includes the second information path; iii) determining reliability for part, but not all, of the decoded information sequence, by comparing the reliability for the second information path against the reliability for the first information path; C) control means operably coupled to the Viterbi Algorithm decoder means for receiving information regarding the reliability, and for automatically initiating a predetermined action in response thereto.
Claim 21
Dependent Claim
152 words
A decoder, comprising: A) input means for receiving a convolutionally encoded stream of information; B) Viterbi Algorithm decoder means operably coupled to the input means for: i) receiving the convolutionally encoded stream of information; ii) using a Viterbi Algorithm to identify a decoded information sequence for a predetermined portion of the stream of information by: a) from time to time discarding a first information path in favor of a second information path; b) determining reliability for the first information path and the second information path; wherein the decoded information sequence includes the second information path; iii) determining reliability for part, but not all, of the decoded information sequence, by comparing the reliability for the second information path against the reliability for the first information path; C) control means operably coupled to the Viterbi Algorithm decoder means for receiving information regarding the reliability, and for automatically initiating a predetermined action in response thereto.
Claim 22
Dependent Claim
23 words
The decoder of claim 17, wherein the predetermined action includes discarding at least some of the information represented by the decoded information sequence.
References Cited (Backward Citations)
US4110735A
Cited
US4119945A
Cited
US4369512A
Cited
US4805174A
Cited
US4823346A
Cited
US5113400A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-07-19 | 1997-01-18 | 1997-07-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-07-19 | 2001-01-18 | 2001-07-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-07-19 | 2005-01-18 | 2005-07-20 | $7700.00 | Window Closed / Lapsed |