Number Systems

Decimal (base 10)

{0 1 2 3 4 5 6 7 8 9}

o Place value gives a logarithmic representation

of the number
o Ex. 4378 means

4 X 103 = 4000
3 X 102 = 300
7 X 101 = 70
8 X 100 =
8

o The place also gives the exponent of the base

Example
432,600
4 3 2 6 0 0
105

100

104

101

103

102
Powers of ten:
100 = 1

102 = 100

104 = 10000

101 = 10

103 = 1000

105 = 100000

Binary (base 2)
Binary

Decimal

10

11

100

101

110

111

1000

1001

1010

10

{0 1}

Example
1 1 0 1 1 0 0 1
27

20

26

21

25

22

24

23

Decimal Equivalent
1101 1001
1 X 27 = 128
+ 1 X 26 = 64
+ 0 X 25 = 0
+ 1 X 24 = 16
+ 1 X 23 = 8
+ 0 X 22 = 0
+ 0 X 21 = 0
+ 1 X 20 = 1
217

Notice how powers of two

stand out:
20 = 1
21 = 10
22 = 100
23 = 1000

Decimal to Binary Conversion

Ex. 575
o Find the largest power of two less than the number
o

29 = 512

o Subtract that power of two from the number

o

575 512 = 63

o Repeat steps 1 and 2 for the new result until you reach zero.
o
o
o
o
o
o

25 = 32
24 = 16
23 = 8
22 = 4
21 = 2
20 = 1

63 32 = 31
31 16 = 15
15 8 = 7
74=3
32=1
11=0

o Construct the number

o

1000111111

Another Example
144
o 27 = 128
o 24 = 16

Result

144 128 = 16
16 16 = 0

10010000

Hexadecimal (base 16)

{0 1 2 3 4 5 6 7 8 9 A B C D E F}
Assignments Dec Hex Dec

Hex

10

11

12

13

14

15

Example
3B6E

163

160

162

161
3 X 163 = 12288
11 X 162 = 2816
6 X 16 =

96

14 X 160 =

14

15214

Hexadecimal is Convenient for

Binary Conversion
Binary

Hex

Binary

Hex

1001

1010

10

1011

11

1100

100

1101

101

1110

110

1111

111

1 0000

10

1000

Nibble

Binary to Hex Conversion

Group binary number by fours (nibbles)
o 1101 1001 0110

Convert each nibble into hex equivalent

o 1101 1001 0110
D
9
6

Decimal to Hex Conversion

Ex. 284
o 162 = 256
o 161 = 16
o Result 1 1 C

284 256 = 28
28 - 16 = 12 (Hex C)

Another Example with an Extension

1054
o 162 = 256

But we have several multiples of 256 in 1054

o 1054/256 = 4.12 take integer part
o This eliminates 4*256 = 1024

1054 1024 = 30

o 161 = 16
o Result 4 1 E

30 16 = 14 (Hex E)

Truth Table
Binary
0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111

Decimal

Hexadecimal

Truth Table
Binary
0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111

Decimal
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

Hexadecimal
0
1
2
3
4
5
6
7
8
9
A
B
C
D
E
F

Sexagesimal
(Base 60)

Practice
Convert 212 decimal to binary
o 212 27 = 84
o 84 26 = 20
o 20 24 = 4
o 4 22 = 0
o Result: 1101 0100

More Practice
Convert 1101 0010 binary to hex
o 0010 = 2
o 1101 = 13 = D
o Result D2

Notation
Some books use a subscript to denote the
base.
o Ex: 1210 = 12 decimal
o 1216 = 12 hex = 18 decimal

Logic Gates

Transistors as Switches
VBB voltage controls whether the transistor
conducts in a common base configuration.

Logic circuits can be built

Boolean Algebra

AND
In order for current to flow, both switches
must be closed
Logic notation AB = C
(Sometimes AB = C)
A

OR
Current flows if either switch is closed
Logic notation A + B = C

Properties of AND and OR

Commutation
oA+ B = B +A
oA B = B A
Same as

Same as

Commutation Circuit

AB

A+B

BA

B+A

Properties of AND and OR

Associative Property
A + (B + C) = (A + B) + C

A (B C) = (A B) C

Properties of AND and OR

Distributive Property
A + B C = (A + B) (A + C)
A+BC

Distributive Property
(A + B) (A + C)
A

Binary Addition
A

C(arry)

Notice that the carry results are the same as AND

C = A B

Inversion (NOT)

Logic:

QA

Exclusive OR (XOR)

Either A or B, but not both

This is sometimes called the
inequality detector, because the
result will be 0 when the inputs are the
same and 1 when they are different.

The truth table is the same as for

S on Binary Addition. S = A B

A
0
1
0
1

B
0
0
1
1

S
0
1
1
0

Getting the XOR

Two ways of getting S = 1

A B or A B

Circuit for XOR

A B AB AB
Accumulating our results: Binary addition is the
result of XOR plus AND

Half Adder

Called a half adder because we havent allowed for any carry bit
on input. In elementary addition of numbers, we always need to
allow for a carry from one column to the next.
18
25
3 (plus a carry)
4

Half Adder

Full Adder
INPUTS

OUTPUTS

CIN

COUT

Full Adder Circuit

Chaining the Full Adder

Possible to use the same
scheme for subtraction by
noting that
A B = A + (-B)

Binary Counting
Use 1 for ON
Use 0 for OFF

00101011

So our example has 25 + 23 + 21 + 20 = 32 + 8 + 2 + 1 = 43

Counting in Binary
1

1 11

1011

21 10101

10 12

1100

22 10110

11 13

1101

23 10111

100 14

1110

24 11000

101 15

1111

25 11001

110 16

10000

26 11010

111 17

10001

27 11011

1000 18

10010

28 11100

1001 19

10011

29 11101

10

1010 20

10100

30 11110

NAND (NOT AND)

Q AB

NOR (NOT OR)

QAB

A
0
0
1
1

B
0
1
0
1

Q
1
0
0
0

DeMorgans Theorem

A NAND gate is equivalent to an inversion followed by an OR

A NOR gate is equivalent to an inversion followed by and AND

DeMorgan Truth Table

NAND

NOR

Exclusive NOR

Q AB
Equality Detector

Summary
Summary for all 2-input gates
Inputs
A

Output of each gate

AND

NAND

OR

NOR

XOR

XNOR

Logic Gates and Symbols

AND

NAND

More Gates and Symbols

OR

NOR

NOT

And More

XOR

NXOR

Multi-input Gates

Three input OR

Logic Gate ICs

Example 7400

More ICs

And More