IEEE 754

Some numbers may have several possible exponential format representations. For instance, if b = 10, and p = 7, then −12.345 can be represented by −12345×10⁻³, −123450×10⁻⁴, and −1234500×10⁻⁵. However, for most operations, such as arithmetic operations, the result (value) does not depend on the representation of the inputs.

For the decimal formats, any representation is valid, and the set of these representations is called a cohort. When a result can have several representations, the standard specifies which member of the cohort is chosen.

For the binary formats, the representation is made unique by choosing the smallest representable exponent allowing the value to be represented exactly. Further, the exponent is not represented directly, but a bias is added so that the smallest representable exponent is represented as 1, with 0 used for subnormal numbers. For numbers with an exponent in the normal range (the exponent field being neither all ones nor all zeros), the leading bit of the significand will always be 1. Consequently, a leading 1 can be implied rather than explicitly present in the memory encoding, and under the standard the explicitly represented part of the significand will lie between 0 and 1. This rule is called leading bit convention, implicit bit convention, or hidden bit convention. This rule allows the binary format to have an extra bit of precision. The leading bit convention cannot be used for the subnormal numbers as they have an exponent outside the normal exponent range and scale by the smallest represented exponent as used for the smallest normal numbers.

Due to the possibility of multiple encodings (at least in formats called interchange formats), a NaN may carry other information: a sign bit (which has no meaning, but may be used by some operations) and a payload, which is intended for diagnostic information indicating the source of the NaN (but the payload may have other uses, such as NaN-boxing[8][9][10]).

The standard defines five basic formats that are named for their numeric base and the number of bits used in their interchange encoding. There are three binary floating-point basic formats (encoded with 32, 64 or 128 bits) and two decimal floating-point basic formats (encoded with 64 or 128 bits). The binary32 and binary64 formats are the single and double formats of IEEE 754-1985 respectively. A conforming implementation must fully implement at least one of the basic formats.

The standard also defines interchange formats, which generalize these basic formats.[11] For the binary formats, the leading bit convention is required. The following table summarizes the smallest interchange formats (including the basic ones).

Note that in the table above, the minimum exponents listed are for normal numbers; the special subnormal number representation allows even smaller numbers to be represented (with some loss of precision). For example, the smallest positive number that can be represented in binary64 is 2⁻¹⁰⁷⁴; contributions to the −1074 figure include the E min value −1022 and all but one of the 53 significand bits (2^{−1022 − (53 − 1)} = 2⁻¹⁰⁷⁴).

Decimal digits is digits × log₁₀ base. This gives an approximate precision in number of decimal digits.

Decimal E max is Emax × log₁₀ base. This gives an approximate value of the maximum decimal exponent.

The binary32 (single) and binary64 (double) formats are two of the most common formats used today. The figure below shows the absolute precision for both formats over a range of values. This figure can be used to select an appropriate format given the expected value of a number and the required precision.

Precision of binary32 and binary64 in the range 10⁻¹² to 10¹²

An example of a layout for 32-bit floating point is

and the 64 bit layout is similar.

The standard specifies optional extended and extendable precision formats, which provide greater precision than the basic formats.[13] An extended precision format extends a basic format by using more precision and more exponent range. An extendable precision format allows the user to specify the precision and exponent range. An implementation may use whatever internal representation it chooses for such formats; all that needs to be defined are its parameters (b, p, and emax). These parameters uniquely describe the set of finite numbers (combinations of sign, significand, and exponent for the given radix) that it can represent.

The standard recommends that language standards provide a method of specifying p and emax for each supported base b.[14] The standard recommends that language standards and implementations support an extended format which has a greater precision than the largest basic format supported for each radix b.[15] For an extended format with a precision between two basic formats the exponent range must be as great as that of the next wider basic format. So for instance a 64-bit extended precision binary number must have an 'emax' of at least 16383. The x87 80-bit extended format meets this requirement.

Interchange formats are intended for the exchange of floating-point data using a bit string of fixed length for a given format.

For the exchange of binary floating-point numbers, interchange formats of length 16 bits, 32 bits, 64 bits, and any multiple of 32 bits ≥ 128[lower-alpha 3] are defined. The 16-bit format is intended for the exchange or storage of small numbers (e.g., for graphics).

The encoding scheme for these binary interchange formats is the same as that of IEEE 754-1985: a sign bit, followed by w exponent bits that describe the exponent offset by a bias, and p − 1 bits that describe the significand. The width of the exponent field for a k-bit format is computed as w = round(4 log₂(k)) − 13. The existing 64- and 128-bit formats follow this rule, but the 16- and 32-bit formats have more exponent bits (5 and 8 respectively) than this formula would provide (3 and 7 respectively).

As with IEEE 754-1985, the biased-exponent field is filled with all 1 bits to indicate either infinity (trailing significand field = 0) or a NaN (trailing significand field ≠ 0). For NaNs, quiet NaNs and signaling NaNs are distinguished by using the most significant bit of the trailing significand field exclusively,[lower-alpha 4] and the payload is carried in the remaining bits.

For the exchange of decimal floating-point numbers, interchange formats of any multiple of 32 bits are defined. As with binary interchange, the encoding scheme for the decimal interchange formats encodes the sign, exponent, and significand. Two different bit-level encodings are defined, and interchange is complicated by the fact that some external indicator of the encoding in use may be required.

The two options allow the significand to be encoded as a compressed sequence of decimal digits using densely packed decimal or, alternatively, as a binary integer. The former is more convenient for direct hardware implementation of the standard, while the latter is more suited to software emulation on a binary computer. In either case, the set of numbers (combinations of sign, significand, and exponent) that may be encoded is identical, and special values (±zero with the minimum exponent, ±infinity, quiet NaNs, and signaling NaNs) have identical encodings.

• Round to nearest, ties to even – rounds to the nearest value; if the number falls midway, it is rounded to the nearest value with an even least significant digit; this is the default for binary floating point and the recommended default for decimal.
• Round to nearest, ties away from zero – rounds to the nearest value; if the number falls midway, it is rounded to the nearest value above (for positive numbers) or below (for negative numbers); this is intended as an option for decimal floating point.

• Round toward 0 – directed rounding towards zero (also known as truncation).
• Round toward +∞ – directed rounding towards positive infinity (also known as rounding up or ceiling).
• Round toward −∞ – directed rounding towards negative infinity (also known as rounding down or floor).

Unless specified otherwise, the floating-point result of an operation is determined by applying the rounding function on the infinitely precise (mathematical) result. Such an operation is said to be correctly rounded. This requirement is called correct rounding.[16]

The standard provides comparison predicates to compare one floating-point datum to another in the supported arithmetic format.[28] Any comparison with a NaN is treated as unordered. −0 and +0 compare as equal.

The standard provides a predicate totalOrder, which defines a total ordering on canonical members of the supported arithmetic format.[29] The predicate agrees with the comparison predicates when one floating-point number is less than the other. The totalOrder predicate does not impose a total ordering on all encodings in a format. In particular, it does not distinguish among different encodings of the same floating-point representation, as when one or both encodings are non-canonical.[30] IEEE 754-2019 incorporates clarifications of totalOrder.

The standard recommends optional exception handling in various forms, including presubstitution of user-defined default values, and traps (exceptions that change the flow of control in some way) and other exception handling models that interrupt the flow, such as try/catch. The traps and other exception mechanisms remain optional, as they were in IEEE 754-1985.

Clause 9 in the standard recommends additional mathematical operations[34] that language standards should define.[35] None are required in order to conform to the standard.

Recommended arithmetic operations, which must round correctly:[36]

• ${\displaystyle e^{x}}$, ${\displaystyle 2^{x}}$, ${\displaystyle 10^{x}}$
• ${\displaystyle e^{x}-1}$, ${\displaystyle 2^{x}-1}$, ${\displaystyle 10^{x}-1}$
• ${\displaystyle \ln x}$, ${\displaystyle \log _{2}x}$, ${\displaystyle \log _{10}x}$
• ${\displaystyle \ln(1+x)}$, ${\displaystyle \log _{2}(1+x)}$, ${\displaystyle \log _{10}(1+x)}$
• ${\displaystyle {\sqrt {x^{2}+y^{2}}}}$
• ${\displaystyle {\sqrt {x}}}$
• ${\displaystyle (1+x)^{n}}$
• ${\displaystyle x^{\frac {1}{n}}}$
• ${\displaystyle x^{n}}$, ${\displaystyle x^{y}}$
• ${\displaystyle \sin x}$, ${\displaystyle \cos x}$, ${\displaystyle \tan x}$
• ${\displaystyle \arcsin x}$, ${\displaystyle \arccos x}$, ${\displaystyle \arctan x}$, ${\displaystyle \operatorname {atan2} (y,x)}$
• ${\displaystyle \operatorname {sinPi} x=\sin \pi x}$, ${\displaystyle \operatorname {cosPi} x=\cos \pi x}$, ${\displaystyle \operatorname {tanPi} x=\tan \pi x}$ (see also: Multiples of π)
• ${\displaystyle \operatorname {asinPi} x={\frac {\arcsin x}{\pi }}}$, ${\displaystyle \operatorname {acosPi} x={\frac {\arccos x}{\pi }}}$, ${\displaystyle \operatorname {atanPi} x={\frac {\arctan x}{\pi }}}$, ${\displaystyle \operatorname {atan2Pi} (y,x)={\frac {\operatorname {atan2} (y,x)}{\pi }}}$ (see also: Multiples of π)
• ${\displaystyle \sinh x}$, ${\displaystyle \cosh x}$, ${\displaystyle \tanh x}$
• ${\displaystyle \operatorname {arsinh} x}$, ${\displaystyle \operatorname {arcosh} x}$, ${\displaystyle \operatorname {artanh} x}$

The asinPi, acosPi and tanPi functions were not part of the IEEE 754-2008 standard because they were deemed less necessary.[37] asinPi, acosPi were mentioned, but this was regarded as an error.[4] All three were added in the 2019 revision.

The operations also include setting and accessing dynamic mode rounding direction,[38] and implementation-defined vector reduction operations such as sum, scaled product, and dot product, whose accuracy is unspecified by the standard.[39]

As of 2019, augmented arithmetic operations[40] for the binary formats are also recommended. These operations, specified for addition, subtraction and multiplication, produce a pair of values consisting of a result correctly rounded to nearest in the format and the error term, which is representable exactly in the format. At the time of publication of the standard, no hardware implementations are known, but very similar operations were already implemented in software using well-known algorithms. The history and motivation for their standardization are explained in a background document.[41][42]

As of 2019, the formerly required minNum, maxNum, minNumMag, and maxNumMag in IEEE 754-2008 are now deleted due to their non-associativity. Instead, two sets of new minimum and maximum operations[43] are recommended. The first set contains minimum, minimumNumber, maximum and maximumNumber. The second set contains minimumMagnitude, minimumMagnitudeNumber, maximumMagnitude and maximumMagnitudeNumber. The history and motivation for this change are explained in a background document.[44]

The standard recommends how language standards should specify the semantics of sequences of operations, and points out the subtleties of literal meanings and optimizations that change the value of a result. By contrast, the previous 1985 version of the standard left aspects of the language interface unspecified, which led to inconsistent behavior between compilers, or different optimization levels in a single compiler.

Programming languages should allow a user to specify a minimum precision for intermediate calculations of expressions for each radix. This is referred to as "preferredWidth" in the standard, and it should be possible to set this on a per block basis. Intermediate calculations within expressions should be calculated, and any temporaries saved, using the maximum of the width of the operands and the preferred width, if set. Thus, for instance, a compiler targeting x87 floating-point hardware should have a means of specifying that intermediate calculations must use the double-extended format. The stored value of a variable must always be used when evaluating subsequent expressions, rather than any precursor from before rounding and assigning to the variable.

The IEEE 754-1985 allowed many variations in implementations (such as the encoding of some values and the detection of certain exceptions). IEEE 754-2008 has strengthened up many of these, but a few variations still remain (especially for binary formats). The reproducibility clause recommends that language standards should provide a means to write reproducible programs (i.e., programs that will produce the same result in all implementations of a language) and describes what needs to be done to achieve reproducible results.

• IEEE Computer Society (2008-08-29). IEEE Standard for Floating-Point Arithmetic. IEEE STD 754-2008. IEEE. pp. 1–70. doi:10.1109/IEEESTD.2008.4610935. ISBN 978-0-7381-5753-5. IEEE Std 754-2008.
• IEEE Computer Society (2019-07-22). IEEE Standard for Floating-Point Arithmetic. IEEE STD 754-2019. IEEE. pp. 1–84. doi:10.1109/IEEESTD.2019.8766229. ISBN 978-1-5044-5924-2. IEEE Std 754-2019.
• ISO/IEC/IEEE 60559:2011 — Information technology — Microprocessor Systems — Floating-Point arithmetic. Iso.org. June 2011. pp. 1–58.
• ISO/IEC 60559:2020 — Information technology — Microprocessor Systems — Floating-Point arithmetic. Iso.org. May 2020. pp. 1–74.

• Decimal floating-point arithmetic, FAQs, bibliography, and links
• Comparing binary floats
• IEEE 754 Reference Material
• IEEE 854-1987 – History and minutes
• Supplementary readings for IEEE 754. Includes historical perspectives.