High speed double error correction plus triple error detection system

Claim 2

In a nine bit parity system for eight bit data providing single and double error correction and triple error detection the combination of: parity generating means for dividing eight bit incoming data D(X) by a polynomial generator G(X) to obtain a quotient Q(X) and a remainder R(X) consisting of nine parity bits; encoding means connected to said parity generating means for forming a seventeen bit encoded word M(X) including said nine parity bits R(X) concatenated to said incoming data D(X); decoding means operatively coupled to receive previously encoded words N(X) and divide at least a portion of same by said polynomial generator G(X) to obtain a quotient and an error decode remainder E(X), N(X) being assumed equal to M(X) and free of errors when E(X) equals zero; an error correction decode table including the values of E(X) corresponding to all possible single and double errors in N(X); error correction means coupled to said decoding means and said error decode table to correct any single or double errors in the data bits of N(X) as may be indicated by the error decode remainder; and said generator polynomial G(X) being selected to have a unique value E(X) for each possible single and double error and a value of E(X) other than zero for at least each triple error.

Claim 3

The single and double error correction, triple error detection, parity system according to claim 1 wherein said polynomial generator G(X) is: G(1171) = X.sup.9 + X.sup.6 + X.sup.5 + X.sup.4 + X.sup.3 + 1.

Claim 4

The single and double error correction, triple error detection, parity system according to claim 2 wherein said error correction decode table is as set forth in FIG. 6 of the drawings.

Claim 5

The single and double error correction, triple error detection, parity system according to claim 2 further comprising: an error detection decode table including values of E(X) corresponding to triple and higher order errors in the data bits of previously encoded words N(X); indicating means coupled to said decoding means and said error detection decode table to indicate when said error decode remainder E(X) corresponds to one of the values in said error detection decode table; and said error detection decode table being as set forth in FIG. 7 of the drawings.

Claim 6

The single and double error correction, triple error detection, parity system according to claim 1 wherein said polynomial generator G(X) is: G(1513) = X.sup.9 + X.sup.8 + X.sup.6 + X.sup.3 + X + 1.

Claim 7

The single and double error correciton, triple error detection, parity system according to claim 5 wherein said error correction decode table is as set forth in FIG. 9 of the drawings.

Claim 8

The single and double error correction, triple error detection, parity system according to claim 5 further comprising: an error detection decode table including values of E(X) corresponding to triple and higher order errors in the data bits of previously encoded words N(X); indicating means coupled to said decoding means and said error detection decode table to indicate when said error decode remainder E(X) corresponds to one of the values in said error detection decode table; and said error detection table being as set forth in FIG. 10 of the drawings.

Claim 9

The single and double error correction, triple error detection, parity system according to claim 1 wherein said parity generating means comprises a nine stage shift register with feedback from the last stage to stages selected according to the generator polynomial G(X).

Claim 10

The single and double error correction, triple error detection, parity system according to claim 1 wherein said decoding means comprises a nine stage shift register with feedback from the last stage to stages selected according to the generator polynomial G(X).

Claim 11

The single and double error correction, triple error detection, parity system according to claim 1 wherein said parity generating means comprises parallel logic circuits for obtaining said nine parity bits according to parity equations derived from the polynomial generator G(X).

Claim 12

The single and double error correction, triple error detection, parity system according to claim 1 wherein said decoding means comprises parallel logic circuits for obtaining parity bits according to the parity equations derived from the polynomial generator G(X).

Claim 13

The single and double error correction, triple error detection, parity system according to claim 1 further comprising: an error detection decode table including values of E(X) corresponding to triple errors and higher order errors in the data bits of previously encoded words N(X); and indicating means coupled to said decoding means and said error detection decode table to indicate when said error decode remainder E(X) corresponds to one of the values in said error detection decode table.

Claim 14

A single and double error correction, triple error detection system according to claim 1 wherein said decoding means divides the entire encoded word N(X) by said polynomial generator G(X) to obtain said error decode remainder E(X).

Claim 15

In a nine bit parity bit system for eight bit data providing single and double error correction and triple error detection the combination of: parity generating means including a first nine stage shift register having feedback from the last stage to other stages selected according to a generator polynomial generator G(X), and means for shifting said first shift register seventeen times as the eight inncoming data bits D(X) are serially advanced through said first shift register, the nine parity bits R(X) being the bits in said first shift register after seventeen shifts; encoding means connected to said parity generating means for forming a seventeen bit encoded word M(X) including said nine parity bits R(X) concatenated to said incoming data D(X); encoding means including a second nine stage shift register having feedback from the last stage to other stages selected according to a generator polynomial generator G(X); means for shifting said second shift register seventeen times as the bits of a previously encoded word N(X) is serially advanced through said second shift register; the nine bits remaining in said second shift register after seventeen shifts being an error decode remainder E(X) such that N(X) is assumed equal to M(X) and free of errors when E(X) equals zero; an error correction decode table including the values of E(X) corresponding to all possible single and double errors in N(X); error correction means coupled to said decoding means and said error decode table to correct any single or double errors in the data bits of N(X) as may be indicated by the error decode remainder; and said generator polynomial G(X) being selected to have a unique value E(X) for each possible single and double error and a value of E(X) other than zero for at least each triple error.

Claim 16

In a nine bit parity bit system for eight bit data providing single and double error correction and triple error detection the combination of: parity generating means including a first nine stage shift register having feedback from the last stage to other stages selected according to a generator polynomial generator G(X), and means for shifting said first shift register seventeen times as the eight inncoming data bits D(X) are serially advanced through said first shift register, the nine parity bits R(X) being the bits in said first shift register after seventeen shifts; encoding means connected to said parity generating means for forming a seventeen bit encoded word M(X) including said nine parity bits R(X) concatenated to said incoming data D(X); encoding means including a second nine stage shift register having feedback from the last stage to other stages selected according to a generator polynomial generator G(X); means for shifting said second shift register seventeen times as the bits of a previously encoded word N(X) is serially advanced through said second shift register; the nine bits remaining in said second shift register after seventeen shifts being an error decode remainder E(X) such that N(X) is assumed equal to M(X) and free of errors when E(X) equals zero; an error correction decode table including the values of E(X) corresponding to all possible single and double errors in N(X); error correction means coupled to said decoding means and said error decode table to correct any single or double errors in the data bits of N(X) as may be indicated by the error decode remainder; and said generator polynomial G(X) being selected to have a unique value E(X) for each possible single and double error and a value of E(X) other than zero for at least each triple error.

Claim 17

The single and double error correction, triple error detection, parity system according to claim 14 wherein said first and second shift registers include feedback to the first, fourth, fifth, sixth and seventh stages.

Claim 18

The single and double error correction, triple error detection, parity system according to claim 14 wherein said first and second shift registers include feedback to the first, second, fourth, seventh and ninth stages.

Claim 19

In a nine bit parity system for eight bit data providing single and double error correction and triple error detection the combination of: parity generating means including parallel logic for developing nine parity bits P(X) from incoming data D(X) using parity equations derived from the generator polynomial G(X); encoding means connected to said parity generating means for forming a seventeen bit encoded word M(X) including said nine parity bits P(X) concatenated to said incoming data D(X); decoding means operatively coupled to receive previously encoded words N(X) and including a parallel logic for developing an error decode remainder E(X) from the previously encoded word N(X) using parity equations derived from said generator polynomial G(X), N(X) being assumed equal to M(X) and free of errors when E(X) equals zero; an error correction decode table including the values of E(X) corresponding to all possible single and double errors in N(X); and error correction means coupled to said decoding means and said error decode table to correct any single or double errors in the data bits of N(X) as may be indicated by the error decode remainder; said generator polynomial equation G(X) being selected to have a unique value E(X) for each possible single and double error and a value of E(X) other than zero for at least each triple error.

Claim 20

In a nine bit parity system for eight bit data providing single and double error correction and triple error detection the combination of: parity generating means including parallel logic for developing nine parity bits P(X) from incoming data D(X) using parity equations derived from the generator polynomial G(X); encoding means connected to said parity generating means for forming a seventeen bit encoded word M(X) including said nine parity bits P(X) concatenated to said incoming data D(X); decoding means operatively coupled to receive previously encoded words N(X) and including a parallel logic for developing an error decode remainder E(X) from the previously encoded word N(X) using parity equations derived from said generator polynomial G(X), N(X) being assumed equal to M(X) and free of errors when E(X) equals zero; an error correction decode table including the values of E(X) corresponding to all possible single and double errors in N(X); and error correction means coupled to said decoding means and said error decode table to correct any single or double errors in the data bits of N(X) as may be indicated by the error decode remainder; said generator polynomial equation G(X) being selected to have a unique value E(X) for each possible single and double error and a value of E(X) other than zero for at least each triple error.

Claim 21

The single and double error correction, triple error detection, parity system according to claim 17 wherein the parallel logic of said decoding means develops the error decode remainder E(X) = E 1 . . . E 9 from the data bits d 1 . . . d 8 and parity bits p 1 . . . p 8 of the previously encoded word N(X) according to the following parity equations: E.sub.1 = p.sub.1 ⊕d.sub.1 ⊕d.sub.4 ⊕d.sub.5 ⊕d.sub.6 E.sub.2 = p.sub.2 ⊕d.sub.2 ⊕d.sub.5 ⊕d.sub.6 ⊕d.sub.7 E.sub.3 = p.sub.3 ⊕d.sub.3 ⊕d.sub.6 ⊕d.sub.7 ⊕d.sub.8 E.sub.4 = p.sub.4 ⊕d.sub.1 ⊕d.sub.5 ⊕d.sub.6 ⊕d.sub.7 ⊕d.sub.8 E.sub.5 = p.sub.5 ⊕d.sub.1 ⊕d.sub.2 ⊕d.sub.4 ⊕d.sub.5 ⊕d.sub.7 ⊕d.sub.8 E.sub.6 = p.sub.6 ⊕d.sub.1 ⊕d.sub.2 ⊕d.sub.3 ⊕d.sub.4 ⊕d.sub.8 E.sub.7 = p.sub.7 ⊕d.sub.1 ⊕d.sub.2 ⊕d.sub.3 ⊕d.sub.6 E.sub.8 = p.sub.8 ⊕d.sub.2 ⊕d.sub.3 ⊕d.sub.4 ⊕d.sub.7 E.sub.9 = p.sub.9 ⊕d.sub.3 ⊕d.sub.4 ⊕d.sub.5 ⊕d.sub.8.

Claim 22

The single and double error correction triple error detection, parity system according to claim 17 wherein the parallel logic of said parity generating means develops the parity bits R(X) = P 1 . . . P 9 from the data D(X) = D 1 . . . D 8 according to the following parity equations: P.sub.1 = D.sub.1 ⊕D.sub.2 ⊕D.sub.3 ⊕D.sub.5 ⊕D.sub.7 ⊕D.sub.8 p.sub.2 = d.sub.1 ⊕d.sub.4 ⊕d.sub.5 ⊕d.sub.6 ⊕d.sub.7 p.sub.3 = d.sub.2 ⊕d.sub.5 ⊕d.sub.6 ⊕d.sub.7 ⊕d.sub.3 p.sub.4 = d.sub.1 ⊕d.sub.2 ⊕d.sub.5 ⊕d.sub.6 p.sub.5 = d.sub.2 ⊕d.sub.3 ⊕d.sub.6 ⊕d.sub.7 p.sub.6 = d.sub.3 ⊕d.sub.4 ⊕d.sub.7 ⊕d.sub.8 p.sub.7 = d.sub.1 ⊕d.sub.2 ⊕d.sub.3 ⊕d.sub.4 ⊕d.sub.7 p.sub.8 = d.sub.2 ⊕d.sub.3 ⊕d.sub.4 ⊕d.sub.5 ⊕d.sub.8 p.sub.9 = d.sub.1 ⊕d.sub.2 ⊕d.sub.4 ⊕d.sub.6 ⊕d.sub.7 ⊕d.sub.8.

Claim 23

the single and double error correction, triple error detection, parity system according to claim 17 wherein the parallel logic of said decoding means develops the error decode remainder E(X) = E 1 . . . E 9 from the data bits d 1 . . . d 8 and parity bits p 1 . . . p 8 of the previously encoded word N(X) according to the following parity equation: E.sub.1 = p.sub.1 ⊕d.sub.1 ⊕d.sub.2 ⊕d.sub.3 ⊕d.sub.5 ⊕d.sub.7 ⊕d.sub.8 E.sub.2 = p.sub.2 ⊕d.sub.1 ⊕d.sub.4 ⊕d.sub.5 ⊕d.sub.6 ⊕d.sub.7 E.sub.3 = p.sub.3 ⊕d.sub.2 ⊕d.sub.5 ⊕d.sub.6 ⊕d.sub.7 ⊕d.sub.8 E.sub.4 = p.sub.4 ⊕d.sub.1 ⊕d.sub.2 ⊕d.sub.5 ⊕d.sub.6 E.sub.5 = p.sub.5 ⊕d.sub.2 ⊕d.sub.3 ⊕d.sub.6 ⊕d.sub.7 E.sub.6 = p.sub.6 ⊕d.sub.3 ⊕d.sub.4 ⊕d.sub.7 ⊕d.sub.8 E.sub.7 = p.sub.7 ⊕d.sub.1 ⊕d.sub.2 ⊕d.sub.3 ⊕d.sub.4 ⊕d.sub.7 E.sub.8 = p.sub.8 ⊕d.sub.2 ⊕d.sub.3 ⊕d.sub.4 ⊕d.sub.5 ⊕d.sub.8 E.sub.9 = p.sub.9 ⊕d.sub.1 ⊕d.sub.2 ⊕d.sub.4 ⊕d.sub.6 ⊕d.sub.7 ⊕d.sub.8.