Boolean Circuits · NAND Game: Arithmetic and Switching

Lesson 7

Nikolai Chukhin · Alexander S. Kulikov

Problem. Synthesize a circuit of size \(4\) over \(\{\operatorname{NAND}_{2}, \operatorname{INV}_{1}, \operatorname{AND}_{2}, \operatorname{OR}_{2}, \operatorname{XOR}_{2}\}\) computing the zero-test function on a 4-bit value: \(\operatorname{ISZERO}_{4}(x) = [x = 0]\), where the input bits are \(x_{3},x_{2},x_{1},x_{0}\).