Draw logic circuit for the simplified function, Computer Engineering

Assignment Help:

Minimize the logic function Y(A, B, C, D) = ∑m(0,1,2,3,5,7,8,9,11,14). Use  Karnaugh map.
Draw logic circuit for the simplified function.

Ans: In following figure (a) shows the Karnaugh map. Because the expression has 4 variables, the map has sixteen cells. The digit one has been written into the cells containing a term in the provided expression. The decimal number has been added like subscript to specify the binary number for the concerned cell. The term ABC D can't be merged along with any other cell. Therefore this  term  will  show  as  such  in  the  last  expression. Here four groupings of 4 cell each. All correspond to the min terms (0, 1, 2, 3), (0, 1, 8, 9), (1, 3,5,7) and also (1, 3, 9, 11). All are represented in the map. Because all the terms (except 14) have been combined in groups of 4 cells, there is no requiring forming groups of two cells.

1561_Draw logic circuit for the simplified function.png

Figure (a)

Hence simplified expression is Y (A,B,C,D) = ABC D + A B + B C + B D+ A D Fig.4 (b) shows the logic diagram for the simplified expression
Y (A,B, C, D) = ABCD‾+ A‾B‾+ B‾C‾+ B‾D‾+ A‾D

27_Draw logic circuit for the simplified function11.png


Related Discussions:- Draw logic circuit for the simplified function

Give the meaning of spc, SPC stands (A)   Standard Protocol Control ...

SPC stands (A)   Standard Protocol Control (B)   Stored Program Control (C)  Signaling and switching Centre (D)  Signaling Process Center Ans: SPC repres

What is binary search, Binary Search: Search a sorted array by repeatedly i...

Binary Search: Search a sorted array by repeatedly in-between the search interval in half. Start with an interval covering the entire array. If the value of the search key is less

How to input to circuit, Q. How to input to circuit? Register A bit...

Q. How to input to circuit? Register A bits as a0, a1, a2 and a3 in the corresponding X bits of the Full Adder (FA). Register B bits as given in the Figure above as in

Why process scheduling algorithm favour i/o bound processes, Suppose that a...

Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes,

Explain the method to identify the object classes, Explain the method to id...

Explain the method to identify the Object Classes You would always be careful while identifying relevant object classes from application domain. Objects may include physical e

4, Ask question 4#Minimum 100 words accepted#

Ask question 4#Minimum 100 words accepted#

Define the term- encryption, Define the term- encryption The user would ...

Define the term- encryption The user would then type in O P E and card purchase will be authorised. This extra protection is used as well as encryption. Some of the new syste

Explain pre-emptive scheduling, Explain Pre-emptive scheduling? Pre-em...

Explain Pre-emptive scheduling? Pre-emptive scheduling: in its approach, center processing unit can be taken away from a process if there is a require while in a non-pre-empt

Explain vector processing with pipelining, Vector Processing with Pipelinin...

Vector Processing with Pipelining Because in vector processing vector instructions execute the similar computation on various data operands repeatedly, vector processing is the

what is polymorphism in c++, Polymorphism in C++ is the idea that a base c...

Polymorphism in C++ is the idea that a base class can be inherited by various classes. A base class pointer can point to its child class and a base class array can store dissimilar

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