2018Institution of Engineering and Technology eBooksRequires access

Adder arithmetic units

Lauren Guckert, Earl E. Swartzlander

Open publisher page 0 citations

Abstract

Adders are a universal component of nearly every computing system, whether traditional or modern. Even the most fundamental machine, which performs no arithmetic, requires an adder to calculate address offsets and branch instructions. Adders are also generally less complex than other arithmetic units found in system. This chapter introduces four different adders: a ripple-carry adder, a carry-look-ahead adder, a carry-select adder, and a conditional-sum adder. The traditional CMOS circuits for each of the adders are described, and the performance and area of these designs are each analyzed. The adders vary in terms of their complexity. The simplest design is the ripple-carry adder, and the most complex design is the carry-look-ahead adder. In general, as the complexity of the adder increases, the speed and performance improve.

About this research paper

What this paper is about

Adders are a universal component of nearly every computing system, whether traditional or modern. Even the most fundamental machine, which performs no arithmetic, requires an adder to calculate address offsets and branch instructions. Adders are also generally less complex than other arithmetic units found in system. This chapter introduces four different adders: a ripple-carry adder, a carry-look-ahead adder, a carry-select adder, and a conditional-sum adder. The traditional CMOS circuits for each of the adders are described, and the performance and area of these designs are each analyzed. The adders vary in terms of their complexity. The simplest design is the ripple-carry adder, and the most complex design is the carry-look-ahead adder. In general, as the complexity of the adder increases, the speed and performance improve.

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

Adders are a universal component of nearly every computing system, whether traditional or modern. Even the most fundamental machine, which performs no arithmetic, requires an adder to calculate address offsets and branch instructions. Adders are also generally less complex than other arithmetic units found in system. This chapter introduces four different adders: a ripple-carry adder, a carry-look-ahead adder, a carry-select adder, and a conditional-sum adder. The traditional CMOS circuits for each of the adders are described, and the performance and area of these designs are each analyzed. The adders vary in terms of their complexity. The simplest design is the ripple-carry adder, and the most complex design is the carry-look-ahead adder. In general, as the complexity of the adder increases, the speed and performance improve.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Adder arithmetic units — Research Paper | ScholarLens