Conversion from Cardinal Form to Minterm Expression
A minterm expression can be obtained from a given cardinal form of boolean function by using the following steps:
- Convert the minterm designation into binary pattern having number of bits same as the number of variables used in the function.
- Write the product of variable or complement of variable corresponding to the bits 1 or 0 of the bit pattern respectively.
- Add the product terms (minterms) to get min term expression.
Example:
Find the maxterm expression for the boolean function: F(A,B,C) = ∑(5,1,3,6)
Binary of 5 is 101: AB’C
Binary of 1 is 001: A’B’C
Binary of 3 is 011: A’BC
Binary of 6 is 110: ABC’
Hence, minterm expression is: (AB’C)+(A’B’C)+(A’BC)+(ABC’)
Find the maxterm expression for the boolean function: F(A,B,C) = ∑(3,7)
Binary of 3 is 011: A’BC
Binary of 7 is 111: ABC
Hence, minterm expression is: (A’BC)+(ABC)
Conversion From Minterm Expression to Maxterm Expression
Minterm is the product of N distinct literals where each literal occurs exactly once. The output of the minterm functions is 1. Maxterm is the sum of N distinct literals where each literals occurs exactly once. The output of the maxterm functions is 0. The conversion from minterm to maxterm involves changing the representation of the function from a Sum of Products (SOP) to a Product of Sums (POS).
In this article, we will cover prerequisites like minterm, maxterm, minterm designation, maxterm designation, conversion from Cardinal form to Minterm Expression, and conversion from Cardinal form to Maxterm Expression with a detailed explanation of conversion from minterm expression to maxterm expression with solved examples and FAQs.