Minimis logic function using K-map, Computer Engineering

Assignment Help:

Minimise the logic function F (A, B, C, D) = Π M (1, 2, 3, 8, 9, 10, 11,14) ⋅ d (7, 15)
Use Karnaugh map.

Ans. Given function F=∏M(1,2,3,8,9,10,11,14).d(7, 15)
F'=B'D+B'C+AC+AB' By Complementing F
F=(B'D+B'C+AC+AB')'
= [(B'D)'(B'C)'(AC)'(AB')']'
= (B+D')(B+C')(A'+C')(A'+B)
Taking here complement twice but also without opening the bracket
F=[(B+D')+(B+C')'('A'+C')+(A'+B)]'

322_Minimis logic function using K-map.png

Related Discussions:- Minimis logic function using K-map

Explain the differences of casex and casez, Explain the differences of case...

Explain the differences of casex and casez over the case statement? casex operator has to be used when both high impedance value (z) and unknown (x) in any bit has to be t

Learning weights in perceptrons, Learning Weights in Perceptrons - Artifici...

Learning Weights in Perceptrons - Artificial neural network In detail we will look at the learning method for weights in multi-layer networks next chapter. The following descri

Define the karnaugh maps (k maps), Define The Karnaugh Maps (K Maps) Th...

Define The Karnaugh Maps (K Maps) The Karnaugh map (K map) provides the systematic method for simplifying a Boolean expression or a truth table function when used properly the

Which data structures used in language processing, Which structure can be u...

Which structure can be used as a criterion for classification of data structures used in language processing. And. Nature of a data structure, purpose of a data structure and l

Explain about annotational notations, Explain about Annotational Notations ...

Explain about Annotational Notations These notations may be applied to describe remark and illuminate about any element in the model. They are considered as explanatory of U

What are the various functional verification methodologies, What are the va...

What are the various functional verification methodologies Ans: TLM (Transaction Level Modelling) Linting RTL Simulation (Environment involving : stimulus generators,

How to calculate register indirect addressing, Q. How to calculate register...

Q. How to calculate register indirect addressing? The effective address of operand in this technique is calculated as: EA= (R) and D = (EA) Address capability of regi

Elucidate basic time division time switching method, With the help of block...

With the help of block diagram Elucidate basic time division time switching method. Basic Time Division Switching: Functional blocks of a memory based time division switching

Performance of caches - computer architecture, Performance of caches: ...

Performance of caches: Amdahl's Law regarding overall speed up: Alternatively, CPU stall can be considered:

Recursive binary search, The implementation of a (non-recursive) binary sea...

The implementation of a (non-recursive) binary search of an array. The assumption is that a given array is sorted. We want to see if a particular value, that we'll call the target

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages