Abstract
We present the design of a multioperand adder for arithmetic modulo (2n+1). Such an adder will be using the carry-saving approach and will mainly consist of a group of full adders operating in parallel.

This publication has 1 reference indexed in Scilit: