# US 2010/0164760 A1 · Coding scheme for serial data communications

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

- Number: US 2010/0164760 A1
- Document ID: US20100164760A1
- Status: Published application
- Kind: A1
- Application number: 12/160,783
- Filed: 2007-01-11
- Published: 2010-07-01
- Earliest claimed: 2006-01-12
- Assignees: NXP B.V.
- Inventors: Gerrit Willem Besten
- Web page: https://patentgrep.com/patent/US20100164760A1

## CPC

- H03M 5/145: {Conversion to or from block codes or representations thereof}
- H04L 25/4906: {using binary codes}
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

An encoding scheme generates an encoded nine bit code word from each input eight bit data word. The coding scheme is such that the encoded data words have advantageous properties, such as a minimum of two polarity transitions in each encoded data word, and a maximum of five bits without a polarity transition. Five of the bits from the input eight bit data word appear unchanged in the encoded data word, while the other four bits of the encoded data word are obtained by applying appropriate logical operators to the remaining three bits of the input data word in combination with two of the five bits that appear unchanged in the encoded data word. Exception codes can also be defined, that is, nine bit code words that cannot be obtained from any eight bit data word by means of the coding scheme, and can be used to embed control information into the data stream. For example, the exception codes may advantageously have six or seven bits without a polarity transition.

## Claims

### Claim 1

A method of encoding data, the method comprising, for each input data byte of eight bits:
dividing the data byte into:
a first group of three bits, and
a second group of five bits; and
generating an output data word containing nine bits, wherein the nine bits include the first group of three bits from the input data byte, and wherein each possible output data word has a maximum runlength of 5 bits.

### Claim 2 (depends on 1)

A method as claimed in claim 1, further comprising:
dividing the second group of five bits into two unencoded bits and three encoded bits;
wherein the nine bits of the output data word further include said two unencoded bits from said second group of five bits from said data byte; and
wherein said step of generating the output data word comprises:
applying logical operators to said second group of five bits from said data byte to obtain four further bits of the output data word.

### Claim 3 (depends on 2)

A method as claimed in claim 2, wherein the nine bits of the output data word comprise:
the first group of three bits from the input data byte;
the two unencoded bits from the second group of five bits of the input data byte;
sixth and seventh bits obtained by applying logical operators to a first of said unencoded bits and the three encoded bits in the input data byte; and
eighth and ninth bits obtained by applying logical operators to a second of said unencoded bits and the three encoded bits in the input data byte.

### Claim 4 (depends on 3)

A method as claimed in claim 3, wherein the two unencoded bits from the second group of five bits from the input data byte, the sixth and seventh bits, and the eighth and ninth bits appear in two blocks of three consecutive bits in the output data word.

### Claim 5 (depends on 4)

A method as claimed in claim 4, wherein the two unencoded bits from the second group of five bits from the input data byte, the sixth and seventh bits, and the eighth and ninth bits appear as the second, third and fourth, and seventh, eight and ninth bits in the output data word.

### Claim 6 (depends on 5)

A method as claimed in claim 5, wherein, in each possible output data word, there is a first polarity transition between the second and third bits or between the third and fourth bits and a second polarity transition between the seventh and eighth bits or between the eighth and ninth bits, while excluding the possibility that the first polarity transition is between the second and third bits while the second polarity transition is between the eighth and ninth bits

### Claim 7 (depends on 4)

A method as claimed in claim 4, wherein the two unencoded bits from the second group of five bits from the input data byte, the sixth and seventh bits, and the eighth and ninth bits appear as the first, second and third, and sixth, seventh and eighth bits in the output data word.

### Claim 8 (depends on 7)

A method as claimed in claim 7, wherein, in each possible output data word, there is a first polarity transition between the first and second bits or between the second and third bits and a second polarity transition between the sixth and seventh bits or between the seventh and eighth bits, while excluding the possibility that the first polarity transition is between the first and second bits while the second polarity transition is between the seventh and eighth bits.

### Claim 9 (depends on 1)

A method as claimed in claim 1, wherein the two unencoded bits from the second group of five bits from the input data byte appear in different ones of the two blocks of three consecutive bits in the output word.

### Claim 10 (depends on 1)

A method as claimed in claim 1, wherein the sixth and seventh bits appear in one of said two blocks of three consecutive bits in the output word, and the eighth and ninth bits appear in another of said two blocks of three consecutive bits in the output word.

### Claim 11 (depends on 3)

A method as claimed in claim 3, wherein the logical operators are such that there are at least two polarity transitions in each possible output data word.

### Claim 12 (depends on 3)

A method as claimed in claim 3, wherein the logical operators are such that there are at least two zeroes and at least two ones in each possible output data word.

### Claim 13 (depends on 1)

A method as claimed in claim 1, comprising:
applying logical operators to the first of said unencoded bits and the group of three encoded bits in the input data byte to obtain the sixth and seventh bits according to the logic:
Y1=(˜Q1&˜Q2&˜X1)|(Q1&Q3)|(Q2&Q3)
Y2=(˜Q1&˜Q2&˜X1)|(Q1&˜Q3)|(Q2&˜Q3)
and applying logical operators to the second of said unencoded bits and the group of three encoded bits in the input data byte to obtain the eighth and ninth bits according to the logic:
Y3=(Q1&Q2)|(Q1&Q2&˜X2)|(˜Q2&Q3)
Y4=(Q1&Q2)|(Q1&Q2&˜X2)|(˜Q1&˜Q3),
wherein X1 is the first of the two unencoded bits from the second group of five bits of the input data byte, X2 is the second of the two unencoded bits from the second group of five bits of the input data byte, Q1, Q2 and Q3 are the group of three encoded bits in the input data byte, Y1 and Y2 are the sixth and seventh bits of the output word, and Y3 and Y4 are the eighth and ninth bits of the output word, and where AND=‘&’, OR=‘|’, and NOT=‘˜’.

### Claim 14 (depends on 1)

A method of transmitting data from a transmitter to a receiver, the method comprising:
encoding the data in accordance with a method as claimed in claim 1; and
including amongst the encoded data at least one exception code, comprising a nine bit word that can not be obtained from any input data byte by encoding the data in accordance with said method.

### Claim 15 (depends on 14)

A method as claimed in claim 14, wherein the exception code comprises a nine bit word having a runlength of 6 bits.

### Claim 16 (depends on 14)

A method as claimed in claim 14, wherein the exception code comprises a nine bit word having a runlength of 7 bits.

### Claim 17 (depends on 14)

A method as claimed in claim 14, wherein the exception code comprises a nine bit word having a runlength of 8 bits that, in combination with an adjacent encoded data word, can provide a runlength of up to 10 bits.

### Claim 18 (depends on 14)

A method as claimed in claim 14, wherein the exception code comprises a nine bit word having a runlength of 8 bits that, in combination with an adjacent encoded data word, can provide a runlength of up to 11 bits.

### Claim 19 (depends on 14)

A method as claimed in claim 14, wherein the exception code has a maximum runlength of 5 bits.

### Claim 20 (depends on 14)

A method as claimed in claim 14, wherein, in the exception code, there is a first polarity change between the second and third bits of the word, and a second polarity change between the eighth and ninth bits of the word, but the third and fourth bits are equal, as are the seventh and eighth bits, while the third and eighth bits have opposite polarities.

### Claim 21 (depends on 1)

A transmitter, for receiving data in input data bytes of eight bits, and comprising an encoder, said encoder comprising logic for encoding said received data in accordance with a method as claimed in claim 1.

### Claim 22 (depends on 21)

A transmitter as claimed in claim 21, further comprising logic for including amongst the encoded data at least one exception code, comprising a nine bit word that can not be obtained from any input data byte by encoding the data in accordance with said method.

### Claim 23 (depends on 22)

A transmitter as claimed in claim 22, wherein the exception code comprises a nine bit word having a runlength of 6 bits.

### Claim 24 (depends on 22)

A transmitter as claimed in claim 22, wherein the exception code comprises a nine bit word having a runlength of 7 bits.

### Claim 25 (depends on 22)

A transmitter as claimed in claim 22, wherein the exception code comprises a nine bit word having a runlength of 8 bits that, in combination with an adjacent encoded data word, can provide a runlength of up to 10 bits.

### Claim 26 (depends on 22)

A transmitter as claimed in claim 22, wherein the exception code comprises a nine bit word having a runlength of 8 bits that, in combination with an adjacent encoded data word, can provide a runlength of up to 11 bits.

### Claim 27 (depends on 22)

A transmitter as claimed in claim 22, wherein the exception code has a maximum runlength of 5 bits.

### Claim 28 (depends on 22)

A transmitter as claimed in claim 22, wherein, in the exception code, there is a first polarity change between the second and third bits of the word, and a second polarity change between the eighth and ninth bits of the word, but the third and fourth bits are equal, as are the seventh and eighth bits, while the third and eighth bits have opposite polarities.

### Claim 29

A method of decoding received encoded data, the method comprising, for each received encoded data word of nine bits:
dividing the encoded data word into:
a first group of five bits, and
a second group of four bits; and
generating an output word containing eight bits, wherein the eight bits comprise:
the first group of five bits from the encoded data word; and
sixth, seventh and eighth bits obtained by applying logical operators to the second group of four bits in the encoded data word.

### Claim 30 (depends on 29)

A method as claimed in claim 29, comprising applying said logical operators such that:
Q


1
=
EXOR

(
Y


1
,
Y


2
)
&
~
(
~
Y


3
&


Y


4
)
Q


2
=
EXOR

(
Y


1
,
Y


2
)
&
~
(
Y


3
&
~
Y


4
)
Q


3
=
(
Y


1
&
~
Y


2
)


(
Y


1
&

Y


2
&

Y


3
)


(
~
Y


1
&
~
Y


2
&

Y


3
)


=
(
Y


1
&
~
Y


2
)
|
(
~
EXO


R

(
Y


1
,
Y


2
)
&

Y


3
)
,
wherein Y1, Y2, Y3 and Y4 are said second group of four bits in the encoded data word; Q1, Q2 and Q3 are said sixth, seventh and eighth bits of said output word; and where AND=‘&’, OR=‘|’, and NOT=‘˜’.

### Claim 31 (depends on 29)

A method as claimed in claim 29, further comprising, as a preliminary step, recognizing and removing any exception codes.

### Claim 32 (depends on 21)

A receiver, for receiving encoded data in encoded data words each of nine bits, and comprising a decoder, said decoder comprising logic for decoding said received data in accordance with a method as claimed in claim 21.

### Claim 33 (depends on 32)

A receiver as claimed in claim 32, further comprising logic for recognizing and removing any exception codes before passing said encoded data to said decoder, and outputting control information represented by said exception codes.
