1

wanted to know the minimum number of gates required to implement a $2$-bit adder, with $4$ inputs $(A_0, B_0, A_1, B_1)$, and $3$ outputs $(S_0,S_1, Carryout)$ using ONLY Universal gates

Thank you.

Kenta S
  • 16,151
  • 15
  • 26
  • 53
Abdalrahman Abouzaied
  • 49
  • "Only universal gates" isn't specific enough. NOT and OR together is a universal set. NOR by itself is universal. Exactly what set of gates would you like to use? Also, what have you tried? How many gates do you need for your best attempt? – Arthur Jul 07 '18 at 09:42
  • A few minutes of googling gives this diagram of a 4-bit full adder which only uses NAND gates. With a little work, this is easily reduced to your 2-bit half adder. – Jens Jul 07 '18 at 16:23

0 Answers0