On the Design of Modulo 2^n+1 Multipliers

In this work a new efficient modulo 2ⁿ+1 modified Booth multiplication algorithm for operands in the weighted representation is proposed. According to our algorithm [n/2]+2 partial products are derived. The resulting partial products are reduced by an inverted end around carry save adder tree to two operands, which are finally added by a diminished-1 modulo 2ⁿ+1 adder. Our design compares favorably for both area and delay to the modulo 2ⁿ+1 modified Booth multipliers previously proposed.