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 an example of resource allocation graph & deadlocked, Suppose there ar...

Suppose there are 2 copies of resource A, 3 copies of resource B, and 3 copies of resource C. Suppose further that process 1 holds one unit of resources B and C and is waiting for

What are the difference between $display and $strobe, What are the Differen...

What are the Difference between $display and $strobe Difference between $display and $strobe is that $strobe displays parameters at the very end of current simulation time unit

What is a recursively enumerable language, What is a recursively enumerable...

What is a recursively enumerable language?            The languages that is accepted by TM is said to be recursively enumerable (r. e) languages.  Enumerable means that the stri

How putchar function is used within a c program, How putchar function is us...

How putchar function is used within a C Program ? The following program reads each character in the first line of input entered at the terminal's keyboard. It uses putchar to d

Implement simplified expression using nor gates only, Q. For function F(x,y...

Q. For function F(x,y,z) = ∑m (1,2,3,5,6) using TRUTH TABLE only 1. Find POS expression 2. Implement this simplified expression using two level OR-to-AND gate network 3. I

What do you mean by ssi chips, Q. What do you mean by SSI chips? The 3 ...

Q. What do you mean by SSI chips? The 3 rd generation computers mostly used SSI chips. One of the key concepts that were brought forward for the duration of this time was conc

What is an imperative statement, What is an imperative statement? Ans. ...

What is an imperative statement? Ans. Shows an action to be performed throughout execution of assembled program is an imperative statement.

Features added in message passing interface-2, Q. Show the Features added i...

Q. Show the Features added in message passing interface-2 Input/output Single-sided operations for remote memory access Binding for C++ Dynamic process managem

Describe the role of software developers, Describe the role of Software dev...

Describe the role of Software developers Software developers have wide experience of tackling such issues. Students who develop software project spending days and nights strug

Recursion to an iterative procedure, The data structure required to convert...

The data structure required to convert a recursion to an iterative procedure is  Stack is the data structure required to convert a recursion to an iterative procedure

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