Patent US5486825A successfully refreshed from Google Patents.
US5486825A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Convolutional encoders for modems which implement the "Cole code"
Assignee: PCTel Inc
•
Filing: 1994-04-20
•
Granted: 1996-01-23
•
Expires: 2014-04-20
Abstract
Abstract A sixty-four state convolutional code known as the "Cole code" is disclosed and take systematic and non-systematic forms. The state variables of the Cole code are r(n-1), r(n-2), s(n-1), s(n-2), p(n-1), and x(n-1). In the four-to-five non-systematic form, four inputs p(n), q(n), r(n) and s(n) are used to generate five outputs y 4 (n), y 3 (n), y 2 (n), y 1 (n), and y 0 (n) according to: y 4 (n)=q(n); y 3 (n)=p(n)+r(n)r(n-1)+r(n-2)+r(n-1)s(n)+r(n-1)s(n-2); y 2 (n)=r(n-1)+s(n)+s(n-2); y 1 (n)=r(n)+r(n-1)r(n-2)+p(n-1)+p(n-2)+q(n-1); and y 0 (n)=s(n-1), where p(n-2)+q(n-1)=x(n-1). New state variables are obtained directly from the inputs and from the previous state variables, except for x(n) which is equals q(n)+p(n-1). In a three-to-four non-systematic implementation of the Cole code, q(n) is not input, y 4 is not output, and q(n-1) is set equal to zero. In the four-to-five systematic form of the Cole code, the inputs y 4 , y 3 , y 2 , y 1 are taken as outputs and are also used on conjunction with the convolutional encoder to generate a fifth output y 0 . With state variables x(n-1), p(n-1), r(n-1), r(n-2), s(n-1), s(n-2) relabled as w 1 , w 2 , w 3 , w 4 , w 5 , and w 6 , output y 0 is taken as state variable w 5 . The state variables are updated according to: new w 6 =w 5 ; new w 5 =y 2 +w 3 +w 6 ; new w 4 =w 3 ; new w 3 =y 1 +w 3 w 4 +w 2 +w 1 ; new w 2 =y 3 +(new w 3 )w 3 +w 4 +w 3 (new w 5 )+w 3 w 6 ; and new w 1 =y 4 +w 2 . In the three-to-four systematic Cole code, y 4 is taken as zero.
Inventors
- 👤 Paul D. Cole
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 22:52
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/03; H03M13/23; H03M13/235; H03M13/25; H03M13/256; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/497; H04L27/00; H04L27/32; H04L27/34; H04L27/3405; H04L27/3416; H04L27/3427; H04L27/3438
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
288 words
A sixty-four state convolutional encoder for a non-systematic encoder of a modem, said sixty-four state convolutional encoder receiving at least three inputs p(n), r(n) and s(n), and having a current state, comprising: a) state means for storing the current state of the convolutional encoder, the current state being defined by six state variables, said six state variables being r(n-1), r(n-2), s(n-1), s(n-2), p(n-1), and x(n-1), where x(n-1) is equal to the sum of p(n-2) plus a first variable, where the first variable is zero when said at least three inputs constitutes exactly three inputs; b) means for updating the current state of the convolutional encoder to a new state by updating said six state variables from old values to new values, where the new value for state variable r(n-1) is the old value of input r(n), the new value for state variable r(n-2) is the old value of state variable r(n-1), the new value for state variable s(n-1) is the old value of input s(n), the new value for state variable s(n-2) is the old value of state variable s(n-1), the new value for state variable p(n-1) is the old value for input p(n), and the new value for state variable x(n-1) is equal to the sum of the old value for state variable p(n-1) plus a second variable, where the second variable is zero when said at least three inputs constitute exactly three inputs; and c) means for generating at least four outputs y 3 (n), y 2 (n), y 1 (n), and y 0 (n) from said six state variables of said current state and from said at least three inputs according to at least four output equations y.sub.3 (n)=p(n)+r(n)r(n-1)+r(n-2)+r(n-1)s(n)+r(n-1)s(n-2) y.sub.2 (n)=r(n-1)+s(n)+s(n-2) y.sub.1 (n)=r(n)+r(n-1)r(n-2)+p(n-1)+p(n-2)+q(n-1) y.sub.0 (n)=s(n-1).
Claim 2
Dependent Claim
288 words
A sixty-four state convolutional encoder for a non-systematic encoder of a modem, said sixty-four state convolutional encoder receiving at least three inputs p(n), r(n) and s(n), and having a current state, comprising: a) state means for storing the current state of the convolutional encoder, the current state being defined by six state variables, said six state variables being r(n-1), r(n-2), s(n-1), s(n-2), p(n-1), and x(n-1), where x(n-1) is equal to the sum of p(n-2) plus a first variable, where the first variable is zero when said at least three inputs constitutes exactly three inputs; b) means for updating the current state of the convolutional encoder to a new state by updating said six state variables from old values to new values, where the new value for state variable r(n-1) is the old value of input r(n), the new value for state variable r(n-2) is the old value of state variable r(n-1), the new value for state variable s(n-1) is the old value of input s(n), the new value for state variable s(n-2) is the old value of state variable s(n-1), the new value for state variable p(n-1) is the old value for input p(n), and the new value for state variable x(n-1) is equal to the sum of the old value for state variable p(n-1) plus a second variable, where the second variable is zero when said at least three inputs constitute exactly three inputs; and c) means for generating at least four outputs y 3 (n), y 2 (n), y 1 (n), and y 0 (n) from said six state variables of said current state and from said at least three inputs according to at least four output equations y.sub.3 (n)=p(n)+r(n)r(n-1)+r(n-2)+r(n-1)s(n)+r(n-1)s(n-2) y.sub.2 (n)=r(n-1)+s(n)+s(n-2) y.sub.1 (n)=r(n)+r(n-1)r(n-2)+p(n-1)+p(n-2)+q(n-1) y.sub.0 (n)=s(n-1).
Claim 3
Dependent Claim
75 words
A sixty-four state convolutional encoder according to claim 1, wherein: said means for updating includes first delay means for delaying s(n) to obtain s(n-1), a second delay means for delaying s(n-1) to obtain s(n-2), a third delay means for delaying r(n) to obtain r(n-1), a fourth delay means for delaying r(n-1) to obtain r(n-2), a fifth delay means for delaying p(n) to obtain p(n-1), and a sixth delay means for delaying p(n-1) to obtain p(n-2).
Claim 4
Dependent Claim
36 words
A sixty-four state convolutional encoder according to claim 2, wherein: said first delay means, second delay means, third delay means, fourth delay means, fifth delay means and sixth delay means comprise a plurality of register means.
Claim 5
Dependent Claim
27 words
A sixty-four state convolutional encoder according to claim 1, wherein: said means for generating comprises logic circuitry including means for binary addition and means for binary multiplication.
Claim 6
Dependent Claim
55 words
A sixty-four state convolutional encoder according to claim 2, wherein: said means for generating comprises logic circuitry including means for binary addition coupled to said second delay means, to said third delay means, to said fourth delay means, and to said fifth delay means, and means for binary multiplication coupled to said third delay means.
Claim 7
Dependent Claim
23 words
A sixty-four state convolutional encoder according to claim 1, wherein: said means for binary multiplication is further coupled to said fourth delay means.
Claim 8
Dependent Claim
50 words
A sixty-four state convolutional encoder according to claim 1, wherein: said means for updating comprises a look-up table, with said six state variables and said at least three inputs constituting addressing means for said look-up table, and said look-up table storing said new state variables as a function of address.
Claim 9
Dependent Claim
57 words
A sixty-four state convolutional encoder according to claim 1, wherein: said at least three inputs includes a fourth input q(n), said first variable is q(n-1), said second variable is the old value of the fourth input q(n), said at least four outputs includes a fifth output y 4 (n), and said output equations include y 4 (n)=q(n).
Claim 10
Dependent Claim
86 words
A sixty-four state convolutional encoder according to claim 8, wherein: said means for updating includes a first delay means for delaying s(n) to obtain s(n-1), a second delay means for delaying s(n-1) to obtain s(n-2), a third delay means for delaying r(n) to obtain r(n-1), a fourth delay means for delaying r(n-1) to obtain r(n-2), a fifth delay means for delaying p(n) to obtain p(n-1), a sixth delay means for delaying p(n-1) to obtain p(n-2), and a seventh delay means for delaying q(n) to obtain q(n-1).
Claim 11
Dependent Claim
190 words
A sixty-four state convolutional encoder for a systematic encoder of a modem, said sixty-four state convolutional encoder receiving at least three inputs y 1 , y 2 , and y 3 , and having a current state, comprising: a) state means for storing the current state of the convolutional encoder, the current state being defined by six state variables, said six state variables being w 1 , w 2 , w 3 , w 4 , w 5 , and w 6 ; and b) means for updating the current state of the convolutional encoder to a new state by updating said six state variables respectively to new state variables according to the state equations new w.sub.6 =w.sub.5 new w.sub.5 =y.sub.2 +w.sub.3 +w.sub.6 new w.sub.4 =w.sub.3 new w.sub.3 =y.sub.1 +w.sub.3 w.sub.4 +w.sub.2 +w.sub.1 new w.sub.2 =y.sub.3 +(new w.sub.3)w.sub.3 +w.sub.4 +w.sub.3 (new w.sub.5)+w.sub.3 w.sub.6 new w.sub.1 =y.sub.4 +w.sub.2 where y 4 is a variable equal to zero when said at least three inputs comprises exactly three inputs, wherein an output y 0 of said sixty-four state convolutional encoder is taken as equal to state variable w 5 of said current state.
Claim 12
Dependent Claim
190 words
A sixty-four state convolutional encoder for a systematic encoder of a modem, said sixty-four state convolutional encoder receiving at least three inputs y 1 , y 2 , and y 3 , and having a current state, comprising: a) state means for storing the current state of the convolutional encoder, the current state being defined by six state variables, said six state variables being w 1 , w 2 , w 3 , w 4 , w 5 , and w 6 ; and b) means for updating the current state of the convolutional encoder to a new state by updating said six state variables respectively to new state variables according to the state equations new w.sub.6 =w.sub.5 new w.sub.5 =y.sub.2 +w.sub.3 +w.sub.6 new w.sub.4 =w.sub.3 new w.sub.3 =y.sub.1 +w.sub.3 w.sub.4 +w.sub.2 +w.sub.1 new w.sub.2 =y.sub.3 +(new w.sub.3)w.sub.3 +w.sub.4 +w.sub.3 (new w.sub.5)+w.sub.3 w.sub.6 new w.sub.1 =y.sub.4 +w.sub.2 where y 4 is a variable equal to zero when said at least three inputs comprises exactly three inputs, wherein an output y 0 of said sixty-four state convolutional encoder is taken as equal to state variable w 5 of said current state.
Claim 13
Dependent Claim
70 words
A sixty-four state convolutional encoder according to claim 10, wherein: said means for updating includes a first delay means for delaying w 1 , a second delay means for delaying w 2 , a third delay means for delaying w 3 , a fourth delay means for delaying w 4 , a fifth delay means for delaying w 5 , and a sixth delay means for delaying w 6 .
Claim 14
Dependent Claim
28 words
A sixty-four state convolutional encoder according to claim 11, wherein: said means for updating further comprises logic circuitry including means for binary addition and means for binary multiplication.
Claim 15
Dependent Claim
61 words
A sixty-four state convolutional encoder according to claim 12, wherein: said means for binary addition are coupled to said first delay means, to said second delay means, to said third delay means, to said fourth delay means, to said fifth delay means, and to said sixth delay means, and said means for binary multiplication are coupled to said third delay means.
Claim 16
Dependent Claim
26 words
A sixty-four state convolutional encoder according to claim 13, wherein: said means for binary multiplication are further coupled to an input to said fifth delay means.
Claim 17
Dependent Claim
28 words
A sixty-four state convolutional encoder according to claim 10, wherein: said at least three inputs includes a fourth input, said fourth input being said variable y 4 .
Claim 18
Dependent Claim
50 words
A sixty-four state convolutional encoder according to claim 10, wherein: said means for updating comprises a look-up table, with said six state variables and said at least three inputs constituting addressing means for said look-up table, and said look-up table storing said new state variables as a function of address.
References Cited (Backward Citations)
US4713817A
Cited
US5113412A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-01-22 | 1999-07-24 | 2000-01-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-01-22 | 2003-07-24 | 2004-01-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-01-22 | 2007-07-24 | 2008-01-23 | $7700.00 | Window Closed / Lapsed |