SOP and POS: Minterms, Maxterms and Canonical Forms
Any Boolean function can be written as a sum of products (SOP) of minterms or a product of sums (POS) of maxterms, read directly from its truth table.
A minterm is an AND of all variables, each appearing once, complemented or not, which equals 1 for exactly one input row. Row 5 (101) of a 3-variable table is the minterm A B' C, written m5. A maxterm is an OR of all variables that equals 0 for exactly one row; for row 5 it is A' + B + C', written M5. Maxterm Mi is the complement of minterm mi.
The canonical SOP lists the minterms where F = 1: F = Sum m(...). The canonical POS lists the maxterms where F = 0: F = Product M(...). The two describe the same function, and the indices in the SOP are exactly the ones missing from the POS. A function with 3 variables has 8 possible minterms.
Standard (non-canonical) forms do not need every variable in every term, e.g. F = AB + C is SOP. SOP maps naturally to AND-OR logic and POS to OR-AND logic, and each can be converted to NAND-NAND or NOR-NOR form.
Key points
- Minterm: AND of all variables, equals 1 for one row.
- Maxterm: OR of all variables, equals 0 for one row.
- Canonical SOP = sum of minterms where F = 1.
- Canonical POS = product of maxterms where F = 0.
- Indices of F in SOP and POS are complementary.
Worked example
For F with truth table 1s at rows 1, 2, 4, 7 of 3 variables: F = Sum m(1, 2, 4, 7), and its POS is F = Product M(0, 3, 5, 6).
Common questions
What is a minterm?
A product term containing every variable once, true for exactly one input combination.
How do you convert SOP to POS?
List the row numbers missing from the minterm list and use them as maxterm indices.
Practice questions on this topic
Try these, then open the app to check your answers with explanations.
- What is the purpose of digital logic gates?
- A. To perform mathematical calculations
- B. To process and manipulate binary data
- C. To generate random numbers
- D. To control physical devices
- Minimizing such functions can be achieved by converting them into standard forms such as ____, then making the k-map and obtaining the minimized function.
- A. SOP
- B. POS
- C. Both A and B
- D. None of the above
- Which of the following is not a positional number system?
- A. Roman Number System
- B. Octal Number System
- C. Binary Number System
- D. Hexadecimal Number System
- The expression W (X + YZ) can be converted to SOP form by applying which law?
- A. associative
- B. commutative
- C. distributive
- D. NONE OF THE ABOVE
- When designing a circuit to emulate a truth table, both Product-of-Sums (POS) expressions and Sum-of- Products (SOP) expressions can be derived from?
- A. k-map
- B. Nand
- C. nor
- D. x-nor
- Using a Karnaugh map, F(x,y,z) = Σm(0, 2, 6, 7) is minimized to:
- A. F = x'z' + y
- B. F = x'z' + xyz'
- C. F = x'z' + xy
- D. F = xz' + xy
Related topics
- Karnaugh Map (K-Map) Simplification Step by Step
- Number System Conversion: Binary, Octal, Decimal and Hexadecimal
- 1's Complement, 2's Complement and Signed Binary Arithmetic
- Boolean Algebra Laws, De Morgan Theorems and Simplification
- Logic Gates: AND, OR, NOT, NAND, NOR, XOR and Universal Gates
- Half Adder, Full Adder, Multiplexer and Decoder Explained
- All topics: Digital Logic
BASMAGLY is an independent student project, not an official Delta University site. Check lectures and your instructor for the final word.