| 摘要 |
PURPOSE:To obtain a remainder with a reasonable hardware quantity in a high speed, by using features and characters of prime numbers effectively. CONSTITUTION:In case that a prime number is 23, the index number is 11, and the prime number is expressed with 2<5>-9. A divisor integer is stored in a register 1 in order of a0, a1...a14 (in case of 15 digits) from the lower bits. A value of a42<4>+a32<3>+a22<2>+a12+a0 and a value of a142<3>+a132<2>+ a122+a11 are added in an adder 5. Meanwhile, the result of the multiplication a(a92<4>+a82<3>+a72<2>+a62+ a5) in a multiplier 2 and the result of the multiplication of a10 and 12a10 in a multiplier 3 are added in an adder 4. Contents of adders 4 and 5 are added in an adder 6, and the result is transferred to a convergence discriminating device 7 through a transfer line 67. The device 7 sends contents of the transfer line 67 to a transfer line 70 as the final result if contents of the transfer line are prime number <=23, but the device 7 subtracts 23 from contents of the transfer line 67 and sends the subtraction result to the transfer line 70 if contents of the transfer line 67 are >=2<5>. |
