A new modulo 2a+1 multiplier

This paper presents the design of a new modulo 2^a + 1 multiplier. It makes use of the redundancy in the binary representation of numbers in the finite integer ring R(2¹+1), though, unlike in some other designs, code translations are not involved. The use of the periodic properties of powers of two taken modulo 2^a+1 simplifies the result correction process and permits a highly regular circuit structure which is suitable for VLSI implementation. Since the multiplier is almost exclusively composed of full and half adders, it can easily be pipelined with throughput reaching hundreds of megahertz. Such performance should make the implementation very attractive in many DSP applications