Boolean expression are short hand way for describing the Boolean function or logic function
Two forms of Boolean Expression
This form of Boolean expression is obtained from truth table. Whereas, standard form of Boolean expression is used when implementing logical diagram standard form Boolean expression is the maintained form of Boolean expression.
a minterm is a product term in which each varaible exist either complemented form or uncomplemented form. The variable will be in uncomplemented form if corresponding bit is 1 and the variable will be in complemented form when corresponding bit is 1.
A minterm is denoted by m^j where ‘j’ is the decimal of binary numbers.
A | B | C | Minterm | m^j |
---|---|---|---|---|
a maxterms is a sum term in which each variable must exist either complimented form or uncomplemented if corresponding bit is ‘0’ and the variable will be in complemented form if corresponding bit is 1. A maxterm is denoted by Mj where ‘j’ is the decimal representation of binary number.
A | B | C | Minterm | M^j |
---|---|---|---|---|
A minterm is complemented of maxterm or a maxterm is the complement of minterm.
---Insert equation here--- pg 29 of DLD - Part 0 (notes)