Scribd
Upload
36 views38 pages

Digital Logic-Lesson2

Uploaded by

fiyinobidiya
Copyright
© © All Rights Reserved
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
36 views38 pages

Digital Logic-Lesson2

Uploaded by

fiyinobidiya
Copyright
© © All Rights Reserved
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/ 38

DIGITAL

LOGICS
IFT211/CSC
212
DR. ABIODUN AND MR. OLOWE
OBJECTIVES
At the end of this unit, student should be able to:
· identify the different logic gates
· analyze circuits with logic gates
· generate other gates from the universal gates.
LOGIC GATES
Logic Gates may be defined as the digital circuits capable of performing a
particular logic function by operating on a number of binary inputs. OR Logic
gates are the basic building blocks of any digital circuit.

Types Of Logic Gates-


Basic Logic Gates
Basic Logic Gates are the fundamental logic gates through which
universal logic gates and other logic gates are constructed.
They have the following properties-

Basic logic gates are associative in nature. (It states that the order in

which the logic operations are performed is irrelevant as their effect


is the same.)
Basic logic gates are commutative in nature. (Commutative law states

that changing the sequence of the variables does not have any effect
on the output of a logic circuit.)
The three basic logic gates are-
AND Gate
OR Gate
NOT Gate
DIFFERENT
REPRESENTATION OF
GATES
Logic gates can be represented using different
methods among which are:
1. Symbol
2. Truth Table
3. Timing Diagram
4. Boolean Algebra
SYMBOL: AND Gate

The output of AND gate is high (‘1’) if all of its inputs are high (‘1’).
The output of AND gate is low (‘0’) if any one of its inputs is low (‘0’).
AND LOGIC SYMBOL
TRUTH TABLE

One of the common tool in specifying a gate function is


the truth table. All possible combination of the inputs A,
B … etc, are enumerated, one row for each possible
combination. Then a column is used to show the
corresponding output value.
Truth tables specifies how a logic circuit’s output
depends on logic levels present at the input.
If two logic circuits share identical truth table, they are
functionally equivalent.
AND GATE TRUTH TABLE

A B Y = A.B
0 0 0
0 1 0
1 0 0
1 1 1
TIMING DIAGRAM
A timing diagram is a graph of the output of a logic gate with
respect to the inputs of the gate. A timing diagram plots
voltage (vertical) with respect to time (horizontal). A timing can
also be seen as waveforms on an oscilloscope or on a logic
analyzer
BOOLEAN ALGEBRA

Boolean algebra is the category of algebra in which the variable’s values are
the truth values, true and false, ordinarily denoted 1 and 0 respectively. It
is used to analyze and simplify digital circuits or digital gates. It is also
called Binary Algebra or logical Algebra. It has been fundamental in the
development of digital electronics and is provided for in all modern
programming languages. It is also used in set theory and statistics.

1.For AND GATE, the Boolean Algebra is Y = A.B


SYMBOL: OR Gate

The output of OR gate is high (‘1’) if any one of its inputs is high (‘1’).
The output of OR gate is low (‘0’) if all of its inputs are low (‘0’).
The logic symbol for OR Gate is as shown below-
TRUTH TABLE FOR OR GATE

A B Y=A+B
0 0 0
0 1 1
1 0 1
1 1 1
TIMING DIAGRAM FOR OR GATE

The Boolean Algebra for OR Gate is Y = A + B


SYMBOL: NOT Gate
The output of NOT gate is high (‘1’) if its input is low (‘0’).
The output of NOT gate is low (‘0’) if its input is high (‘1’).
From here-
It is clear that NOT gate simply inverts the given input.
Since NOT gate simply inverts the given input, therefore it
is also known as Inverter Gate.
NOT GATE TRUTH
TABLE
A Y = A’
0 1
1 0
NOT GATE TIMING DIAGRAM

The Boolean Algebra for OR Gate is Y = A’


Universal Logic Gates-
Universal logic gates are the logic gates that are capable
of implementing any Boolean function without requiring
any other type of gate.
They are called as “Universal Gates” because-They can
realize all the binary operations. All the basic logic gates
can be derived from them.
They have the following properties- Universal gates are
not associative in nature.
Universal gates are commutative in nature.
NOR GATE

A NOR Gate is constructed by connecting a NOT Gate at the output


terminal of the OR Gate.
The output of OR gate is high (‘1’) if all of its inputs are low (‘0’).
The output of OR gate is low (‘0’) if any of its inputs is high (‘1’).
NOR GATE TRUTH TABLE

A B Y=A+B
0 0 1
0 1 0
1 0 0
1 1 0
NOR GATE TIMING
DIAGRAM
NAND Gate-
A NAND Gate is constructed by connecting a NOT
Gate at the output terminal of the AND Gate.
The output of NAND gate is high (‘1’) if at least one
of its inputs is low (‘0’).
The output of NAND gate is low (‘0’) if all of its
inputs are high (‘1’).
CLASS WORK

1. Draw the Truth Table for a two input NAND Gate


2. Draw the timing diagram
3. Write the Boolean Algebra
OTHER GATES
EXOR GATE
EXOR denotes exclusive OR circuit. It obeys the definition, the
output of a two input exclusive OR assumes the logic ‘1’ state
(true) if and only if one of the input signals assume the logic ‘1’
state (true)

A B Y
0 0 0
0 1 1
BOOLEAN ALGEBRA Y = (AB)
1 0 1
1 1 0
OTHER GATES
EXNOR GATE
EXNOR obeys the definition, the output of a two input exclusive
NOR assumes the logic ‘1’ state (true) if and only if the two inputs
are similar. It is an important gate for it can only have two inputs at
a time.

A B Y
0 0 1
0 1 0
BOOLEAN ALGEBRA Y = (AB)
1 0 0
1 1 1
OUTPUTS OF SIX
DIFFERENT GATES
INPUTS
OUTPUTS

OR AND NOR NAND EXOR EXNOR


A B A+B A.B (A+B)’ (A.B)’ AB (AB)’
0 0 0 0 1 1 0 1
0 1 1 0 0 1 1 0
1 0 1 0 0 1 1 0
1 1 1 1 0 0 0 1
THREE INPUT GATES
INPUTS OUTPUTS

OR AND NOR NAND


A B C A+B A.B (A+B)’ (A.B)’
0 0 0 0 0 1 1
0 0 1 1 0 0 1
0 1 0 1 0 0 1
0 1 1 1 0 0 1
1 0 0 1 0 0 1
1 0 1 1 0 0 1
1 1 0 1 0 0 1
1 1 1 1 1 0 0
Determining outputs value from a
Diagram

A
B
C
D

To evaluate the output of this circuit for inputs


shown, we propagate the input values through
the gates from left to right.

Find the value of X if A=1, B=0, C=1 and D=1


A
A+B
B (A + B).CD
C

D
Determining outputs value from a
Diagram

A
B
C

(i) Find the value of X if A=0, B=1, C=1 and D=1


(ii) Find the value of X if A=0, B=0, C=0 and D=0
(iii)Find the value of X if A=0, B=1, C=1 and D=0
(iv)Derived the Boolean expression for X
Solution

(i) X = 0

(ii) X = 0
(iii) X = 1
(iv) (A’.B.C). (A+D)’ = (A.B.C).(A+D) = PQ
Transform a circuit into a
truth table

A P

C Q
CIRCUITS TO TRUTH
TABLE

INPUT INTERMEDIATE VALUES


A B C B’ Q=B’C P=AB F= P + Q
0 0 0 1 0 0 0
0 0 1 1 1 0 1
0 1 0 0 0 0 0
0 1 1 0 0 0 0
1 0 0 1 0 0 0
1 0 1 1 1 0 1
1 1 0 0 0 1 1
1 1 1 0 0 1 1
Transform the circuit into a
truth table

X Q

Z R
P
CIRCUITS TO TRUTH
TABLE

INPUT INTERMEDIATE VALUES


X Y Z P=Z’ Q=(X + Y)’ R=(Y+Z’)’ F= (RQ)’
0 0 0 1 1 0 1
0 0 1 0 1 1 0
0 1 0 1 0 0 1
0 1 1 0 0 0 1
1 0 0 1 0 0 1
1 0 1 0 0 1 1
1 1 0 1 0 0 1
1 1 1 0 0 0 1
IMPLEMENTING CIRCUITS FROM
BOOLEAN EXPRESSION

When the operations of a circuit is defined by a Boolean expression, we


can draw a logic-circuit diagram directly from that expression.
For example:
Solution
CLASS WORK
Draw the logic-circuits from
the expression:
Y = AC + BC’ + A’BC
SOLUTIONS

You might also like