Boolean Circuits · NAND Game: Arithmetic and Switching

Lesson 9

Nikolai Chukhin · Alexander S. Kulikov

Problem. Synthesize a circuit of size \(3\) over \(\{\operatorname{NAND}_{2}, \operatorname{INV}_{1}, \operatorname{AND}_{2}, \operatorname{OR}_{2}, \operatorname{XOR}_{2}\}\) computing the one-bit selector function: \[\operatorname{SELECT}_{1}(s,d_{1},d_{0})=z=d_{s}.\]