AISHWARYA COLLEGE OF ENGINEERING

AND TECHNOLOGY

REGULATION : 2017
SUBJECT:DIGITAL LOGIC CIRCUITS
CODE: EE8351
 OBJECTIVES
• To study various number systems and simplify
the logical expression functions.
 UNIT-I
Number systems and Digital logic families

Review of number systems, binary codes,

error detection and correction codes (parity
and hamming code)- Digital logic families-
comparison of RTL, DTL, TTL, ECL and MOS
families- operation, characteristics of digital
logic family.
REVIEW OF NUMBER SYSTEM
• Decimal number system – 0 to 9
• Binary number system – 0 &1
• Octal number system – 0 to 7
• Hexadecimal number system – 0 to 15
• Decimal number system
Represented by using base “10”
Eg: (5678.1) 10
Solution: 5×1000+ 6×100+7×10+8×100+1x10-1
i.e, Power of 10 goes on decrement
• Binary number system
Only 0 &1 represent base with base “2”
Eg: (1010.01) 2
Solution: 1×2^3+0×2^2+1×2^1+0×2^0+0×2^-
1+1×2^-2
• Octal number Systems
Uses 0 to 7 with base “8”
Eg: (2250.176) 8
Sol: 2×8^3+2×8^2+5×8^1+0×8^0+1×8^-1+7×8^-
1+7×8^-2+6×8^-3
• Hexadecimal number systems
Uses 0 to 9,A,B,C,D,E,F [upto 15] with base “16”
Eg” (3AF.95) 16
Sol: 3×16^2+10×16^1+15×16^0+9×16^-1+5×16^-
2
 DECIMAL TO BINARY
• Divide the number by 2
• Get the integer quotient for the next iteration
• Get the remainder for the binary digit
• Repeat the steps until the quotient is equal to 0
Eg: Convert decimal number13 10 to binary
Division by 2 Quotient Remainder
13/2 6 1
6/2 3 0
3/2 1 1
1/2 0 1

13 10 = 11012
 DECIMAL TO OCTAL
• Divide the number by 16
• Get the integer quotient for the next iteration
• Get the remainder for the octal digit
• Repeat the steps until the quotient is equal to 0
Eg: Convert decimal number 210 10 to Octal
Division by 8 Quotient Remainder
210/8 26 2
26/8 3 2
3/2 1 1
1/2 0 1

13 10 = 11218
 Decimal to hex
• Divide the number by 8
• Get the integer quotient for the next iteration
• Get the remainder for the hex digit
• Repeat the steps until the quotient is equal to 0
Eg: Convert decimal number 7562 10 to hex
Division by 16 Quotient Remainder Remainder
(hex)
7562/16 472 10 A
472/16 29 8 8
29/16 1 13 D
1/16 0 1 1

7562 10 = 1D8A2
 Binary to decimal
• Write down the binary number and determine
the positions, namely the power of 2
• Represent the number in terms of its
positions.
Eg: Convert (101011) 2 to decimal
= 1×2^5+0×2^4+1×2^3+0×2^2+1×2^1+1×2^0
= 32+0+8+0+2+1
=43
(101011) 2 = (43) 10
Binary to octal
BINARY OCTAL
000 0
001 1
010 2
011 3
100 4
101 5
110 6
111 7
• Take binary number
• Divide the binary digit into groups of three (starting from right for integer)
part and start from left for fraction part
• Convert each group of three binary digits to one octal digit.

Eg: Covert Binary number (10010110) 2 to Octal

(10010110) 2
= 010 010 110
= (226) 8
 Binary to Hex
BINARY HEX BINARY HEX
0000 0 1000 8
0001 1 1001 9
0010 2 1010 A
0011 3 0011 B
0100 4 1100 C
0101 5 1101 D
0110 6 1110 E
0111 7 1111 F
 Binary to Hex
• Take binary number
• Divide the binary digit into groups of Four (starting from right for integer)
part and start from left for fraction part
• Convert each group of three binary digits to one octal digit.

Eg: Convert (01001110) 2 to hexadecimal

(0100) 2 = (4) 16
(1110) 2 = (E) 16
(01001110) 2 = (4E) 16
 OCTAL TO DECIMAL
• Write down the place value of each digit.
• Add up the place value of each digit.
• Convert (72)8 To decimal
2 - 2×8^0=2
7- 7×8^1=56
58
(72) 8 = (58) 10
OCTAL TO BINARY
OCTAL BINARY
0 000
1 001
2 010
3 011
4 100
5 101
6 110
7 111
 Octal to binary
• Covert each octal digit to its 3-digit binary
representation
• Combine these binary representations to form
a single binary number.
Eg: Convert 305 to binary
305 8 = (011 000 101) 2
 Octal to Hex
• Convert the octal number into binary digit ND
Then further to from binary to hexadecimal.
Eg: Convert 536 8 to hexadecimal
536 8 = (101) (011) (110)
= (101011110)
= 0001 0101 1110
= (15E) 16
 Hex to Binary
Hex BINARY Hex BINARY
0 0000 8 1000
1 0001 9 1001
2 0010 10 1010
3 0011 11 0011
4 0100 12 1100
5 0101 13 1101
6 0110 14 1110
7 0111 15 1111
 Binary Addition
case A+B Sum Carry
1 0+0 0 0
2 0+1 1 0
3 1+0 1 0
4 1+1 0 1

For example:
00011010 + 00001100 = 00100110
1 1 carries
 Binary Subtraction
Input A Input B
0 0
0 1
1 0
1 1
Subtract A-B Borrow
0 0
0 1
1 0
0 0

For example: 00100101 - 00010001 = 00010100

borrows
00100101 37(base 10)
- 00010001 17(base 10))

00010100 = 20(base 10)

 Binary Multiplication
Input A Input B Multiply
A×B
0 0 0
0 1 0
1 0 0
1 1 1

For Example 00001000 × 00000011 = 00011001

00001000 8 (base 10)

+ 00001000 8 (base 10)
00001000 8 (base 10)

00011001 24 (base 10)

 Binary Division
• 1÷1=1
• 1÷0=0
For example,
01111100÷0010 = 111110
 Work Out
Binary Addition
1. 00010011 + 00111110 = 01010001
Binary subtraction
2. 00110011 - 00010110 = 00011101
Binary Division
3. 101101÷101=1001
• Convert (95)8 To decimal
• Convert (7F) 16 to Binary