← Back to Patent Explorer
EP0075985A1 Expired / Lapsed EP ⏱️ 0.0 years remaining

A data processing device for processing multiple-symbol data-words based on a symbol-correcting code and having multiple operating modes

Assignee: Koninklijke Philips NV
•
Filing: 1982-09-17
•
Granted: —
•
Expires: 2002-09-17
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A computer system is described which is based on a symbol-correcting code. The code words consist of a number of code symbols. In the normal operating mode of the error correction members, correction is possible of all errors which are either limited to one code symbol or which concern only two arbitrarily situated code bits. During operation in the erasure mode, a predetermined code symbol within the code word is not taken into account; therefore, it may contain an arbitrary, unknown error. Moreover, an error can be corrected which concerns only one arbitrarily situated code bit. In the selection mode, two predetermined code symbols within the code word are not taken into account. The data words can be reconstructed from the others. The mode is controlled by the content of the mode register (110). The mode register is controlled by the output signals (106) of syndrome generators (102).

Inventors

  • 👤 Thijs Krol
  • 👤 Bernardus Jan Vonk

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-08 18:29
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; H; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/13

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 653 words
A data processing device for the processing of data words which are composed of k = 2p-2 ≥ 2 data symbols by means of code words which are formed from the associated data words by means of an error-correcting code, said code words containing n=2p code symbols, all symbols consisting of m = 2s > 4 bits and forming part of a Galois field GF(2 m ) = {0, a , a ... a 2 m-2}, said device comprising a first input for a data word, first multiplier means for multiplying the data word by a generator matrix [G] consisting of nxk matrix element each of m bits in order to form a code word, processing means for processing the code word in order to form a processing result, and reconstruction means for reconstructing, using a parity check matrix [R] which is orthogonal to the generator matrix [G], the second data word associated with the processing result for output on a first output, characterized in that the reconstruction means comprise: a) second multiplier means (102) with a second input for receiving the processing result for multiplication by a parity check matrix [R] = [S]. [H]. [T] in order to form a number of at least (n-k) = 2t ≥ 2 syndrome symbols (SO, S1, S2, S3) on a second output, [S] being a non-singular matrix consisting of (mkxmk) bits, the matrix [H] comprising a first sub-matrix of kxk symbols in the form of an identity matrix and a second sub-matrix of kx (n-k) symbols whose determinant is not equal to 1 = a o , the absolute values modulo (2 m -1) of the differences between the exponents of the symbols written as powers of (a) being at least equal to (m) on each respective row and in each respective column of the matrix [H], while each (kxk) sub-matrix of [H] is non-singular, the matrix [T] consisting of (nmxnm) bits in nxn blocks which are arranged in rows and columns and each of which blocks consists of mxm bits, each row and each column of blocks comprising (n-1) blocks which consist exclusively of "0" bits, each row of bits and each column of bits containing exactly one "1" bit and for the remainder exclusively "0" bits; b) a mode register (110) which has a third input and a third output, a first state of the mode register controlling a "normal" mode for processing the code words as forming part of a code with a minimum Hamming-distance of three over the symbols or a minimum Hamming-distance of five over the bits, n respective second states of the mode register controlling an erasure operation for a code symbol uniquely associated with the respective second state in order to process the remaining code symbols as forming a code word of a code having a minimum distance of three over the bits; c) a data reconstruction device (104) with a fourth input (100) for receiving the processing result and a fifth input for receiving the syndrome symbols, and with a fourth output (Y32, Y31, Y30, Y21, Y20, Y10) for forming a reconstructed data word on the basis of associated sub-sets of k code symbols; d) a selection device (106) with a sixth input which is connected to the second output in order to receive the syndrome symbols and a seventh input which is connected to the third output in order to receive the state information from the mode register, and also with a sixth output which is connected to the third output and a seventh output for supplying, on the basis of the syndrome symbols and the state of the mode register, a selection signal for indicating the error-free code symbols and for supplying a set signal for the mode register; e) a gating device (112-122), with inputs which are connected to the fourth output and the seventh output for the selection of a corrected data word.
Claim 2
Dependent Claim 653 words
A data processing device for the processing of data words which are composed of k = 2p-2 ≥ 2 data symbols by means of code words which are formed from the associated data words by means of an error-correcting code, said code words containing n=2p code symbols, all symbols consisting of m = 2s > 4 bits and forming part of a Galois field GF(2 m ) = {0, a , a ... a 2 m-2}, said device comprising a first input for a data word, first multiplier means for multiplying the data word by a generator matrix [G] consisting of nxk matrix element each of m bits in order to form a code word, processing means for processing the code word in order to form a processing result, and reconstruction means for reconstructing, using a parity check matrix [R] which is orthogonal to the generator matrix [G], the second data word associated with the processing result for output on a first output, characterized in that the reconstruction means comprise: a) second multiplier means (102) with a second input for receiving the processing result for multiplication by a parity check matrix [R] = [S]. [H]. [T] in order to form a number of at least (n-k) = 2t ≥ 2 syndrome symbols (SO, S1, S2, S3) on a second output, [S] being a non-singular matrix consisting of (mkxmk) bits, the matrix [H] comprising a first sub-matrix of kxk symbols in the form of an identity matrix and a second sub-matrix of kx (n-k) symbols whose determinant is not equal to 1 = a o , the absolute values modulo (2 m -1) of the differences between the exponents of the symbols written as powers of (a) being at least equal to (m) on each respective row and in each respective column of the matrix [H], while each (kxk) sub-matrix of [H] is non-singular, the matrix [T] consisting of (nmxnm) bits in nxn blocks which are arranged in rows and columns and each of which blocks consists of mxm bits, each row and each column of blocks comprising (n-1) blocks which consist exclusively of "0" bits, each row of bits and each column of bits containing exactly one "1" bit and for the remainder exclusively "0" bits; b) a mode register (110) which has a third input and a third output, a first state of the mode register controlling a "normal" mode for processing the code words as forming part of a code with a minimum Hamming-distance of three over the symbols or a minimum Hamming-distance of five over the bits, n respective second states of the mode register controlling an erasure operation for a code symbol uniquely associated with the respective second state in order to process the remaining code symbols as forming a code word of a code having a minimum distance of three over the bits; c) a data reconstruction device (104) with a fourth input (100) for receiving the processing result and a fifth input for receiving the syndrome symbols, and with a fourth output (Y32, Y31, Y30, Y21, Y20, Y10) for forming a reconstructed data word on the basis of associated sub-sets of k code symbols; d) a selection device (106) with a sixth input which is connected to the second output in order to receive the syndrome symbols and a seventh input which is connected to the third output in order to receive the state information from the mode register, and also with a sixth output which is connected to the third output and a seventh output for supplying, on the basis of the syndrome symbols and the state of the mode register, a selection signal for indicating the error-free code symbols and for supplying a set signal for the mode register; e) a gating device (112-122), with inputs which are connected to the fourth output and the seventh output for the selection of a corrected data word.
Claim 3
Dependent Claim 575 words
A data processing device for the processing of data words which are composed of k=2p-2 ≥ 2 data symbols by means of code words which are formed from the associated data words by means of an error-correcting code, said code words containing n=2p code symbols, all symbols consisting of m=2s ≥ 4 bits and forming part of a Galois field GF(2 m ) = {0, a 0 , a 1 .. . a 2 m-2}, said device comprising a first input for a data word, first multiplier means for multiplying the data word by a generator matrix [G] consisting of (nxk) elements each of m bits in order to form a code word, processing means for processing the code word in order to form a processing result, and reconstruction means for reconstructing, using a parity check matrix [R] which is orthogonal to the generator matrix [G], the second data word associated with the processing result for output on a first output,characterized in that the reconstruction means comprise: a) second multiplier means (300) with a second input for receiving the processing result for multiplication by a parity check matrix [R] = [S] . [H] [T] in order to form a number of at least (n-k) = 2t ) 2 syndrome symbols on a second output, [S] being a non-singular matrix consisting of (mkxmk) bits, the matrix [H] comprising a first sub-matrix of kxk symbols formed as an identity matrix and a second sub-matrix of kx(n-k) symbols whose determinant is not equal to a =1, the absolute values modulo (2 m- 1) of the differences between the exponents of the symbols expressed as powers of (a) being at least equal to (m) on each respective row and in each respective column of the matrix [H], each (kxk) sub-matrix of [H] being non-singular, the matrix [T] consisting of nmxnm bits in nxn blocks which are arranged in rows and columns and each of which consists of (mxm) bits, each row and each column of blocks comprising (n-1) blocks which consist exclusively of "0" bits, each column of bits containing exactly one "1" bit and for the remainder exclusively "0" bits; b) a mode regiser (308) which has a third input and a third output, a first state of the mode register controlling a normal mode for processing the code words as forming part of a code with a minimum Hamming-distance of three over the symbols or a minimum Hamming-distance of five over the bits, n respective second states of the mode register controlling an associated erasure operation for a code symbol uniquely associated with that state in order to process the remaining code symbols as forming part of a code having a minimum distance of three over the bits; c) correction determining means (302) which have an eighth input which is connected to the second output in order to receive the syndrome symbols and a ninth input which is connected to the third output in order to receive the state information from the mode register, and also having an eighth output for supplying a corrector and a ninth output for supplying an error indication signal, the latter output being connected to the third input of the mode register; d) correction means (304) which have a tenth input for receiving at least the data symbols of the processing result and for modulo-2 addition thereof to the corrector in order to supply a corrected data word on a tenth output.
Claim 4
Dependent Claim 575 words
A data processing device for the processing of data words which are composed of k=2p-2 ≥ 2 data symbols by means of code words which are formed from the associated data words by means of an error-correcting code, said code words containing n=2p code symbols, all symbols consisting of m=2s ≥ 4 bits and forming part of a Galois field GF(2 m ) = {0, a 0 , a 1 .. . a 2 m-2}, said device comprising a first input for a data word, first multiplier means for multiplying the data word by a generator matrix [G] consisting of (nxk) elements each of m bits in order to form a code word, processing means for processing the code word in order to form a processing result, and reconstruction means for reconstructing, using a parity check matrix [R] which is orthogonal to the generator matrix [G], the second data word associated with the processing result for output on a first output,characterized in that the reconstruction means comprise: a) second multiplier means (300) with a second input for receiving the processing result for multiplication by a parity check matrix [R] = [S] . [H] [T] in order to form a number of at least (n-k) = 2t ) 2 syndrome symbols on a second output, [S] being a non-singular matrix consisting of (mkxmk) bits, the matrix [H] comprising a first sub-matrix of kxk symbols formed as an identity matrix and a second sub-matrix of kx(n-k) symbols whose determinant is not equal to a =1, the absolute values modulo (2 m- 1) of the differences between the exponents of the symbols expressed as powers of (a) being at least equal to (m) on each respective row and in each respective column of the matrix [H], each (kxk) sub-matrix of [H] being non-singular, the matrix [T] consisting of nmxnm bits in nxn blocks which are arranged in rows and columns and each of which consists of (mxm) bits, each row and each column of blocks comprising (n-1) blocks which consist exclusively of "0" bits, each column of bits containing exactly one "1" bit and for the remainder exclusively "0" bits; b) a mode regiser (308) which has a third input and a third output, a first state of the mode register controlling a normal mode for processing the code words as forming part of a code with a minimum Hamming-distance of three over the symbols or a minimum Hamming-distance of five over the bits, n respective second states of the mode register controlling an associated erasure operation for a code symbol uniquely associated with that state in order to process the remaining code symbols as forming part of a code having a minimum distance of three over the bits; c) correction determining means (302) which have an eighth input which is connected to the second output in order to receive the syndrome symbols and a ninth input which is connected to the third output in order to receive the state information from the mode register, and also having an eighth output for supplying a corrector and a ninth output for supplying an error indication signal, the latter output being connected to the third input of the mode register; d) correction means (304) which have a tenth input for receiving at least the data symbols of the processing result and for modulo-2 addition thereof to the corrector in order to supply a corrected data word on a tenth output.
Claim 5
Dependent Claim 81 words
A data processing device as claimed in Claim 1 or 2 , characterized in that for n=4, k=2, the matrix [H] is chosen from: in which (a ) is an element of the Galois field GF(2 4 ) generated by means of the primitive and irreducible polynomial π(x) = x 4 +x+1, and in which a J is an element of the Galois field GF(2 4 ) generated by the primitive and irreducible polynomial π'(x) = x 4 +x 3 +1.
Claim 6
Dependent Claim 44 words
A data processing device as claimed in Claim 1, 2, or 3, characterized in that the mode register contains n bits, each of which is uniquely assigned to a respective code symbol within the code word in order to control the erasure mode therefor.
Claim 7
Dependent Claim 125 words
A data processing device as claimed in any of the Claims 1-4, characterized in that there is provided an error register (110, 306) which comprises at least n bit locations and an eleventh input which is connected in parallel with the third input of the mode register in order to receive, upon detection of a correctable error in a symbol, a symbol indicator which is to be stored in the associated position of the error register, the symbol indicators received being continuously combined with a stored symbol indicator by means of a symbolwise logic OR-function (242-248), the error register having an eleventh output for connection to an updating and control device, and also a reset input for receiving a reset signal from the control device.
Claim 8
Dependent Claim 77 words
A data processing device as claimed in Claim 5, characterized in that the mode register has an additional data input (278) and a load control input (276) for receiving a control word from the control device in order to control the data processing device in a gating mode so that a data word is reconstructed by the selective erasure of (n-k) code symbols on the basis of the k code symbols then remaining, without correction of errors.
Claim 9
Dependent Claim 66 words
A data processing device as claimed in any of the Claims 1 to 6, characterized in that there is provided a detector for detecting a multi-bit one-symbol error in the normal mode and for directly switching over the mode register to the erasure mode in reaction thereto, code symbols having the same symbol number as that in which the multi-bit one-symbol error occurred being subsequently erased.
Claim 10
Dependent Claim 154 words
A multiprocessor computer system which is composed of n sub-computers which are situated in respective error isolation zones and which each comprise, for use in a data processing device as claimed in any of the Claims 1 to 7, a data reconstruction device for receiving all code symbols of a code word to be processed and for reconstructing therefrom a data word, processor means for processing the data word in the same way as in the other sub-computers, a code generator for forming a code symbol from a processed data word so that the set of code symbols thus generated forms a code word, a memory for storing the code symbol formed, and an output for a code symbol, characterized in that each sub-computer furthermore comprises its own mode register and its own error register for the control of the processing of the code symbols and the temporary storage of a detected error, respectively.

References Cited (Backward Citations)

US4077028A Cited
EP0031183A2 Cited
GB2081479A Cited

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag