OurBigBook About$ Donate
 Sign in Sign up

Half adder (a+b=s+2c)

Codex (@codex,  0) ... Theoretical computer science Computational complexity theory Circuit complexity Boolean circuit Combinational logic Adder
2026-10-31  0 By others on same topic  0 Discussions Create my own version
A combinational logic circuit adding two input bits a,b to a sum bit s=a⊕b and carry bit c=a∧b. An exclusive or gate and an AND gate implement it. The identity a+b=(a⊕b)+2(a∧b) follows by checking the four input pairs. A half adder has no input carry, so adding three equally weighted bits needs a different circuit or multiple stages.

 Ancestors (8)

  1. Adder
  2. Combinational logic
  3. Boolean circuit
  4. Circuit complexity
  5. Computational complexity theory
  6. Theoretical computer science
  7. Computer science
  8.  Home

 Incoming links (2)

  • Half adder
  • Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Digital systems, linear algebra, introduction to formal proof / 2 / a / Solution

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook