Ep 036: Introduction to Sum of Products Expressions
We've learned how to create a truth table from a Boolean expression or a logic circuit, but what about creating a Boolean expression from a truth table? Our first foray will be to use an OR-gate to combine the products from multiple AND-gates - the sum-of-products or SOP expression.
▶︎
Ep 037: Converting a Sum-of-Products Expression to a Truth Table
▶︎
Ep 041: Rules for Makin' Karnaugh Map Rectangles
▶︎
Ep 038: Introduction to Product-of-Sums Expressions
▶︎
Ep 031: Identities of Boolean Algebra
▶︎
Ep 026: Introduction to Combinational Logic
▶︎
Example Problems Boolean Expression Simplification
▶︎
Ep 040: Introduction to Karnaugh Maps
▶︎
Ep 028: Boolean Expressions, Circuits, and Truth Tables
▶︎
Ep 027: Deriving a Truth Table from Combinational Logic
▶︎
Ep 039: Converting a Product-of-Sums Expression to a Truth Table
▶︎
Ep 034: Basic Boolean Algebraic Simplification Examples
▶︎
SR Latch Circuit - Basic Introduction
▶︎
Ep 030: Introduction to Boolean Algebra
▶︎
Boolean Function Representation: SOP and POS Form | Minterms and Maxterms Explained
▶︎
Ep 042: Working with 4x4 Karnaugh Maps
▶︎
Introduction to Programming and Computer Science - Full Course
▶︎
Sum of Products (Part 1) | SOP Form
▶︎
Ep 051: Introduction to Hamming Code
▶︎
Ep 032: Properties of Boolean Algebra
▶︎