APPENDIX A
GLOSSARY
ALGORITHM
A procedure for solving a mathematical problem in a finite number of steps that
frequently involves repetition of an operation.
BCD (Binary-Coded-Decimal) Number
The representation of cardinal numbers 0 through 9 by 10 binary codes of any length.
The minimum length is four and there are over 29x 109 possible four-bit BCD codes.
However, codes in which the four bits contain the hexadecimal representation of 0
through 9 are the more commonly used codes, for obvious reasons.
BIASED EXPONENT
The sum of the exponent and a constant (bias) chosen to make the biased exponents
range non-negative.
BINARY FLOATING-POINT NUMBER
A bit string characterized by three components: a sign, a signed exponent, and a
significand. (See single, double, and extended precision.) The numerical value of the
bit string is the signed product of the significand and two raised to the power of the
exponent.
DENORMALIZED NUMBER
A floating-point number having all zeros in the exponent and a non-zero value in the
fraction/mantissa.
DOUBLE PRECISION
A 64-bit binary floating-point operand format composed of three fields: a one-bit sign
field, an 11-bit biased exponent field, and an 52-bit fraction (significand) field.
DYADIC OPERATION
An operation on two operands.
E FIELD
See exponent (E field).
EXPONENT
A symbol written above and to the right of a mathematical expression to indicate the
operation of rising to a power.
EXPONENT (E FIELD)
The component of a binary floating-point number that normally signifies the integer
power to which two is raised in determining the value of the represented number.
Occasionally, the exponent is called the signed or unbiased exponent.
MC68881/MC68882 USER'S MANUAL FREESCALE
A-1
To Next Page
Loading...