Encoder verifier

Claim 2

An encoder verifier for checking the functioning of an encoder in which data and parity bytes are intended to be digitally encoded in data blocks to form for each data block a respective codeword in multi-bit bytes in the form of a Galois field polynomial that is divisible in the Galois field by a generator polynomial, such generator polynomial being the Galois field product of a plurality of factors, said encoder verifier comprising: polynomial dividing means responsive to codewords for polynomial division in a Galois field of respective codewords by only one of said factors to produce a remainder signal systematically related to the remainder from such division, and indicator means responsive to a said remainder signal corresponding to a remainder signal other than zero for producing an indication of encoder malfunction.

Claim 3

A digital encoder verifier for checking the functioning of a Reed-Solomon encoder in which data and parity bytes are intended to be digitally encoded in data blocks to form for each data block a respective codeword in successive m-bit bytes in the form of a Galois field polynomial that is divisible in the Galois field by a generator polynomial, such generator polynomial being the Galois field product of a plurality of factors and m being an integer greater than 1, said encoder verifier comprising Galois field addition means for Galois field adding a received m-bit byte to a delayed m-bit addend to produce an m-bit sum, means for sucessively applying m-bit bytes of a respective codeword to said addition means, Galois field multiplying means for Galois field multiplying said m-bit sum by a predetermined constant corresponding to one of said factors to produce an m-bit product, means for delaying said m-bit product to produce a delayed product and applying the delayed product to said addition means as a delayed m-bit addend at a time when the next successive byte of the respective codeword is applied to said addition means, and indicator means responsive to completion of receipt and addition of the last m-bit byte of a respective codeword and to a said m-bit sum other than zero at that time for producing an indication of malfunction.

Claim 4

A digital encoder verifier for checking the functioning of a Reed-Solomon encoder in which data and parity bytes are intended to be digitally encoded in data blocks to form for each data block a respective codeword in successive m-bit bytes in the form of a Galois field polynomial that is divisible in the Galois field by a generator polynomial, such generator polynomial being the Galois field product of a plurality of factors and m being an integer greater than 1, said encoder verifier comprising Galois field addition means for Galois field adding a received m-bit byte to a delayed m-bit addend to produce an m-bit sum, means for sucessively applying m-bit bytes of a respective codeword to said addition means, Galois field multiplying means for Galois field multiplying said m-bit sum by a predetermined constant corresponding to one of said factors to produce an m-bit product, means for delaying said m-bit product to produce a delayed product and applying the delayed product to said addition means as a delayed m-bit addend at a time when the next successive byte of the respective codeword is applied to said addition means, and indicator means responsive to completion of receipt and addition of the last m-bit byte of a respective codeword and to a said m-bit sum other than zero at that time for producing an indication of malfunction.

Claim 5

A digital encoder verifier in accordance with claim 2 wherein said encoder is intended to produce codewords interleaved to a depth δ, where δ is greater than 1, and clock pulses corresponding to each byte of said codewords, and wherein said means for delaying includes memory means responsive to said clock pulses for receiving m-bit bytes, storing them for δ clock pulses, and outputting them.

Claim 6

A digital encoder verifier in accordance with claim 3 wherein said memory means comprises a shift register.

Claim 7

A digital encoder verifier in accordance with claim 4 wherein said shift register comprises a random access memory for receiving bytes into and outputting bytes from addressed positions, and a δ-bit counter responsive to said clock pulses for successively addressing δ m-bit positions.

Claim 8

A digital encoder verifier in accordance with claim 2 wherein said codeword is formed of no more than 2 m -1 bytes.

Claim 9

A digital encoder verifier in accordance with claim 6 wherein m=8 and said generator polynomial is a 12th order polynomial.

Claim 10

A digital encoder verifier in accordance with claim 2 wherein said means for delaying said m-bit product is disposed at least in part in circuit between said addition means and said multiplier means to delay the application of said sum to said multiplier.

Claim 11

A digital encoder verifier in accordance with claim 2 wherein said encoder is intended produce codewords interleaved to a depth δ, where δ is greater than 1, and clock pulses corresponding to each byte of said codewords, said verifier including means responsive to said clock pulses for producing a selection pulse every δth clock pulse for selecting bytes of a respective interleaved codeword, and means for applying said selected bytes to said addition means.