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

Explain about cathode ray tubes, Q. Explain about Cathode Ray Tubes? Ca...

Q. Explain about Cathode Ray Tubes? Cathode ray tube is the major technology on that televisions and monitors have been based.  CRT is a partially evacuated glass tube which is

Hyper-threading, Hyper-threading, officially known as Hyper-threading Techn...

Hyper-threading, officially known as Hyper-threading Technology (HTT), is Intel's trademark for their execution of the simultaneous multithreading technology on the Pentium 4 micro

What is a table attribute, What is a Table attribute? The table's attr...

What is a Table attribute? The table's attributes verifies who is responsible for maintaining a table and which types of access are permitted for the table.  The most signific

Example on cyclic distribution of data, Q. Example on Cyclic Distribution o...

Q. Example on Cyclic Distribution of data? !HPF$ PROCESSORS P1(4) !HPF$ TEMPLATE T1(18) !HPF$ DISTRIBUTE T1(CYCLIC) ONTO P1 The result of these instructions is display

Explain about cseg segment, CSEG SEGMENT  ASSUME CS:CSEG, DS:CSEG, SS:CS...

CSEG SEGMENT  ASSUME CS:CSEG, DS:CSEG, SS:CSEG  ORG 100h START:MOV AX, CSEG; Initialise data segment  MOV DS, AX; register using AX  MOV AL, NUM1; Take the first num

Evaluation stack architecture, Q. Evaluation Stack Architecture? A stac...

Q. Evaluation Stack Architecture? A stack is a data structure which implements Last-In-First-Out (LIFO) access policy. You can add an entry to the with a PUSH(value) as well as

Leading zeroes of a number field, In order to suppress the leading zeroes o...

In order to suppress the leading zeroes of a number field the which keywords is used ? NO-ZERO.

Copy machine problem, We are trying to figure out how many copy machines we...

We are trying to figure out how many copy machines we should install in the basement of Stranahan Hall.  Copy machines should be available 24/7.  Students may walk up at any time o

Recent parallel programming models, A model for parallel programming is an ...

A model for parallel programming is an abstraction and is machine architecture independent. A model can be executed on several hardware and memory architectures. There are various

Example of calculate maximum access time & cost of switch, Calculate the ma...

Calculate the maximum access time that can be permitted for the data and control memories in a TSI switch with a single input and single output trunk multiplexing 2500 channels. Al

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