Decimal numbers can be written as pure decimal times the power of 10. Similarly, binary numbers can be written as pure decimal multiplied by several powers of 2. For example,11.01= 22× 0.11; Generally, any binary n can be expressed as n = 2 j× s;

Where j is a binary number, called rank code; J If there is a sign, it is called a step sign; S is a pure decimal, called mantissa; Numeric symbols refer to symbols of n integers.

The range that floating-point numbers can represent is determined by the number of digits of rank codes, and the precision is determined by the number of digits of mantissa.

Extended data:

The process of floating-point addition and subtraction is more complicated than fixed-point operation. If one of the two operands x or y is judged to be 0, the operation result can be known without a series of subsequent operations, thus saving the operation time. The 0 operand check step is used to complete this function.

The addition and subtraction of two floating-point numbers depends first on whether the rank codes of the two numbers are the same, that is, whether the decimal points are aligned. If the second-order codes are the same, it means that the decimal points are aligned and the mantissa can be added or subtracted. On the other hand, if the second-order codes are different, it means that the decimal points are not aligned, and the second-order codes must be the same.