Chapter 1 Professor Brendan Morris, SEB 3216, - PowerPoint PPT Presentation

Hexadecimal Numbers Hex Digit Decimal Equivalent Binary Equivalent 0 0 0000 1 1 0001 2 2 0010 3 3 0011 4 4 0100 5 5 0101 6 6 0110 7 7 0111 8 8 1000 9 9 1001 A 10 1010 B 11 1011 C 12 1100 D 13 1101 E 14 1110 F 15 1111 Chapter 1 <43>

Hexadecimal to Binary Conversion • Hexadecimal to binary conversion: • Convert 4AF16 (also written 0x4AF) to binary • Hexadecimal to decimal conversion: • Convert 0x4AF to decimal Chapter 1 <44>

Hexadecimal to Binary Conversion • Hexadecimal to binary conversion: • Convert 4AF16 (also written 0x4AF) to binary • 0x4AF = 0100 1010 1111 2 • Hexadecimal to decimal conversion: • Convert 0x4AF to decimal • 4 × 16 2 + 10 × 16 1 + 15 × 16 0 = 1199 10 Chapter 1 <45>

Number Systems • Popular • Decimal Base 10 • Binary Base 2 • Hexadecimal Base 16 • Others • Octal Base 8 • Any other base Chapter 1 <46>

Octal Numbers • Same as hex with one less binary digit Octal Digit Decimal Equivalent Binary Equivalent 0 0 000 1 1 001 2 2 010 3 3 011 4 4 100 5 5 101 6 6 110 7 7 111 Chapter 1 <47>

Number Systems • In general, an N-digit number {𝑏 𝑂−1 𝑏 𝑂−2 … 𝑏 1 𝑏 0 } of base 𝑆 in decimal equals • 𝑏 𝑂−1 𝑆 𝑂−1 + 𝑏 𝑂−2 𝑆 𝑂−2 + ⋯ + 𝑏 1 𝑆 1 + 𝑏 0 𝑆 0 • Example: 4-digit {5173} of base 8 (octal) Chapter 1 <48>

Number Systems • In general, an N-digit number {𝑏 𝑂−1 𝑏 𝑂−2 … 𝑏 1 𝑏 0 } of base 𝑆 in decimal equals • 𝑏 𝑂−1 𝑆 𝑂−1 + 𝑏 𝑂−2 𝑆 𝑂−2 + ⋯ + 𝑏 1 𝑆 1 + 𝑏 0 𝑆 0 • Example: 4-digit {5173} of base 8 (octal) • 5 × 8 3 + 1 × 8 2 + 7 × 8 1 + 3 × 8 0 = 2683 10 Chapter 1 <49>

Decimal to Octal Conversion • Remember two methods for D2B conversion • 1: remove largest multiple; 2: repeated divide • Convert 29 10 to octal Chapter 1 <50>

Decimal to Octal Conversion • Remember two methods for D2B conversion • 1: remove largest multiple; 2: repeated divide • Convert 29 10 to octal • Method 2 29/8 =3 R5 lsb 3/8 =0 R3 msb 29 10 = 35 8 Chapter 1 <51>

Decimal to Octal Conversion • Remember two methods for D2B conversion • 1: remove largest multiple; 2: repeated divide • Convert 29 10 to octal • Method 1 8 × 3=24 29 29-24=5 29 10 = 24 + 5 = 3 × 8 1 + 5 × 8 0 = 35 8 • Or (better scalability) 29 10 = 16 + 8 + 4 + 1 = 11101 2 = 35 8 Chapter 1 <52>

Octal to Decimal Conversion • Convert 163 8 to decimal Chapter 1 <53>

Octal to Decimal Conversion • Convert 163 8 to decimal • 163 8 = 1 × 8 2 + 6 × 8 1 + 3 • 163 8 = 64 + 48 + 3 • 163 8 = 115 10 Chapter 1 <54>

Recap: Binary and Hex Numbers • Example 1: Convert 83 10 to hex • Example 2: Convert 01101011 2 to hex and decimal • Example 3: Convert 0xCA3 to binary and decimal Chapter 1 <55>

Recap: Binary and Hex Numbers • Example 1: Convert 83 10 to hex • 83 10 = 64 + 16 + 2 + 1 = 1010011 2 • 1010011 2 = 101 0011 2 = 53 16 • Example 2: Convert 01101011 2 to hex and decimal • 01101011 2 = 0110 1011 2 = 6𝐶 16 • 0x6B = 6 × 16 1 + 11 × 16 0 = 96 + 11 = 107 • Example 3: Convert 0xCA3 to binary and decimal • 0xCA3 = 1100 1010 0011 2 • 0xCA3 = 12 × 16 2 + 10 × 16 1 + 3 × 16 0 = 3235 10 Chapter 1 <56>

Large Powers of Two • 2 10 = 1 kilo ≈ 1000 (1024) • 2 20 = 1 mega ≈ 1 million (1,048,576) • 2 30 = 1 giga ≈ 1 billion (1,073,741,824) • 2 40 = 1 tera ≈ 1 trillion (1,099,511,627,776) Chapter 1 <57>

Large Powers of Two: Abbreviations • 2 10 = 1 kilo ≈ 1000 (1024) for example: 1 kB = 1024 Bytes 1 kb = 1024 bits • 2 20 = 1 mega ≈ 1 million (1,048,576) for example: 1 MiB, 1 Mib (1 megabit) • 2 30 = 1 giga ≈ 1 billion (1,073,741,824) for example: 1 GiB, 1 Gib Chapter 1 <58>

Estimating Powers of Two • What is the value of 2 24 ? • How many values can a 32-bit variable represent? Chapter 1 <59>

Estimating Powers of Two • What is the value of 2 24 ? • 2 4 × 2 20 ≈ 16 million • How many values can a 32-bit variable represent? • 2 2 × 2 30 ≈ 4 billion Chapter 1 <60>

Binary Codes Another way of representing decimal numbers in binary Example binary codes: • Weighted codes • Binary Coded Decimal (BCD) (8-4-2-1 code) • 6-3-1-1 code • 8-4-2-1 code (simple binary) • Gray codes • Excess-3 code • 2-out-of-5 code Chapter 1 <61>

ASCII-Code Chapter 1 <62>

Binary Codes Decimal # 8-4-2-1 6-3-1-1 Excess-3 2-out-of-5 Gray (BCD) 0 0000 0000 0011 00011 0000 1 0001 0001 0100 00101 0001 2 0010 0011 0101 00110 0011 3 0011 0100 0110 01001 0010 4 0100 0101 0111 01010 0110 5 0101 0111 1000 01100 1110 6 0110 1000 1001 10001 1010 7 0111 1001 1010 10010 1011 8 1000 1011 1011 10100 1001 9 1001 1100 1100 11000 1000 Each code combination represents a single decimal digit. Chapter 1 <63>

Gray Codes • Next number differs in Decimal # Gray only one bit position 0 0000 • Example: 000, 001, 011, 1 0001 010, 110, 111, 101, 100 2 0011 • Example use: Analog- 3 0010 to-Digital (A/D) 4 0110 converters. Changing 2 5 1110 bits at a time (i.e., 011 6 1010 →100) could cause 7 1011 large inaccuracies. 8 1001 • Will use in K-maps 9 1000 Chapter 1 <64>

Chapter 1.4.5 Addition Chapter 1 <65>

Addition • Decimal 3734 + 5168 • Binary 1011 + 0011 Chapter 1 <66>

Addition • Decimal carries 11 3734 + 5168 8902 • Binary 1011 + 0011 Chapter 1 <67>

Addition • Decimal carries 11 3734 + 5168 8902 • Binary carries 11 1011 + 0011 1110 Chapter 1 <68>

Binary Addition Examples • Add the following 4-bit 1001 binary numbers + 0101 • Add the following 4-bit 1011 binary numbers + 0110 Chapter 1 <69>

Binary Addition Examples • Add the following 4-bit 1 1001 binary numbers + 0101 1110 • Add the following 4-bit 1011 binary numbers + 0110 Chapter 1 <70>

Binary Addition Examples • Add the following 4-bit 1 1001 binary numbers + 0101 1110 • Add the following 4-bit 111 1011 binary numbers + 0110 10001 Overflow! Chapter 1 <71>

Overflow • Digital systems operate on a fixed number of bits • Overflow: when result is too big to fit in the available number of bits • See previous example of 11 + 6 Chapter 1 <72>

Chapter 1.4.6 Signed Binary Numbers Chapter 1 <73>

Signed Binary Numbers • Sign/Magnitude Numbers • Two’s Complement Numbers Chapter 1 <74>

Sign/Magnitude • 1 sign bit, N - 1 magnitude bits • Sign bit is the most significant (left-most) bit   – Positive number: sign bit = 0 A : a , a , a a a , ,   N 1 N 2 2 1 0 – Negative number: sign bit = 1  n 2    a i  ( 1) 2 A a n 1 i  i 0 • Example, 4 - bit sign/magnitude representations of ± 6: • +6 = • - 6 = • Range of an N -bit sign/magnitude number: • Chapter 1 <75>

Sign/Magnitude • 1 sign bit, N - 1 magnitude bits • Sign bit is the most significant (left-most) bit   – Positive number: sign bit = 0 A : a , a , a a a , ,   N 1 N 2 2 1 0 – Negative number: sign bit = 1  n 2    a i  ( 1) 2 A a n 1 i  i 0 • Example, 4 - bit sign/magnitude representations of ± 6: • +6 = 0110 • - 6 = 1110 • Range of an N -bit sign/magnitude number: • [-(2 N-1 -1), 2 N-1 -1] Chapter 1 <76>

Sign/Magnitude Numbers • Problems: • Addition doesn’t work, for example -6 + 6: 1110 + 0110 • Two representations of 0 (± 0): • +0 = • −0 = Chapter 1 <77>

Sign/Magnitude Numbers • Problems: • Addition doesn’t work, for example -6 + 6: 1110 + 0110 10100 (wrong!) • Two representations of 0 (± 0): • +0 = 0000 • −0 = 1000 Chapter 1 <78>

Two’s Complement Numbers • Don’t have same problems as sign/magnitude numbers: • Addition works • Single representation for 0 • Range of representable numbers not symmetric • One extra negative number Chapter 1 <79>

Two’s Complement Numbers • msb has value of −2 𝑜−1    2 n      n 1 i A a 2 a 2  n 1 i  i 0 • The most significant bit still indicates the sign (1 = negative, 0 = positive) • Range of an N - bit two’s comp number? • Most positive 4-bit number? • Most negative 4-bit number? Chapter 1 <80>

Two’s Complement Numbers • msb has value of −2 𝑂−1    2 n      n 1 i A a 2 a 2  n 1 i  i 0 • The most significant bit still indicates the sign (1 = negative, 0 = positive) • Range of an N - bit two’s comp number? • [− 2 𝑂−1 , 2 N−1 − 1] • Most positive 4-bit number? 0111 • Most negative 4-bit number? 1000 Chapter 1 <81>

“Taking the Two’s Complement” • Flips the sign of a two’s complement number • Method: 1. Invert the bits 2. Add 1 • Example: Flip the sign of 3 10 = 0011 2 Chapter 1 <82>

“Taking the Two’s Complement” • Flips the sign of a two’s complement number • Method: 1. Invert the bits 2. Add 1 • Example: Flip the sign of 3 10 = 0011 2 1. 1100 2. + 1 1101 = -3 10 Chapter 1 <83>

Two’s Complement Examples • Take the two’s complement of 6 10 = 0110 2 • What is the decimal value of the two’s complement number 1001 2 ? Chapter 1 <84>

Two’s Complement Examples • Take the two’s complement of 6 10 = 0110 2 1. 1001 2. + 1 1010 2 = -6 10 • What is the decimal value of the two’s complement number 1001 2 ? 1. 0110 2. + 1 0111 2 = 7 10 , so 1001 2 = -7 10 Chapter 1 <85>

Two’s Complement Addition • Add 6 + (- 6) using two’s complement numbers 0110 + 1010 • Add - 2 + 3 using two’s complement numbers 1110 + 0011 Chapter 1 <86>

Two’s Complement Addition • Add 6 + (- 6) using two’s complement numbers 111 0110 + 1010 10000 • Add - 2 + 3 using two’s complement numbers 1110 + 0011 Chapter 1 <87>

Two’s Complement Addition • Add 6 + (- 6) using two’s complement numbers 111 0110 + 1010 10000 • Add - 2 + 3 using two’s complement numbers 111 1110 + 0011 10001 Chapter 1 <88>

Increasing Bit Width • Extend number from N to M bits (M > N) : • Sign-extension • Zero-extension Chapter 1 <89>

Sign-Extension • Sign bit copied to msb’s • Number value is same • Example 1 • 4-bit representation of 3 = 0011 • 8-bit sign-extended value: • Example 2 • 4-bit representation of -7 = 1001 • 8-bit sign-extended value: Chapter 1 <90>

Sign-Extension • Sign bit copied to msb’s • Number value is same • Example 1 • 4-bit representation of 3 = 0011 • 8-bit sign-extended value: 00000011 • Example 2 • 4-bit representation of -7 = 1001 • 8-bit sign-extended value: 11111001 Chapter 1 <91>

Zero-Extension • Zeros copied to msb’s • Value changes for negative numbers • Example 1 • 4-bit value = 0011 2 • 8-bit zero-extended value: • Example 2 • 4-bit value = 1001 • 8-bit zero-extended value: Chapter 1 <92>

Zero-Extension • Zeros copied to msb’s • Value changes for negative numbers • Example 1 • 4-bit value = 0011 2 • 8-bit zero-extended value: 00000011 • Example 2 • 4-bit value = 1001 • 8-bit zero-extended value: 00001001 Chapter 1 <93>

Zero-Extension • Zeros copied to msb’s • Value changes for negative numbers • Example 1 • 4-bit value = 0011 2 = 3 10 • 8-bit zero-extended value: 00000011 = 3 10 • Example 2 • 4-bit value = 1001 = -7 10 • 8-bit zero-extended value: 00001001 = 9 10 Chapter 1 <94>

Number System Comparison Number System Range [0, 2 N - 1] Unsigned [ - (2 N -1 - 1), 2 N -1 - 1] Sign/Magnitude Two’s Complement [ - 2 N -1 , 2 N -1 - 1] For example, 4-bit representation: -8 -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Unsigned 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111 Two's Complement 1000 1001 1010 1011 1100 1101 1110 1111 0000 0001 0010 0011 0100 0101 0110 0111 0000 0001 0010 0011 0100 0101 0110 0111 Sign/Magnitude 1111 1110 1101 1100 1011 1010 1001 1000 Chapter 1 <95>

Chapter 1.5 Logic Gates Chapter 1 <96>

Logic Gates • Perform logic functions: • inversion (NOT), AND, OR, NAND, NOR, etc. • Single-input: • NOT gate, buffer • Two-input: • AND, OR, XOR, NAND, NOR, XNOR • Multiple-input Chapter 1 <97>

Single-Input Logic Gates NOT BUF A Y A Y Y = A Y = A A Y A Y 0 0 1 1 Chapter 1 <98>

Single-Input Logic Gates • Bubble on wire indicates inversion NOT BUF A Y A Y Y = A Y = A A Y A Y 0 0 0 1 1 1 1 0 • Note: bar over variable indicates complement (invert value) Chapter 1 <99>

Two-Input Logic Gates AND OR A A Y Y B B Y = AB Y = A + B A B Y A B Y 0 0 0 0 0 1 0 1 1 0 1 0 1 1 1 1 Chapter 1 <100>