SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 4

SYEN 3330 Digital Systems Chapter Standard Forms

SYEN 3330 Digital Systems Chapter Standard Sum-of-Products (SOP)

SYEN 3330 Digital Systems Chapter Standard Sum-of-Products (SOP) The Canonical Sum- of-Minterms form has (5 * 3) = 15 literals and 5 terms. The reduced SOP form has 3 literals and 2 terms.

SYEN 3330 Digital Systems Chapter AND/OR Two-level Implementation of SOP Expression

SYEN 3330 Digital Systems Chapter Standard Product-of-Sums (POS)

SYEN 3330 Digital Systems Chapter Standard Product-of-Sums (POS)

SYEN 3330 Digital Systems Chapter Standard Product-of-Sums (POS) The Canonical Product- of-Maxterms form had (3 * 3) = 9 literals and 3 terms. The reduced POS form had 4 literals and 2 terms.

SYEN 3330 Digital Systems Chapter OR/AND Two-level Implementation

SYEN 3330 Digital Systems Chapter SOP and POS Observations

SYEN 3330 Digital Systems Chapter Equivalent Cost Circuits

SYEN 3330 Digital Systems Chapter Boolean Function Simplification Reducing the literal cost of a Boolean Expression leads to simpler networks. Simpler networks are less expensive to implement. Boolean Algebra can help us minimize literal cost. When do we stop trying to reduce the cost? Do we know when we have a minimum? We will introduce a systematic way to arrive a a minimum cost, two-level POS or SOP network.

SYEN 3330 Digital Systems Chapter Karnaugh Maps (K-map)

SYEN 3330 Digital Systems Chapter Uses of Karnaugh Maps Provide a means for finding optimum:  Simple SOP and POS standard forms, and  Small two-level AND/OR and OR/AND circuits Visualize concepts related to manipulating Boolean expressions Demonstrate concepts used by computer- aided design programs to simplify large circuits

SYEN 3330 Digital Systems Chapter Two Variable Maps A Two variable Karnaugh Map:

SYEN 3330 Digital Systems Chapter K-Map and Function Tables Function Table K-Map

SYEN 3330 Digital Systems Chapter K-Map Function Representations For function F(x,y), the two adjacent cells containing 1’s can be combined using the Minimization Theorem: For G(x,y), two pairs of adjacent cells containing 1’s can be combined using the Minimization Theorem: Duplicate x y

SYEN 3330 Digital Systems Chapter Three Variable Maps

SYEN 3330 Digital Systems Chapter Example Functions

SYEN 3330 Digital Systems Chapter Combining Squares By combining squares, we reduce the representation for a term, reducing the number of literals in the Boolean equation. On a three-variable K-Map:

SYEN 3330 Digital Systems Chapter Combining Squares Example

SYEN 3330 Digital Systems Chapter Alternate K-Map Diagram x y z m0m0 m1m1 m3m3 m2m2 m4m4 m5m5 m7m7 m6m6 x yz m0m0 m1m1 m3m3 m2m2 m4m4 m5m5 m7m7 m6m x m0m0 m1m1 m3m3 m2m2 m4m4 m5m5 m7m7 m6m yz z x y