Digital Electronics

Course Code : 10B11EC401

L T P : 3 1 0
Credits : 4
Course Coordinator: D S Saini (Lectures)
Neeru Sharma(Tutorials)


1
Evaluation System
1. Test 1 1 h 15
2. Test 2 1 h 30 min 25
3. Test - 3 2 h 35
4. Teachers Assessment 25

Total 100

2
Teachers Assessment
1. Attendance 5
2. Quiz 10
3. Tutorial Assessment 10
3

Module
No.

Subtitle of the Module

Topics in the module

No. of

Lectures

1

Number System, and
Binary Codes
Conversion of bases,
Representation of negative
numbers, 9s and 1s
complement, 10s and 2s
complement, arithmetic using 2s
complement Hexadecimal
code, weighted codes - BCD,
Excess-3 code, Gray Code and
Alphanumeric code.

4


2

Boolean Algebra
Boolean function
representation and
minimization techniques

Logic gates and
Boolean Algebra. Standard and
canonical representation and
minimization of Boolean
expressions using Karnaugh
map, Quine-McCluskey method
4
4

3

Combinational
Logic Circuits

Half Adder, Full Adder, Half Subtractor,
Full Subtractor , Full adder using Half
adder, Multiplexer/demultiplexers, Arithmetic
circuits: Look ahead carry adder, BCD adder,
programmable adder/subtractor, Encoders and
Decoders
7
4 Sequential
Logic Circuits
Flip Flops: SR, JK, Master slave JK, T and D.
Excitation tables, conversion of Flip Flops,
Synchronous and Asynchronous counters, Design
of counters using flip flops. Shift Registers and
their Applications, Analysis of Sequential circuits
8
5
State Diagram
Design
Mealey and Moore State diagrams, Sequence
Detector.
2
6
Digital
Memories
Introduction to Semiconductor Memories, PROM,
ROM, PLA, PAL.
2
7
Introduction to
VHDL
Basic language elements, Behavioral
Modeling, Data flow Modeling, Structural
Modeling
6
5
8 Waveform and wave
shaping
Schmitt Trigger and Square
wave circuit
4
9 Digital Logic Families Parameters of Logic Families.
Introduction to logic Families:
DTL,RTL,TTL, TTL NAND gate,
CMOS
5
Recommended Reading material:
1. M. Morris Mano, Digital Logic and Computer Design, First Indian Reprint,
PHI, 2005.
2. M. Morris Mano, Digital Design, Pearson Education Asia, 3rd edition.
3. R.P . Jain, Modern Digital Electronics, TMH, 4
th
Edition.
4. J Bhasker, VHDL Primer, Tata McGraw-Hill 3rd edition
5. Taub and Schilling, Digital Integrated Electronics, McGraw Hill, Int. Ed.
6
Introduction
Analog Signals
Digital Signals
Applications of digital systems:
Digital computers
Calculators
Electronic appliances
Multimedia
Telephony
Video games
7
Advantages of digital over analog:
Easy to design.
Less affected by noise.
Information storage is easy.
Accuracy and precision are greater.
More digital circuitry can be fabricated on IC chip.
Disadvantages:
In digitisation (converting physical quantity to digital
form), there occurs unavailable error, i.e quantisation
error.
All physical parameters are analog in nature.

8
Digital Devices
Gates
Flip-Flops
PLDs- Programmable Logic Devices
FPGAs- Field Programmable Gate Arrays.
9
Chapter I
Conversion of bases, Representation of negative
numbers.
9s and 1s complement.
10s and 2s complement
Arithmetic using 2s complement
Hexadecimal code, weighted codes - BCD, Excess-3
code, Gray Code and Alphanumeric code.
Logic gates and Boolean Algebra
10
Binary digits
The two digits in the binary system 1 and 0 are called
bits-binary digit.
In digital circuits, two different voltage levels are used
to represent the two bits.
Generally 1 is represented by the higher voltage, which
is referred as HIGH and 0 is represented by a lower
voltage level, referred as LOW.
This is called positive logic, i.e. HIGH=1 and LOW=0.
Another system where 1=LOW and 0=HIGH is called
negative logic.
11
Binary Numbers have only two digits 0 or 1
Decimal Binary
0 0
1 1
2 10
3 11
4 100
5 101
6 110
7 111
Binary is known as Base 2
12
2
7
2
6
2
5
2
4
2
3
2
2
2
1
2
0
128 64 32 16 8 4 2 1
0 0 1 0 1 0 0 1
1 x 1 = 1
Total = 41
128 x 0 = 0
64 x 0 = 0
32 x 1 = 32
16 x 0 = 0
8 x 1 = 8
4 x 0 = 0
Use the chart to convert the binary number to decimal.
Note: The bit to
the far right is the
Least Significant
Bit (LSB) and will
determine if the
number is even or
odd.
2 x 0 = 0
13
2
7
2
6
2
5
2
4
2
3
2
2
2
1
2
0
128 64 32 16 8 4 2 1
0 1 1 1 1 1 1 1
1 x 1 = 1
Total = 127
128 x 0 = 0
64 x 1 = 64
32 x 1 = 32
16 x 1 = 16
8 x 1 = 8
4 x 1 = 4
Use the chart to convert the binary number to decimal.
2 x 1 = 2
Note: if consecutive
bits from the right
are all 1s
Then the answer is
the next power of 2
minus 1
In this case
128 1 = 127
14
2
7
2
6
2
5
2
4
2
3
2
2
2
1
2
0
128 64 32 16 8 4 2 1
1 0 1 1 1 0 1 0
1 x 0 = 0
Total = 186
128 x 1 = 128
64 x 0 = 0
32 x 1 = 32
16 x 1 = 16
8 x 1 = 8
4 x 0 = 0
Convert the given binary number to decimal.
2 x 1 = 2
15
2
8
2
7
2
6
2
5
2
4
2
3
2
2
2
1
2
0

256 128 64 32 16 8 4 2 1

The largest number that can be represented using
an 8 bit binary number is 255.
1 1 1 1 1 1 1 1
Remember the rule if all the digits are 1 then
the number is the next power of 2 minus 1
256 1 = 255
16
2
7
2
6
2
5
2
4
2
3
2
2
2
1
2
0
128 64 32 16 8 4 2 1
Converting a binary number to a decimal number
is a simple task if you understand the chart below
and how to use it.
17
Number System
Number is a collection of digits.


N- Number
b, r Base or radix of a number
n Number of digits
m Number of digits in integer position

m n n b r
d d d d d d d d d d N N

...... . ......
3 2 1 0 1 2 3 2 1
18
Different number systems
Decimal
Binary
Octal
Hexadecimal

19
Decimal Number System
Has 10 digits, 0-9
b = 10
d
i
= 09


Weight of i
th
digit = r
i

m n n
d d d d d d d d d d

...... . ......
3 2 1 0 1 2 3 2 1
20
The position of each digit in a decimal number
indicates the magnitude of the quantity represented
and can be assigned a weight.
The weights for whole numbers are positive powers
of 10, that increase from right to left, beginning with
10
0
=1.
For fractional part, weights are powers of 10 that
decrease from left to right.
Example: 2 3
Weight of 3 is 1
Weight of 2 is 10

Also it means 2*10+3*1=23
21
Binary Number System
Only two bits - 1 and 0
b, r=2
d
i
= 0,1
8 bits = 1byte
Group of bits is called a word.
Any number having n digits can have r
n
different
values.
Example: n=3. 2
3
= 8, will have 8 different values.
22
Weighted structure of binary numbers
........ 2 2 2 . 2 2 2 2 ........ 2
3 2 1 0 1 2 3 1 n
All the bits to the left of the binary point have
weights that are positive powers of 2 and all the bits
to the right of the binary point have weights that are
negative powers of 2.
23
Octal Number System
b, r = 8
d
i
=0,1.7
Hexadecimal Number System
Hex+Decimal = 6+10
b, r = 16
d
i
=0,1.9, A, B, C, D, E, F
10, 11, 12, 13, 14, 15

24
Conversions
1) Binary-to-Decimal
The decimal value of any binary can be found by
adding the weights of all bits that are 1 and
discarding the weights of all bits that are 0.
Example: 1101101
Weight: 2
6
2
5
2
4
2
3
2
2
2
1
2
0
Binary Number 1 1 0 1 1 0 1
= 2
6
+2
5
+0 +2
3
+2
2
+0+ 2
0
= 64+32+0+8+4+0+1 = 109

25
To convert the fractional binary number to
decimal, determine the weights if each bit that is
a 1 and then sum the weights to get the decimal
fraction.
Example: 0.1011
Weight: 2
-1
2
-2
2
-3
2
-4
Binary Number: 0. 1 0 1 1
= 2
-1
+2
-3
+2
-4
= 0.5+0.125+0.0625 = 0.6875

26
2) Decimal to binary
(a) Sum of weights method:
Determine the set of binary weights whose sum is
equal to the decimal number.
Example: 9 in decimal = 8+1
= 2
3
+2
0
Now place 1s in the appropriate weight positions, 2
3
and
2
0
, and 0s in the 2
2
and 2
1
positions.
Thus 2
3
2
2
2
1
2
0

1 0 0 1 ----is the binary equivalent of 9.
27
(b) Repeated Division by 2 method:

Begin by dividing the decimal number by 2. Then
divide each resulting quotient by 2 until there is a 0
whole-number quotient.
The remainders generated by each division form the
binary number.
The first remainder is the LSB and the last remainder
is the MSB of the binary number.
28
Example: 239
2 239
2 119 --- 1(LSB)
2 59 --- 1
2 29 ----1
2 14 --- 1
2 7 --- 0
2 3 --- 1
2 1 --- 1
2 0 --- 1 (MSB)
(239)
10
= (11101111)
2
(MSB--------LSB)

29
Example: 64
2 64
2 32 --- 0
2 16 --- 0
2 8 --- 0
2 4 --- 0
2 2 --- 0
2 1 --- 0
2 0 --- 1


(64)
10
= (1000000)
2

30
To convert decimal fraction to binary, sum of
weights method can be used.
Example: 0.625 = 0.5+0.125 = 2
-1
+2
-3

There is a 1 in 2
-1
position, a 0 in 2
-2
position and
a 1 in 2
-3
position.
Thus (0.625)
10
= (0.101)
2
Repeated multiplication by 2 is another method:


31
Example: 0.625
.625 x 2 = 1.25(MSB)
.25 x 2 = 0.50
.50 x 2 = 1.00

(.625)
10
= (.101)
2

32
Example: 37.0625
(37)
10
= (100101)
2
(.0625)
10
= (.0001)
2

(37.0625)
10
= (100101.0001)
2

33
Binary Arithmetic
1) Binary Addition
0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 10 ------ 1 is carry
34
2) Binary Subtraction
0 - 0 = 0
1 - 1 = 0
1 - 0 = 1
10 - 1 = 1 0-1 with a borrow of 1
35
3) Binary Multiplication
0 X 0 = 0
0 X 1 = 0
1 X 0 = 0
1 X 1 = 1
4) Binary Division
Division is performed as decimal division.
36
1s and 2s complement
1s complement of a binary number is found by
changing all the 1s to 0s and all the 0s to 1s.
Example: 10110010
1s complement is 01001101
2s complement is found by adding 1 to the LSB
of 1s complement of a binary number.
Example: 10110010
1s complement is 01001101
2s complement is 01001110
37
Given a number N in base r having n digits,
(r-1)s complement of N is defined as (r
n
-1)-N,
where n is the number of bits in a N.
9s complement of a decimal number 546700 is
999999-546700 = 453299.
And 10s complement is 4533300 (9s
complement + 1)
38