Truth Table to Canonical POS
NOR-based CMOS logic families natively implement functions expressed in Product of Sums (POS) form.
The truth table below defines a three-input logic function F with inputs A, B, and C.
| A | B | C | F | |---|---|---|---| | 0 | 0 | 0 | 1 | | 0 | 0 | 1 | 0 | | 0 | 1 | 0 | 1 | | 0 | 1 | 1 | 0 | | 1 | 0 | 0 | 0 | | 1 | 0 | 1 | 1 | | 1 | 1 | 0 | 0 | | 1 | 1 | 1 | 1 |
Identify the maxterms of the function. Express the output F in canonical Product of Sums notation.
Constraints
- Canonical POS must include all variables in every sum term.
- Maxterm indices correspond to the binary value of the inputs where
Fevaluates to 0.
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.