Some aspects related with the performability of the sequential multipliers units
Daniel E. Popescu, Mirela Pater
Abstract
Daniel E. Popescu, Mirela Pater
Abstract
There are two basic ways in which the basic procedures can be speeded up: speeding up each addition and reducing the number of additions required. Faster addition can be achieved through the use of progressively adder, (carry-skip adder, carry-lookahead adder, carry-select adder). The problem is that once the list of this adders has been exhausted, some other method for speeding up the addition process is needed; one such method is that of using carry save adders, which is analyzed in this paper.
OpenAlex reports 1 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.
There are two basic ways in which the basic procedures can be speeded up: speeding up each addition and reducing the number of additions required. Faster addition can be achieved through the use of progressively adder, (carry-skip adder, carry-lookahead adder, carry-select adder). The problem is that once the list of this adders has been exhausted, some other method for speeding up the addition process is needed; one such method is that of using carry save adders, which is analyzed in this paper.
Key concepts: Adder, Carry (investment), Carry-save adder, Computer science, Serial binary adder, Arithmetic, Process (computing), Parallel computing