Channel encoder for generating rotationally invariant trellis codes

• US 4,891,823 A
• Filed: 10/26/1988
• Issued: 01/02/1990
• Est. Priority Date: 10/26/1988
• Status: Expired due to Fees

• Current Assignee: PC-TEL Incorporated
• Original Assignee: General DataComm, Inc. (General DataComm Industries, Inc.)
• Inventors: Cole, Paul D.
• Primary Examiner(s): Griffin, Robert L.
• Assistant Examiner(s): Chin, Stephen
• Application Number:
  US07/262,714
• Time in Patent Office: 433 Days
• Field of Search: 375/25, 375/34, 375/37, 375/39, 375/42, 371/43, 371/44, 371/45, 341/81, 341/95, 341/106
• US Class Current: 375/242
• CPC Class Codes: H04L 27/3427 in which the constellation is the n - fold Cartesian product of a single underlying two-dimensional constellation

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.

Claims

1. 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.

2. 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.

3. An encoder according to claim 2, wherein:

said state means is arranged to assume twenty-four states s.

4. An encoder according to claim 2, wherein:

said state means is arranged to assume forty-eight states s.