IEEE 754-2008 (previously known as IEEE 754r) is a revision of the IEEE 754 standard for floating-point arithmetic. It was published in August 2008 and is a significant revision to, and replaces, the IEEE 754-1985 standard. The 2008 revision extended the previous standard where it was necessary, added decimal arithmetic and formats, tightened up certain areas of the original standard which were left undefined, and merged in IEEE 854 (the radix-independent floating-point standard). In a few cases, where stricter definitions of binary floating-point arithmetic might be performance-incompatible with some existing implementation, they were made optional. In 2019, it was updated with a minor revision IEEE 754-2019.[1]

Revision process

The standard had been under revision since 2000, with a target completion date of December 2006. The revision of an IEEE standard broadly follows three phases:

  1. Working group – a committee that creates a draft standard
  2. Ballot – interested parties subscribe to the balloting group and vote on the draft (75% of the group must participate, and 75% must approve for the draft to go forward); comments from the votes are resolved by a Ballot Resolution Committee (BRC) and changes made have to be recirculated with a new ballot if they are substantive
  3. When all comments are resolved and there are no further changes, the draft is submitted to the IEEE for review, approval, and publication (this can also result in changes and ballots, although this is rare).

On 11 June 2008, it was approved unanimously by the IEEE Revision Committee (RevCom), and it was formally approved by the IEEE-SA Standards Board on 12 June 2008. It was published on 29 August 2008.

754r Working Group phase

Participation in drafting the standard was open to people with a solid knowledge of floating-point arithmetic. More than 90 people attended at least one of the monthly meetings, which were held in Silicon Valley, and many more participated through the mailing list.

Progress at times was slow, leading the chairman to declare at the 15 September 2005 meeting[2] that "no progress is being made, I am suspending these meetings until further notice on those grounds". In December 2005, the committee reorganized under new rules with a target completion date of December 2006.

New policies and procedures were adopted in February 2006. In September 2006, a working draft was approved to be sent to the parent sponsoring committee (the IEEE Microprocessor Standards Committee, or MSC) for editing and to be sent to sponsor ballot.

754r Ballot phase

The last version of the draft, version 1.2.5, submitted to the MSC was from 4 October 2006.[3] The MSC accepted the draft on 9 October 2006. The draft has been changed significantly in detail during the balloting process.

The first sponsor ballot took place from 29 November 2006 through 28 December 2006. Of the 84 members of the voting body, 85.7% responded—78.6% voted approval. There were negative votes (and over 400 comments) so there was a recirculation ballot in March 2007; this received an 84% approval. There were sufficient comments (over 130) from that ballot that a third draft was prepared for second, 15-day, recirculation ballot which started in mid-April 2007. For a technical reason, the ballot process was restarted with the 4th ballot in October 2007; there were also substantial changes in the draft resulting from 650 voters' comments and from requests from the sponsor (the IEEE MSC); this ballot just failed to reach the required 75% approval. The 5th ballot had a 98.0% response rate with 91.0% approval, with comments leading to relatively small changes. The 6th, 7th, and 8th ballots sustained approval ratings of over 90% with progressively fewer comments on each draft; the 8th (which had no in-scope comments: 9 were repeats of previous comments and one referred to material not in the draft) was submitted to the IEEE Standards Revision Committee ('RevCom') for approval as an IEEE standard.

754r Review and Approval phase

The IEEE Standards Revision Committee (RevCom) considered and unanimously approved the IEEE 754r draft at its June 2008 meeting, and it was approved by the IEEE-SA Standards Board on 12 June 2008. Final editing is complete and the document has now been forwarded to the IEEE Standards Publications Department for publication.

IEEE Std 754-2008 publication

The new IEEE 754 (formally IEEE Std 754-2008, the IEEE Standard for Floating-Point Arithmetic) was published by the IEEE Computer Society on 29 August 2008, and is available from the IEEE Xplore website[4]

This standard replaces IEEE 754-1985. IEEE 854, the Radix-Independent floating-point standard was withdrawn in December 2008.

Summary of the revisions

The most obvious enhancements to the standard are the addition of a 16-bit and a 128-bit binary type and three decimal types, some new operations, and many recommended functions. However, there have been significant clarifications in terminology throughout. This summary highlights the main differences in each major clause of the standard.

Clause 1: Overview

The scope (determined by the sponsor of the standard) has been widened to include decimal formats and arithmetic, and adds extendable formats.

Clause 2: Definitions

Many of the definitions have been rewritten for clarification and consistency. A few terms have been renamed for clarity (for example, denormalized has been renamed to subnormal).

Clause 3: Formats

The description of formats has been made more regular, with a distinction between arithmetic formats (in which arithmetic may be carried out) and interchange formats (which have a standard encoding). Conformance to the standard is now defined in these terms.

The specification levels of a floating-point format have been enumerated, to clarify the distinction between:

  1. the theoretical real numbers (an extended number line)
  2. the entities which can be represented in the format (a finite set of numbers, together with −0, infinities, and NaN)
  3. the particular representations of the entities: sign-exponent-significand, etc.
  4. the bit-pattern (encoding) used.

The sets of representable entities are then explained in detail, showing that they can be treated with the significand being considered either as a fraction or an integer. The particular sets known as basic formats are defined, and the encodings used for interchange of binary and decimal formats are explained.

The binary interchange formats have the "half precision" (16-bit storage format) and "quad precision" (128-bit format) added, together with generalized formulae for some wider formats; the basic formats have 32-bit, 64-bit, and 128-bit encodings.

Three new decimal formats are described, matching the lengths of the 32–128-bit binary formats. These give decimal interchange formats with 7, 16, and 34-digit significands, which may be normalized or unnormalized. For maximum range and precision, the formats merge part of the exponent and significand into a combination field, and compress the remainder of the significand using either a decimal integer encoding (which uses Densely Packed Decimal, or DPD, a compressed form of BCD) encoding or conventional binary integer encoding. The basic formats are the two larger sizes, which have 64-bit and 128-bit encodings. Generalized formulae for some other interchange formats are also specified.

Extended and extendable formats allow for arithmetic at other precisions and ranges.

Clause 4: Attributes and rounding

This clause has been changed to encourage the use of static attributes for controlling floating-point operations, and (in addition to required rounding attributes) allow for alternate exception handling, widening of intermediate results, value-changing optimizations, and reproducibility.

The round-to-nearest, ties away from zero rounding attribute has been added (required for decimal operations only).

Clause 5: Operations

This section has numerous clarifications (notably in the area of comparisons), and several previously recommended operations (such as copy, negate, abs, and class) are now required.

New operations include fused multiply–add (FMA), explicit conversions, classification predicates (isNan(x), etc.), various min and max functions, a total ordering predicate, and two decimal-specific operations (samequantum and quantize).

Min and max

The min and max operations are defined but leave some leeway for the case where the inputs are equal in value but differ in representation. In particular:

  • min(+0,−0) or min(−0,+0) must produce something with a value of zero but may always return the first argument.

In order to support operations such as windowing in which a NaN input should be quietly replaced with one of the end points, min and max are defined to select a number, x, in preference to a quiet NaN:

  • min(x,qNaN) = min(qNaN,x) = x
  • max(x,qNaN) = max(qNaN,x) = x

These functions are called minNum and maxNum to indicate their preference for a number over a quiet NaN. However, in the presence of a signaling NaN input, a quiet NaN is returned as with the usual operations. After the publication of the standard, it was noticed that these rules make these operations non-associative; for this reason, they have been replaced by new operations in IEEE 754-2019.

Decimal arithmetic

Decimal arithmetic, compatible with that used in Java, C#, PL/I, COBOL, Python, REXX, etc., is also defined in this section. In general, decimal arithmetic follows the same rules as binary arithmetic (results are correctly rounded, and so on), with additional rules that define the exponent of a result (more than one is possible in many cases).

Correctly rounded base conversion

Unlike in 854, 754-2008 requires correctly rounded base conversion between decimal and binary floating point within a range which depends on the format.

Clause 6: Infinity, NaNs, and sign bit

This clause has been revised and clarified, but with no major additions. In particular, it makes formal recommendations for the encoding of the signaling/quiet NaN state.

Clause 7: Default exception handling

This clause has been revised and considerably clarified, but with no major additions.

Clause 8: Alternate exception handling

This clause has been extended from the previous Clause 8 ('Traps') to allow optional exception handling in various forms, including traps and other models such as try/catch. Traps and other exception mechanisms remain optional, as they were in IEEE 754-1985.

This clause is new; it recommends fifty operations, including log, power, and trigonometric functions, that language standards should define. These are all optional (none are required in order to conform to the standard). The operations include some on dynamic modes for attributes, and also a set of reduction operations (sum, scaled product, etc.).

Clause 10: Expression evaluation

This clause is new; it 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.

Clause 11: Reproducibility

This clause is new; it 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.

Annex A: Bibliography

This annex is new; it lists some useful references.

Annex B: Program debugging support

This annex is new; it provides guidance to debugger developers for features that are desired for supporting the debugging of floating-point code.

Index of operations

This is a new index, which lists all the operations described in the standard (required or optional).

Discussed but not included

Due to changes in CPU design and development, the 2008 IEEE floating-point standard could be viewed as historical or outdated as the 1985 standard it replaced. There were many outside discussions and items not covered in the standardization process, the items below are the ones that became public knowledge:

  • Annex "L" recommended to language developers how to bind items in the standard to features in a language.
  • Annex "U" provided guidance on the choice of numeric underflow definitions.
In 754 the definition of underflow was that the result is tiny and encounters a loss of accuracy.
Two definitions were allowed for the determination of the 'tiny' condition: before or after rounding the infinitely precise result to working precision, with unbounded exponent.
Two definitions of loss of accuracy were permitted: inexact result or loss due only to denormalization. No known hardware systems implemented the latter and it has been removed from the revised standard as an option.
Annex U of 754r recommended that only tininess after rounding and inexact as loss of accuracy be a cause for underflow signal.
  • Annex "Z" introduced optional data types for supporting other fixed-width floating-point formats, as well as arbitrary-precision formats (i.e., where the precision of representation and rounding is determined at execution time) – some of this material was moved into the body of the draft by generalizing section 5. Arbitrary precision was dropped.
  • Inheritance and propagation of modes (exception handling, presubstitution, rounding) and flags (inexact, underflow, overflow, divide by zero, invalid). The desire is to have flags propagate out to a caller; and mode changes be able to be inherited by a callee, but not affect the caller.
  • Interval and other arithmetics were discussed but not included as being outside scope (and a large piece of work in their own right). Work is starting in 2008 on a proposed IEEE standard for interval arithmetic.

References

  1. ↑ "ANSI/IEEE Std 754-2019". 754r.ucbtest.org. Retrieved 2019-08-06.
  2. ↑ "15 September 2005 meeting".
  3. ↑ DRAFT Standard for Floating-Point Arithmetic P754, version 1.2.5. Revising ANSI/IEEE Std 754-1985 (Report). 2006-10-04.
  4. ↑ 754-2008 - IEEE Standard for Floating-Point Arithmetic. IEEE. 2008-08-29. doi:10.1109/IEEESTD.2008.4610935. ISBN 978-0-7381-5752-8. (NB. Superseded by IEEE Std 754-2019, a revision of IEEE 754-2008.)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.