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

Background and foreground colors can be interchanged, Background and foregr...

Background and foreground colors can be interchanged using the command?? Format Inverse command.

What is common language runtime, What is "Common Language Runtime" (CLR)?  ...

What is "Common Language Runtime" (CLR)?  CLR is .NET equivalent of Java Virtual Machine (JVM). It is the runtime that changes a MSIL code into the host machine language code,

Biometric systems for implementing client server network, Discuss password ...

Discuss password schemes and Biometric systems for implementing client server network security.          In cyberspace, buyers & sellers cannot see each other. Also in video con

Design issues, Design issues:  To complete the maximum processor utilizatio...

Design issues:  To complete the maximum processor utilization in a multithreaded architecture, the following design issues have to be addressed: Context Switching time: S

What is a flip-flop, What is a flip-flop? Ans. Flip-flop is particu...

What is a flip-flop? Ans. Flip-flop is particular bit memory cell. This stores individual bit information in its true and compliment form. It is the basic block of any sequ

I2c protocol bus , I²C TECHNOLOGIES The I2C protocol bus is two bi-dire...

I²C TECHNOLOGIES The I2C protocol bus is two bi-directional wires, serial data (SDA) and serial clock (SCL), that transmit information between the devices connected to the bus.

What is a serial port, What is a serial port?  A serial port transfers...

What is a serial port?  A serial port transfers and receives data single bit at a time.

Simplify the boolean expression, Simplify the Boolean expression F = C(B + ...

Simplify the Boolean expression F = C(B + C)(A + B + C). Ans. Simplification of the given Boolean Expression F = C (B +C) (A+B+C) given as F = C (B+C) (A+B+C) = CB + CC [(A+B+C

Explain dma and interrupt breakpoints, Q. Explain about DMA and Interrupt B...

Q. Explain about DMA and Interrupt Breakpoints? DMA interface transfers complete block of data one word at a time directly to or from memory without going through processor. Wh

How a shift register can be used as a ring counter, Explain how a shift reg...

Explain how a shift register can be used as a ring counter giving the wave forms at the output of the flipflops. Ans: Shift Register as a Ring Counter: A Ring Counter is a

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