2008Modern ComputerRequires access

Research on Carry Look-Ahead Adder

Tang Jin-yi

Open publisher page 0 citations

Abstract

Introduces the optimization design method of changing the serial adder to the carry look-ahead adder to increase the computing speed of the low level hardware. By removing the iterative relation, carry look-ahead addition makes the variables independent from each other, avoids carry spread and reduces the gate level number.

About this research paper

What this paper is about

Introduces the optimization design method of changing the serial adder to the carry look-ahead adder to increase the computing speed of the low level hardware. By removing the iterative relation, carry look-ahead addition makes the variables independent from each other, avoids carry spread and reduces the gate level number.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Introduces the optimization design method of changing the serial adder to the carry look-ahead adder to increase the computing speed of the low level hardware. By removing the iterative relation, carry look-ahead addition makes the variables independent from each other, avoids carry spread and reduces the gate level number.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Research on Carry Look-Ahead Adder — Research Paper | ScholarLens