System and method for transition encoding with reduced error propagation

Patent metadata

Field	Value
Publication number	US-11764805-B2
Application number	US-202117533014-A
Country	US
Kind code	B2
Filing date	Nov 22, 2021
Priority date	Oct 6, 2021
Publication date	Sep 19, 2023
Grant date	Sep 19, 2023

Abstract

A method of encoding input data includes receiving the input data that includes a plurality of input words including a first input word and a second input word, generating a plurality of converted words including a first converted word and a second converted word, the first converted word being based at least on the first input word, the second converted word being based on the first converted word and the second input word, identifying a key value based on the plurality of converted words, and generating a plurality of coded words based on the key value and the plurality of converted words.

First claim

What is claimed is:

1. A method of encoding input data, the method comprising:
receiving the input data that comprises a plurality of input words comprising a first input word and a second input word;
generating a plurality of converted words comprising a first converted word and a second converted word, the first converted word being based at least on the first input word, the second converted word being based on the first converted word and the second input word;
identifying a key value based on the plurality of converted words; and
generating a plurality of coded words based on the key value and the plurality of converted words.

2. The method of claim 1 , wherein the first input word is an (i−1)th input word, the second input word is an ith input word, i being an integer greater than 1, and
wherein the first converted word is an (i−1)th converted word and the second converted word is an ith converted word.

3. The method of claim 1 , wherein the generating the plurality of converted words comprises:
generating the first converted word as the first input word; and
generating the second converted word by performing a binary XOR operation on the second input word and the first converted word.

4. The method of claim 1 , wherein the generating the plurality of converted words comprises:
generating the first converted word by performing a binary XOR operation on the first input word and a previous converted word of the plurality of converted words; and
generating the second converted word by performing a binary XOR operation on the second input word and the first converted word.

5. The method of claim 1 , wherein a bit length of the first input word is a same as that of the first converted word.

6. The method of claim 1 , wherein a bit length of the first converted word is a same as that of a coded word of the plurality of coded words.

7. The method of claim 1 , wherein the key value has a same bit length as one of the plurality of converted words, and is not the same as any one of the plurality of converted words.

8. The method of claim 1 , wherein the plurality of coded words comprises a first coded word and a second coded word, the first coded word being based at least on the key value and the second coded word being based on the key value and the first converted word.

9. The method of claim 8 , wherein the generating the plurality of coded words comprises:
generating the first coded word as the key value; and
generating the second converted word by performing a binary XOR operation on the first input word and the key value.

10. The method of claim 8 , wherein the generating the plurality of coded words comprises:
generating the first coded word by performing a binary XOR operation on the first converted word and the key value; and
generating the second coded word by performing a binary XOR operation on the second converted word and the key value.

11. The method of claim 1 , wherein the plurality of converted words denoted as {y 1 , y 2 , . . . , y N } is expressed as:
{ x 1 ,x 2 {circumflex over ( )}x 1 , . . . ,x N {circumflex over ( )} . . . {circumflex over ( )}x 2 {circumflex over ( )}x 1 },
where {x 1 , x 2 , . . . , x N } represent the plurality of input words, N is an integer greater than 2, and {circumflex over ( )} symbolizes a binary XOR operation.

12. The method of claim 11 , wherein the plurality of coded words is expressed as:
{ D,y 1 {circumflex over ( )}D,y 2 {circumflex over ( )}D, . . . ,y N {circumflex over ( )}D},
where D represents the key value.

13. The method of claim 1 , further comprising:
transmitting transmission data to a receiver through a communication channel, the transmission data comprising the plurality of coded words.

14. A transition encoder for encoding input data, the transition encoder comprising:
a processor; and
a processor memory local to the processor, wherein the processor memory has stored thereon instructions that, when executed by the processor, cause the processor to perform:
receiving the input data that comprises a plurality of input words comprising a first input word and a second input word;
generating a plurality of converted words comprising a first converted word and a second converted word, the first converted word being based at least on the first input word, the second converted word being based on the first converted word and the second input word;
identifying a key value based on the plurality of converted words; and
generating a plurality of coded words based on the key value and the plurality of converted words.

15. A method of decoding transmission data, the method comprising:
receiving the transmission data that comprises a plurality of coded words comprising a first coded word and a second coded word; and
generating a first decoded word of a plurality of decoded words by performing a binary XOR operation on the first and second coded words.

16. The method of claim 15 , wherein the first and second coded words are consecutive words.

17. The method of claim 15 , wherein the plurality of coded words is expressed as:
{ D,y 1 {circumflex over ( )}D,y 2 {circumflex over ( )}D, . . . ,y N {circumflex over ( )}D},
where {y 1 , y 2 , . . . , y N } represent a plurality of converted words, D represents a key value used to code the plurality of coded words, and {circumflex over ( )} symbolizes the binary XOR operation.

18. The method of claim 17 , wherein the plurality of converted words is expressed as:
{ x 1 ,x 2 {circumflex over ( )}x 1 , . . . ,x N {circumflex over ( )} . . . {circumflex over ( )}x 2 {circumflex over ( )}x 1 },
where {x 1 , x 2 , . . . , x N } represent the plurality of decoded words, and N is an integer greater than 2.

19. The method of claim 15 , wherein a bit length of the first coded word is a same as that of the first decoded word.

20. The method of claim 15 , wherein receiving the transmission data comprises:
receiving the transmission data from a transmitter through a communication channel.

Assignees

• Samsung Display Co Ltd

Inventors

• Abbasfar Aliazam

Classifications

• H03M5/145 Primary

  Conversion to or from block codes or representations thereof · CPC title

• H04L1/0014 Primary

  by adapting the source coding · CPC title

• H03M7/46 Primary

  Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind · CPC title

• H03M13/31

  combining coding for error detection or correction and efficient use of the spectrum (without error detection or correction H03M5/14 {, H03M5/145}) · CPC title

• H03M99/00

  Subject matter not provided for in other groups of this subclass · CPC title