Boolean Circuits · NAND Game: Arithmetic Logic Unit (Optional)

Lesson 5

Nikolai Chukhin · Alexander S. Kulikov

Problem. Synthesize a circuit of size \(8\) over \(\{\operatorname{NAND}_{2}, \operatorname{INV}_{1}, \operatorname{AND}_{2}, \operatorname{OR}_{2}, \operatorname{XOR}_{2}, \operatorname{ISNEG}_{16}, \operatorname{ISZERO}_{16}\}\) computing the condition predicate: \[\operatorname{CONDITION}_{16}(\texttt{lt},\texttt{eq},\texttt{gt},x)=j=(\texttt{lt}\land [x<0]) \lor (\texttt{eq}\land [x=0]) \lor (\texttt{gt}\land [x>0]),\] where \(x\) is a 16-bit two's-complement value.

String task, Advanced problem