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 is dispatch unit, What is dispatch unit? A separate unit which we ...

What is dispatch unit? A separate unit which we call the dispatch unit fetch instructions from the front of the queue and sends them to the execution unit. The dispatch unit al

Data structure, explain different type of sparse matrix

explain different type of sparse matrix

Explain the process of theory driven discovery, Question 1 Explain brie...

Question 1 Explain briefly the process of matching production rules against working memory 2 Explain Simplification, Conjunction and Transportation in propositional logic by

Explain about of unicode, Q. Explain about of Unicode? This is a newer ...

Q. Explain about of Unicode? This is a newer International standard for character representation. Unicode offers a unique code for each character irrespective of Program, platf

To which one erlang is equal, One Erlang is equal to (A)  3600 CCS ...

One Erlang is equal to (A)  3600 CCS (B)  36 CCS (C) 60 CCS (D)  24 CCS Ans: One Erlang is equivalent to 3600 CCS.

What is master clock signal in control unit, Q. What is Master Clock Signal...

Q. What is Master Clock Signal in Control Unit? The Master Clock Signal: This signal causes micro-operations to be executed in a square. In a single clock cycle either a single

Passing parameters through stack, Q. Passing Parameters through Stack? ...

Q. Passing Parameters through Stack? The best scheme for parameter passing is through stack. It is also a standard scheme for passing parameters when assembly language is inter

What is the future of hyper threading, Q. What is the Future of Hyper threa...

Q. What is the Future of Hyper threading? Current Pentium 4 based MPUs employ Hyper-threading however next-generation cores, Conroe, Merom and Woodcrest will not. As some have

Explain the term confidentiality - firewall design policy, Explain the term...

Explain the term Confidentiality - Firewall Design Policy Whilst some corporate data is for public consumption, the vast majority of it should remain private.

What is source and listener, A source is an object that produces an event. ...

A source is an object that produces an event. This happens when the internal state of that object changes in some way. A listener is an object that is notified when an event happen

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