Premier University, Chittagong

EEE-311: Digital Electronics

Analysis & synthesis of digital logic circuits

Dr. Sampad Ghosh

Associate Professor
Department of Electrical and Electronic Engineering
Faculty of Electrical and Computer Engineering
Chittagong University of Engineering and Technology (CUET)

January 14, 2023

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET)
KYUSHU UNIVERSITY
 Topics Reference
Analysis & synthesis of digital logic circuits
Basic logic functions
OR operation with OR gates, AND operation with
AND gates, NOR operation with NOR gates,
Tocci
Describing logic circuits algebraically, Evaluating
logic circuit outputs, Implementing circuits from
Boolean expressions, NOR gates & NAND gates

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 2

Binary Logic and Logic Gates
 Binary logic consists of binary variables and logical operations.
o Variables designated by alphabet (A, B, C, x, y, z)
 Variable allows only two values — 0 and 1.
 Logic 0: false, off, low, no, open switch.

 Logic 1: true, on, high, yes, closed switch.

o Three basic logic operations

 OR, AND and NOT.
 Binary logic dealing with an algebra called Boolean Algebra.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 3

Binary Logic and Logic Gates …
 Boolean functions are implemented in digital computer circuits called
gates.
 A gate is an electronic device that produces a result based on two or
more input values.
o In reality, gates consist of one to six transistors, but digital designers
think of them as a single unit.
o Integrated circuits (ICs) contain collections of gates suited to a particular
purpose.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 4

Point’s Need To Understand
 Electronic gates require a power supply.
 Gate Input’s are driven by voltage having two nominal values.
 The Output of a gate provides two nominal values of voltage.
 There is always a Time Delay between an input being applied and the
output responding.
 Digital systems are said to be constructed by using various gates.
o AND Gate o NAND Gate
o OR Gate o NOR Gate
o NOT Gate o Ex-OR Gate
o Ex-NOR Gate

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 5

Truth Tables
 Describes relationship between input and output of logic circuit.
 Used to describe functional behavior of Boolean expression and/ Logic circuit.
 Each row in truth table represents a unique combination of input variables.
 For n input variables, there are 2n rows.
 2-input truth table would have 22 = 4 entries.
 3-input truth table would have 23 = 8 entries.
 The output of the logic function is defined for each row.
 Each row is assigned a numerical value, with rows listed in ascending order.
 The order of the input variables defined in the logic function is important.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 6

Truth Tables …

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 7

OR Operation with OR Gates
 Boolean expression for OR operation
o x = A+B - read as “x equals A OR B”
 OR operation is similar to addition, but when A = 1 and B = 1, OR
operation produces:
o 1 + 1 = 1 not 1 + 1 = 2
 OR operation produces a result (output) of 1 whenever any input is
1. Otherwise, output is 0.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 8

OR Operation with OR Gates …
 OR gate is an electronic circuit that gives a high output when one or
more of its inputs are high.
 An OR gate is a logic circuit that performs an OR operation on the
circuit’s input.

Truth table and circuit symbol for a 2-input OR gate

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 9

OR Operation with OR Gates …

Truth table and circuit symbol for a 3-input OR gate

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 10

AND Operation with AND Gates
 Boolean expression for AND operation
o x = A.B - read as “x equals A AND B”
 AND operation is performed the same as ordinary multiplication of 1s
and 0s.
 AND operation produces a result (output) of 1 whenever all inputs
are 1. Otherwise, output is 0.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 11

AND Operation with AND Gates …
 The AND gate is an electronic circuit that gives a high output only if
all its inputs are high.
 An AND gate is a logic circuit that performs the AND operation on the
circuit’s input.

Truth table and circuit symbol for a 2-input AND gate

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 12

AND Operation with AND Gates …

Truth table and circuit symbol for a 3-input AND gate

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 13

AND / OR

 The AND symbol on a logic-circuit

diagram tells you output will go HIGH
only when all inputs are HIGH.
Input Output

 The OR symbol means the output will

go HIGH when any input is HIGH.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 14

NOT Operation with NOT Gates
 Boolean expression for NOT operation
ഥ - read as x equals “NOT A” or “inverse of A” or
o x = A’ = 𝐀
“complement of A”
 The NOT gate is an electronic circuit that produces an inverted
version of the input at its output.
 More commonly called an Inverter.
Truth table and circuit symbol for NOT gate

Presence of small circle

always denotes inversion
CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 15
NOT Operation with NOT Gates …
 The INVERTER inverts (complements) the input signal at all points on
the waveform.

 Whenever the input = 0, output = 1, and vice versa.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 16

Boolean operations
 Summarized rules for OR, AND and NOT.

 These three basic Boolean operations can describe any logic circuit.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 17

Describing Logic Circuits Algebraically
 If an expression contains both AND and OR gates, the AND operation
will be performed first.

 Unless there is a parenthesis in the expression.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 18

Describing Logic Circuits Algebraically …
 Whenever an INVERTER is present, output is equivalent to input, with
a bar over it.
o ഥ.
Input A through an inverter equals 𝐀

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 19

Evaluating Logic Circuit Outputs
 Rules for evaluating a Boolean expression:
o Perform all inversions of single terms.
o Perform all operations within parenthesis.
o Perform AND operation before an OR operation unless parenthesis indicate otherwise.
o If an expression has a bar over it, perform operations inside the expression, and then
invert the result.

A=B=0, C=D=E=1,

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 20

Evaluating Logic Circuit Outputs …
 The best way to analyze a circuit made up of multiple logic gates is
to use a truth table:
o It allows you to analyze one gate or logic combination at a time.
o It allows you to easily double-check your work.
o When you are done, you have a table of tremendous benefit in
troubleshooting the logic circuit.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 21

Analysis of a logic circuit using truth tables

1. The first step after listing all input combinations

is to create a column in the truth table for each
Node u has been filled as
intermediate signal (node).
the complement of A

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 22

Analysis of a logic circuit using truth tables …

2. The next step is to fill in the values for column v.

Node v should be HIGH when

A’ (node u) and B are HIGH

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 23

Analysis of a logic circuit using truth tables …

3. The third step is to predict the values at node w

which is the logical product of BC.
This column is HIGH
whenever B and C are HIGH

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 24

Analysis of a logic circuit using truth tables …

4. The final step is to logically combine columns v

and w to predict the output x. The x output will be HIGH
when v or w is HIGH

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 25

Evaluating Logic Circuit Outputs …

 t=1, when A=0, and B=C=1

 u=1, when A=1 or D=1
 v=u’
 x=1, when t=1 and v=1

v
u

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 26

Importance of Boolean Algebra
 Boolean Algebra is used to simplify Boolean expressions.
o Through application of the Laws and Theorems
 Simpler expressions lead to simpler circuit realization, which,
generally, reduces cost, area requirements, and power consumption.
 The objective of the digital circuit designer is to design and realize
optimal digital circuits.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 27

NOR Gates and NAND Gates
 So far, discussed basic AND, OR, and NOT operations.
o Simplifying the writing of Boolean expressions
 Output of NAND and NOR gates may be found by determining the
output of an AND or OR gate, and inverting it.
o The truth tables for NOR and NAND gates show the complement of
truth tables for OR and AND gates.

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 28

NOR Gates
 The NOR gate is an inverted OR gate.
o An inversion “bubble” is placed at the output of the OR gate, making the
Boolean output expression x = 𝐀 + 𝐁 = (𝐀 + 𝐁)′

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 29

NAND Gates
 The NAND gate is an inverted AND gate.
o An inversion “bubble” is placed at the output of the AND gate, making
the Boolean output expression x = 𝐀. 𝐁 = (𝐀. 𝐁)′

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 30

Exclusive-OR (XOR) Gates
 An encircled plus sign () is used to show the Exclusive–OR
operation.

AB

AB’+A’B

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 31

Exclusive-NOR (XNOR) Gates
 The Exclusive–NOR gate is circuit does the opposite to the XOR
gate. The symbol is an EX-NOR gate with a small circle on the
output.
o The small circle represents inversion.

(A  B)’=(A Θ B)

AB+A’B’

CHITTAGONG UNIVERSITY OF ENGINEERING AND TECHNOLOGY (CUET) 32