| 摘要 |
PROBLEM TO BE SOLVED: To provide a coding arithmetic circuit for performing respectively cyclic code and convolution code arithmetic operations that eliminates the need for preparing a shift register with the same length as a maximum order of a generation polynomial required for a system so as to reduce the circuit scale and freely set the generation polynomial. SOLUTION: The coding arithmetic circuit is provided with a generation polynomial storage means 101 that stores coefficient data of one or a plurality of generation polynomials, a shift register means 103 that comprises N-sets of latch circuits, N-sets of logic arithmetic means 104 or below that are laid out corresponding to the latch circuits, a connection changeover means 105 that can optionally switch connections among respective terminals for the latch circuits, the logic arithmetic means and an input data stream, and a connection control means 106 that controls the connection changeover means according to designation of the cyclic code and convolution code arithmetic operations and the coefficient data of the generation polynomials.
|
