DIGITAL

ELECTRONICS
PRESENTED BY
SHOBHA RUDRA
SRI GAYATHRI DEVARAJU
CONTENTS
Introduction
Number System
Types of Number System
Number Base Conversion
Logic Gates
Construction of basic gates using NAND & NOR
Boolean & Demorgan’s Theorems
K-Map
Combinational Circuits
Sequential Circuits
 Introduction
A Digital system is an interconnection of
digital modules
It is a system that manipulates discrete
elements of information that is represented
internally in the binary form.
Now a day’s digital systems are used in
wide variety of industrial and consumer
products such as automated industrial
machinery, pocket calculators,
microprocessors, digital computers, digital
watches, TV games and signal processing
and so on.
06/20/2024 3
 Number System
In a digital system,
• The system can understand only
the optional number system.
• In these systems, digits symbols
are used to represent different
values
In simple terms, for representing the
digital information to digital
modules , we use the number system
in the digital system.
06/20/2024 4
 Types of Number
System
Binary Number System
Decimal Number System
Octal Number System
Hexadecimal Number System

06/20/2024 5
 Binary Number Syste
m
The binary number system is a
positional weighted system.
The base or radix of this number
system is 2.
 It has two independent
symbols, The symbols used are
0 and 1.
A binary digit is called a bit.

06/20/2024 6
 Decimal Number Syst
em
The decimal number system
contain ten unique symbols
0,1,2,3,4,5,6,7,8 and 9.
In decimal system 10 symbols
are involved, so the base or radix
is 10.
It is a positional weighted
system.

06/20/2024 7
 Octal Number System
It is also a positional weighted
system.
Its base or radix is 8.
It has 8 independent symbols
0,1,2,3,4,5,6 and 7.
Its base 8 = 23, every 3- bit
group of binary can be
represented by an octal digit

06/20/2024 8
 Hexadecimal Numbe
r System
The hexadecimal number system
is a positional weighted system.
The base or radix of this number
system is 16.
 The symbols used are
0,1,2,3,4,5,6,7,8,9,A,B,C,D,E
and F
The base 16 = 24 , every 4 – bit
group of binary can be
represented by an hexadecimal.
06/20/2024 9
 Number Base
Conversion
• Binary to other Number
Systems.
• Decimal to other Number
Systems.
• Octal to other Number Systems.
• Hexadecimal to other Number
Systems.

06/20/2024 10
Binary to Other
Decimal to Other
Octal to Other
Hexadecimal to Other
 Logic Gates
Logic gates are physical devices
which performs logical operation
on one/more logical inputs and
produces single logical output.
Types of logic gates
o Basic logic gates
o Universal logic gates
o Special logic gates

06/20/2024 15
 Classifications

Basic Gates
Universal Gates
Exclusive Gates

06/20/2024 16
AND Gate
• Symbol and Truth table An AND gate has two or more
inputs but only one output.
The output is logic 1 state only
when each one of its inputs is at
logic 1 state.
The output is logic 0 state even
if one of its inputs is at logic 0
state.
OR Gate
• Symbol and Truth table An OR gate may have two or
more inputs but only one output.
The output is logic 1 state, even
if one of its input is 1.
The output is logic 0 state, only
when each one of its inputs is in
logic state 0.
NOT Gate
• Symbol and Truth table A NOT gate, also called as
inverter, has only one input and
one output.
It is a device whose output is
always the complement of its
input.
The output of a NOT gate is the
logic 1 state when its input is in
logic 0 state and the logic 0 state
when its inputs is in logic 1 state.
NAND Gate
• Symbol and Truth table NAND gate is a combination of
an AND gate and a NOT gate.
The output is logic 0 when each
of the input is logic 1 and for any
other combination of inputs, the
output is logic 1.
NOR Gate
• Symbol and Truth table NOR gate is a combination of
an OR gate and a NOT gate.
The output is logic 1, only when
each one of its input is logic 0
and for any other combination of
inputs the output is a logic 0
level.
EX-OR Gate
• Symbol and Truth table An X-OR gate is a two input,
one output logic circuit.
The output is logic 1 when one
and only one of its two inputs is
logic 1. When both the inputs is
logic 0 or when both the inputs is
logic 1, the output is logic 0.
EX-NOR Gate
• Symbol and Truth table An X-NOR gate is the
combination of an X-OR gate and
NOT gate
An X-NOR gate is a two input,
one output logic circuit. The
output is logic 1 only when both
the inputs are logic 0 or when
both the inputs is 1.
The output is logic 0 when one of
the inputs is logic 0 and other is 1
Construction of basic gates using NAND
Construction of basic gates using NOR
Boolean algebra and demorgan's
theorems
• Boolean algebra is a system of mathematical logic. It is an
algebraic system consisting of the set of elements (0,1), two
binary operators called OR and AND and unary operator called
NOT.
• It is the basic mathematical tool in the analysis and synthesis of
switching circuits.
• It is a way to express logic functions algebraically.
Laws of boolean algebra
• Complementation Law:0' = 1 , 1' = 0 , A = 0 then 𝐴'= 1 ,A = 1 then
𝐴 '= 0 ,𝐴"=0
• OR Law: A + 0 = A (Null law) , A + 1 = 1(Identity law) ,A + A = A ,
A+𝐴' = 1
• And law:A . 0 = 0 (Null law) ,A . 1 = A (Identity law),
A . A = A ,A .𝐴' = 0
• Commutative law:A + B = B + A ,A . B = B . A
• Associative law: (A + B) + C = A + (B + C) ,(A .B) C = A (B .C)
• Distributive law: A (B + C) = AB + AC , A + BC = (A+B) (A+C)
• Redundant Literal Rule (RLR): A + 𝐴'B = A + B,A(𝐴'+ B) = AB
• Idempotence Laws: A. A = A ,A + A = A
• Absorption Laws: A + A ∙ B = A ,A ( A + B) = A
Demorgan's theorem
• De Morgan’s theorem represents two laws in Boolean algebra.
• This law states that the complement of a sum of variables is equal to
the product of their individual complements.
• Law 1: (𝐴 + 𝐵 )'=A'.B'
• Law 2: A'.B'=(A+B)'
K-Map
The K- map is a chart or a graph, composed of an arrangement of adjacent
cells, each
Representing a particular combination of variables in sum or product form
The K- map is systematic method of simplifying the Boolean expression.
The n variable K-map has 2n squares. These squares are called cells.
 We can minimize Boolean expressions of 3, 4 variables very easily using
K-map without using any Boolean algebra theorems.

Example = F(A, B, C, D) = Σm(0, 1, 2, 5, 7, 8, 9, 10, 13, 15)

06/20/2024 30
 Combinational
circuits
Characteristics
Output generation depends upon
only the current input.
This type of circuit is a time-
independent circuit i.e. independe
nt of a clock signal.
Its elementary building block is a
logic gate.

06/20/2024 31
Combinational circuits
• It does not have any memory elements.
• It does not have any feedback path between input and output.
• It is used for arithmetic circuits and boolean circuits.
• It is fast in speed.
• It is easy to design and also easy to use.
Examples: Multiplexer,demultiplexer, encoder, decoder, half-adder, full-
adder, etc
 Sequential Circuits
Characteristics
Output generation depends upon the
previous output and current input signals.
 It depends upon its previous feedback or
previous output. It uses the current state
(previous output) as control inputs for the
next operations.
 This type of circuit depends upon time
instant i.e. depends upon clock cycles.
 This can be two types-
Synchronous circuit (uses clock pulse)
and Asynchronous circuit (does not use
clock pulse).
06/20/2024 33
Sequential circuits
Flip-flops like D flipflop, SR flip-flop, JK flip-flop, T flip-flop.
 Registers
 Counters