Assertion: algorithm | /r/CapableOf | let the number of bits
Facets:
value: in m
type: LOCATION
Source sentences:
text: Booth's algorithm can be implemented by repeatedly adding (with ordinary unsigned binary addition) one of two predetermined values A and S to a product P, then performing a rightward arithmetic shift on P. Let m and r be the multiplicand and multiplier, respectively; and let x and y represent the number of bits in m and r.