Scribd
Upload
161 views35 pages

Chap4 BEKG1113

The document discusses basic logic gates and Boolean expressions. It defines logic gates as basic digital circuits with two or more inputs and one output that can have values of 1 or 0. The basic logic gates are NOT, AND, OR, NAND, NOR, XOR, and XNOR. Boolean expressions and theorems like DeMorgan's can be used to simplify logic circuits and implement them using combinations of NAND or NOR gates. Standard logic symbols from IEEE/ANSI are also introduced.

Uploaded by

am2030
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
161 views35 pages

Chap4 BEKG1113

The document discusses basic logic gates and Boolean expressions. It defines logic gates as basic digital circuits with two or more inputs and one output that can have values of 1 or 0. The basic logic gates are NOT, AND, OR, NAND, NOR, XOR, and XNOR. Boolean expressions and theorems like DeMorgan's can be used to simplify logic circuits and implement them using combinations of NAND or NOR gates. Standard logic symbols from IEEE/ANSI are also introduced.

Uploaded by

am2030
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 35

CHAPTER 4:

DIGITAL ELECTRONIC
Basic Logic Gates
 Logic gate is the most basic type of digital circuit, which
consists of two or more inputs and one output.

 It has only two states, either “1” or “0”.

 A gate can be used alone to perform a logic function.

 It can also be connected to several other gates to form a


logic network.

 Basic gates are the NOT, AND, OR, XOR, XNOR,


NAND & NOR.
BASIC LOGIC GATES
NOT gate / Inverter
 The output is the inverse of the input.

A Y= A

Boolean equation: YA

Truth table: Input, A Output, Y


0 1

1 0
BASIC LOGIC GATES
OR gate
 The output is 1 if any or all of the inputs are 1.

A
F
B

Boolean equation: F  A B

Input Output
Truth table:
A B F
0 0 0
0 1 1
1 0 1
1 1 1
BASIC LOGIC GATES
AND gate
 The output is 1 only if all the inputs are 1.
A
F
B

Boolean equation: F  A  B  AB

Truth table: Input Output


A B F
0 0 0
0 1 0
1 0 0
1 1 1
BASIC LOGIC GATES

NOR gate
 The output is 1 only if all of the inputs are 0.

A A
F
= F
B B

Boolean equation: F  A B

Input Output
Truth table: A B F
0 0 1
0 1 0
1 0 0
1 1 0
BASIC LOGIC GATES

NAND gate
 The output is 1 if any or all the inputs are 0.

A
B
F
= A
B
F

Boolean equation: F  AB

Truth table: Input Output


A B F
0 0 1
0 1 1
1 0 1
1 1 0
BASIC LOGIC GATES

X-OR GATE (Exclusive-OR gate)


 The output is 1 only if an odd number of the inputs are 1.

A F
B

Boolean equation: F  AB  AB  A  B

Truth table: Input Output


A B F
0 0 0
0 1 1
1 0 1
1 1 0
BASIC LOGIC GATES

X-NOR GATE (Exclusive-NOR gate)


 The output is 1 only if an odd number of inputs are 0.

A
F
B

Boolean equation: F  AB  AB  A  B

Truth table: Input Output


A B F
0 0 1
0 1 0
1 0 0
1 1 1
BOOLEAN EXPRESSIONS
IMPLEMENTING CIRCUIT FROM BOOLEAN
EXPRESSION

 When a logic is defined by a Boolean expression, we


can draw the circuit directly from the expression.

 If an expression contains both AND and OR operation,


the AND operations are performed first.

 Unless there are parentheses in the expression, where


the operation inside the parentheses is to be performed
first.
BOOLEAN EXPRESSIONS

EXAMPLE:
Given, F = ( A + B) • C so the diagram is performed as:

A (A + B )
B F= (A + B )·C
C

Given, F = ( A + B )( B + C ) the diagram is performed as:


BOOLEAN EXPRESSIONS

Evaluating Logic-Circuit Outputs


Given A=0, B=1, C=1, D=1 and the Boolean expression as
below. Determine the output for the expression.

F = ABC ( A + D )
Solution:

F  ABC ( A  D)
 0  1  1(0  1)
 1(0)
0
BOOLEAN EXPRESSIONS

Determining Output Level From A Diagram

Determining the output level from a circuit diagram, where


the inputs are A=0, B=1, C=1,D=1
BOOLEAN THEOREMS
 Boolean theorems can be used to express logic circuit
operations mathematically.

 It can help us to simplify logic expression, therefore


logic circuit.

 There are two methods to simplify a complicated logic


circuit.
 Boolean algebra & DeMorgan’s theorem
 Karnaugh Map

 The most important of Boolean algebra rules and laws


are presented in the following section.
BOOLEAN THEOREMS
BOOLEAN THEOREMS
BOOLEAN THEOREMS
BOOLEAN THEOREMS
BOOLEAN THEOREMS

Multivariable theorems

(10a) A+B = B+A


(10b) A•B = B•A
(11) A+(B+C) = (A+B)+C
(12) A(BC)=(AB)C
(13a) A(B+C) = AB+AC
(13b) (A+B)(C+D)=AC+BC+AD+BD
(14) A+AB = A
(15a) A+AB=A+B
(15b) A+AB = A+B
BOOLEAN THEOREMS

DeMorgan’s Theorem
 DeMorgan’s theorems are very useful in simplifying
expressions for easy transfer back and forth from the
product of variables to the sum of variables form.

 It allows for elimination of overbar(s) that are over


several variables.

 The two theorems are:


 First theorem
The inverted of a product of variables is equal to the sum of the
inverted individually variable.

A⋅ B = A + B
BOOLEAN THEOREMS
BOOLEAN THEOREMS

 Second theorem
The inverted of a sum of variables is equal to the product of the
inverted individual variable.

A + B = A⋅ B
BOOLEAN THEOREMS
BOOLEAN THEOREMS

Applying Demorgans Theorems


 The following procedure illustrates the applications of
DeMorgan’s theorems and Boolean Algebra to the
specific expression:
BOOLEAN THEOREMS
BOOLEAN THEOREMS
BOOLEAN THEOREMS
SIMPLIFICATION USING BOOLEAN ALGEBRA
 Apply the laws, rules and theorems of Boolean algebra
to simplify general expressions.
SIMPLIFICATION USING BOOLEAN ALGEBRA
SIMPLIFICATION USING BOOLEAN ALGEBRA
UNIVERSALITY OF NAND GATES & NOR GATES
 All Boolean expressions consists of various
combinations of the basic operations of OR, AND, and
INVERTER.

 Therefore, any expression can be implement using


combinations of OR gates, AND gates, and INVERTERs.
BOOLEAN THEOREMS
BOOLEAN THEOREMS
IEEE/ANSI STANDARD LOGIC SYMBOLS
 The logic symbols used we have used so far in this
chapter are the traditional standard symbols used in the
digital industry for many, many years.

 A newer standard for logic symbols was developed in


1984; it is called the IEEE/ANSI Standard 91-1984 for
logic symbols.

 The IEEE/ANSI standard uses rectangular symbols to


represent all logic gates and circuits.

 A special dependency notation inside the rectangular


symbol indicates how the device outputs depend on the
device inputs.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy