# US 6,731,692 B1 · Symbol encoding and decoding architecture for trellis-coded modulation in gigabit ethernet

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 6,731,692 B1
- Document ID: US6731692B1
- Status: Granted
- Kind: B1
- Application number: 09/533,922
- Filed: 2000-03-23
- Granted: 2004-05-04
- Earliest claimed: 2000-03-23
- Assignees: Agere Systems Inc.
- Inventors: Sudeep Bhoja
- Web page: https://patentgrep.com/patent/US6731692B1

## CPC

- H04L 1/006: {Trellis-coded modulation}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method of encoding a plural-bit data word as a plurality of multi-level symbols, where each of the plurality of multi-level symbols has a value selected from a predetermined plurality of levels. The method includes first translating each one of the selected bit positions of the plural-bit data word to one of the levels. When the contents of a predetermined one of the bits of the data word is a predetermined value, the method provides a second translation of each of the selected bit positions of the plural-bit data word to one of the levels. The method further includes generating a plural-bit offset word from predetermined bit positions of the data word and generating the multi-level symbols by addition of the offset word to the translated levels. One embodiment of the invention provides that the multi-level symbols are assigned a five-level code and the codes are treated as twos-complement numbers.

## Claims

### Claim 1

A method of encoding a plural-bit data word as a plurality of multi-level symbols, each having a value selected from a predetermined plurality of levels, comprising the steps of:
a first translation of each of selected bit positions of said data word to one of said levels;
when the contents of a predetermined one of said data word bits is a predetermined value, a second translation of each of said selected data word bit positions to one of said levels;
generating a plural-bit offset word from predetermined bit positions of said data word; and
generating said multi-level symbols by addition of said offset word to said translated levels.

### Claim 2 (depends on 1)

The encoding method of claim 1 wherein said multi-level symbols are assigned a five-level code, comprising a first, a second, a third, a fourth and a fifth code level, and wherein the first translation step further includes the step:
translating a first predetermined bit value to said third code level and a second predetermined bit value to said second code level.

### Claim 3 (depends on 2)

The encoding method of claim 2 wherein said data-word comprises the bits Sd[8:0], said offset-word comprises the bits V0, V1, V2 and V3 and the offset-word generating step further includes the step:
when said contents of said predetermined one of said data word bits is said predetermined value, generating said bits V0, V1, V2 and V3 according to the equations:
V0=Sd[4]
V1=Sd[4]{circumflex over ( )}Sd[6]
V2=Sd[4]{circumflex over ( )}Sd[6]{circumflex over ( )}Sd[7]
V3=Sd[4]{circumflex over ( )}Sd[7]{circumflex over ( )}Sd[8],
where {circumflex over ( )} is the XOR operation.

### Claim 4 (depends on 2)

The encoding method of claim 2 wherein said data-word comprises the bits Sd[8:0], said offset-word comprises the bits V0, V1, V2 and V3 and the offset-word generating step further includes the step:
when said contents of said predetermined one of said data word bits is said predetermined value, generating said bits V0, V1, V2 and V3 according to the equations:
V0=I4
V1=I4{circumflex over ( )}Sd[6]
V2=I4{circumflex over ( )}Sd[6]{circumflex over ( )}Sd[7]
V3=I4{circumflex over ( )}Sd[7]{circumflex over ( )}Sd[8], where I4 is assigned a binary value according to the table:
Sd[4] Sd[3] I4 0 0 0 0 1 Sd[6] {circumflex over ( )} Sd[7] 1 0 Sd[6] 1 1 Sd[7] {circumflex over ( )} Sd[8]
where {circumflex over ( )} is the XOR operation.

### Claim 5 (depends on 2)

The encoding method according to claim 2 wherein each said multi-level symbols is encoded on a predetermined one of four signal lines and wherein said second translation step further includes the steps:
when said contents of said predetermined one of said data word bits is said predetermined value;
adding said fifth code value to one of said signal lines as selected by predetermined bit positions of said data word;
discarding the symbol on said fourth signal line; and
selecting the symbols on the remaining three signal lines from the symbols on the lines to which no said fifth code value is added.

### Claim 6 (depends on 3)

The encoding method according to claim 3 wherein said code levels are treated as twos-complement numbers, wherein each said multi-level symbols is encoded on a predetermined one of four signal lines and wherein said offset-word addition step includes the step:
twos-complement addition of said offset-word bits to said code-levels on respective ones of said signal lines.

### Claim 7 (depends on 5)

The encoding method according to claim 5 wherein said code levels are treated as twos-complement numbers, wherein each said multi-level symbols is encoded on a predetermined one of four signal lines and wherein said offset-word addition step includes the step:
when said contents of said predetermined one of said data word bits is said predetermined value, twos-complement addition of said offset-word bits to said code-levels on respective ones of said signal lines symbols on said three signal lines to which no said fifth code value is added.

### Claim 8

A method of decoding a plurality of multi-level symbols as a plural-bit data word, each said symbol having a value selected from a five-level code, each said code level treated as a twos-complement number, comprising the steps of:
a translation of each of selected bit positions of said twos-complement representation to predetermined bit positions of said data word;
when the contents of a predetermined bit positions of a twos-complement representation of one of said symbol is a predetermined value, setting of predetermined bit positions of said data word to a selected value;
generating a plural-bit offset word from predetermined bit positions of said twos-complement representation of each of said symbols; and
generating predetermined bit positions of said data-word from said offset word to a selected value, dependent on said contents of said predetermined bit positions of a twos-complement representation of one of said symbol being said predetermined value.

### Claim 9 (depends on 8)

The decoding method of claim 8 wherein said five-level code comprises a first, a second, a third, a fourth and a fifth code level, wherein said the contents of a predetermined bit positions of a twos-complement representation of one of said symbol is said fifth level, wherein each said multi-level symbols is encoded on a predetermined one of four signal lines, wherein said twos-complement representation of said four multi-level symbols comprises the bits A[2:0], B[2:0], C[2:0] and D[2:0], said data-word comprises the bits Sd[8:0], and wherein the translation step further includes the steps:
A[2]=Sd[0]
B[2]=Sd[1]
C[2]=Sd[2]
D[2]=Sd[3].

### Claim 10 (depends on 9)

The decoding method of claim 9 wherein said offset-word comprises the bits V0, V1, V2 and V3 and the offset-word generating step further includes the steps:
V0=A[0]
V1=B[0]
V2=C[0]
V3=D[0].

### Claim 11 (depends on 10)

The decoding method of claim 10 wherein the step of setting of predetermined bit positions of said data word to a selected value further includes the steps:
Sd[6]=V0{circumflex over ( )}V1
Sd[7]=V1{circumflex over ( )}V2
Sd[8]=V0{circumflex over ( )}V1{circumflex over ( )}V2{circumflex over ( )}V3, where {circumflex over ( )} is the XOR operation.

### Claim 12 (depends on 11)

The decoding method of claim 11 wherein when said contents of said predetermined bit positions of said twos-complement represents said fifth code level, the step of setting of predetermined bit positions of said data word to a selected value further includes the steps;
Sd[4]=V0
Sd[5]=0.

### Claim 13 (depends on 9)

The decoding method of claim 9 wherein when said contents of said predetermined bit positions of said twos-complement represents said fifth code level, the step of setting of predetermined bit positions of said data word to a selected value further includes the steps;
Sd[5:3]=100, if A[2:0]=said fifth code level, Sd[5:3]=110, if B[2:0]=said fifth code level, Sd[5:3]=101, if C[2:0]=said fifth code level, Sd[5:3]=111, if D[2:0]=said fifth code level; and
Sd[0:2] is selected from compacted bits of Sd[0:3], dependent on which of said A[2:0], B[2:0], C[2:0], D[2:0]=said fifth code level.
