Scribd
Upload
220 views

Viii - Tabulation Method

The document describes the tabulation method, a systematic step-by-step procedure to simplify Boolean functions into standard form. It involves listing all minterms in binary, grouping them by number of 1's, and combining minterms that differ by one variable into "cubes" until prime implicants are formed. The essential prime implicants are then determined and used to write the simplified Boolean expression. The method was formulated by Quine and improved by McCluskey.

Uploaded by

Charles Brian Lunas
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
220 views

Viii - Tabulation Method

The document describes the tabulation method, a systematic step-by-step procedure to simplify Boolean functions into standard form. It involves listing all minterms in binary, grouping them by number of 1's, and combining minterms that differ by one variable into "cubes" until prime implicants are formed. The essential prime implicants are then determined and used to write the simplified Boolean expression. The method was formulated by Quine and improved by McCluskey.

Uploaded by

Charles Brian Lunas
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

TABULATION METHOD

ECE DEPARTMENT FACULTY OF ENGINEERING UNIVERSITY OF SANTO TOMAS

TABULATION METHOD
Specific step-by-step procedure that is guaranteed to

produce a simplified standard form expression for a function First formulated by Quine and later improved by McCluskey Also known as Quine-McCluskey method

Ex: Simplify F(W,X,Y,Z) = m(0,1,3,4,5,7,12,13,14,15) using the tabulation method

STEP 1
List down all the given minterms with its binary equivalent. Count the no. of 1s in each minterm
Minterms 0 1 3 4 5 7 12 13 14 15 Binary Equiv 0000 0001 0011 0100 0101 0111 1100 1101 1110 1111 No. of 1s 0 1 2 1 2 1 3 2 3 3 4

STEP 2
Make the 0-cube column: Group binary representation of the minterms according to the number of 1s contained. This is done by grouping the minterms into sections separated by horizontal lines.

The first section contains the number with no 1s The second section contains those numbers that have only one 1. The third, fourth, and fifth sections contain those binary numbers with two, three, and four 1s respectively.

Step 3
Make the 1-cube column Combine any two minterms which differ from each other by only one variable and remove the unmatched variable. The minterms in one section are compared with those of the next section down only.

Step 4
Continue making the 2-cube column by repeating the procedure in step 3. Repeat for the 3-cube column, and so on until prime-implicants are formed. Prime-implicants are those not checked in the table

Step 5
Make a prime-implicant table to determine essential

prime-implicants (EPI)

Step 6
Write the expression

You might also like