Upload
hoanghanh
View
215
Download
0
Embed Size (px)
Citation preview
Number Systems
Decimal (base 10) {0 1 2 3 4 5 6 7 8 9}o Place value gives a logarithmic representation
of the numbero 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,6004 3 2 6 0 0
105
104
103
100
101
102
Powers of ten:
100 = 1 102 = 100 104 = 10000
101 = 10 103 = 1000 105 = 100000
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 numbero 29 = 512
o Subtract that power of two from the numbero 575 – 512 = 63
o Repeat steps 1 and 2 for the new result until you reach zero.o 25 = 32 63 – 32 = 31o 24 = 16 31 – 16 = 15o 23 = 8 15 – 8 = 7o 22 = 4 7 – 4 = 3o 21 = 2 3 – 2 = 1o 20 = 1 1 – 1 = 0
o Construct the numbero 1000111111
Hexadecimal (base 16) {0 1 2 3 4 5 6 7 8 9 A B C D E F} Assignments Dec Hex Dec Hex
0 0 8 81 1 9 92 2 10 A3 3 11 B4 4 12 C5 5 13 D6 6 14 E7 7 15 F
Hexadecimal is Convenient for Binary Conversion
Binary Hex Binary Hex0 0 1001 91 1 1010 A
10 2 1011 B11 3 1100 C
100 4 1101 D101 5 1110 E110 6 1111 F111 7 1 0000 101000 8 Nibble
Binary to Hex Conversion
Group binary number by fours (nibbles)o 1101 1001 0110
Convert each nibble into hex equivalento 1101 1001 0110 D 9 6
Decimal to Hex Conversion
Ex. 284o 162 = 256 284 – 256 = 28o 161 = 16 28 - 16 = 12 (Hex C)
oResult 1 1 C
Another Example with an Extension
1054o 162 = 256
But we have several multiples of 256 in 1054o 1054/256 = 4.12 take integer parto This eliminates 4*256 = 1024
1054 – 1024 = 30o 161 = 16 30 – 16 = 14 (Hex E)
oResult 4 1 E
Truth TableBinary Decimal Hexadecimal
0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111
Truth TableBinary Decimal Hexadecimal0000 0 00001 1 10010 2 20011 3 30100 4 40101 5 50110 6 60111 7 71000 8 81001 9 91010 10 A1011 11 B1100 12 C1101 13 D1110 14 E1111 15 F
Practice
Convert 212 decimal to binaryo 212 – 27 = 84o 84 – 26 = 20o 20 – 24 = 4o 4 – 22 = 0oResult: 1101 0100
Notation
Some books use a subscript to denote the base.o Ex: 1210 = 12 decimalo 1216 = 12 hex = 18 decimal
Transistors as Switches• VBB voltage controls whether the transistor
conducts in a common base configuration.
• Logic circuits can be built
ANDIn order for current to flow, both switches
must be closed¤ Logic notation AB = C (Sometimes AB = C)
A B C0 0 00 1 01 0 01 1 1
Properties of AND and OR
Distributive PropertyA + B C = (A + B) (A + C)A + B C
A B C Q0 0 0 00 0 1 00 1 0 00 1 1 11 0 0 11 0 1 11 1 0 11 1 1 1
Distributive Property
(A + B) (A + C)
A B C Q
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 1
1 1 1 1
Binary Addition
A B S C(arry)
0 0 0 0
1 0 1 0
0 1 1 01 1 0 1
Notice that the carry results are the same as AND
C = A B
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 B S0 0 01 0 10 1 11 1 0
Half Adder
Called a half adder because we haven’t 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
43 (plus a carry)
Full Adder
INPUTS OUTPUTS
A B CIN COUT S
0 0 0 0 0
0 0 1 0 1
0 1 0 0 1
0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 0
1 1 1 1 1
Chaining the Full AdderPossible to use the same scheme for subtraction by
noting that
A – B = A + (-B)
Binary CountingUse 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
2 10 12 1100 22 10110
3 11 13 1101 23 10111
4 100 14 1110 24 11000
5 101 15 1111 25 11001
6 110 16 10000 26 11010
7 111 17 10001 27 11011
8 1000 18 10010 28 11100
9 1001 19 10011 29 11101
10 1010 20 10100 30 11110
DeMorgan’s 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
Summary
Summary for all 2-input gates
Inputs Output of each gate
A B AND NAND OR NOR XOR XNOR
0 0 0 1 0 1 0 1
0 1 0 1 1 0 1 0
1 0 0 1 1 0 1 0
1 1 1 0 1 0 0 1