Two-Input XOR Using Minimum NAND Gates
Parity checking, cryptography, and arithmetic datapaths rely heavily on exclusive-OR operations. In standard cell libraries, optimizing this function for area and delay requires minimizing the transistor count by using universal gates efficiently.
The circuit must implement the XOR logical function using the inputs A and B to drive the output Y.
| A | B | Y | |-----|-----|-----| | 0 | 0 | 0 | | 0 | 1 | 1 | | 1 | 0 | 1 | | 1 | 1 | 0 |
Constraints
- Use only 2-input NAND gates.
- Do not exceed a total gate count of 4.
- Combinational logic only.
Topics
Solve this problem
Place the gates, wire them up and watch the signals settle. Every submission runs on the same simulation engine that grades it.
This problem is part of Codiode Pro. The statement above is free to read.
The circuit builder and code editor need a desktop screen. On a phone, read the problem here and open it on a laptop to solve.