Electrical Engineering › Section S · Logic gates and Boolean algebra › Topic S.4
Boolean simplification, standard forms, and truth tables
Any gate circuit can be written as a Boolean expression, simplified with the laws of Boolean algebra and rebuilt with fewer gates. This topic shows how to analyse a circuit, simplify its expression, put it into the standard sum-of-products and product-of-sums forms, and move freely between expressions and truth tables.
In this topic
- From circuit to expression
- Worked example: analysing a circuit
- Why simplify
- Worked example: algebraic simplification
- Sum-of-products form
- Standard SOP and minterms
- Product-of-sums form
- Converting between SOP and POS
- Expressions and truth tables
- Worked example: truth table to standard forms
- Common mistakes to avoid
- Key takeaways
This topic is part of Wuanberri Pro. Checking your access…