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

Welcome to Scribd!

  • 31 views

    14 Tabulation Method

    Uploaded by

    mukul20031
    The document discusses the Quine McCluskey tabulation method for minimizing boolean functions, which involves arranging minterms in order of ones, identifying prime implicants with a single bit difference, constructing a prime implicant table to identify essential prime implicants, and simplifying the boolean function based on the essential prime implicants. The method is useful for problems with more than 4 variables but has higher computational complexity than K-map methods.

    Copyright:

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

    14 Tabulation Method

    Uploaded by

    mukul20031
    31 views20 pages
    The document discusses the Quine McCluskey tabulation method for minimizing boolean functions, which involves arranging minterms in order of ones, identifying prime implicants with a single bit difference, constructing a prime implicant table to identify essential prime implicants, and simplifying the boolean function based on the essential prime implicants. The method is useful for problems with more than 4 variables but has higher computational complexity than K-map methods.

    Original Description:

    14 Tabulation method

    Original Title

    14 Tabulation method

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses the Quine McCluskey tabulation method for minimizing boolean functions, which involves arranging minterms in order of ones, identifying prime implicants with a single bit difference, constructing a prime implicant table to identify essential prime implicants, and simplifying the boolean function based on the essential prime implicants. The method is useful for problems with more than 4 variables but has higher computational complexity than K-map methods.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    31 views20 pages

    14 Tabulation Method

    Uploaded by

    mukul20031
    The document discusses the Quine McCluskey tabulation method for minimizing boolean functions, which involves arranging minterms in order of ones, identifying prime implicants with a single bit difference, constructing a prime implicant table to identify essential prime implicants, and simplifying the boolean function based on the essential prime implicants. The method is useful for problems with more than 4 variables but has higher computational complexity than K-map methods.

    Copyright:

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

    TABULATION METHOD

    Quine McCluskey Method (QMC):


    • Quine McCluskey method also known as the tabulation
    method is used to minimize the Boolean functions.
    • It simplifies boolean expression into the simplified form
    using prime implicants.
    • This method is convenient to simplify boolean
    expressions with more than 4 input variables.
    • It uses an automatic simplification routine.
    Terminologies:
    Implicant: Implicant is defined as a group of 1’s(for
    minterm).
    Prime implicant: It is the largest possible group of 1’s(for
    minterm).
    Essential Prime implicant: Essential prime implicants are
    groups that cover at least one minterm which cannot be
    covered by other applicants.
    Steps for Quine McCluskey Method:
    1. Arrange the given minterms according to the number of ones present in their binary
    representation in ascending order.
    2. Take the minterms from the continuous group if there is only a one-bit change to make
    their pair.
    3. Place the ‘-‘ symbol where there is a bit change accordingly and keep the remaining bits
    the same.
    4. Repeat steps 2 to 3 until we get all prime implicants (when all the bits present in the
    table are different).
    5. Make a prime implicant table that consists of the prime implicants (obtained minterms)
    as rows and the given minterms (given in problem) as columns.
    6. Place ‘1’ in the minterms (cell) which are covered by each prime implicant.
    7. Observe the table, if the minterm is covered by only one prime implicant then it is an
    essential to prime implicant.
    8. Add the essential prime implicants to the simplified boolean function.
    Example: Simplify using tabulation method : F(A,B,C,D)
    =∑ m(0,1,2,4,6,8,9,11,13,15)
    F(A,B,C,D) =∑ m(0,1,2,4,6,8,9,11,13,15)
    F(A,B,C,D) =∑ m(0,1,2,4,6,8,9,11,13,15)
    F(A,B,C,D) =∑ m(0,1,2,4,6,8,9,11,13,15)
    : Convert the given minterms into their binary representation and arrange them
    according to the number of ones present in the binary representation. Table 1:

    F(A,B,C,D) =∑ m(0,1,2,4,6,8,9,11,13,15)

    Group Minterm A B C D
    0 0 0 0 0 0
    1 1 0 0 0 1
    2 0 0 1 0
    4 0 1 0 0
    8 1 0 0 0
    2 6 0 1 1 0
    9 1 0 0 1
    3 11 1 0 1 1
    13 1 1 0 1
    4 15 1 1 1 1
    Now, for table-2 take minterms from successive groups(simultaneous group only) which have
    an only a 1-bit difference in their representation Table - 2

    Group Pair A B C D
    0 (0,1) 0 0 0 –
    (0,2) 0 0 – 0
    (0,4) 0 – 0 0
    (0,8) – 0 0 0
    1 (1,9) – 0 0 1
    (2,6) 0 – 1 0
    (4,6) 0 1 – 0
    (8,9) 1 0 0 –
    2 (9,11) 1 0 – 1
    (9,13) 1 – 0 1
    3 (11,15) 1 – 1 1
    (13,15) 1 1 – 1
    Now, for table-2 take minterms from successive groups(simultaneous group only) which have
    an only a 1-bit difference in their representation Table - 2

    Group Pair A B C D
    0 (0,1) 0 0 0 –
    (0,2) 0 0 – 0
    (0,4) 0 – 0 0
    (0,8) – 0 0 0
    1 (1,9) – 0 0 1
    (2,6) 0 – 1 0
    (4,6) 0 1 – 0
    (8,9) 1 0 0 –
    2 (9,11) 1 0 – 1
    (9,13) 1 – 0 1
    3 (11,15) 1 – 1 1
    (13,15) 1 1 – 1
    Group Quad A B C D

    (0,1,8,9) – 0 0 –
    0
    (0,2,4,6) 0 – – 0

    1 (9,11,13,15) 1 – – 1
    Group Quad A B C D

    (0,1,8,9) – 0 0 –
    0
    (0,2,4,6) 0 – – 0

    1 (9,11,13,15) 1 – – 1
    Group Quad A B C D

    (0,1,8,9) – 0 0 –
    0
    (0,2,4,6) 0 0
    – –
    1 (9,11,13,15) 1 – – 1
    PRIME IMPLICANT TABLE

    Minterms ⇢
    Prime Implicants ⇣ 0 1 2 4 6 8 9 11 13 15

    B’C’ (0,1,8,9) 1 1 1 1

    A’D'(0,2,4,6) 1 1 1 1

    AD(9,11,13,15) 1 1 1 1
    PRIME IMPLICANT TABLE

    Minterms ⇢
    Prime Implicants ⇣ 0 1 2 4 6 8 9 11 13 15

    B’C’ (0,1,8,9) 1 1 1 1

    A’D'(0,2,4,6) 1 1 1 1

    AD(9,11,13,15) 1 1 1 1

    Simplified Boolean function = B’C’ + A’D’ + AD


    Example
    Let us simplify the following Boolean
    function, f(W,X,Y,Z)=∑m(2,6,8,9,10,11,14,15)
    The prime implicant table is shown below.

    Min terms / 2 6 8 9 10 11 14 15
    Prime Implicants
    YZ’ 1 1 1 1
    WX’ 1 1 1 1
    WY 1 1 1 1

    f(W,X,Y,Z) = YZ’ + WX’ + WY.


    Advantages of Quine McCluskey Method:
    • This method is suitable for a large number of inputs(n>4) for
    which K-map construction is a tedious task.
    • It does not require pattern recognition.

    Disadvantages of Quine McCluskey Method:


    • The computational complexity of this method is high.
    19
    14
    27
    45
    17
    15
    11
    116
    26
    19
    None
    20

    You might also like