IEEE 754

Get IEEE 754 essential facts below. View Videos or join the IEEE 754 discussion. Add IEEE 754 to your PopFlock.com topic list for future reference or share this resource on social media.
## Standard development

## Formats

### Representation and encoding in memory

### Basic and interchange formats

### Extended and extendable precision formats

### Interchange formats

#### Binary

#### Decimal

## Rounding rules

### Roundings to nearest

### Directed roundings

## Required operations

### Comparison predicates

### Total-ordering predicate

## Exception handling

## Recommendations

### Alternate exception handling

### Recommended operations

### Expression evaluation

### Reproducibility

## Character representation

## See also

## Notes

## References

### Standards

### Secondary references

## Further reading

## External links

This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

IEEE 754

The **IEEE Standard for Floating-Point Arithmetic** (**IEEE 754**) is a technical standard for floating-point arithmetic established in 1985 by the Institute of Electrical and Electronics Engineers (IEEE). The standard addressed many problems found in the diverse floating-point implementations that made them difficult to use reliably and portably. Many hardware floating-point units use the IEEE 754 standard.

The standard defines:

*arithmetic formats:*sets of binary and decimal floating-point data, which consist of finite numbers (including signed zeros and subnormal numbers), infinities, and special "not a number" values (NaNs)*interchange formats:*encodings (bit strings) that may be used to exchange floating-point data in an efficient and compact form*rounding rules:*properties to be satisfied when rounding numbers during arithmetic and conversions*operations:*arithmetic and other operations (such as trigonometric functions) on arithmetic formats*exception handling:*indications of exceptional conditions (such as division by zero, overflow,*etc.*)

IEEE 754-2008, published in August 2008, includes nearly all of the original IEEE 754-1985 standard, plus the IEEE 854-1987 Standard for Radix-Independent Floating-Point Arithmetic. The current version, IEEE 754-2019, was published in July 2019.^{[1]} It is a minor revision of the previous version, incorporating mainly clarifications, defect fixes and new recommended operations.

The first standard for floating-point arithmetic, IEEE 754-1985, was published in 1985. It covered only binary floating-point arithmetic.

A new version, IEEE 754-2008, was published in August 2008, following a seven-year revision process, chaired by Dan Zuras and edited by Mike Cowlishaw. It replaced both IEEE 754-1985 (binary floating-point arithmetic) and IEEE 854-1987 Standard for Radix-Independent Floating-Point Arithmetic. The binary formats in the original standard are included in this new standard along with three new basic formats, one binary and two decimal. To conform to the current standard, an implementation must implement at least one of the basic formats as both an arithmetic format and an interchange format.

The international standard **ISO/IEC/IEEE 60559:2011** (with content identical to IEEE 754-2008) has been approved for adoption through JTC1/SC 25 under the ISO/IEEE PSDO Agreement^{[2]} and published.^{[3]}

The current version, IEEE 754-2019 published in July 2019, is derived from and replaces IEEE 754-2008, following a revision process started in September 2015, chaired by David G. Hough and edited by Mike Cowlishaw. It incorporates mainly clarifications (e.g. *totalOrder*) and defect fixes (e.g. *minNum*), but also includes some new recommended operations (e.g. *augmentedAddition*).^{[4]}^{[5]}

An IEEE 754 *format* is a "set of representations of numerical values and symbols". A format may also include how the set is encoded.^{[6]}

A floating-point format is specified by:

- a base (also called
*radix*)*b*, which is either 2 (binary) or 10 (decimal) in IEEE 754; - a precision
*p*; - an exponent range from
*emin*to*emax*, with*emin*= 1 -*emax*for all IEEE 754 formats.

A format comprises:

- Finite numbers, which can be described by three integers:
*s*= a*sign*(zero or one),*c*= a*significand*(or*coefficient*) having no more than*p*digits when written in base*b*(i.e., an integer in the range through 0 to*b*^{p}- 1), and*q*= an*exponent*such that*emin*q +*p*- 1 emax. The numerical value of such a finite number is .^{[a]}Moreover, there are two zero values, called signed zeros: the sign bit specifies whether a zero is +0 (positive zero) or -0 (negative zero). - Two infinities: +? and -?.
- Two kinds of NaN (not-a-number): a quiet NaN (qNaN) and a signaling NaN (sNaN).

For example, if *b* = 10, *p* = 7, and *emax* = 96, then *emin* = -95, the significand satisfies 0 c 9999999, and the exponent satisfies -101 q -101, and the largest is 9999999×10^{90} (9.999999×10^{96}), so the full range of numbers is -9.999999×10^{96} through 9.999999×10^{96}. The numbers -*b*^{1-emax} and *b*^{1-emax} (here, -1×10^{-95} and 1×10^{-95}) are the smallest (in magnitude) *normal numbers*; non-zero numbers between these smallest numbers are called subnormal numbers.

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^{-3}, -123450×10^{-4}, and -1234500×10^{-5}. 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*^{[7]}^{[8]}^{[9]}).

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.^{[10]} For the binary formats, the leading bit convention is required. The following table summarizes the smallest interchange formats (including the basic ones).

Name | Common name | Base | Significand bits^{[b]} or digits |
Decimal digits | Exponent bits | Decimal E max | Exponent bias^{[11]} |
E min | E max | Notes |
---|---|---|---|---|---|---|---|---|---|---|

binary16 | Half precision | 2 | 11 | 3.31 | 5 | 4.51 | 2^{4}-1 = 15 |
-14 | +15 | not basic |

binary32 | Single precision | 2 | 24 | 7.22 | 8 | 38.23 | 2^{7}-1 = 127 |
-126 | +127 | |

binary64 | Double precision | 2 | 53 | 15.95 | 11 | 307.95 | 2^{10}-1 = 1023 |
-1022 | +1023 | |

binary128 | Quadruple precision | 2 | 113 | 34.02 | 15 | 4931.77 | 2^{14}-1 = 16383 |
-16382 | +16383 | |

binary256 | Octuple precision | 2 | 237 | 71.34 | 19 | 78913.2 | 2^{18}-1 = 262143 |
-262142 | +262143 | not basic |

decimal32 | 10 | 7 | 7 | 7.58 | 96 | 101 | -95 | +96 | not basic | |

decimal64 | 10 | 16 | 16 | 9.58 | 384 | 398 | -383 | +384 | ||

decimal128 | 10 | 34 | 34 | 13.58 | 6144 | 6176 | -6143 | +6144 |

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^{-1074}; 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^{-1074}).

Decimal digits is *digits* × log_{10}*base*. This gives an approximate precision in number of decimal digits.

Decimal E max is *Emax* × log_{10}*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.

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.^{[12]} 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*.^{[13]} 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*.^{[14]} 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^{[c]} 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_{2}(*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,^{[d]} 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.

The standard defines five rounding rules. The first two rules round to a nearest value; the others are called *directed roundings*:

**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*).

Mode | Example value | |||
---|---|---|---|---|

+11.5 | +12.5 | -11.5 | -12.5 | |

to nearest, ties to even | +12.0 | +12.0 | -12.0 | -12.0 |

to nearest, ties away from zero | +12.0 | +13.0 | -12.0 | -13.0 |

toward 0 | +11.0 | +12.0 | -11.0 | -12.0 |

toward +? | +12.0 | +13.0 | -11.0 | -12.0 |

toward -? | +11.0 | +12.0 | -12.0 | -13.0 |

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*.^{[15]}

Required operations for a supported arithmetic format (including the basic formats) include:

- Arithmetic operations (add, subtract, multiply, divide, square root, fused multiply-add, remainder)
^{[16]}^{[17]} - Conversions (between formats, to and from strings,
*etc.*)^{[18]}^{[19]} - Scaling and (for decimal) quantizing
^{[20]}^{[21]} - Copying and manipulating the sign (abs, negate,
*etc.*)^{[22]} - Comparisons and total ordering
^{[23]}^{[24]} - Classification and testing for NaNs,
*etc.*^{[25]} - Testing and setting flags
^{[26]} - Miscellaneous operations.
^{[specify]}

The standard provides comparison predicates to compare one floating-point datum to another in the supported arithmetic format.^{[27]} 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.^{[28]} 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.^{[29]} IEEE 754-2019 incorporates clarifications of *totalOrder*.

The standard defines five exceptions, each of which returns a default value and has a corresponding status flag that is raised when the exception occurs.^{[e]} No other exception handling is required, but additional non-default alternatives are recommended (see § Alternate exception handling).

The five possible exceptions are:

- Invalid operation: mathematically undefined,
*e.g.*, the square root of a negative number. By default, returns qNaN. - Division by zero: an operation on finite operands gives an exact infinite result,
*e.g.*, 1/0 or log(0). By default, returns ±infinity. - Overflow: a result is too large to be represented correctly (
*i.e.*, its exponent with an unbounded exponent range would be larger than*emax*). By default, returns ±infinity for the round-to-nearest modes (and follows the rounding rules for the directed rounding modes). - Underflow: a result is very small (outside the normal range) and is inexact. By default, returns a subnormal or zero (following the rounding rules).
- Inexact: the exact (
*i.e.*, unrounded) result is not representable exactly. By default, returns the correctly rounded result.

These are the same five exceptions as were defined in IEEE 754-1985, but the *division by zero* exception has been extended to operations other than the division.

For decimal floating point, there are additional exceptions:^{[30]}^{[31]}

- Clamped: a result's exponent is too large for the destination format. By default, trailing zeros will be added to the coefficient to reduce the exponent to the largest usable value. If this is not possible (because this would cause the number of digits needed to be more than the destination format) then an overflow exception occurs.
- Rounded: a result's coefficient requires more digits than the destination format provides. An inexact exception is signaled if any non-zero digits are discarded.

Additionally, operations like quantize when either operand is infinite, or when the result does not fit the destination format, will also signal invalid operation exception.^{[32]}

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 which 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^{[33]} that language standards should define.^{[34]} These are all optional (not required in order to conform to the standard).

Recommended arithmetic operations, which must round correctly:^{[35]}

- , ,
- , ,
- , ,
- , ,
- ,
- , ,
- , , ,
- , , (see also: Multiples of ?)
- , , , (see also: Multiples of ?)
- , ,
- , ,

The asinPi, acosPi and tanPi functions were not part of the IEEE 754-2008 standard because the feeling was that they were less necessary.^{[36]} The first two were at least mentioned in a paragraph, but this was regarded as an error^{[4]} until they were added in the 2019 revision.

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

As of 2019, *augmented arithmetic operations*^{[39]} 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.^{[40]}^{[41]}

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*^{[42]} 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.^{[43]}

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.

The standard requires operations to convert between basic formats and *external character sequence* formats.^{[44]} Conversions to and from a decimal character format are required for all formats. Conversion to an external character sequence must be such that conversion back using rounding to even will recover the original number. There is no requirement to preserve the payload of a quiet NaN or signaling NaN, and conversion from the external character sequence may turn a signaling NaN into a quiet NaN.

The original binary value will be preserved by converting to decimal and back again using:^{[45]}

- 5 decimal digits for binary16,
- 9 decimal digits for binary32,
- 17 decimal digits for binary64,
- 36 decimal digits for binary128.

For other binary formats, the required number of decimal digits is

where *p* is the number of significant bits in the binary format, e.g. 237 bits for binary256.

(Note: as an implementation limit, correct rounding is only guaranteed for the number of decimal digits above plus 3 for the largest supported binary format. For instance, if binary32 is the largest supported binary format, then a conversion from a decimal external sequence with 12 decimal digits is guaranteed to be correctly rounded when converted to binary32; but conversion of a sequence of 13 decimal digits is not; however, the standard recommends that implementations impose no such limit.)

When using a decimal floating-point format, the decimal representation will be preserved using:

- 7 decimal digits for decimal32,
- 16 decimal digits for decimal64,
- 34 decimal digits for decimal128.

Algorithms, with code, for correctly rounded conversion from binary to decimal and decimal to binary are discussed by Gay,^{[46]} and for testing – by Paxson and Kahan.^{[47]}

- Binade
- Coprocessor
- C99 for code examples demonstrating access and use of IEEE 754 features.
- Floating-point arithmetic, for history, design rationale and example usage of IEEE 754 features.
- Fixed-point arithmetic, for an alternative approach at computation with rational numbers (especially beneficial when the mantissa range is known, fixed, or bound at compile time).
- IBM System z9, the first CPU to implement IEEE 754-2008 decimal arithmetic (using hardware microcode).
- IBM z10, IBM z196, IBM zEC12, and IBM z13, CPUs that implement IEEE 754-2008 decimal arithmetic fully in hardware.
- ISO/IEC 10967, language-independent arithmetic (LIA).
- Minifloat, low-precision binary floating-point formats following IEEE 754 principles.
- POWER6, POWER7, and POWER8 CPUs that implement IEEE 754-2008 decimal arithmetic fully in hardware.
- strictfp, a keyword in the Java programming language that restricts arithmetic to IEEE 754 single and double precision to ensure reproducibility across common hardware platforms.
- The table-maker's dilemma for more about the correct rounding of functions.
- Standard Apple Numerics Environment
- Tapered floating point

**^**For example, if the base is 10, the sign is 1 (indicating negative), the significand is 12345, and the exponent is -3, then the value of the number is = = -12.345.**^**including the implicit bit (which always equals 1 for normal numbers, and 0 for subnormal numbers. This implicit bit is not stored in memory), but not the sign bit.**^**Contrary to decimal, there is no binary interchange format of 96-bit length. Such a format is still allowed as a non-interchange format, though.**^**The standard recommends 0 for signaling NaNs, 1 for quiet NaNs, so that a signaling NaNs can be quieted by changing only this bit to 1, while the reverse could yield the encoding of an infinity.**^**No flag is raised in certain cases of underflow.

**^**"IEEE 754-2019 - IEEE Standard for Floating-Point Arithmetic".*standards.ieee.org*. Retrieved .**^**"FW: ISO/IEC/IEEE 60559 (IEEE Std 754-2008)".*grouper.ieee.org*. Archived from the original on 2017-10-27. Retrieved .**^**"ISO/IEC/IEEE 60559:2011 - Information technology -- Microprocessor Systems -- Floating-Point arithmetic".*www.iso.org*. Retrieved .- ^
^{a}^{b}Cowlishaw, Mike (2013-11-13). "IEEE 754-2008 errata".*speleotrove.com*. Retrieved . **^**"Revising ANSI/IEEE Std 754-2008".*ucbtest.org*. Retrieved .**^**IEEE 754 2008, §2.1.27.**^**"SpiderMonkey Internals".*developer.mozilla.org*. Retrieved .**^**Klemens, Ben (September 2014).*21st Century C: C Tips from the New School*. O'Reilly Media, Incorporated. p. 160. ISBN 9781491904442. Retrieved .**^**"zuiderkwast/nanbox: NaN-boxing in C".*GitHub*. Retrieved .**^**IEEE 754 2008, §3.6.**^**Cowlishaw, Mike. "Decimal Arithmetic Encodings" (PDF). IBM. Retrieved .**^**IEEE 754 2008, §3.7.**^**IEEE 754 2008, §3.7 states: "Language standards should define mechanisms supporting extendable precision for each supported radix."**^**IEEE 754 2008, §3.7 states: "Language standards or implementations should support an extended precision format that extends the widest basic format that is supported in that radix."**^**IEEE 754 2019, §2.1**^**IEEE 754 2008, §5.3.1**^**IEEE 754 2008, §5.4.1**^**IEEE 754 2008, §5.4.2**^**IEEE 754 2008, §5.4.3**^**IEEE 754 2008, §5.3.2**^**IEEE 754 2008, §5.3.3**^**IEEE 754 2008, §5.5.1**^**IEEE 754 2008, §5.10**^**IEEE 754 2008, §5.11**^**IEEE 754 2008, §5.7.2**^**IEEE 754 2008, §5.7.4**^**IEEE 754 2019, §5.11**^**IEEE 754 2019, §5.10**^**IEEE 754 2019, §5.10**^**"9.4. decimal -- Decimal fixed point and floating point arithmetic -- Python 3.6.5 documentation".*docs.python.org*. Retrieved .**^**"Decimal Arithmetic - Exceptional conditions".*speleotrove.com*. Retrieved .**^**IEEE 754 2008, §7.2(h)**^**IEEE 754 2019, §9.2**^**IEEE 754 2008, Clause 9.**^**IEEE 754 2019, §9.2 .**^**"Re: Missing functions tanPi, asinPi and acosPi".*grouper.ieee.org*. Archived from the original on 2017-07-06. Retrieved .**^**IEEE 754 2008, §9.3.**^**IEEE 754 2008, §9.4.**^**IEEE 754 2019, §9.5 .**^**Riedy, Jason; Demmel, James. "Augmented Arithmetic Operations Proposed for IEEE-754 2018" (PDF). 25th IEEE Symbosium on Computer Arithmetic (ARITH 2018). pp. 49-56. Archived (PDF) from the original on 2019-07-23. Retrieved .**^**"754 Revision targeted for 2019".*754r.ucbtest.org*. Retrieved .**^**IEEE 754 2019, §9.6 .**^**Chen, David. "The Removal of MinNum and MaxNum Operations from IEEE 754-2019" (PDF).*grouper.ieee.org*. Retrieved .**^**IEEE 754 2008, §5.12.**^**IEEE 754 2008, §5.12.2.**^**Gay, David M. (1990-11-30). "Correctly rounded binary-decimal and decimal-binary conversions". Numerical Analysis Manuscript. Murry Hill, NJ, USA: AT&T Laboratories. 90-10. Cite journal requires`|journal=`

(help)CS1 maint: ref=harv (link)**^**Paxson, Vern; Kahan, William (1991-05-22). "A Program for Testing IEEE Decimal-Binary Conversion". Manuscript. CiteSeerX 10.1.1.144.5889. Cite journal requires`|journal=`

(help)CS1 maint: ref=harv (link)

- 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.

- 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.

- Goldberg, David (March 1991). "What Every Computer Scientist Should Know About Floating-Point Arithmetic".
*ACM Computing Surveys*.**23**(1): 5-48. doi:10.1145/103162.103163. Retrieved . - Hecker, Chris (February 1996). "Let's Get To The (Floating) Point" (PDF).
*Game Developer Magazine*: 19-24. ISSN 1073-922X. - Severance, Charles (March 1998). "IEEE 754: An Interview with William Kahan" (PDF).
*IEEE Computer*.**31**(3): 114-115. doi:10.1109/MC.1998.660194. S2CID 33291145. Retrieved . - Cowlishaw, Mike (June 2003). "Decimal Floating-Point: Algorism for Computers".
*16th IEEE Symposium on Computer Arithmetic, 2003. Proceedings*(PDF).*Proceedings 16th IEEE Symposium on Computer Arithmetic*. Los Alamitos, Calif.: IEEE Computer Society. pp. 104-111. doi:10.1109/ARITH.2003.1207666. ISBN 978-0-7695-1894-7. S2CID 18713046. Retrieved .. (Note:*Algorism*is not a misspelling of the title; see also algorism.) - Monniaux, David (May 2008). "The pitfalls of verifying floating-point computations".
*ACM Transactions on Programming Languages and Systems*.**30**(3): 1-41. arXiv:cs/0701192. doi:10.1145/1353445.1353446. ISSN 0164-0925. S2CID 218578808.: A compendium of non-intuitive behaviours of floating-point on popular architectures, with implications for program verification and testing. - Muller, Jean-Michel; Brunie, Nicolas; de Dinechin, Florent; Jeannerod, Claude-Pierre; Joldes, Mioara; Lefèvre, Vincent; Melquiond, Guillaume; Revol, Nathalie; Torres, Serge (2018) [2010].
*Handbook of Floating-Point Arithmetic*(2 ed.). Birkhäuser. doi:10.1007/978-3-319-76526-6. ISBN 978-3-319-76525-9. - Overton, Michael L. (2001). Written at Courant Institute of Mathematical Sciences, New York University, New York, USA.
*Numerical Computing with IEEE Floating Point Arithmetic*(1 ed.). Philadelphia, USA: SIAM. doi:10.1137/1.9780898718072. ISBN 978-0-89871-482-1. 978-0-89871-571-2, 0-89871-571-7. - Cleve Moler on Floating Point numbers
- Beebe, Nelson H. F. (2017-08-22).
*The Mathematical-Function Computation Handbook - Programming Using the MathCW Portable Software Library*(1 ed.). Salt Lake City, UT, USA: Springer International Publishing AG. doi:10.1007/978-3-319-64110-2. ISBN 978-3-319-64109-6. LCCN 2017947446. S2CID 30244721. - Hough, David G. (December 2019). "The IEEE Standard 754: One for the History Books".
*Computer*. IEEE.**52**(12): 109-112. doi:10.1109/MC.2019.2926614. S2CID 208281213.

This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

Popular Products

Music Scenes

Popular Artists