Explain Tabulation Method for simplifying k maps?

The Tabulation Method (QUINE-McCLUSKEY MINIMIZATION)

• An expression is represented in the canonical SOP form if not already in that form.
• A function is converted into numeric notation.
• The numbers can be converted into binary form.
• The minterms can be arranged in a column divided into groups.
• Start with the minimization procedure.
  1. Every minterm of one group is compared with the each minterm in the group immediately below.
  2. Every time a number is found in one group which is the same as a number in the group below except for one digit, the pair numbers is ticked and a new composite is created.
  3. This composite number has the same number of digits as the numbers in the pair except the digit different which are replace by an "x".
• The above process is repeated on second column to generate a third column.
• The next step is to identify the necessarily prime implicants which can be done using a prime implicant chart.
  1. Where the prime implicant covers a minterm the intersection of the corresponding row and column is marked with a cross.
  2. Those columns with only one cross identify the necessary prime implicants these prime implicants must be in the final answer.
  3. The single crosses on the column are circled and all the crosses on the same row are as well circled, indicating that these crosses are covered by the prime implicants selected.
  4. Once one cross on the column is circled all the crosses on that column can be circled since the minterm is now covered.
  5. If any unnecessary prime implicant has all its crosses circled the prime implicant is redundant and need not be considered further.
• After that, selections have to be made from the remaining unnecessary prime implicants, by considering how the crosses not circled can best be covered.
  1. One in common would take those prime implicants which cover the greatest number of crosses on their row.
  2. If all the crosses in the one row as well occur on another row which includes further crosses then the latter is said to dominate the former and can be selected.
  3. The dominated prime implicant can after that be deleted.

 

Posted Date: 6/11/2013 3:55:03 AM | Location : United States

Ask an Expert

Related Discussions:- Explain tabulation method for simplifying k maps, Assignment Help, Ask Question on Explain tabulation method for simplifying k maps, Get Answer, Expert's Help, Explain tabulation method for simplifying k maps Discussions

Write discussion on Explain tabulation method for simplifying k maps
Your posts are moderated

Write your message here..

Related Questions

The need of parallel computation, The Need Of Parallel Computation With... The Need Of Parallel Computation With the advancement of computer science (CS), computational speed of the processors has also improved many a time. Moreover, there is certain

Software engineering, how to find the type of cohesion in a module how to find the type of cohesion in a module

State some criterias and their effects on a database, It is possible to ent... It is possible to enter one or more criteria in the rows which can influence your database significantly. >="Callahan" this returns all the several records from Callahan to the

Explain working of telnet, Q. Explain Working of TELNET? The working o... Q. Explain Working of TELNET? The working of TELNET 1.  Commands and characters are sent to operating system on common server computer. 2.  Local operating system send

Deductive inferences - artificial intelligence, Deductive Inferences - Arti... Deductive Inferences - Artificial intelligence: We have described how knowledge can be represented in first-order logic, and how in logic rule-based expert systems expressed ca

Example of the horizon problem, Example of the horizon problem: It is ... Example of the horizon problem: It is also worth bearing in mind the horizon problem, however a game-playing agent cannot see much far satisfactory into the search space. Now

Explain time complexity in parallel algorithms, Q. Explain Time Complexity ... Q. Explain Time Complexity in Parallel algorithms? As it takes place nearly everyone who implement algorithms wish to know how much of an individual resource (for example time

Simplify following using k-map, Q. Explain XNOR gate with three input varia... Q. Explain XNOR gate with three input variable and draw necessary circuits. Q. Simplify FOLLOWING Using K-Map 1. m0 + m1 + m6 + m7 + m12 + m13 + m8 + m9 2. m0 + m2 + m4 +

What is linear bounded automation, What is linear bounded automation?  ... What is linear bounded automation?   A linear bounded automation is restricted type of Turing machine where in the tape head isn't permitted to move off the portion of the tape

Determine the basic machine language instructions, Determine the basic Mach... Determine the basic Machine language instructions Machine language instructions and data are in terms of 0s and 1s and are stored in the memory. It isn't possible to distinguis