Modified Booth 1's complement and modulo 2/sup n/-1 multipliers

In this paper we derive a novel modified Booth multiplier architecture which is based on 1's complement arithmetic. We also extend our theory to the design of module 2/sup n/-1 multipliers. The proposed 1's complement modified Booth multipliers have an execution latency which is approximately the same as that offered by their 2's complement counterparts with a completely regular structure. Therefore, pipelined implementations of them can be derived in a straightforward manner. The proposed modified Booth module 2/sup n/-1 multipliers can find great applicability in Residue Number System (RNS) applications.