Three module memory system constructed with symbol-wide memory chips and having an error protection feature, each symbol consisting of 2I+1 bits

Claim 2

A three module memory system, each module having an equal number of memory symbol locations, each memory symbol location having an equal number of 2 i +1 memory bit locations, a memory word thus containing 3(2 i +1) bits with 3≦i, said memory system comprising input means for receiving user words of 2.sup.(i+1) bits, encoding means fed by said input means for multiplying a user word received by a generator matrix (GO) to produce a memory word for storing in three corresponding memory symbol locations, wherein (GO)=(P)×(G)×(Q), wherein (P) is an arbitrary regular matrix of dimensions (2 i+1 )×(2 i+1 ), (Q) is an arbitrary permutation matrix of dimensions {3×(2 i +1)}×{3×(2 i +1)} for effecting bit-wise permutation within a code symbol and/or symbol-wise permutation within a code word, the choice for (P) and (Q) including identity matrices, and wherein G is a matrix of dimensions (2 i+1 ) rows and 3×(2 i +1) columns for implementing a bitwise systematic error protection code having a minimum distance profile of (p, 2, 0) wherein p is at least equal to five.

Claim 3

A three module memory system, each module having an equal number of memory symbol locations, each memory symbol location having an equal number of 2 i +1 memory bit locations, a memory word thus containing 3(2 i +1) bits with i=2, said memory system comprising input means for receiving user words of 2.sup.(i+1) bits, encoding means fed by said input means for multiplying a user word received by a generator matrix (GO) to produce a memory word for storing in three corresponding memory symbol locations, wherein (GO)=(P)×(G)×(Q), wherein (P) is an arbitrary regular matrix of dimensions (2 i+1 )×(2 i+1 ), (Q) is an arbitrary permutation matrix of dimentions {3×(2 i +1)}×{3×(2 i +1)} for effecting bit-wise permutation within a code symbol and/or symbol-wise permutation within a code word, the choice for (P) and (Q) including identity matrices, and wherein (G) is a matrix for implementing a bitwise systematic error protection code having a minimum distance profile of (p, 2, 0) wherein p is equal to four.

Claim 4

A three module memory system, each module having an equal number of memory symbol locations, each memory symbol location having an equal number of 2 i +1 memory bit locations, a memory word thus containing 3(2 i +1) bits with i=2, said memory system comprising input means for receiving user words of 2.sup.(i+1) bits, encoding means fed by said input means for multiplying a user word received by a generator matrix (GO) to produce a memory word for storing in three corresponding memory symbol locations, wherein (GO)=(P)×(G)×(Q), wherein (P) is an arbitrary regular matrix of dimensions (2 i+1 )×(2 i+1 ), (Q) is an arbitrary permutation matrix of dimentions {3×(2 i +1)}×{3×(2 i +1)} for effecting bit-wise permutation within a code symbol and/or symbol-wise permutation within a code word, the choice for (P) and (Q) including identity matrices, and wherein (G) is a matrix for implementing a bitwise systematic error protection code having a minimum distance profile of (p, 2, 0) wherein p is equal to four.

Claim 5

A three module memory system as claimed in claim 1, wherein p is equal to at least six.

Claim 6

A three module memory system as claimed in any one of claims 1, 2, or 3, wherein said generator matrix (G) has the shape of ##EQU3## wherein I is an identity matrix of 2 i ×2 i entries, 0 is an all-zero matrix of 2 i ×2 i entries, p T (I) is all-one parity generator column for generating a parity bit over a first half of the data word, and a second half of the data word, respectively, p T (0) is an all-zero column, M is a basic redundancy matrix, M 2 is the square matrix of M and p T (M) and p T (M 2 ) are the associated columns for generating a parity bit thereover, and wherein I+M+M 2 =0.

Claim 7

A three module memory as claimed in claim 4, wherein (M)×(M)×(M) is equal to an identify matrix (I) and (M) has components m j ,k wherein 0≦j, k≦2 i -1 and ##EQU4## which means that (m j ,0 . . . m j ,2 i -1 ) is the binary representation of ca b .2.spsp.j with respect to the normal basis N b of the Galois field GF(2 2 .spsp.i) in question, wherein a is a zero of the associated primitive polynomial and c is a predetermined power of said zero.

Claim 8

A three module memory as claimed in claim 5, wherein i=3, p(x)=x 8 +x 4 +x 3 +x 2 +1 over GF(2) and c=a 85 or c=a 170 .

Claim 9

A three module memory as claimed in any one of the claims 1 through 3, said memory system having decoder means coupled to an output of said memory system for decoding a code word received as being protected by a code defined by said generator matrix (G), said decoder having syndrome generator means (106) coupled to said output for generating 3(2 i +1)-2 i+1 syndrome bits, first detector means (108, 132) fed by said syndrome generator for detecting a non-zero syndrome, second detector means (110, 112, 114) fed by said syndrome generator for detecting a situation in which only a single code word symbol has an incorrect parity and pointing to said code symbol, third detector means (116 . . . 130) fed by said syndrome generator for provisionally indicating a sequence number of a single erroneous code bit within its code symbol, correlating means (134, 136) fed by said first, second and third detector means, for correlating an indicated sequence number and a pointed code symbol and thereupon producing a single bit error indicator, first signalling means (142, 148) fed by said correlating means and by said first detector means, in case of a non-zero syndrome under absence of a single bit error indicator, for signalling an incorrectable error.

Claim 10

A three module memory system as claimed in claim 7, furthermore comprising second signalling means (142) fed by said correlating means for signalling a "no-single-bit-error situation" to said first signalling means.