written 7.7 years ago by | modified 2.1 years ago by |

F = ∏M (1,2,3,7,10,11)+d(0,15) - F = ∏M (3,4,5,6,7,10,11,15) - Mumbai University > ELECTRO > Sem 3 > Digital Circuits and Designs

**Marks:** 10M

**Year:** May 2015

**1 Answer**

0

13kviews

Simplify following logic function and realize using NOR gate:

written 7.7 years ago by | modified 2.1 years ago by |

F = ∏M (1,2,3,7,10,11)+d(0,15) - F = ∏M (3,4,5,6,7,10,11,15) - Mumbai University > ELECTRO > Sem 3 > Digital Circuits and Designs

**Marks:** 10M

**Year:** May 2015

ADD COMMENT
EDIT

0

845views

written 7.7 years ago by |

A Karnaugh map provides a pictorial method of grouping together expressions to minimize a given boolean function.

Consider the following function.

F = ∏M (1,2,3,7,10,11)+d(0,15)

It is given in terms of maxterms, hence the minimized expression will be in the form of POS. The K-map minimization of the given function is as follows:

Implementation of the above minimized expression using NOR gates is shown below

Consider the second function.

F = ∏M (3,4,5,6,7,10,11,15)

It is given in terms of maxterms, hence the minimized expression will be in the form of POS. The K-map minimization of the given function is as follows:

Implementation of the above minimized expression using NOR gates is shown below

ADD COMMENT
EDIT

Please log in to add an answer.