GALOIS FIELD COMPUTER

摘要

Errors are corrected in a cyclic encoded data stream, consisting of sequential groups of data bits and check bits, by means of a novel digital computer. The computer employs a stored program and is organized into three distinct substructures, each having an independent internal addressable memory and all capable of synchronous concurrent operation. An arithmetic unit substructure (6) including a data memory (60) implements finite field arithmetic operations upon received data. The arithmetic unit includes a Galois field manipulative subunit (62) for producing finite field products and sums over the field GF(25) from operands selected from three registers which derive data from the memory of the arithmetic unit, another register, or the result of a currently executed Galois field operation. The preferred embodiment is especially suitable for correcting data encoded in the Reed-Solomon (31, 15) code. An address generator (5) realizes address modification in the Galois field GF(27), whereby consecutive addresses in data memory (60) are characterized by a shift register sequence. The address generator (5) includes a counter memory array (52) and an equality test facility (54). Counter memory words of the address generator may selectably retain either the modified or non-modified address. A control unit substructure (4) includes a control memory for storage and execution of the instruction sequence, branching logic (44) for determining the transfer of control in response to logical functions of up to 16 logical variables, and select means and gating means for execution of instructions in all three substructures. Provision for data dependent arithmetic function selection, not employed for decoding the (31, 15) Reed-Solomon code, permits operation of the apparatus to yield solutions at high speed to simultaneous linear binary equations.