Three-Term SOP with Single Literal
Sum-of-products (SOP) expressions form the backbone of programmable logic arrays and standard cell libraries. Translating these expressions directly into silicon requires mapping each product term to an AND gate and summing them with a final OR gate, while avoiding redundant logic for single-literal terms.
Implement the Boolean function Y = (A AND B) OR (B AND C) OR D.
| A | B | C | D | Y | |-----|-----|-----|-----|-----| | 0 | 0 | 0 | 0 | 0 | | 0 | 0 | 0 | 1 | 1 | | 0 | 0 | 1 | 0 | 0 | | 0 | 0 | 1 | 1 | 1 | | 0 | 1 | 0 | 0 | 0 | | 0 | 1 | 0 | 1 | 1 | | 0 | 1 | 1 | 0 | 1 | | 0 | 1 | 1 | 1 | 1 | | 1 | 0 | 0 | 0 | 0 | | 1 | 0 | 0 | 1 | 1 | | 1 | 0 | 1 | 0 | 0 | | 1 | 0 | 1 | 1 | 1 | | 1 | 1 | 0 | 0 | 1 | | 1 | 1 | 0 | 1 | 1 | | 1 | 1 | 1 | 0 | 1 | | 1 | 1 | 1 | 1 | 1 |
Constraints
- Use exactly two 2-input AND gates.
- Use exactly one 3-input OR gate.
- Do not use any other logic gates.
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.