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

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

Masters and slaves, The devices on the I2C bus are either masters or slaves...

The devices on the I2C bus are either masters or slaves. The master is the device that is responsible for driving the SCL clock line, while the slaves are the devices that respond

What is one-way association, What is one-way association? One-way assoc...

What is one-way association? One-way association means association will traverse in only in one direction and implement using the actual implementation. If the multiplicity is

Define emulation, Define emulation. Given a computer with a particular ...

Define emulation. Given a computer with a particular instruction set, it is possible to explain additional machine instructions and execute them with extra micro routines. Emul

What is collection objects in vb, Likewise to arrays but is preferred over ...

Likewise to arrays but is preferred over an array due to of the following reasons. 1. A collection objects uses less Memory than an array. 2. It gives methods to add and dele

Describe about immediate addressing mode, Q. Describe about Immediate Addre...

Q. Describe about Immediate Addressing mode? When an operand is interpreted as an immediate value for example LOAD IMMEDIATE 7 it is actual value 7 which is put in CPU register

Binary tree can be converted in to its mirror image, A binary tree can be c...

A binary tree can be converted in to its mirror image By traversing it in Preorder

What is race around condition, What is race around condition? Ans: ...

What is race around condition? Ans: Race Around Condition:- Jn Kn Q(n+1) output   0 1 0 1   0 0

Binary constraints, Binary Constraints: Alternatively unary constraint...

Binary Constraints: Alternatively unary constraints specify that a particular variable can take certain values that basically restricts the domain for that variable thus shoul

Determine capacity in bytes of a certain memory, A certain memory has a cap...

A certain memory has a capacity of 4K × 8 (i)  How many data input and data output lines does it have? (ii) How many address lines does it have? (iii) What is its capacity in bytes

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