Ripple-Carry Adder

combinatorial-logic

Definition

Ripple-Carry Adder

The ripple-carry adder consists of multiple 1-bit adders chained together to form a computational unit.

Problem: Ripple-carry adders are slow. Their delay is denoted as:

$$t_{\text{ripple}}=N\cdot t_{\text{full adder}}$$

where $N$ is the number of full adders in the chain.

¹

Footnotes

1. Digital Design and Computer Architecture - RISC-V Edition ↩