4-bit ripple-carry adder
A ripple-carry adder adds two multi-bit binary numbers by chaining one full adder per bit.
Open this circuit in LogicLab →
Boolean expressions
- S = A + B + Cin (4 bits)
- Cout = carry out of bit 3
How it works
Each full adder passes its carry-out to the carry-in of the next bit. It is simple and small, but the final sum must wait for the carry to travel through every stage, so wider adders get slower.
Try it yourself
Four full adders in a chain add two 4-bit numbers; each carry ripples into the next stage. Open the circuit, click the switches to change the inputs, and watch the LEDs and the waveform panel respond. You can edit the circuit, convert it to NAND-only or NOR-only gates, and save or export your version.
Related circuits
Reference: en.wikipedia.org/wiki/Adder_(electronics)#Ripple-carry_adder