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

Feature of micro-instruction execution, Q. Feature of micro-instruction exe...

Q. Feature of micro-instruction execution? Feature of micro-instruction execution is micro-instruction sequencing which involves address calculation of next micro-instruction.

Explain about micro-instruction formats, Q. Explain about Micro-instruction...

Q. Explain about Micro-instruction Formats? Now let's focus on format of a micro-instruction. The two widely used formats employed for micro-instructions are vertical and horiz

#logic function, Minimize the following logic function using K-maps and rea...

Minimize the following logic function using K-maps and realize using NAND and NOR gates. F(A,B,C,D) =?_m(1,3,5,8,9,11,15) + d(2,13).

Define a variant of top-down parsing without backtracking, A parser which i...

A parser which is a variant of top-down parsing without backtracking is? Ans. Recursive Descend is a variant of top-down parsing without backtracking.

Criteria for selecting a theme for a project, Q. Criteria for selecting a t...

Q. Criteria for selecting a theme for a project? Topics for projects as we indicated earlier should emerge from the children's world. Teaching often becomes boring and unintere

Graphics, what is bitmap and pixmap

what is bitmap and pixmap

What kind of system do we need to run gimp, Any system able of run Gnome 2,...

Any system able of run Gnome 2, KDE 3.2, Windows 2000, Mac OS X and later versions should be capable to run GIMP. GIMP's biggest appetite is for memory and how much you will requir

Simplify pos expression, Q. For function F(X, Y, Z) = ∑(1, 2, 3, 5, 6) usin...

Q. For function F(X, Y, Z) = ∑(1, 2, 3, 5, 6) using TRUTH TABLE only 1.  Find POS expression 2.  Simplify POS expression 3.  Implement this simplified expression using t

What is configuration, What is configuration?  Turing  machine  compute...

What is configuration?  Turing  machine  computes,  changes  occur  in  the  current  state,  the  current  tap contents  and  the  current  head  location. A  setting  of  the

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