PARALLEL PROCESSING REED-SOLOMON ENCODING CIRCUIT AND PARALLEL PROCESSING REED-SOLOMON ENCODING METHOD USED FOR SAME

摘要

PROBLEM TO BE SOLVED: To provide a parallel processing Reed-Solomon encoding circuit which can use an optimum number of parallel processes for a system by making it possible to use an arbitrary number of parallel processes.;SOLUTION: Multipliers corresponding to 1st inputs of 1st to 4th Galois field product sum circuits 134 are coefficients of 0-to 3rd order of a generating polynomial G(x). Multipliers corresponding to 2nd inputs of the 1st to 4th Galois field product sum circuits 131 to 134 are coefficients of 0-to 3rd order of a polynomial of the residue obtained by dividing x5 by the generating polynomial G(x). Multipliers corresponding to 3rd inputs of the 1st to 4th Galois field product sum circuits 131 to 134 are coefficients of 0-to 3rd order of a polynomial of the residue obtained by dividing x6 by the generating polynomial G(x). While an information signal is inputted from a 1st selector circuit 121 to a 3rd selector circuit 123, signals A, B, and C are outputted and when not, D, E, and F are outputted.;COPYRIGHT: (C)2001,JPO