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

How to insert script in dreamweaver, Q. How to insert script in dreamweaver...

Q. How to insert script in dreamweaver? Step 1: Click on Insert Step 2: Click on Script Step 3: Choose the type of Script Step 4: Write the code in "Content" Step 5: T

Determine resources, Consider the following system snapshot using data stru...

Consider the following system snapshot using data structures in the Banker's algorithm, with resources A, B, C, and D, and process P0 to P4:                           Max

How do you import data from one more access database, The process of import...

The process of importing data from one more Access database follows these common steps they are. ? Preparing the document for import operation and make ensure that extensions ar

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

Determine the list of micro-operations, Micro-Operations A micro-operat...

Micro-Operations A micro-operation is an basic operation which is performed on data stored in registers. We can classify micro-operations into four categories: 1. Register t

State about the directed-test methodology, Directed-Test Methodology Bu...

Directed-Test Methodology Building a directed verification environment with a comprehensive set of directed tests is very time-consuming and difficult. As directed tests only c

Which dependencies of hierarchical tables in the sap system, The structure ...

The structure of Logical Databases reflects which dependencies of hierarchical tables in the SAP system. Foreign Key dependencies

What is sorted linked list, Linked list means node which is linked each oth...

Linked list means node which is linked each other with  a line. It means that every node is connected with another one. Every node of the list hold the reference of the next node.

Characteristics of a computer memory systems, Question: a) Describe wha...

Question: a) Describe what is meant by a "bus". There are two types of bus, dedicated and multiplexed. Give a brief description of both types of buses. b) Briefly explain f

The goal of hashing, The goal of hashing is to produce a search that takes ...

The goal of hashing is to produce a search that takes   O(1) time

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