Assertion: algorithm | /r/CapableOf | perform rightward arithmetic shift
Facets:
value: on p. let m
type: LOCATION
value: on r
type: TEMPORAL
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.