Explain tabulation method for simplifying k maps, Computer Engineering

Explain Tabulation Method for simplifying k maps?


  • 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

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
Related Questions
types of internal conditioning with explanations and examples

Q. Explain Disk Cartridges ? Disk Cartridges: Removable disk cartridges are an option to hard disk units as a form of secondary storage. Cartridge generally comprises one or

The search method for searching a sorted file that needs increased amount of space is The search technique for searching a sorted file that needs increased amount of space

Explain Recursive Descent Parsing It is a top down parsing with no backtracking. This parsing method uses a set of recursive processes to perform parsing. Most important advant

If for a short period of time circuits goes to some dissimilar logic level then it is assumed to have then it is known as static hazard e.g. If the final logic value of output of a

Write a script that will read from a file x and y data points in the following format: x   0    y  1 x  1.3  y  2.2 x  2.2  y  6 x  3.4  y  7.4 The format of each line in the

State the SELECTIVE CLEAR - logic micro operations The selective-clear operation clears to 0 bits in register A only  where there are corresponding 1's in the register B. For

In binary counter the flip flop of lowest order position is complemented with each pulse. This means that JK input position must be maintained with logic one

draw input and output charectoristics of BJT and justify CE configuration provides large current amplification