Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 173 views

    (K-Map) OksanaYarem - KarnaughMaps

    Uploaded by

    maprof
    Karnaugh maps provide a graphical method for simplifying Boolean functions by grouping ones in the truth table. They arrange the truth table rows and columns according to the Boolean variables. Groupings of ones must contain a power of two, be rectangular without diagonals, and be as large as possible. This allows irrelevant variables to be eliminated, simplifying the Boolean function. Examples show how grouping ones on a Karnaugh map for two, three, and four variables can simplify Boolean expressions.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    (K-Map) OksanaYarem - KarnaughMaps

    Uploaded by

    maprof
    173 views11 pages
    Karnaugh maps provide a graphical method for simplifying Boolean functions by grouping ones in the truth table. They arrange the truth table rows and columns according to the Boolean variables. Groupings of ones must contain a power of two, be rectangular without diagonals, and be as large as possible. This allows irrelevant variables to be eliminated, simplifying the Boolean function. Examples show how grouping ones on a Karnaugh map for two, three, and four variables can simplify Boolean expressions.

    Original Title

    (K-Map) OksanaYarem_KarnaughMaps.ppt

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Karnaugh maps provide a graphical method for simplifying Boolean functions by grouping ones in the truth table. They arrange the truth table rows and columns according to the Boolean variables. Groupings of ones must contain a power of two, be rectangular without diagonals, and be as large as possible. This allows irrelevant variables to be eliminated, simplifying the Boolean function. Examples show how grouping ones on a Karnaugh map for two, three, and four variables can simplify Boolean expressions.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    173 views11 pages

    (K-Map) OksanaYarem - KarnaughMaps

    Uploaded by

    maprof
    Karnaugh maps provide a graphical method for simplifying Boolean functions by grouping ones in the truth table. They arrange the truth table rows and columns according to the Boolean variables. Groupings of ones must contain a power of two, be rectangular without diagonals, and be as large as possible. This allows irrelevant variables to be eliminated, simplifying the Boolean function. Examples show how grouping ones on a Karnaugh map for two, three, and four variables can simplify Boolean expressions.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 11

    Karnaugh Maps

    Graphical way to represent Boolean functions


    Systematic approach for reducing Boolean
    expressions
    Ex.

    F(A, B, C) = A B C + A B C + A B C + A B C
    Simplified into:
    F(A, B) = A B + A B

    Definition of Kmap

    Kmap is a table used to enumerate the values of a given Boolean


    expression for different input values.

    The ROWS and columns of the table correspond to the possible


    VALUES of the functions inputs.

    Each CELL represents the OUTPUTS of the function for the


    possible
    inputs.

    Minterms in
    Kmaps

    Minterm represents
    ALL of the possible
    INPUT combinations
    for the function.
    A function with n
    variables has 2^n
    minterms
    (since each variable can
    appear complemented
    or not)

    Minter
    m

    Minterm

    X Y

    X Y

    X Y

    XY

    X Y

    X Y Z

    X Y Z

    X Y Z

    X Y Z

    X Y Z

    X Y Z

    XYZ

    Example 1. Re-arranging the truth table into the Kmap for two

    variables.
    F(X, Y) = X + Y
    This function is equivalent to the OR of all of the minterms that have a value of 1.
    0
    1
    Thus: F(X, Y) = X + Y = X Y + X Y + X YX
    Minter
    X
    Y
    X+
    Y
    m
    Y
    X
    X

    X Y

    X Y

    X Y

    XY

    0
    X

    XY

    The rules of Kmap simplification


    are:

    Groupings can contain only 1s; no 0s.

    Groups can be formed only at right angles; diagonal groups are


    not allowed.

    The number of 1s in a group must be a power of 2 even if it


    contains a single 1.

    The groups must be made as large as possible.

    Groups can overlap and wrap around the sides of the Kmap.

    Example 1. Kmap simplification for two


    variables
    F(X, Y) = X + Y

    The two minterms are X Y and X Y

    This group presents the logical OR of these two


    terms, or X Y + X Y. These terms differ in Y, so
    Y is discarded leaving only X

    The second group represents X Y and X Y ( X Y +


    X Y differ in X, so X is discarded, leaving Y)

    We can begin with the group represented by the


    second row (where x = 1)

    Coming back to our Boolean function:


    F(X, Y) = X + Y = X Y + X Y + X Y = X + Y

    X Y

    X Y

    X Y

    XY

    Kmap simplification for


    three variables
    Minterm

    X Y

    X Y

    X Y

    X Y Z

    X Y

    X Y Z

    X Y Z

    XYZ

    Z
    Z
    Z

    We have placed each


    minterm in the cell that
    will hold its value.

    Example 2. Kmap simplification for


    three
    variables
    F(X, Y, Z) = X Y Z + X Y Z + X Y Z + X Y Z
    Kmap is given below has the largest group of 1s that is power of 2.
    This grouping tells us that changes in the
    variables X and Y have no influence upon
    the value of the function: They are irrelevant.

    This means that the function,


    reduces to F(Z) = Z.

    Example 3. Kmap simplification for three


    variables.
    F(X, Y, Z) = X Y Z + X Y Z + X Y Z + X Y Z + X Y Z +
    X Y Z

    Example of a group that wraps around the sides


    of a Kmap.
    This group tells us that the values of x and y are
    not relevant to the term of the function that is
    encompassed by the group leaving only Z

    The green group in the top row tells us that only


    the value of x is significant in that group.

    X complemented in that row, so the other term of


    the reduced function is X

    The reduced function is F(X, Z) = Z + X

    Example 4. Kmap for four variables

    Number of minterms is 2^n,


    where n=number of variables. In
    this case we have 2^4 or 16
    minterms.
    Recall that
    groups can
    overlap.

    Possible groupings

    Try to keep groups as


    large as possible.

    We may have a choice as


    to how to pick groups
    within Kmap, while keeping
    the groups as large as
    possible.

    The (different) functions that


    result from the groupings
    below are logically equivalent.

    You might also like