Patent US6205186B1 successfully refreshed from Google Patents.
US6205186B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Decoding with partial state information on a convolutionally encoded channel
Assignee: Qualcomm Inc
•
Filing: 1997-09-03
•
Granted: 2001-03-20
•
Expires: 2017-09-03
Abstract
Abstract The certainties of transmitted bits at predetermined locations in time are determine a priori. This information is then used to set the states of a Viterbi decoder to different state metrics in accordance with the certainties of the transmitted bits. High certainty of a transmitted bit results in resetting the states corresponding to that bit to a high state metric. In contrast, low certainty of a transmitted bit results in resetting the states corresponding to that bit to a low state metric. Resetting the states to different state metrics improves the decoding performance and shortens the time required to converge the decoding trellis by eliminating improbable paths.
Inventors
- 👤 Brian K. Butler
- 👤 Gwain Bayley
- 👤 David Hansquine
- 👤 Edward G. Tiedemann, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 14:51
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0071; H03; H03M; H03M13/00; H03M13/37; H03M13/39; H03M13/3961; H03M13/3988; H03M13/41; H03M13/4107; H03M13/63; H03M13/6325; H03M13/65; H03M13/6508; H03M13/6577; H03M13/6583; H04L1/0045; H04L1/0054
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
46 words
A method for decoding convolutionally encoded channel comprising the steps of: determining certainties of transmitted bits at predetermined locations in time; resetting states within a Viterbi decoder corresponding to said transmitted bits with state metrics corresponding to said certainties; decoding said channel with said state metrics.
Claim 2
Independent Claim
46 words
A method for decoding convolutionally encoded channel comprising the steps of: determining certainties of transmitted bits at predetermined locations in time; resetting states within a Viterbi decoder corresponding to said transmitted bits with state metrics corresponding to said certainties; decoding said channel with said state metrics.
Claim 3
Dependent Claim
33 words
The method of claim 1 wherein states within said Viterbi decoder corresponding to said transmitted bits are reset to a very good state metric corresponding to a high certainty for said transmitted bits.
Claim 4
Dependent Claim
33 words
The method of claim 1 wherein states within said Viterbi decoder corresponding to said transmitted bits are reset to a very bad state metric corresponding to a low certainty for said transmitted bits.
Claim 5
Dependent Claim
19 words
The method of claim 1 wherein certainties of four transmitted bits at said predetermined locations in time are determined.
Claim 6
Dependent Claim
19 words
The method of claim 1 wherein certainties of three transmitted bits at said predetermined locations in time are determined.
Claim 7
Dependent Claim
26 words
The method of claim 1 further comprising the step of: setting a predetermined number of bits at said predetermined locations in time to zero padding bits.
Claim 8
Dependent Claim
13 words
The method of claim 6 wherein said predetermined number of bits is four.
Claim 9
Dependent Claim
13 words
The method of claim 6 wherein said predetermined number of bits is three.
Claim 10
Dependent Claim
22 words
The method of claim 1 wherein certainties of four transmitted bits immediately prior to a start of an assigned slot are determined.
Claim 11
Dependent Claim
22 words
The method of claim 1 wherein certainties of three transmitted bits immediately prior to a start of an assigned slot are determined.
Claim 12
Dependent Claim
29 words
The method of claim 1 further comprising the step of: setting a predetermined number of bits immediately prior to a start of an assigned slot to zero padding bits.
Claim 13
Dependent Claim
13 words
The method of claim 11 wherein said predetermined number of bits is four.
Claim 14
Dependent Claim
13 words
The method of claim 11 wherein said predetermined number of bits is three.
Claim 15
Independent Claim
54 words
A method for decoding convolutionally encoded paging channel in an IS95 communication system comprising the steps of: determining certainties of transmitted bits immediately prior to an assigned slot; resetting states within a Viterbi decoder corresponding to said transmitted bits with state metrics corresponding to said certainties; decoding said paging channel with said state metrics.
Claim 16
Independent Claim
54 words
A method for decoding convolutionally encoded paging channel in an IS95 communication system comprising the steps of: determining certainties of transmitted bits immediately prior to an assigned slot; resetting states within a Viterbi decoder corresponding to said transmitted bits with state metrics corresponding to said certainties; decoding said paging channel with said state metrics.
Claim 17
Dependent Claim
33 words
The method of claim 14 wherein states within said Viterbi decoder corresponding to said transmitted bits are reset to a very good state metric corresponding to a high certainty for said transmitted bits.
Claim 18
Dependent Claim
33 words
The method of claim 14 wherein states within said Viterbi decoder corresponding to said transmitted bits are reset to a very bad state metric corresponding to a low certainty for said transmitted bits.
Claim 19
Dependent Claim
19 words
The method of claim 14 wherein certainties of four transmitted bits immediately prior to said assigned slot are determined.
Claim 20
Dependent Claim
19 words
The method of claim 14 wherein certainties of three transmitted bits immediately prior to said assigned slot are determined.
Claim 21
Dependent Claim
35 words
The method of claim 14 wherein state 0 through 15 within said Viterbi decoder are reset to a very good state metric and states 16 through 255 are reset to a very bad state metric.
Claim 22
Dependent Claim
35 words
The method of claim 14 wherein state 0 through 31 within said Viterbi decoder are reset to a very good state metric and states 32 through 255 are reset to a very bad state metric.
Claim 23
Dependent Claim
75 words
The method of claim 14 wherein state 0 through 7 within said Viterbi decoder are reset to a best state metric, states 8 through 15 are reset to a very good metric, states 16 through 31 are reset to a good metric, states 32 through 63 are reset to a medium metric, states 64 through 127 are reset to a very bad metric, and states 128 through 255 are reset to a worst state metric.
Claim 24
Dependent Claim
26 words
The method of claim 14 further comprising the step of: transmitting at least a predetermined number of padding bits immediately prior to said assigned paging slot.
Claim 25
Dependent Claim
42 words
The method of claim 14 further comprising the step of: transmitting at least a predetermined number of padding bits immediately prior to said assigned paging slot when a start of said assigned paging slot coincides with a start of a paging message.
Claim 26
Dependent Claim
13 words
The method of claim 23 wherein said predetermined number of bit is four.
Claim 27
Dependent Claim
13 words
The method of claim 23 wherein said predetermined number of bit is three.
Claim 28
Dependent Claim
42 words
The method of claim 14 further comprising the step of: transmitting a paging channel message capsule at a next available paging channel half frame if less than a predetermined number of padding bits are transmitted immediately prior to said assigned paging slot.
Claim 29
Dependent Claim
11 words
The method of claim 26 wherein said predetermined number is four.
Claim 30
Dependent Claim
11 words
The method of claim 26 wherein said predetermined number is three.
Claim 31
Dependent Claim
53 words
The method of claim 14 wherein K sets of state are reset with up to K state metrics in accordance with said determined certainty of each of K−1 transmitted bits immediately prior to said assigned paging slot, wherein K is a constraint length of a convolutional encoder used to encode said paging channel.
Claim 32
Dependent Claim
9 words
The method of claim 29 wherein K is 9.
References Cited (Backward Citations)
US5566206A
Cited
US5673291A
Cited
US5687188A
Cited
US5712880A
Cited
US6029268A
Cited
US6044069A
Cited
US5912908A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-03-19 | 2004-09-18 | 2005-03-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-03-19 | 2008-09-18 | 2009-03-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-03-19 | 2012-09-18 | 2013-03-20 | $7700.00 | Window Closed / Lapsed |