Boolean Circuits · NAND Game: Arithmetic and Switching

Lesson 10

Nikolai Chukhin · Alexander S. Kulikov

Problem. Synthesize a circuit of size \(2\) over \(\{\operatorname{NAND}_{2}, \operatorname{INV}_{1}, \operatorname{AND}_{2}, \operatorname{OR}_{2}, \operatorname{XOR}_{2}\}\) computing the one-bit switch function: \(\operatorname{SWITCH}_{1}(s,d) = (c_{1},c_{0}) = (s \land d,\overline{s}\land d)\).