Digital Arithmetic

Result-Digit Selection

347

EXAMPLE 6.3

The number of bits of the integer square root is

(n - m)/2.

Consequently,

the number of iterations required to obtain these bits is

NI

= [(n-m)/2k

]

6.37

where r = 2k is the radix of the result digit.

The result has to be aligned to the integer position. This can be done by

placing the digits in the correct final position or placing the digits aligned to the

left (to combine with fractional square root) and then performing a right shift of

(n -m)/2

bits.

2

We now show an example of integer square root, radix 4 with p - g and 8-bit

operand. Consider the case x = 27 with binary representation ...