Modified Booth algorithm for higher radix fixed-point multiplication

In this paper the general case of multiplying two fixed length signed numbers using radix r(r⩾2) is considered. It is shown that using the standard Booth multiplication algorithm, in such cases, can result in an incorrect answer. A correction cycle is required to correct the answer. The function of the correction cycle depends on the radix (r) and the multiplier word length (M). A rule which modifies the algorithm to correct the answer for general r and M is presented