Books for Reference:
Text Books:
1. Modern Digital Electronics by [Link], 4th Edition, ISBN 978-0-07-06691-
16 Tata McGraw Hill
2. Digital Logic and Computer Design by Moris Mano, Pearson , ISBN 978-93-
325-4252-5
Reference Books:
1. John F. Wakerly, "Digital Design: Principles and Practices," Pearson.
2. Mark Bach, “Complete Digital Design”, Tata MCGraw Hill, 2005.
3. Charles H. Roth Jr., "Fundamentals of Logic Design," Cengage Learning.
Unit-1 Syllabus
Contents
Number systems: Binary, Decimal, Octal and Hexadecimal Number system,
conversion of one number system to another,
Representation of signed number- sign magnitude representation, 1‟s
complement and 2‟s complement form, addition and subtraction of two
binary numbers,
Fixed point representation of a numbers, standard representation for logic
functions,
Minimization of Boolean function using K-map (up to 4 variables),
Minimization of SOP and POS using K-map.
Decimal Number System (Base-10)
- Most widely used number system in daily life
- Based on 10 digits: 0 to 9
- Each digit has a place value based on powers of
10
- Also known as Base-10 system
- Used in counting, arithmetic, money, measurement,
etc.
Each position in a number represents a power of 10
- Place values increase from right to left
Features & Applications
Base = 10
- Digits used = 0 to 9
- Supports positive and decimal (fractional) numbers
- Real-world examples:
• Currency (₹120.75)
• Time (24 hours)
• Distance (5.8 km)
• Temperature (37°C)
Binary Number System (Base-2)
Binary system uses only two digits: 0 and 1
- It is a base-2 number system
- Each position represents a power of 2
- Widely used in computers and digital systems
- Every bit is either ON (1) or OFF (0)
Binary Number System (Base-2)
Example:
Binary: 1011
Calculation: 1×8 + 0×4 + 1×2 + 1×1 = 11
Applications:
- Computer memory and processing
- Logic gates and circuits
- Data representation and transmission
- Machine-level programming
Octal Number System (Base-8)
Octal system uses 8 digits: 0 to 7
- It is a base-8 number system
- Each position represents a power of 8
- Commonly used in computing as a shorthand for
binary
- Easier to read and write than long binary
sequences
Example & Usage
Example:
Octal: 157
Calculation: 1×64 + 5×8 + 7×1 = 64 + 40 + 7 =
111
Usage:
- Unix file permissions (e.g., chmod 755)
- Shorter representation of binary data
Hexadecimal Number System (Base-16)
Hexadecimal system uses 16 symbols: 0–9 and A–F
A = 10, B = 11, ..., F = 15
It is a base-16 number system
Each position represents a power of 16
Compact and readable form of binary data
Example & Applications
Example:
Hex: 2F
Calculation: 2 × 16 + 15 = 32 + 15 = 47
(Decimal)
Applications:
Memory addresses (e.g., 0xFF)
Color codes in web design (e.g., #FF5733)
Machine code representation
Easier grouping of binary (4 bits = 1 hex digit)
Bit and Byte
Feature Bit Byte
Definition Short for Binary Digit Group of 8 bits
Symbol b (lowercase) B (uppercase)
1 bit = 1 binary value (0
Size 1 byte = 8 bits
or 1)
Smallest unit? Yes – smallest data unit No – made up of 8 bits
Representing binary values Representing characters,
Used for
(1 or 0) data size
01101100 = 1 byte (e.g.
Example 1 or 0
letter 'l')
Storage/Speed Units Internet speed (e.g., Mbps) File size (e.g., MB, GB)
Conversion of one number system to another
Relation between binary number system and others
Binary and Decimal
Converting a decimal number into binary
(decimal binary)
Divide the decimal number by 2 and take its
remainder
The process is repeated until it produces the
result of 0
The binary number is obtained by taking the
remainder from the bottom to the top
Binary and Decimal
Converting a decimal number into
binary (decimal binary)
Divide the decimal number by 2 and take
its remainder
The process is repeated until it
produces the result of 0
The binary number is obtained by taking
the remainder from the bottom to the
top
Example: Decimal Binary
5310 => 53 / 2 = 26 remainder 1
26 / 2 = 13 remainder 0
13 / 2 = 06 remainder 1 Read from
06 / 2 = 03 remainder 0 the bottom
to the top
03 / 02 = 01 remainder 1
01 / 02 = 00 remainder 1
= 1101012 (6 bits)
= 001101012 (8 bits)
(note: bit = binary digit)
Signed Magnitude Representation
Signed Magnitude (SM) is a method for encoding
signed integers.
The Most Significant Bit is used to represent the sign.
„1‟ is used for a „-‟ (negative sign), a „0‟ for a „+‟
(positive sign).
The format of a SM number in 8 bits is:
Smmmmmmm
where „s‟ is the sign bit and the other 7 bits
represent the magnitude.
Examples on sign-magnitude representation of
signed numbers
+9 is represented as 01001 …32 16 8 4 2 1
-9 is represented as 11001
Examples
What are the decimal values of the following 8-bit
sign-magnitude numbers?
10000011 = -3
00000101 = +5
11111111 = ?
01111111 = ?
Represent the following in 8-bit sign-magnitude:
-15 = 10001111
+7 = 00000111
-1 = ?
1's Complement Representation
Positive numbers are represented using normal binary
equivalent while negative numbers are represented by the 1's
complement (complement) of the normal binary representation
of the magnitude.
+9 is represented as 01001
-9 is represented as 10110 (obtained by complementing the
binary representation of 9).
Important Note: Negative numbers will always have a 1 in the
MSB while positive numbers will have a 0 in the MSB.
2's Complement Representation
Positive numbers are represented using normal binary
equivalent while negative numbers are represented by the 2's
complement (complement) of the normal binary representation
of the magnitude. The 2's complement of a binary number
equals its 1's complement + 1.
+9 is represented as 01001
-9 is represented as 10111 (Now leave the LSB 1 unchanged
and complement all the remaining bits).
Example:
Karnaugh Map (K-map)
In the algebraic method of simplification, we need
to write lengthy equations, find the common terms,
manipulate the expressions etc., so it is time
consuming work.
“K-map” is another simplification technique to
reduce the Boolean equation.
Karnaugh Map (K-map)- Cont.
It overcomes all the disadvantages of algebraic
simplification techniques.
The information contained in a truth table or
available in the SOP or POS form is represented on
K-map.
Karnaugh Map (K-map)- Cont.
K-map Structure - 2 Variable
A & B are variables or inputs
0 & 1 are values of A & B
2 variable k-map consists of 4 boxes i.e. 22=4
Karnaugh Map (K-map)- Cont.
K-map Structure - 2 Variable
Inside 4 boxes we have enter values of Y i.e. output
Karnaugh Map (K-map)- Cont.
Relationship between Truth Table & K-map
Karnaugh Map (K-map)- Cont.
K-map Structure - 3 Variable
A, B & C are variables or inputs
3 variable k-map consists of 8 boxes i.e. 23=8
Karnaugh Map (K-map)- Cont.
3 Variable K-map & its associated product terms
Karnaugh Map (K-map)- Cont.
3 Variable K-map & its associated minterms
Karnaugh Map (K-map)- Cont.
K-map Structure - 4 Variable
A, B, C & D are variables or inputs
4 variable k-map consists of 16 boxes i.e. 24=16
Karnaugh Map (K-map)- Cont.
4 Variable K-map and its associated product terms
Karnaugh Map (K-map)- Cont.
4 Variable K-map and its associated minterms
Karnaugh Map (K-map)- Cont.
Steps to design K-map:
Design the K-map for corresponding number of variables
Assign the position of variables
Input variable values are ordered in a sequence
00 – 01 – 11 – 10
Assign the decimal value to each cell
Mount the minterms/maxterms
Make the group of adjacent cell 1/2/4/8/16
(Group should be as large as possible)
After the group, the variable which having different values i.e. 0 & 1 will get
eliminated
Write the reduce equation in SOP or POS form depends on given function (No. of
groups = No. of terms)
Representation of Standard SOP form expression on K-map
Rules for K-map simplification
Rules for K-map simplification
Rules for K-map simplification
Rules for K-map simplification
Rules for K-map simplification
Rules for K-map simplification
Rules for K-map simplification
Grouping Rule:
While grouping, we should group most number of
1‟s.
The grouping follows the binary rule i.e we can
group 1,2,4,8,16,32,…..…number of 1‟s.
We cannot group 3,5,7,………number of 1‟s
Pair:
A group of two adjacent 1‟s is called as Pair
Quad: A group of four adjacent 1‟s is called as Quad
Octet: A group of eight adjacent 1‟s is called as Octet
Grouping Example (3- variable k-map):
Grouping Example (3- variable k-map):
Grouping Example (4- variable k-map):
Grouping Example (4- variable k-map):
Grouping Example:
