Professional Documents
Culture Documents
Cs8351 Digital Principles and System Design
Cs8351 Digital Principles and System Design
Used by Used in
System Base Symbols humans? computers?
Decimal 10 0, 1, … 9 Yes No
Binary 2 0, 1 No Yes
Octal 8 0, 1, … 7 No No
Hexa- 16 0, 1, … 9, No No
decimal A, B, … F
Quantities/Counting (1 of 3)
Hexa-
Decimal Binary Octal decimal
0 0 0 0
1 1 1 1
2 10 2 2
3 11 3 3
4 100 4 4
5 101 5 5
6 110 6 6
7 111 7 7
Quantities/Counting (2 of 3)
Hexa-
Decimal Binary Octal decimal
8 1000 10 8
9 1001 11 9
10 1010 12 A
11 1011 13 B
12 1100 14 C
13 1101 15 D
14 1110 16 E
15 1111 17 F
Quantities/Counting (3 of 3)
Hexa-
Decimal Binary Octal decimal
16 10000 20 10
17 10001 21 11
18 10010 22 12
19 10011 23 13
20 10100 24 14
21 10101 25 15
22 10110 26 16
23 10111 27 17
Base-r system
Decimal Octal
Binary Hexadecimal
Example
Base
Decimal to Decimal
Decimal Octal
Binary Hexadecimal
Weight
Base
Binary to Decimal
Decimal Octal
Binary Hexadecimal
Binary to Decimal
– Multiply each bit by 2n, where n is the “weight”
of the bit
– The weight is the position of the bit, starting
from 0 on the right
– Add the results
Example
Bit “0”
1010112 => 1 x 20 = 1
1 x 21 = 2
0 x 22 = 0
1 x 23 = 8
0 x 24 = 0
1 x 25 = 32
4310
Octal to Decimal
Decimal Octal
Binary Hexadecimal
Octal to Decimal
– Multiply each bit by 8n, where n is the “weight”
of the bit
– The weight is the position of the bit, starting
from 0 on the right
– Add the results
Example
7248 => 4 x 80 = 4
2 x 81 = 16
7 x 82 = 448
46810
Hexadecimal to Decimal
Decimal Octal
Binary Hexadecimal
Hexadecimal to Decimal
– Multiply each bit by 16n, where n is the
“weight” of the bit
– The weight is the position of the bit, starting
from 0 on the right
– Add the results
Example
Binary Hexadecimal
Decimal to Binary
– Divide by two, keep track of the remainder
– First remainder is bit 0 (LSB, least-significant
bit)
– Second remainder is bit 1
– Etc.
Example
12510 = ?2 2 125
2 62 1
2 31 0
2 15 1
2 7 1
2 3 1
2 1 1
0 1
12510 = 11111012
Octal to Binary
Decimal Octal
Binary Hexadecimal
Octal to Binary
– Convert each octal digit to a 3-bit equivalent
binary representation
Example
7058 = ?2
7 0 5
7058 = 1110001012
Hexadecimal to Binary
Decimal Octal
Binary Hexadecimal
Hexadecimal to Binary
– Convert each hexadecimal digit to a 4-bit
equivalent binary representation
Example
10AF16 = ?2
1 0 A F
10AF16 = 00010000101011112
Decimal to Octal
Decimal Octal
Binary Hexadecimal
Decimal to Octal
– Divide by 8
– Keep track of the remainder
Example
123410 = ?8
8 1234
8 154 2
8 19 2
2 3
123410 = 23228
Decimal to Hexadecimal
Decimal Octal
Binary Hexadecimal
Decimal to Hexadecimal
– Divide by 16
– Keep track of the remainder
Example
123410 = ?16
16 1234
16 77 2
4 13 = D
123410 = 4D216
Binary to Octal
Decimal Octal
Binary Hexadecimal
Binary to Octal
– Group bits in threes, starting on right
– Convert to octal digits
Example
10110101112 = ?8
1 3 2 7
10110101112 = 13278
Binary to Hexadecimal
Decimal Octal
Binary Hexadecimal
Binary to Hexadecimal
– Group bits in fours, starting on right
– Convert to hexadecimal digits
Example
10101110112 = ?16
10 1011 1011
2 B B
10101110112 = 2BB16
Octal to Hexadecimal
Decimal Octal
Binary Hexadecimal
Octal to Hexadecimal
– Use binary as an intermediary
Example
10768 = ?16
1 0 7 6
2 3 E
10768 = 23E16
Hexadecimal to Octal
Decimal Octal
Binary Hexadecimal
Hexadecimal to Octal
– Use binary as an intermediary
Example
1F0C16 = ?8
1 F 0 C
1 7 4 1 4
1F0C16 = 174148
Binary Addition (1 of 2)
• Two 1-bit values
A B A+ B
0 0 0
0 1 1
1 0 1
1 1 10
“two”
Binary Addition (2 of 2)
• Two n-bit values
– Add individual bits
– Propagate carries
– E.g.,
1 1
10101 21
+11001 + 25
101110 46
Multiplication (1 of 3)
• Decimal
35
x 105
175
000
35
3675
Multiplication (2 of 3)
• Binary, two 1-bit values
A B AB
0 0 0
0 1 0
1 0 0
1 1 1
Multiplication (3 of 3)
• Binary, two n-bit values
– As with decimal values
– E.g.,
1110
x 1011
1110
1110
0000
1110
10011010
Fractions
• Decimal to decimal
Commutative w. r. t. + (.)
x+y=y+x
x.y=y.x
‘.’ is Distributive over ‘+’:
x . (y + z) = (x . y) + (x . z)
x+ x
= (x+ x) . 1 --------postulate 2(b) [ x. 1 = x ]
= (x+ x). (x+ x’) ------- 5(a) [ x+ x’ = 1]
= x+ xx’ ---------------- 4(b) [ x+yz = (x+y)
(x+z)]
= x+ 0 ------------------ 5(b) [ x. x’ = 0 ]
= x ----------------------2(a) [ x+0 = x ]
x. x = x
x. x
= (x. x) + 0 ---- by postulate 2(a) [ x+ 0 = x ]
= (x. x) + (x. x’) ----------- 5(b) [ x. x’ = 0]
= x ( x+ x’) ----------- 4(a) [ x (y+z) = (xy)+ (xz)]
= x (1) ------------------- 5(a) [ x+ x’ = 1 ]
= x ------------------- 2(b) [ x.1 = x ]
a) x+ 1 = 1
x+ 1 =
1 . (x+ 1) ------- by postulate 2(b) [ x. 1 = x ]
= (x+ x’). (x+ 1) ---------------- 5(a) [ x+ x’ = 1]
= x+ x’.1 ----------------4(b) [ x+yz = (x+y)(x+z)]
= x+ x’ ------------------- 2(b) [ x. 1 = x ]
= 1 ------------------- 5(a) [ x+ x’= 1]
(x’)’ = x
From postulate 5, we have x+ x’ = 1 and x. x’ = 0,
which defines the complement of x. The
complement of x’ is x and is also (x’)’.
x+ xy
= x. 1 + xy ------ by postulate 2(b) [ x. 1 = x ]
= x (1+ y) ------------- 4(a) [ x (y+z) = (xy)+ (xz)]
= x (1) ----------------- by theorem 2(a) [x+ 1 = x]
= x. ------------------- by postulate 2(a) [x. 1 = x]
x. (x+ y) = x
x. (x+ y)
= x. x+ x. y ----------- 4(a) [ x (y+z) = (xy)+ (xz)]
= x + x.y --------------- by theorem 1(b) [x. x = x]
= x. ------------------- by theorem 4(a) [x+ xy = x]
x+ x’y = x+ y
x+ x’y
= x+ xy+ x’y ------- by theorem 4(a) [x+ xy = x]
= x+ y (x+ x’) -----
by postulate 4(a) [ x (y+z) = (xy)+ (xz)]
= x+ y (1) ------------------- 5(a) [x+ x’ = 1]
= x+ y ------------------- 2(b) [x. 1= x]
x. (x’+y) = xy
x. (x’+y) = x.x’+ xy
postulate 4(a) [ x (y+z) = (xy)+ (xz)]
= 0+ xy ------------------- 5(b) [x. x’ = 0]
= xy. ------------------- 2(a) [x+ 0= x]
DeMorgan’s Theorems:
The first theorem states that the complement of a
product is equal to the sum of the complements.
(AB)’ = A’+ B’
1. Y(A, B) = A+ B
3.Y (A, B, C) = A+ BC