1 / 42

Lecture 3

ITEC 1000 “Introduction to Information Technology”. Lecture 3. Representing Integer Data. Lecture Template:. Number Representation Unsigned Integer Signed Integer Complementary Representation 9’s Decimal Representation (skip) 1’s Binary Representation (skip) 10’s Decimal Representation

ebeverly
Télécharger la présentation

Lecture 3

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ITEC 1000 “Introduction to Information Technology” Lecture 3 Representing Integer Data

  2. Lecture Template: • Number Representation • Unsigned Integer • Signed Integer • Complementary Representation • 9’s Decimal Representation (skip) • 1’s Binary Representation (skip) • 10’s Decimal Representation • 2’s Binary Representation

  3. Number Representation • An integer is a number which has no fractional part. • Numbers can be represented as a combination of • Sign (plus or minus) • Value or magnitude

  4. Unsigned Integer(Natural Number) • 8-bit storage location • 28 different values between 0 and 255 • 16-bit storage location • 216 different values between 0 and 65535 • multiple storage locations • 4 consecutive 1-byte storage locations • provide 32 bits of range • 232, or 4,294,967,296 different values • difficult to calculate and manipulate

  5. 32-bit multiple storage location

  6. Signed-Integer Representation • No obvious direct way to represent the sign in binary notation • Options: • Sign-and-magnitude representation • 1’s complement (skip – confusing) • 2’s complement (most common)

  7. Sign-and-Magnitude • Use left-most bit for sign • 0 = plus; 1 = minus • Total range of integers the same • Half of integers positive; half negative • Magnitude of largest integer half as large • Example using 8 bits: • Unsigned: 1111 1111 = +255 • Signed: 0111 1111 = +127 1111 1111 = -127 • Note: 2 values for 0: +0 (0000 0000) and -0 (1000 0000)

  8. Calculation Algorithms • Sign-and-magnitude algorithms complex and difficult to implement in hardware • Must test for 2 values of 0 • Useful with BCD (see slides at end) • Order of signed number and carry/borrow makes a difference • Example: Decimal addition algorithm

  9. Ranges

  10. Ranges: General Rule

  11. Complementary Representation • Sign of the number does not have to be handled separately • Consistent for all different signed combinations of input numbers • Two methods • Radix: value used is the base number • Diminished radix: value used is the base number minus 1 (skip – confusing) • 9’s complement: base 10 diminished radix • 1’s complement: base 2 diminished radix

  12. 10’s Decimal Complement • Complement representation: (1) positive number: remains itself; (2) negative number: subtracting its absolute value from a standard basis value • Decimal (base 10) system: radix complement • Radix = 10 10 as the basis • 3-digit example: base value = 1000 • Range of possible values 0 to 999 arbitrarily split at 500 1000 – 500

  13. 10’s Decimal Complement • Necessary to specify number of digits or word size • 10’s complement representation in “1000” base • Example: representation of 3-digit number • First digit = 0 through 4 positive number • First digit = 5 through 9 negative number

  14. Examples with 3-Digit Numbers • Example 1: • 10’s complement representation of 247 • 247 (positive number) • Example 2: • 10’s complement representation of -247 • 1000 – 247 = 753 (negative number) • Example 3: • Find a value with 10’s complement representation 777 • Negative number because first digit is 7 • 1000 – 777 = 223 • Signed value = -223

  15. 10’s Decimal Complement • Conversion to sign-and-magnitude value for 9’s complement representation(3 digits) • 321 remains +321 • 521: take the difference: base minus complement (999 – 521) with negative sign: – 479

  16. Addition: Counting Upwards • Counting upward on scale corresponds to addition • Example in 10’s complement: does not cross the modulus

  17. Addition with Wraparound • Count to the right to add a negative number to the representation (since the complement 700 represents the value of -300) • Wraparound scale used to extend the range for the negative result

  18. Addition with End-around Carry • Count to the right crosses the modulus

  19. Overflow • Fixed word size has a fixed range size • Overflow: combination of numbers that adds to result outside the range • End-around carry in modular arithmetic avoids problem • Complementary arithmetic: numbers out of range have the opposite sign • Test: If both inputs to an addition have the same sign and the output sign is different, an overflow occurred

  20. 2’s Binary Complement • Binary system complement • Binary (base 2) system radix complement • Radix = 2 2 as the basis • Inversion: change 1’s to 0’s and 0’s to 1s (add 1) • Numbers beginning with 0 are positive • Numbers beginning with 1 are negative • Example with 8-bit binary numbers

  21. 2’s Complement • 2’s complement representation: • Positive value represents itself • Negative value: invert and add “1”

  22. 000101 +5 111010 + 1 111011 -5 Example: 2’s Complement • Represent –5 in binary using 2’s complement notation • Decide on the number of bits: • Find the binary representation of the +ve value in 6 bits • Invert all the bits: • Add 1 6 (for example) 111010

  23. +5: 0 0 0 1 0 1 -5: 1 1 1 0 1 1 +ve 5 -ve Sign Bit in 2’s Complement • In 2’s complement representation, the MSB is the sign bit (as with sign-magnitude notation) • 0 = positive value • 1 = negative value

  24. Estimating Integer Value of 2’s Complement Representation • Positive numbers begin with 0 • Small negative numbers (close to 0) begin with multiple 1’s • 1111 1110 = -2 in 8-bit 2’s complements • 1000 0000 = -128, largest negative 2’s complements • Invert all 1’s and 0’s, add “1” and approximate the value

  25. Exercise: 2’s complement conversions • What is -20 expressed as an 8-bit binary number in 2’s complement representation? • Answer: • 1100011 is a 7-bit binary number in 2’s complement representation. What is the decimal sign-and-magnitude value? • Answer: Skip answer Answer

  26. Exercise: 2’s complement conversions Answer • What is -20 expressed as an 8-bit binary number in 2’s complement notation? • Answer: 11101100 • 1100011 is a 7-bit binary number in 2’s complement notation. What is the decimal value? • Answer: -29

  27. Detail for -20 -> 11101100 -2010: Positive Value = 00010100 Invert: 11101011 Add 1: + 1 11101100

  28. Detail for 1100011 -> - 29 2’s Complement Rep: 1100011 Invert: 0011100 Add One: + 1 0011101 Converts to: = - 29

  29. Invert to get magnitude Arithmetic in 2’s Complement • Add 2 positive 8-bit numbers • Add 2 8-bit numbers with different signs • Take the 1’s complement of 58 (i.e. invert, add 1)0011 10101100 0110

  30. Addition with Carryin 2’s Complement • 8-bit number • Invert (add 1)0000 0010(210)1111 1110 • Add • drop final carry out

  31. Subtraction • 8-bit number • Invert (add 1)0101 1010(9010)1010 0110 • Add • drop final carry out

  32. Overflow • 8-bit number • 256 different numbers • Positive numbers: 0 to 127 • Add • Test for overflow • 2 positive inputs produced negative result overflow! • Wrong answer! • Programmers beware: some high-level languages, e.g., some versions of BASIC, do not check for overflow adequately Invert to get magnitude

  33. Overflow and Carry Conditions • Carry flag: set when the result of an addition or subtraction exceeds fixed number of bits allocated • Overflow: result of addition or subtraction overflows into the sign bit

  34. Overflow/Carry Examples • Example 1: • Correct result • No overflow, no carry • Example 2: • Incorrect result • Overflow, no carry 0101 + 1 0110 Invert, then add 1 to get magnitude

  35. Overflow/Carry Examples • Example 3: • Result correct ignoring the carry • Carry but no overflow • Example 4: • Incorrect result • Overflow, carry ignored

  36. 2’s Complement Subtraction • Just add the opposite value! A – B = A + (-B) add 2’s complement rep. of -B

  37. Reading: Lecture slides and Chapter 5 Not quite finished => BCD

  38. Unsigned Integers • Binary equivalent • conversion as discussed in Lecture 2 • 4 bits can hold 16 different values 0 – 15 • 8 bits can hold 28 different values between 0 and 255 • BCD: Binary-Coded Decimal • digit-by-digit individual conversion to binary • 4 bits per decimal digit, i.e. 10 different values 0 - 9 • 8-bit storage location can hold 2 BCD digits, i.e. 100 different values 00 - 99

  39. Binary vs. BCD

  40. Value Range: Binary vs. BCD

  41. Simple BCD Multiplication

  42. Conventional Binary vs. BCD • Binary representation generally preferred • greater range of value for given number of bits • calculations easier • BCD is still used • in business applications to maintain decimal rounding and decimal precision • in applications with a lot of input and output, but limited calculations

More Related