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

Channel encoder for generating rotationally invariant trellis codes

Assignee: PCTel Inc
•
Filing: 1988-10-26
•
Granted: 1990-01-02
•
Expires: 2008-10-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An encoder is provided for generating rotationally invariant trellis codes when used with a signal constellation having m subconstellations indexed by j, each subconstellation having a plurality of points, where each subconstellation is a distinct rotation by j(360/m) degrees of another subconstellation such that no subconstellation has a point in common with another subconstellation. The encoder has a state block and a state update block. The state means receives q inputs i, and generates m outputs j, where m=pq and where p and q are integers greater than one and have no common factors. Outputs m are generated according to inputs i and states s of the state block according to j=i mod q and jd=s mod p, where the state block can assume n states, and n=md where d is an integer greater than one and has no common factors with p. The state update block updates the state block to a new state t chosen from the allowable n states based on the output j and previous state s according to t=jd+F(s-jd) mod n, where F is the permutation of 0, . . . , n-1, and is a function given by F(am+b)=bd+a for a=0, . . . , d-1, and for b=0, . . . , m-1.

Inventors

  • 👤 Paul D. Cole

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-28 09:34
CPC Classifications
H; H04; H04L; H04L27/00; H04L27/32; H04L27/34; H04L27/3405; H04L27/3416; H04L27/3427

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 185 words
An encoder for coding data intended for transmission over a channel, comprising: state means for receiving inputs i of said data, where i=0, . . . , q-1, and where q is an integer greater than one, and for generating outputs j, where j=0, . . . , m-1 and m=pq where p is an integer greater than one and has no common factors with q, said outputs generated according to said inputs i and states s of said state means according to j=i mod q and jd=s mod p, where s=0, . . . , n-1 and n=md where d is an integer greater than one and has no common factors with p; and state update means for updating said state means to a new state t chosen from said 0, . . . , n-1 based on said ouput j and previous state s according to t=jd+F(s-jd) mod n, where F is the permutation of 0, . . . , n-1 and is a function given by F(am+b)=bd+a for a=0, . . . , d-1, and for b=0, . . . , m-1.
Claim 2
Dependent Claim 185 words
An encoder for coding data intended for transmission over a channel, comprising: state means for receiving inputs i of said data, where i=0, . . . , q-1, and where q is an integer greater than one, and for generating outputs j, where j=0, . . . , m-1 and m=pq where p is an integer greater than one and has no common factors with q, said outputs generated according to said inputs i and states s of said state means according to j=i mod q and jd=s mod p, where s=0, . . . , n-1 and n=md where d is an integer greater than one and has no common factors with p; and state update means for updating said state means to a new state t chosen from said 0, . . . , n-1 based on said ouput j and previous state s according to t=jd+F(s-jd) mod n, where F is the permutation of 0, . . . , n-1 and is a function given by F(am+b)=bd+a for a=0, . . . , d-1, and for b=0, . . . , m-1.
Claim 3
Dependent Claim 30 words
An encoder according to claim 1, wherein: said state means is arranged to accept two inputs i, to generate six outputs j, and to assume at least twelve states s.
Claim 4
Dependent Claim 17 words
An encoder according to claim 2, wherein: said state means is arranged to assume twenty-four states s.
Claim 5
Dependent Claim 17 words
An encoder according to claim 2, wherein: said state means is arranged to assume forty-eight states s.

References Cited (Backward Citations)

US4338284A Cited
US4755998A Cited
US4756007A Cited
US4631735A Cited
US4677625A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-01-01 1993-07-03 1994-01-02 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-01-01 1997-07-03 1998-01-02 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-01-01 2001-07-03 2002-01-02 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag