Boolean Circuits · NAND Game: Arithmetic and Switching
Lesson 2
Problem. Synthesize a half adder of size 2: \(\operatorname{ADD}(x_{1}, x_{2})=(w_{1}, w_{0})\) such that \(x_{1}+x_{2}=2w_{1}+w_{0}\) (hence, \(w_{1}\) and \(w_{0}\) are the most and the least significant bits of the sum, respectively).
10 points