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 program controlled i/o, What is program controlled I/O? In prog...

What is program controlled I/O? In program controlled I/O the processor repeatedly checks a status flag to achieve the needed synchronization among the processor and an input a

What are superscalar processors, What are superscalar processors? Sever...

What are superscalar processors? Several instructions start implementation in the same clock cycle, and the processor is said to use multiple issue. Such processors are capable

Describe how management information systems, Question: a) Why do we u...

Question: a) Why do we use the Internet as the new distribution channel for e-banking products and services? b) In the context of e-banking or e-commerce, outline some o

Explain Not recently used page replacement algorithm, Not Recently Used Pag...

Not Recently Used Page Replacement Algorithm The not recently used abbreviated as NRU page replacement algorithm works on the subsequent principle: while a page is referenced,

Address phase - computer architecture, Address phase: A PCI bus transa...

Address phase: A PCI bus transaction starts having an address phase. The initiator,  after seeing that it has GNT# and the bus is inactive, drives the target address onto the

Information security, i wants to know the methods and process of substituti...

i wants to know the methods and process of substitution and transposition cipher with examples.

Dbms, write er diagram for company database

write er diagram for company database

Application layer in tcp/ip model corresponds to for what, Application laye...

Application layer (layer 4) in TCP/IP model corresponds to? In OSI model, application layer (layer 4) in TCP/IP model corresponds to layer 6 and layer 7.

De multiplexer, design a gray to bcd code converter using 16:1 de multiplex...

design a gray to bcd code converter using 16:1 de multiplexe

Differences between inter statement and intra statement, Differences betwee...

Differences between inter statement and intra statement delay? //define register variables reg a, b, c; //intra assignment delays initial begin a = 0; c = 0;

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