Boolean Circuits · NAND Game: Arithmetic and Switching
Lesson 3
Problem. Synthesize a circuit of size \(3\) over \(\{\operatorname{NAND}_{2}, \operatorname{INV}_{1}, \operatorname{AND}_{2}, \operatorname{OR}_{2}, \operatorname{XOR}_{2}, \operatorname{HADD}_{2}\}\) computing the full-adder function: \(\operatorname{FADD}_{3}(x_{1}, x_{2}, x_{3}) = (w_{1}, w_{0})\), where \(x_{1} + x_{2} + x_{3} = 2w_{1} + w_{0}\).