ELEC1710 Lecture Notes - Lecture 3: Boolean Expression, Canonical Normal Form, Or Gate
Document Summary
Boolean expressions can be converted into either of two standard forms: sum-of-products (sop) form, product-of-sums (pos) for. Makes the following much easier and systematic: evaluation, the truth table for the boolean expression, simplification, fewer gates for the same function. No longer in sop form if there are any not gates between the and and or gate. The domain of a boolean expression is the set of variables in the expressions i. e. a b c d . Any logic expression can be changed to. Standard sop expression: all variables in the domain appear in each product term in the expression, product terms involve all variables in the domain are called minterms. Product terms missing variables can always be expanded to standard form using. Truth tables are the list of all possible input combinations and their corresponding output. If in standard sop form, each term corresponds to a single row in the truth table. Product-of-sums (pos) expressions are sum terms multiplied/and"d together.