Digital Electronics Circuits

By
Dr. S. P. Singh
Assistant Professor
Department of ETC
IIIT Bhubaneswar
 Digital Electronics Circuit
Syllabus
Module - 1
▪ Number System: Binary Numbers, Data Representation, Binary, Octal, Hexadecimal and
Decimal Number System and their Conversion, Complements, Signed Binary Numbers,
Binary Codes, Binary Logic.
▪ Boolean Algebra and Logic Gates: Basic Definitions, Basic Theorems and properties of
Boolean Algebra, Boolean Functions, Canonical and Standard Forms, Other logic
Operations, Digital Logic Gates, Digital Logic Families.
▪ Gate Level Minimization: The Map Method, Four and Five Variable Map, Product of
Sums Simplification, Don't-Care Conditions, NAND and NOR Implementation, Other
two-level Implementation, Exclusive-OR Function
▪ Combinational Logic Design: Combinational Circuits, Binary Adder-Subtractor, BCD
adder, Binary Multiplier, Comparator, Decoder, Encoder, Multiplexers and De-
multiplexers.
 Digital Electronics Circuit
Module - 2

▪ Sequential Logic: Concepts of Sequential Circuits, Latches, Flip-flops, Analysis and

synthesis of Clocked Sequential Circuits, State Reduction Sequential Circuits and Memory
Elements: Registers, Shift Registers,
▪ Counters: Asynchronous Counters, Synchronous Counters Other Counters, Finite State
Machine, Sequence Detector Circuits, Introduction to RAM and ROMs, Memory
Decoding, PLA, PAL.

Module - 3

▪ Logic Family: Voltages as Logic Variables, Logic Delay Times: Output Switching Times,
Propagation Delay, Fan-In and Fan-out, RTL, DTL, TTL, and C-MOS Electronics,
MOSFETS, C-MOS Invertors, Logic Formation Using MOSFETS: the NAND and NOR
Gate, CMOS Logic Connection, Complex Logic Gates in C-MOS
 Digital Electronics Circuit
Reference Books:
✓ Digital Design, Morris M. Mano, Pearson Education
✓ Digital Fundamentals, T.L. Floyd and R.P. Jain, Pearson Education, New Delhi

Marking Scheme:

▪ Quiz = 15
▪ Mid Semester Exam = 30
▪ End Semester Exam = 50
▪ Teacher Assessment = 5
 Signal
A signal is a variation in parameters.
e.g., Temperature variation, speech signal, light signal etc.

In electrical/electronics engineering domain, we analyze electrical signal means the variation

in voltage/current as a function of time.

Source: Digital Design, Morris M. Mano

Analog signal
Continuous in both time
axis and amplitude axis

Discrete signal

Discrete in time axis and

continuous in amplitude axis
 Digital signal
Discrete in both time
axis and amplitude axis

Advantages of digital signal: ✓ Ease of design

✓ Programmable
✓ Reproducibility
✓ Speed
✓ Economical
✓ Compact
✓ Storage capability
Why number systems?

❑ Digital systems process binary data

❑ Real life problems are based on decimal numbers

Positional number systems: Least significant bit (LSB)

𝑎𝑛 𝑎𝑛−1 ………. 𝑎2 𝑎1 𝑎0 . 𝑎−1 𝑎−2 … … 𝑎−𝑚 𝑟 where a = 0, 1, 2…, r-2, r-1

Most significant bit (MSB)

𝑎𝑛 𝑟 𝑛 + 𝑎𝑛−1 𝑟 𝑛−1 +………. 𝑎2 𝑟 2 + 𝑎1 𝑟1 + 𝑎0 𝑟 0 + 𝑎−1 𝑟 −1 + 𝑎−2 𝑟 −2 +. . 𝑎−𝑚 𝑟 −𝑚

Decimal number system: The base r is equal to 10 for decimal number system. The weighting
structure of decimal numbers:

102 101 100 . 10−1 10−2 10−3 … .

Decimal point
Decimal number system:

45 = 4 × 101 + 5 × 100

768.23 = 7 × 102 + 6 × 101 + 8 × 100 + 2 × 10−1 + 3 × 10−2

Random number base to decimal number conversion:

127.4 8 = 1 × 82 + 2 × 81 + 7 × 80 + 4 × 8−1 = 87.5 10

4021.2 5 = 4 × 53 + 0 × 52 + 2 × 51 + 1 × 50 + 2 × 5−1 = 511.4 10

Binary number Octal number Hexadecimal number

system: system: system:

Base, r = 2 Base, r = 8 Base, r = 16

a = 0, 1 a = 0, 1, 2, 3, 4, 5, 6, 7 a = 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F
Decimal number to Random number base conversion:

(41)10 = ( )2 (153)10 = ( )8

Random Integer Remainder Random Integer Remainder

Base Base
2 41 1 8 153 1
2 20 0 8 19 3 (153)10 = (231)8
2 10 0 2
2 5 1 (41)10 = (101001)2
2 2 0
1
Random Integer Remainder
Base
(983)10 = ( )12 12 983 11
12 81 9 (980)10 = (69B)12
6
 (0.81)10 = ( )16 Take the
(0.513)10 = ( )8 Take the integer part integer part
0.81 x 16 = 12.96
0.513 x 8 = 4.104
0.96 x 16 = 15.36
0.104 x 8 = 0.832
0.36 x 16 = 05.76
0.832 x 8 = 6.656 (0.513)10 = (0.40651…)8
0.76 x 16 = 12.16
0.656 x 8 = 5.248
0.16 x 16 = 02.56
0.248 x 8 = 1.984
(0.81)10 = (0.CF5C2…)16
(0.6875)10 = ( )2
Take the integer part

0.6875 x 2 = 1.3750
0.3750 x 2 = 0.7500
(0.6875)10 = (0.1011)2
0.7500 x 2 = 1.5000
0.5000 x 2 = 1.0000
 Direct conversion from decimal to binary

Binary weights
28 27 26 25 24 23 22 21 20 2-1 2-2 2-3 2-4
256 128 64 32 16 8 4 2 1 0.5 0.25 0.125 0.0625

(93)10 = ( )2 (93)10 = (1011101.00…)2 (93)10 = (1011101)2

256 128 64 32 16 8 4 2 1 0.5 0.25 0.125 0.0625

1 0 1 1 1 0 1 0 0 0 0

(58)10 = ( )2 (58)10 = (110110.00…)2 (58)10 = (110110)2

256 128 64 32 16 8 4 2 1 0.5 0.25 0.125 0.0625

1 1 0 1 1 0 0 0 0 0
(0.6875)10 = ( )2 (0.6875)10 = (0.1011)2

256 128 64 32 16 8 4 2 1 0.5 0.25 0.125 0.0625

0 1 0 1 1

(0.625)10 = ( )2 (0.625)10 = (0.1010)2

256 128 64 32 16 8 4 2 1 0.5 0.25 0.125 0.0625

0 1 0 1 0
 Direct conversion from binary to octal and hexa-decimal

(93.6875)10 = (1011101.1011)2 = ( )8 = ( )16

For octal:
0 0 1 0 1 1 1 0 1 . 1 0 1 10 0 (1011101.1011)2 = (135.54)8
Make a group of
three bits
For hexa-decimal: 01 0 1 1 1 0 1 . 1 0 1 1 (1011101.1011)2 = (5D.B)16
Make a group of
four bits

(58.625)10 = (110110.1010)2 = ( )8 = ( )16

1 1 0 1 1 0 . 1 0 1 0 0 01 1 0 1 1 0 . 1 0 1 0

(110110.1010)2 = (66.5)8 = (36.A)16

Random base conversion: First convert the given number base into decimal number and
then convert the decimal number into the desired number base.

(93)11 = ( )5 (93)11 = (102)10 = (402)5

(172)11 = ( )6 (172)11 = (200)10 = (532)6

(542)7 = ( )12 (542)7 = (275)10 = (1AB)12

(51)10 + (14)10 = ( )5 (51)10 + (14)10 = (65)10 = (230)5

(1a0)6 / (20)3 = (101)5 Find a (36+6a) / 6 = 26 a = 20 Can not be a solution

(1a0)6 / (20)3 = (12)5 Find a (36+6a) / 6 = 7 a=1

Arithmetic addition:
1 0 0 Carry 1 1 1 1 1 0 Carry 1 1 1 0 Carry 0 0 1 0 Carry
190 10101 456 A 2 C
256 11111 723 5 B 8
( 4 4 6 )10 ( 1 1 0 1 0 0 )2 12 8 910 1514 2010
14 10 118 F E 1416
( 1 4 0 1 )8 ( F E 4 )16

Arithmetic subtraction:
0 1010 Borrow 0 0 10 0 Borrow 0 8 8 Borrow 0 1616 Borrow
3 4 0 1 1 0 1 4 5 2 A 2 C
2 5 6 1 0 1 1 2 7 3 5 B F
( 0 8 4 )10 ( 0 0 1 0 )2 (1 5 7 )8 ( 4 6 D )16
 Complements of positional number systems

There are two types of complements for each base (r) system:
❑ the radix complement (r′s complement )
❑ the diminished radix complement, (r - 1)′s complement

r′s complement: 𝑟𝑛 − 𝑁 (r-1)′s complement: (𝑟 𝑛 −1) − 𝑁

✓ Complements are defined for negative numbers

Decimal number: 9′s and 10′s complements

Binary numbers: 1′s and 2′s complements

Octal numbers: 7′s and 8′s complements

Decimal number: 9′s and 10′s complements: -21, -405, -8001

9′s complement: 102 − 1 − 21 = 99 − 21 = 78

103 − 1 − 405 = 999 − 405 = 594

104 − 1 − 8001 = 9999 − 8001 = 1998

10′s complement:
102 − 21 = 100 − 21 = 79

103 − 405 = 1000 − 405 = 595

104 − 8001 = 10000 − 8001 = 1999

✓ 10′s complement can be obtained from 9′s by adding 1

Binary number: 1′s and 2′s complements: -10, -101, -1111

1′s complement: 22 − 1 − 10 = 11 − 10 = 01
23 − 1 − 101 = 111 − 101 = 010

24 − 1 − 1111 = 1111 − 1111 = 0000

➢ Interestingly, the 1's complement of a binary number is formed by flipping all bits—
changing 0s to 1s and 1s to 0s.
2′s complement:
22 − 10 = 100 − 10 = 10

23 − 101 = 1000 − 101 = 011

24 − 1111 = 10000 − 1111 = 0001

✓ 2′s complement can be obtained from 1′s by adding 1 in 1′s complement

Octal number: 7′s and 8′s complements: -21, -405, -7156

7′s complement: 82 − 1 − 21 = 77 − 21 = 56

83 − 1 − 405 = 777 − 405 = 372

84 − 1 − 7156 = 7777 − 7156 = 0621

8′s complement:
82 − 21 = 100 − 21 = 57

83 − 405 = 1000 − 405 = 373

84 − 7156 = 10000 − 7156 = 0622

✓ 8′s complement can be obtained from 7′s by adding 1

 Addition and Subtraction with Complement Numbers

Using (r-1)’s complements: 1. Take the (r-1)’s complements of numbers

2. Add the numbers
3. If carry is generated, add that carry to the
sum

Using r’s complements: 1. Take the r’s complements of numbers

2. Add the numbers
3. If carry is generated, discard the carry to the sum

✓ The end answer is in complements form.

Signed Binary Numbers
Binary Codes

The 2421 and the excess‐3 codes are

examples of self‐complementing codes. Such
codes have the property that the 9’s
complement of a decimal number is obtained
directly by changing 1’s to 0’s and 0’s to 1’s
(i.e., by complementing each bit in the
pattern).
For example, decimal 395 is represented in
the excess‐3 code as 0110 1100 1000.
The 9’s complement of 604 is represented as
1001 0011 0111, which is obtained simply by
complementing each bit of the code (as with
the 1’s complement of binary numbers).
Floating-Point Numbers
To represent very large integer (whole) numbers, many bits are required. There is also a
problem when numbers with both integer and fractional parts, such as 23.5618, need to be
represented. The floating-point number system, based on scientific notation, is capable of
representing very large and very small numbers without an increase in the number of bits.

A floating-point number (also known as a real number) consists of two parts plus a sign. The
mantissa is the part of a floating-point number that represents the magnitude of the number
and is between 0 and 1. The exponent is the part of a floating-point number that represents the
number of places that the decimal point (or binary point) is to be moved.
Single-precision Floating-point binary numbers

The exponent, 12, is expressed as a biased exponent by adding it to 127 (12 + 127 = 139).
To illustrate, let’s consider the following floating-point binary number:

The sign bit is 1. The biased exponent is 10010001 = 145.

Example:
 BINARY LOGIC

Binary logic consists of binary variables and a set of logical operations. The variables are
designated by letters of the alphabet, such as A, B, C, x, y, z, etc., with each variable having
two and only two distinct possible values: 1 and 0. There are three basic logical operations:
AND, OR, and NOT. Each operation produces a binary result, denoted by z.

➢ Logic gates are electronic

circuits that operate on one or
more input signals to produce
an output signal.

❖ A truth table is a table of all possible combinations of the variables, showing the relation
between the values that the variables may take and the result of the operation.
 Digital Logic Gates
Name Graphic Algebraic Truth Table
Symbol Function