ripple-carry adder

ripple-carry adder

[′rip·əl ¦kar·ē ‚ad·ər]
(computer science)
A device for addition of two n-bit binary numbers, formed by connecting n full adders in cascade, with the carry output of each full adder feeding the carry input of the following full adder.
References in periodicals archive ?
This kind of adder is called a ripple-carry adder, since each carry bit "ripples" to the next full adder as shown in above Fig.
Here, Ripple-carry adder, BruntKung adder, and Ling adder are considered to emphasize the performance properties.
Conventionally, CSL is implemented with dual ripple-carry adder (RCA) with the carry-in of 0 and 1, respectively.