Device for correcting two errors with a code of hamming distance three or four

Patent metadata

Field	Value
Publication number	US-9515682-B2
Application number	US-201314411081-A
Country	US
Kind code	B2
Filing date	Jun 26, 2013
Priority date	Jun 26, 2012
Publication date	Dec 6, 2016
Grant date	Dec 6, 2016

Abstract

A device for correcting an initial binary word affected by an error in 1 or 2 bits and arising from a corrector code endowed with a minimum Hamming distance of 3 or 4, comprises first means for correcting an error of 1 bit and for detecting an error of more than 1 bit in the initial word and second means for correcting an error of 1 bit in a word arising from an inversion module, able to receive a datum indicative of a binary level of confidence, low or high, assigned to each of the bits of at least one part of the initial word, said inversion module being configured to invert the bits of the initial word which suffer the low confidence level, and a multiplexer with at least two inputs which is driven by the means for detecting an error of more than 1 bit in the initial word, said multiplexer being fed on a first input by the output of the first correction means and on a second input by the output of the second correction means.

First claim

The invention claimed is:

1. A device for correcting an initial binary word affected by an error in 1 or 2 bits and arising from a correction code with a minimum Hamming distance of 3 or 4, the device comprising:
a first correction and detection means for correcting an error of 1 bit and for detecting an error of more than 1 bit in the initial word,
a second means for correcting an error of 1 bit in a word coming from an inversion module, the inversion module configured to:
receive a data item indicating a binary level of confidence assigned to each of the bits of at least one part of the initial word, and
invert the bits of the initial word that are assigned the low confidence level to form an intermediate word; and

a multiplexer with at least two inputs driven by the first correction and detection means the multiplexer configured to receive on a first input by an output of the first correction and detection means and on a second input by an output of the second correction means the first correction and detection means configured to generate a control signal to select the output of the second correction means when the first correction and detection detects an error of more than 1 bit in the initial word, and otherwise select the output of the first correction and detection means, wherein the output of the first correction and detection means is based on the initial word and the output of the second correction means is based on the intermediate word.

2. The device for correcting an initial word as claimed in claim 1 , wherein the second correction means is configured to correct a single error and to detect an error of more than 1 bit, outputs of the second correction means being combined to generate a signal indicating an uncorrectable error when the first correction and detection means has detected an error of more than 1 bit.

3. The device as claimed in claim 2 , wherein the first correction and detection means is configured to detect errors affecting more than two bits which are characterized by a non-zero syndrome which is different from syndromes corresponding to a single error.

4. A memory module comprising a device as claimed in claim 3 .

5. The device as claimed in claim 1 , wherein the first correction and detection means is configured to detect errors affecting more than two bits which are characterized by a non-zero syndrome which is different from syndromes corresponding to a single error.

6. A memory module comprising a device as claimed in claim 5 .

7. A memory module comprising a device as claimed in claim 1 .

Assignees

• Commissariat Energie Atomique

Inventors

• Evain Samuel
• Gherman Valentin

Classifications

• G06F11/10

  Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's · CPC title

• H03M13/2906 Primary

  using block codes (H03M13/2957 takes precedence) · CPC title

• H03M13/453 Primary

  wherein the candidate code words are obtained by an algebraic decoder, e.g. Chase decoding · CPC title

• H03M13/159

  Remainder calculation, e.g. for encoding and syndrome calculation · CPC title