Explain tabulation method for simplifying k maps, Computer Engineering

Assignment Help:

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.

 


Related Discussions:- Explain tabulation method for simplifying k maps

Write down the basic performance equation, Write down the basic performance...

Write down the basic performance equation? T=N*S/R T=processor time N=no.of instructions S=no of steps R=clock rate

Enum statement differ from a typedef statement, How does an enumstatement d...

How does an enumstatement differ from a typedef statement? Typedef statement permits user to define an identifier that would show an exiting data type. The user-defined data

Eight-stage process - conjunctive normal forms, Eight-stage process - Conju...

Eight-stage process - Conjunctive normal forms: Hence we notice the following eight-stage process converts any sentence with CNF as:  1.  Eliminate all arrow connectives by

What is pattern, What is pattern? A pattern is a proven solution to a g...

What is pattern? A pattern is a proven solution to a general problem. Lots of patterns are used. There are patterns for analysis, architecture, design and execution. Patterns c

How address resolution is performed with table lookup, How address resoluti...

How address resolution is performed with table lookup? Explain with the help of a suitable example. The approach of table lookup to address resolution needs a data structure wh

Engineering phyics, what is interference of light explain the nessicity of ...

what is interference of light explain the nessicity of coharent source for obtaining sustain interference pattern

Make your simulation run faster, Ameliorating the mechanical delays of seek...

Ameliorating the mechanical delays of seeks and rottion are usually regardeed as major aspects of device drivers for disks. The simplest way for a disk device driver to service dis

For what CIDR stands, CIDR stands for? CIDR stands here for Classless I...

CIDR stands for? CIDR stands here for Classless Inter Domain Routing.

Assessing heuristic searches , Assessing Heuristic Searches: Given a p...

Assessing Heuristic Searches: Given a particular problem you want to build an agent to solve, so there may be more than one way of justifying it as a search problem, more than

Differences between inter statement and intra statement, Differences betwee...

Differences between inter statement and intra statement delay? //define register variables reg a, b, c; //intra assignment delays initial begin a = 0; c = 0;

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd