Infineon Technologies Ag

Christian Badack

Michael Goessel

Thomas Kern

Klaus Oberlaender

Thomas Rabenalt

Ulrich Backhausen

Jessica Trebst

A method for detecting an address error when reading a bitstream from a memory is proposed, wherein a check is carried out as to whether the bitstream in conjunction with the present read address is a code word of an error code and wherein, should the bitstream in conjunction with the present read address not be a code word of the error code, an address error is subsequently detected provided the error code does not correct an error correctable thereby. Accordingly, an apparatus, a system and a computer program product are specified.

Detecting address errors

A method and associated apparatus is disclosed for processing data by means of an error code, wherein the error code has an H-matrix with n columns and m rows, wherein the columns of the H-matrix are different, wherein component-by-component XOR sums of adjacent columns of the H-matrix are different from one another and from all columns of the H-matrix and wherein component-by-component XOR sums of nonadjacent columns of the H-matrix are different from all columns of the H-matrix and from all component-by-component XOR sums of adjacent columns of the H-matrix.

Processing of data

Systems, methods, and circuitries are disclosed for protecting data throughout read and write operations. In one example a method includes receiving a plurality of data bits; dividing the plurality of data bits into at least two data blocks; generating respective sets of block check bits for each respective data block using a respective first error code; combining the sets of block check bits to generate a set of signature bits for the plurality of data bits; generating a set of cumulative check bits for the plurality of data bits and the set of signature bits using a second error code; and storing, in a memory location, the plurality of data bits, the set of signature bits, and the set of cumulative check bits.

Continuous error coding

A circuit arrangement for determining in parallel of at least two byte error position signals for identifying at least one byte error in a binary sequence comprising a plurality of bytes, wherein the binary sequence in the error-free case is a code word of an error code, the circuit arrangement is configured such that each of the at least two byte error position signals is determinable using components of an error syndrome of the error code such that the components indicate whether or not a byte of the binary sequence that is associated with the byte error position signal is erroneous.

Determination and use of byte error position signals

A circuit arrangement for determining a correction signal on the basis of at least one bit error of a binary word is specified, including a plurality of subcircuits (ST), wherein a respective subcircuit is provided for a bit position to be corrected of the binary word, wherein each of the subcircuits provides at least two locator polynomial values, and comprising a selection unit, which determines a correction signal depending on the locator polynomial values and depending on an error signal (err, E). A method for driving such a circuit arrangement is furthermore proposed.

Error correction

A circuitry comprising a syndrome generator configured to generate a syndrome based on a parity check matrix and a binary word comprising a first set of bits and a second set of bits is provided. For the first set of bits an error correction of correctable bit errors within the first set is provided by the parity check matrix and for the second set of bits an error detection of a detectable bit errors within the second set is provided by the parity check matrix.

Apparatus and method for error correction and error detection

A circuitry for error correction includes a plurality of subcircuits for determining intermediate values Zw, Zw, Zw, Zwto be used as coefficients in an error correction expression (z, z, . . . , z)=Zw&#xb7;&#x3b1;+Zw&#xb7;&#x3b1;+Zw&#xb7;&#x3b1;+Zw. The intermediate values Zw, Zw, Zw, Zware determined depending on subsyndromes s, s, sso that in case of a 1-bit, 2-bit, or 3-bit error z=(z, z, . . . , z)=(0, 0, . . . , 0) when an error occurred in the bit position i, and z=(z, z, . . . , z)&#x2260;(0, 0, . . . , 0) when no error occurred in the bit position i. A correction value &#x394;v=for the bit position i may then be determined on the basis of the error correction expression evaluated for &#x3b1;.

Efficient error correction of multi-bit errors

A circuitry is proposed for the correction of errors in a possibly erroneous binary word v'=v&#x2032;, . . . , v&#x2032;relative to a codeword v=v, . . . , v, in particular 3-bit errors containing an adjacent 2-bit error (burst error). The circuitry comprises a syndrome generator and a decoder. A modified BCH is used wherein n&#x2032; column vectors of a first BCH code submatrix are paired as column vector pairs so that a componentwise XOR combination of the two column vectors of each column vector pair produces an identical column vector K that is different from all column vectors of the first BCH submatrix. A second BCH submatrix comprises corresponding column vectors as the third power, according to Galois field arithmetic, of the column vector in the first BCH submatrix. The syndrome generated by the syndrome generator can be checked against the columns of the first and second submatrices.

Growing community of inventors

Unterhaching, Germany

Christian Badack