Number Systems and Encoding

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/20

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering number systems, base conversions, integer representations (true form, one's complement, two's complement), and floating-point standards (IEEE 754).

21 Terms

1
New cards

Decimal System

A base-1010 numeral system composed of ten digits (00–99) that functions on the rule of "carry one when reaching ten".

2
New cards

Binary System

A base-22 numeral system composed of two digits (00 and 11) operating on the rule of "carry one when reaching two", chosen by computers due to physical transistor states and simplified arithmetic rules.

3
New cards

Place Value Expansion

A conversion method where each digit of a number is multiplied by its corresponding base power and summed together (D=∑(bi×basei)D = \sum (b_i \times \text{base}^i)) to calculate its decimal equivalent.

4
New cards

Divide by 2, Take Remainder Method

The standard procedure for converting a decimal integer into binary by repeatedly dividing by 22, recording each remainder until the quotient is 00, and arranging the remainders in reverse order (bottom to top).

5
New cards

Multiply by 2, Take Integer Part Method

The procedure for converting a decimal fraction into binary by repeatedly multiplying the fractional portion by 22 and recording the resulting integer parts in forward order until the fraction becomes 00 or the required precision is reached.

6
New cards

Finite Precision Problem

A computational limitation where certain decimal fractions (such as 0.60.6) cannot be represented with finite binary digits and become repeating decimals, leading to rounding errors in floating-point arithmetic.

7
New cards

Three-Digit Grouping Method

The conversion method between binary and octal based on 8=238 = 2^3, where binary digits are partitioned into groups of three (from right to left for integers and left to right for fractions, padded with 00 if needed) to form octal digits.

8
New cards

Four-Digit Grouping Method

The conversion method between binary and hexadecimal based on 16=2416 = 2^4, where binary digits are partitioned into groups of four to map directly to hexadecimal digits (00–99, AA–FF).

9
New cards

True Form (Sign-Magnitude)

An integer encoding representation where the highest bit represents the sign (00 for positive, 11 for negative) and the remaining bits directly represent the absolute magnitude of the number.

10
New cards

Limitations of True Form

Encoding drawbacks including the redundant dual representation of zero (+0+0 as 0000 00000000\,0000 and −0-0 as 1000 00001000\,0000) and complex arithmetic logic requiring sign comparison that leads to calculation errors when adding numbers with opposite signs directly (e.g., 5+(−5)=−105 + (-5) = -10).

11
New cards

One's Complement

An integer encoding representation where positive numbers are identical to true form, and negative numbers keep the sign bit unchanged while inverting all magnitude bits bit by bit.

12
New cards

End-Around Carry

An additional corrective handling step required during one's complement arithmetic whenever a carry occurs, making hardware addition and subtraction logic less concise and efficient.

13
New cards

Two's Complement

The standard integer encoding in computer architecture where positive numbers equal true form and negative numbers are formed by adding 11 to their one's complement (One’s Complement+1\text{One's Complement} + 1).

14
New cards

Modulus in Two's Complement

The modular base 2n2^n for an nn-bit binary representation (e.g., 28=2562^8 = 256 for 88 bits), allowing a negative number −B-B to be represented as 2n−B2^n - B, which converts subtraction into modular addition.

15
New cards

Unified Addition and Subtraction

The operational advantage of two's complement where subtraction is executed as addition via A−B=A+(∼B+1)A - B = A + (\sim B + 1) and high-bit carry is discarded, allowing arithmetic logic units to execute both operations using a single adder circuit without sign judgment.

16
New cards

Floating-Point Representation

A real number representation system based on scientific notation that formats numbers as (−1)S×1.M×2E−bias(-1)^S \times 1.M \times 2^{E - \text{bias}}, exchanging some precision for an enormous dynamic range of values.

17
New cards

Exponent Bias

A fixed constant added to the actual exponent in IEEE 754 standards (127127 for single precision, 10231023 for double precision) so that both positive and negative exponents can be stored as non-negative unsigned integers.

18
New cards

IEEE 754 Single-Precision Floating-Point

A 3232-bit standard format comprising a 11-bit sign bit (SS), an 88-bit exponent (EE) with a bias of 127127, and a 2323-bit mantissa (MM), spanning a range of approximately ±1.18×10−38\pm 1.18 \times 10^{-38} to ±3.4×1038\pm 3.4 \times 10^{38}.

19
New cards

IEEE 754 Double-Precision Floating-Point

A 6464-bit standard format comprising a 11-bit sign bit (SS), an 1111-bit exponent (EE) with a bias of 10231023, and a 5252-bit mantissa (MM) providing 5353 bits of actual precision, spanning approximately ±2.23×10−308\pm 2.23 \times 10^{-308} to ±1.80×10308\pm 1.80 \times 10^{308}.

20
New cards

Floating-Point Rounding Error

A discrepancy caused by truncating infinite repeating binary decimals into a fixed mantissa length, resulting in non-exact arithmetic results such as 0.1+0.2≠0.30.1 + 0.2 \neq 0.3.

21
New cards

Epsilon Comparison

An engineering technique that avoids direct equality checks (==) on floating-point numbers by testing whether their absolute difference falls within a small predefined error tolerance range.