A. Skavantzos
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.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Adder, Arithmetic, Modulo, Carry (investment), Carry-save adder, Serial binary adder, Computer science, Mathematics