Scribd Logo
Upload

Welcome to Scribd!

  • Karnaugh Maps - "K-Maps"

    Uploaded by

    kenzy wardak
    8 views29 pages
    Karnaugh maps (K-maps) are used to simplify logic circuits by grouping expressions with common factors to minimize the number of logic gates needed. A K-map is a visual representation of a truth table that allows identifying the largest groupings of 1s (representing true values) to find simplified Boolean expressions. Larger groupings of 2N cells, where N is the number of variables, produce simpler expressions.

    Original Description:

    k maps

    Original Title

    CSCI240_-_KMAPS

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Karnaugh maps (K-maps) are used to simplify logic circuits by grouping expressions with common factors to minimize the number of logic gates needed. A K-map is a visual representation of a truth table that allows identifying the largest groupings of 1s (representing true values) to find simplified Boolean expressions. Larger groupings of 2N cells, where N is the number of variables, produce simpler expressions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views29 pages

    Karnaugh Maps - "K-Maps"

    Uploaded by

    kenzy wardak
    Karnaugh maps (K-maps) are used to simplify logic circuits by grouping expressions with common factors to minimize the number of logic gates needed. A K-map is a visual representation of a truth table that allows identifying the largest groupings of 1s (representing true values) to find simplified Boolean expressions. Larger groupings of 2N cells, where N is the number of variables, produce simpler expressions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 29

    Karnaugh Maps – “K-Maps”

    - used to simplify circuits so that they can be implemented using


    a minimum number of logic gates.

    - A visual method of grouping together expressions with common


    factors and therefore eliminating unwanted variables.

    - Largest vertical or horizontal groupings of 2N (i.e. 1, 2, 4, 8, 16,


    etc)

    Copyright 2020 - Queens College CSCI 240


    Truth Table vs K-MAP

    A B Output
    0 1
    0 0 W
    0 1 X 0 W X
    1 0 Y
    1 1 Z
    1 Y Z

    Copyright 2020 - Queens College CSCI 240


    Find groupings of 2N

    0 1 0 1 0 1
    0 1 0 0 1 0 0 1 1
    1 0 0 1 0 1 1 1 1

    0 1 0 1
    How many groupings of 2N
    0 1 0 are there?
    0 1 1
    1 1 0 1 1 0

    Copyright 2020 - Queens College CSCI 240


    Naming the Groups

    B B

    0 1
    A 0 W X
    1
    A 1 Y Z

    Copyright 2020 - Queens College CSCI 240


    Naming the Groups

    Intersection of a ROW and a COLUMN


    B

    0 1 A*B
    0 0 0
    A 1 0 1

    Copyright 2020 - Queens College CSCI 240


    2 Input K-MAP

    0 1
    0 1 0
    1 0 0

    Copyright 2020 - Queens College CSCI 240


    2 Input K-MAP

    0 1
    0 1 0
    1 0 1

    Copyright 2020 - Queens College CSCI 240


    2 Input K-MAP

    0 1
    0 1 0
    1 1 0

    Copyright 2020 - Queens College CSCI 240


    2 Input K-MAP

    0 1
    0 1 1
    1 1 0

    Copyright 2020 - Queens College CSCI 240


    2 Input K-MAP

    0 1
    0 1 1
    1 1 1

    Copyright 2020 - Queens College CSCI 240


    Truth Table to KMAP

    A B Output
    0 0 0
    0 1
    0 1 1 0 0 1
    1 0 1
    1 1 1 1 1 1
    Boolean Expression to KMAP

    0 1
    A’B + AB’ + AB 0 0 1
    1 1 1
    3 Input KMAP

    B B

    BC BC BC BC

    00 01 11 10
    1
    A 0
    A
    1

    C C C

    Copyright 2020 - Queens College CSCI 240


    3 Input KMAP

    0 00 000
    1 01 001
    11 011
    10 010
    110
    111
    101
    100
    3 Input KMAP

    A’B’C + AB’C

    00 01 11 10
    0
    1

    Copyright 2020 - Queens College CSCI 240


    3 Input KMAP

    A’B’C’ + A’B’C + A’BC + A’BC’

    00 01 11 10
    0
    1

    Copyright 2020 - Queens College CSCI 240


    3 Input KMAP

    AB’C + A’B’C + A’BC + ABC

    00 01 11 10
    0
    1

    Copyright 2020 - Queens College CSCI 240


    3 Input KMAP

    A’B’C’ + AB’C’ + A’BC’ + ABC’

    00 01 11 10
    0
    1

    Copyright 2020 - Queens College CSCI 240


    3 Input KMAP

    A’B’C’ + A’B’C + AB’C

    00 01 11 10
    0
    1

    Copyright 2020 - Queens College CSCI 240


    3 Input KMAP

    AB’C’ + AB’C + ABC’

    00 01 11 10
    0
    1

    Copyright 2020 - Queens College CSCI 240


    3 Input KMAP

    AB’C’ + AB’C + B

    00 01 11 10
    0
    1

    Copyright 2020 - Queens College CSCI 240


    3 Input KMAP

    A’B’C’ + AB’C + A’BC + ABC’

    00 01 11 10
    0
    1

    Copyright 2020 - Queens College CSCI 240


    3 Input KMAP
    Remember this?

    A’BC + AB’C + ABC’ + ABC

    00 01 11 10
    0
    1

    Copyright 2020 - Queens College CSCI 240


    C C
    4 Input KMAP
    CD CD CD CD

    00 01 11 10
    B
    AB 00
    A
    AB 01
    B
    AB 11
    A
    AB 10
    B

    D
    D D

    Copyright 2020 - Queens College CSCI 240


    4 Input KMAP

    00 01 11 10
    00 1 0 0 0
    01 1 1 1 1
    11 1 0 0 0
    10 1 0 0 0

    Copyright 2020 - Queens College CSCI 240


    4 Input KMAP

    00 01 11 10
    00 0 1 0 0
    01 0 1 1 0
    11 0 1 1 0
    10 0 1 0 0

    Copyright 2020 - Queens College CSCI 240


    4 Input KMAP

    00 01 11 10
    00 1 0 0 0
    01 1 0 0 1
    11 1 0 0 0
    10 1 0 0 0

    Copyright 2020 - Queens College CSCI 240


    4 Input KMAP

    00 01 11 10
    00 1 1 1 0
    01 1 1 1 0
    11 0 0 0 0
    10 0 0 0 0

    Copyright 2020 - Queens College CSCI 240


    4 Input KMAP

    00 01 11 10
    00 1 0 0 1
    01 1 0 0 1
    11 0 0 0 0
    10 0 0 0 0

    Copyright 2020 - Queens College CSCI 240

    You might also like