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

Explain logical shifts with example, Q. Explain Logical shifts with example...

Q. Explain Logical shifts with example? Logical shifts LOGICAL SHIFT LEFT and LOGICAL SHIFT RIGHT insert zeros to end bit position and other bits of a word are shifted left or

What do you mean by segment numbers, Q. What do you mean by Segment numbers...

Q. What do you mean by Segment numbers? There is a good reason for not leaving determination of segment numbers up to assembler. It permits programs written in 8086 assembly

A switch statement , Which is more efficient, a switch statement or an if e...

Which is more efficient, a switch statement or an if else chain? Ans) The differences, if any, are likely to be small. The switch statement was designed to be efficiently impl

Explain working of counters, Q. Explain working of Counters? A counter ...

Q. Explain working of Counters? A counter is a register that goes through a predetermined sequence of states when clock pulse is applied. In principle value of counters is incr

Minimis logic function using K-map, Minimise the logic function F (A, B, C,...

Minimise the logic function F (A, B, C, D) = Π M (1, 2, 3, 8, 9, 10, 11,14) ⋅ d (7, 15) Use Karnaugh map.   Ans. Given function F=∏M(1,2,3,8,9,10,11,14).d(7, 15) F'=B'D+B'C+AC+AB'

Principles of logic circuits, A logic gate is an electronic circuit that ge...

A logic gate is an electronic circuit that generates a typical output signal which depends on its input signal. Output signal of a gate is a general boolean operation of its input

Programmed input - output technique for computers, Q. Programmed input - ou...

Q. Programmed input - output technique for computers? Programmed input/output is a useful I/O technique for computers where hardware costs need to be minimised. Input or output

Explain how someone refine the ratio analysis, Refining the Ratio Analysis ...

Refining the Ratio Analysis Basically, refinement leads to purity. Thus to get a cleaner, more understandable and consistent design need to iterate analysis process.  R

Differences between one hot and binary encoding, What are differences betwe...

What are differences between one hot and binary encoding? Common classifications used to explain the state encoding of an FSM is Binary or highly encoded and one hot. A bina

What is meant by inferring latches, What is meant by inferring latches, how...

What is meant by inferring latches, how to avoid it? Consider the following: always @(s1 or s0 or i0 or i1 or i2 or i3) case ({s1, s0}) 2'd0: out = i0; 2'd1: out =

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