2009Unpublished venueRequires access

Some aspects related with the performability of the sequential multipliers units

Daniel E. Popescu, Mirela Pater

Open publisher page 1 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Adder, Carry (investment), Carry-save adder, Computer science, Serial binary adder, Arithmetic, Process (computing), Parallel computing

Related papers

Back to paper searchBrowse research topicsOriginal source
Some aspects related with the performability of the sequential multipliers units — Research Paper | ScholarLens