Identify the Function Computed by a Multi-Level NAND Circuit Using Bubble Pushing
Synthesis tools aggressively map Boolean logic into multi-level NAND networks to minimize transistor count and maximize switching speed.
The schematic displays a three-level logic circuit composed entirely of two-input NAND gates. The inputs are A, B, C, and D. Gate 1 receives A and B and drives node N1. Gate 2 receives N1 and C and drives node N2. Gate 3 receives N2 and D and drives the output Y.
Apply bubble pushing to convert the schematic into an equivalent AND-OR structure. Determine the minimized Sum of Products (SOP) expression at Y and evaluate the logic path behavior.
Constraints
- Assume all gates are standard 2-input CMOS NAND gates.
- SOP expressions must be fully expanded with no unnecessary parentheses.
- Use standard prime notation for inversion in text answers (e.g., A'B + CD').
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.
Free to solve. A Codiode account keeps your progress.
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.
Part of Gate-Level Logic
Problem 4 of 62 in the Gate-Level Logic track.
Related problems
Browse all problems · Digital logic design practice problems · Learning tracks