Scribd
Upload
62 views6 pages

C2 - Simplifying Logic Circuits Using Theorems-NTHai-2-2020

This document is a chapter on logic gates and Boolean algebra from a lecture at the University of Technology and Education. It discusses simplifying Boolean expressions using theorems like DeMorgan's Laws. Examples are provided of simplifying expressions and implementing circuits from Boolean expressions using logic gates. Review questions at the end involve further simplifying expressions and drawing circuit diagrams.

Uploaded by

Duc Nguyen
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
62 views6 pages

C2 - Simplifying Logic Circuits Using Theorems-NTHai-2-2020

This document is a chapter on logic gates and Boolean algebra from a lecture at the University of Technology and Education. It discusses simplifying Boolean expressions using theorems like DeMorgan's Laws. Examples are provided of simplifying expressions and implementing circuits from Boolean expressions using logic gates. Review questions at the end involve further simplifying expressions and drawing circuit diagrams.

Uploaded by

Duc Nguyen
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/ 6

University of Technology and Education

Faculty of Electrical & Electronic Engineering

Lecture:
DIGITAL SYSTEMS
Chapter 2:
Logic Gates and Boolean Algebra

Assoc. Prof. Nguyen Thanh Hai, PhD

1
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra


Example 8: Simplify the expression y=ABD+ABD

Solution: According to theorem (13), we have y=AB(D+D)


Using theorem (8) and (2), we have y=AB 1
=AB
Review questions: Simplify the following expressions
1) y=AC+ABC 2) y=ABCD+ABCD 3) y=AD+ABD
When we need to design a logic circuit based on user’s
requirements (inputs and output states), an expression is
produced, however, the expression can be complex, so we need
to simplify it using theorems, as described in example.

2
Assoc. Prof. Nguyen Thanh Hai, PhD
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra


Similarity to Boolean theorems, we can use DeMorgan’s theorems
for simplifying expressions
Example: Simplify the expression z=(A+C)  (B+D)
Solution: According to theorem (17), we have z=(A+C)  (B+D)
Using theorem (16), we have z=(A  C)  (B  D)
Review questions:
1. Use DeMorgan’s theorems to convert the expression z=(A+B)  C
to one that has only single-variable inversions.

z=(A+B)  C  A+B+C=A  B+C=A  B+C

2. Repeat question 1 for the expression y=RST+Q


y=RST+Q  RST  Q=(R+S+T)  Q  (R+S+T)  Q
3
Assoc. Prof. Nguyen Thanh Hai, PhD
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra


Review questions:

1. Use DeMorgan’s theorems to convert the expression z=(A+B)  C


to one that has only single-variable inversions.
z=(A+B)  C  A+B+C=A  B+C=A  B+C
2. Repeat question 1 for the expression y=RST+Q
y=RST+Q  RST  Q=(R+S+T)  Q  (R+S+T)  Q
3. Implement a circuit having the output expression
using only a NOR gate and an INVERTER. z=ABC
z=ABC=(A+B)  C=(A+B)+C  (A+B)+C
4. Use DeMorgan’s theorems to convert y=A+B+CD to an
expression containing only single-variable inversions.
y=A+B+CD  A  B  CD  A  B  (C+D)=A  B  (C+D) 4
Assoc. Prof. Nguyen Thanh Hai, PhD
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra


Implementing Circuits From Boolean Expressions

Review Questions

1. Draw the circuit diagram that implements the following


expression using gates with no more three inputs
Y = AB C ( A  D )
2. Draw the circuit diagram for the expression
Y=AC+BC +ABC
3. Draw the circuit diagram for

Y = [ D + ( A + B ) C .E
5
Assoc. Prof. Nguyen Thanh Hai, PhD
University of Technology and Education
Faculty of Electrical & Electronic Engineering

Logic Gates and Boolean Algebra

The End

6
Assoc. Prof. Nguyen Thanh Hai, PhD

You might also like