Scribd
Upload
100 views9 pages

3 Boolean and Demorgan Laws

The document summarizes an experiment to verify Boolean and De Morgan laws using Emona-Net Circuit labs. It [1] simplifies a Boolean equation to show M = XY' using identities, [2] draws logic diagrams for X and Y, and [3] designs circuits to implement the two elements of De Morgan's theorem. The results show that the Boolean laws and De Morgan's theorem help simplify digital circuits, reducing the number of gates, cost, complexity, and heat dissipation.

Uploaded by

Parimala Ashok
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100 views9 pages

3 Boolean and Demorgan Laws

The document summarizes an experiment to verify Boolean and De Morgan laws using Emona-Net Circuit labs. It [1] simplifies a Boolean equation to show M = XY' using identities, [2] draws logic diagrams for X and Y, and [3] designs circuits to implement the two elements of De Morgan's theorem. The results show that the Boolean laws and De Morgan's theorem help simplify digital circuits, reducing the number of gates, cost, complexity, and heat dissipation.

Uploaded by

Parimala Ashok
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Register Number: 20BCE1082 Name: SHRIKUMARAN.

P A

VERIFICATION OF BOOLEAN AND DE MORGAN LAWS

Experiment no. 3 Date: 08-04-2021

Aim of the Experiment:

To implement and verify the Boolean and De Morgan laws using Emona- Net Circuit labs;

QUESTION 1:

1. Simplify the Boolean equation M = W’XY’ + WXY’ + XY’Z using Boolean identities and theorems to show that
M = XY’

SIMPLIFICATON AND EQUIVALENT BOOLEAN IDENTITY CIRCUIT.


̅ in EMONA – net CIRCUIT labs:
Circuit Implementation of M=X𝒀

QUESTION 2:

2. Draw the logic diagrams for X = AB(A’ + BC)’ and Y = ABC’

LOGIC DIAGRAM OF X = AB(A’ + BC)’ and Y = ABC’


Circuit Implementation of OF X = AB(A’ + BC)’ and Y = ABC’ in EMONA – net CIRCUIT labs:
VERIFICATION OF DE MORGAN THEOREMS:

THEOREM 1:

Design and draw the first element of De Morgan’s Theorem (AB)’ = A’ + B’ using the AND, OR and NOT gates.
CIRCUIT IMPLEMENTATION OF (AB)’ = A’ + B’ USING EMONA NET CIRCUIT LABS:
(AB)’

A’ + B’
THEOREM 2:

Design and draw the second element of De Morgan’s Theorem (C + D)’ = C’D’ using the AND, OR and NOT gates.

CIRCUIT IMPLEMENTATION OF (C + D)’ = C’D’ USING EMONA NET CIRCUIT LABS:


(C + D)’

C’D’
Inference & Result :

The Boolean laws and the De Morgan’s theorem helps us to greatly simplify the digital circuit thereby
Gives the following advantages

• Reduces the number of gates for the given circuit


• Reduces the cost
• Reduces the complexity and easy to manipulate
• Reduces the heat dissipation .
Result:

The Boolean laws and the De Morgan’s laws are verified using Emona net circuit labs:

You might also like