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

Zero address instruction format, Zero address instruction format is used fo...

Zero address instruction format is used for  (A) RISC architecture.      (B) CISC architecture.  (C) Von-Neuman architecture.   (D) Stack-organized architecture.

Explain the data dependency, Data Dependency It indicates to the situ...

Data Dependency It indicates to the situation in which two or more instructions share same data. The instructions in a program are able to be arranged based on relationship o

Multiple valued logics, Multiple valued logics: Multiple valued logics...

Multiple valued logics: Multiple valued logics, where altered types of truth value such as "unknown" are may be allowed. These have some of the particular advantages of fuzzy

Data structure, what are the fundamental data structures

what are the fundamental data structures

Perform binary addition, Q. Explain the following: a. BCD code b. Gra...

Q. Explain the following: a. BCD code b. Gray code c. Excess-3 code d. True complement method Q. Addition-Subtraction-Multiplication-Division: Perform Binary Addi

Design principles, The usability and user experience goalsprovidet heintera...

The usability and user experience goalsprovidet heinteraction designer with high-level goals for the interactivep roduct. Thenextissueis how to design a product that satisfies thes

Define the thread libraries, Q. Define the Thread libraries? The most d...

Q. Define the Thread libraries? The most distinctive representatives of shared memory programming models are thread libraries present in most of modern operating systems. Illus

How atoms differ from the arrangement of atoms in a liquid, Q. How does the...

Q. How does the preparation of atoms in mainly solids differ from the arrangement of atoms in a liquid? Answer:- The arrangement of atoms in solids are diverse from those

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