Define the don''t care states - simplifying k maps, Computer Engineering

Assignment Help:

Define the Don't Care States - Simplifying K Maps?

The Truth table specifications for a logic function may not to include all possible combinations of the input binary digits for the input variables yet they may still be complete specifications of the logic function for the prescribed application. In these circumstances certain input combinations will not take place due to the nature of the application when the input combinations are irrelevant or cannot take place, the output states are in the Truth table and the K map are filled with an X and are referred to as don't care states.

When simplifying K maps with a don't care states, the contents of the undefined cells (1 or 0) are chosen according to preference. The aim is to extend group sizes thereby eliminating as many input variables from the simplified expression as possible. Only those X's that support in simplifying the function should be included in the groupings and No additional X's should be added that would result in additional terms in the expression.


Related Discussions:- Define the don''t care states - simplifying k maps

What are the modes in which any update tasks work, What are the modes in wh...

What are the modes in which any update tasks work? Synchronous and Asynchronous.

Why do we call motherboard a motherboard, Motherboard is called as motherbo...

Motherboard is called as motherboard because in the world all borned creature is directly attached to her mother & after it all the relations makes due to her mother so in the simi

How to transmits data in the active message buffer, Q. How to Transmits dat...

Q. How to Transmits data in the active message buffer? int pvm_bcast( char *group, int msgtag ) Transmits data in the active message buffer to a group of processes. msgt

Graph has a minimum spanning tree already computed, Assume that a graph has...

Assume that a graph has a minimum spanning tree already computed.  How fastly can the minimum spanning tree be updated if a new vertex and incident edges are added to G? If the

Classes, write a program to copt values of object without using copy constr...

write a program to copt values of object without using copy constructor or = operator

Time Complexity, how to determiner time complexity of any given polynomial ...

how to determiner time complexity of any given polynomial in data structure?

Safety argument for good design, So far we have considered the problems of ...

So far we have considered the problems of poor ID in terms of the loss of productivity and efficiency to business. There is another important aspect to consider: the issue of safet

How the simulation is done, How the simulation is done Data is entered ...

How the simulation is done Data is entered into the computer and simulation is run. The below scenarios may be tried out: -  Timing of lights varied to see how traffic flow

Show the frames inside other frames, Q. Show the Frames inside other frames...

Q. Show the Frames inside other frames? Here we would discuss how to divide frames into different frames that is how to put horizontal frames in a vertical one and vice-versa.

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