Patent US5550870A successfully refreshed from Google Patents.
US5550870A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Viterbi processor
Assignee: Nokia of America Corp
•
Filing: 1994-03-02
•
Granted: 1996-08-27
•
Expires: 2014-03-02
Abstract
Abstract A digital signal processor with an embedded error correcting coprocessor (ECCP) is disclosed. The ECCP provides soft symbol Viterbi decoded outputs which have the absolute value of the accumulated cost difference of competing states concatenated with the traceback bit or most significant bit of the next state.
Inventors
- 👤 David M. Blaker
- 👤 Gregory S. Ellard
- 👤 Mohammad S. Mobin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 16:42
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/37; H03M13/39; H03M13/41; H03M13/4161; H03M13/4169; H03M13/25; H03M13/256; H03M13/3961; H03M13/4138; H03M13/65; H03M13/6577; H03M13/6591
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
55 words
A method of trellis decoding comprising: determining a set of two or more branch metric components, X1 and XQ; determining if any of said branch metric components X1, XQ of said set exceeds a predetermined saturation value; setting any branch metric component of said set which exceeds said predetermined value to said predetermined saturation value.
Claim 2
Independent Claim
55 words
A method of trellis decoding comprising: determining a set of two or more branch metric components, X1 and XQ; determining if any of said branch metric components X1, XQ of said set exceeds a predetermined saturation value; setting any branch metric component of said set which exceeds said predetermined value to said predetermined saturation value.
Claim 3
Dependent Claim
12 words
The method of claim 1 in which said predetermined value is OXFF.
Claim 4
Independent Claim
95 words
A method of trellis decoding comprising: determining two or more branch metric values associated with state transitions in a Viterbi trellis; said branch metric values having a maximum of n bits; forming a k bit number associated with each of said branch metric value by: if k<n, discarding the n-k least significant bits; if k>n, shifting each of said branch metric bits so that their most significant bits is the k th bit position and concentrating zeros in the least significant bit positions, thereby obtaining two to more modified branch metrics, each having k bits.
Claim 5
Independent Claim
95 words
A method of trellis decoding comprising: determining two or more branch metric values associated with state transitions in a Viterbi trellis; said branch metric values having a maximum of n bits; forming a k bit number associated with each of said branch metric value by: if k<n, discarding the n-k least significant bits; if k>n, shifting each of said branch metric bits so that their most significant bits is the k th bit position and concentrating zeros in the least significant bit positions, thereby obtaining two to more modified branch metrics, each having k bits.
Claim 6
Dependent Claim
80 words
The method of claim 3 further including: adding each of said modified branch metrics to an appropriate accumulated cost, thereby obtaining two updated accumulated costs, having j bits, j>n; subtracting one of said updated accumulated costs from the other, thereby obtaining an accumulated cost difference; taking the absolute value of said accumulated cost difference; discarding a predetermined number of the most significant bits of said absolute value of said accumulated cost difference thereby obtaining a modified absolute accumulated cost difference.
Claim 7
Dependent Claim
78 words
The method of claim 4 further including: determining the traceback bit for each symbol instant associated with said Viterbi trellis; and, if traceback bit is a 1, concentrating said traceback bit at the MSB with said modified absolute accumulated cost difference, thereby obtaining a soft symbol output; and if said traceback bit is 0, concentrating said traceback bit at the MSB with the ones complement of said modified absolute accumulated cost difference, thereby obtaining a soft symbol output.
Claim 8
Dependent Claim
28 words
The method of claim 4 in which n=17, k=16, j=24 and said accumulated cost difference has 24 bits and said modified absolute accumulated cost difference has 7 bits.
Claim 9
Dependent Claim
114 words
The method of claim 4 further including: determining the most significant bit of another state of the Viterbi trellis for each symbol instant and, if said most significant bit of the said another state of the Viterbi trellis is a 1, concatenating said most significant bit of the said another state Viterbi trellis with said modified absolute accumulated cost difference, thereby obtaining a soft symbol output; and if said most significant bit of the said another state of the Viterbi is a 0, concatenating said most significant bit of the said another state of the Viterbi trellis with a ones complement of said modified absolute accumulated cost difference, thereby obtaining a soft symbol output.
References Cited (Backward Citations)
US4240156A
Cited
US4346473A
Cited
US4493082A
Cited
US5065411A
Cited
EP0413505A1
Cited
US5144644A
Cited
EP0430428A2
Cited
EP0467522A2
Cited
US5134635A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-08-27 | 2000-02-26 | 2000-08-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-08-27 | 2004-02-26 | 2004-08-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-08-27 | 2008-02-26 | 2008-08-27 | $7700.00 | Window Closed / Lapsed |