| 摘要 |
By taking a high-order position in an operand which is normalized in a two bit unit by means of and output from a normalizing circuit as an address, an approximation of square root's reciprocal is indexed by means of a table information storing unit. By multiplying an output of a residue holding circuit which takes a 0th residue as a normalized operand by the approximation of square root's reciprocal by using a multiplying circuit, a partial square root value is found. The individual partial square root values each having a overlapped bit at each iteration are merged with one another by means of a digit aligning circuit and an adder. A residue for a next step in iterative computation is found by subtracting a product of a merged square root value and a partial square root value from a residue by means of an inverting circuit, a multiplicand generator, a (R+S*T) operation unit.
|
