Fraction (floating Point Number)

The significand (also mantissa or coefficient, sometimes also argument, or ambiguously fraction or characteristic) is part of a number in scientific notation or in floating-point representation, consisting of its significant digits. Depending on the interpretation of the exponent, the significand may represent an integer or a fraction.

Example

The number 123.45 can be represented as a decimal floating-point number with the integer 12345 as the significand and a 10^−2 power term, also called characteristics, where −2 is the exponent (and 10 is the base). Its value is given by the following arithmetic:

: 123.45 = 12345 × 10^−2.

The same value can also be represented in normalized form with 1.2345 as the fractional coefficient, and +2 as the exponent (and 10 as the base):

: 123.45 = 1.2345 × 10⁺².

Schmid, however, called this representation with a significand ranging between 1.0 and 10 a modified normalized form.

For base 2, this 1.xxxx form is also called a normalized significand.

Finally, the value can be represented in the format given by the Language Independent Arithmetic standard and several programming language standards, including Ada, C, Fortran and Modula-2, as

: 123.45 = 0.12345 × 10⁺³.

Schmid called this representation with a significand ranging between 0.1 and 1.0 the true normalized form.

For base 2, this 0.xxxx form is also called a normed significand.

Significands and the hidden bit

For a normalized number, the most significant digit is always non-zero. When working in binary, this constraint uniquely determines this digit to always be 1; as such, it does not need to be explicitly stored, being called the ''hidden bit''. The significand is characterized by its width in (binary) digits, and depending on the context, the hidden bit may or may not be counted towards the width of the significand. For example, the same IEEE 754 double-precision format is commonly described as having either a 53-bit significand, including the hidden bit, or a 52-bit significand, excluding the hidden bit. IEEE 754 defines the precision ''p'' to be the number of digits in the significand, including any implicit leading bit (e.g., ''p'' = 53 for the double-precision format), thus in a way independent from the encoding, and the term to express what is encoded (that is, the significand without its leading bit) is ''trailing significand field''.

Terminology

The term ''significand'' was introduced by George Forsythe and Cleve Moler in 1967 and is the word used in the IEEE standard.
However, in 1946 Arthur Burks used the terms ''mantissa'' and ''characteristic'' to describe the two parts of a floating-point number ( Burks ''et al.'') and that usage remains common among computer scientists today. ''Mantissa'' and ''characteristic'' have long described the two parts of the logarithm found on tables of common logarithms. While the two meanings of ''exponent'' are analogous, the two meanings of ''mantissa'' are not equivalent. For this reason, the use of ''mantissa'' for ''significand'' is discouraged by some including the creator of the standard, William Kahan and prominent computer programmer and author of '' The Art of Computer Programming'', Donald E. Knuth.

The confusion is because scientific notation and floating-point representation are log-linear, not logarithmic. To multiply two numbers, given their logarithms, one just adds the characteristic (integer part) and the mantissa (fractional part). By contrast, to multiply two floating-point numbers, one adds the exponent (which is logarithmic) and ''multiplies'' the significand (which is linear).

See also

* Mantissa (logarithm)

Notes

References

{{Reflist, refs=
{{cite book , author-last1=Burks , author-first1=Arthur Walter , author-link1=Arthur Walter Burks , author-last2=Goldstine , author-first2=Herman H. , author-link2=Herman Goldstine , author-last3=von Neumann , author-first3=John , author-link3=John von Neumann , orig-year=1946 , title=Preliminary discussion of the logical design of an electronic computing instrument , type=Technical report, Institute for Advanced Study, Princeton, New Jersey, USA , chapter=5.3. , work=Collected Works of John von Neumann , volume=5 , editor-first=A. H. , editor-last=Taub , publisher= The Macmillan Company , location=New York, USA , date=1963 , page=42 , url=https://www.cs.princeton.edu/courses/archive/fall10/cos375/Burks.pdf , access-date=2016-02-07 , quote= ��Several of the digital computers being built or planned in this country and England are to contain a so-called "floating decimal point". This is a mechanism for expressing each word as a characteristic and a mantissa—e.g. 123.45 would be carried in the machine as (0.12345,03), where the 3 is the exponent of 10 associated with the number. ��}
{{citation , author-first=William Morton , author-last=Kahan , author-link=William Morton Kahan , title=Names for Standardized Floating-Point Formats , url=http://www.eecs.berkeley.edu/~wkahan/ieee754status/Names.pdf , date=2002-04-19 , quote= ��''m'' is the significand or coefficient or (wrongly) mantissa ��}
{{cite book , title=Decimal Computation , author-first=Hermann , author-last=Schmid , author-link=Hermann Schmid (computer scientist) , date=1974 , edition=1 , publisher= John Wiley & Sons, Inc. , location=Binghamton, New York, USA , isbn=0-471-76180-X , pag
204
205 , url=https://archive.org/details/decimalcomputati0000schm , url-access=registration , access-date=2016-01-03
{{cite book , title=Decimal Computation , author-first=Hermann , author-last=Schmid , author-link=Hermann Schmid (computer scientist) , orig-year=1974 , date=1983 , edition=1 (reprint) , publisher=Robert E. Krieger Publishing Company , location=Malabar, Florida, USA , isbn=0-89874-318-4 , pages=204–205 , url=https://books.google.com/books?id=uEYZAQAAIAAJ , access-date=2016-01-03 (NB. At least some batches of this reprint edition were misprints with defective pages 115–146.)
{{cite book , author-first1=George Elmer , author-last1=Forsythe , author-link1=George Elmer Forsythe , author-first2=Cleve Barry , author-last2=Moler , author-link2=Cleve Barry Moler , title=Computer Solution of Linear Algebraic Systems , date=September 1967 , publisher=Prentice-Hall, Englewood Cliffs , location=New Jersey, USA , edition=1st , series=Automatic Computation , isbn=0-13-165779-8
{{cite book , author-first=Pat H. , author-last=Sterbenz , title=Floating-Point Computation , date=1974-05-01 , edition=1 , series=Prentice-Hall Series in Automatic Computation , publisher=Prentice Hall , location=Englewood Cliffs, New Jersey, USA , isbn=0-13-322495-3
{{cite journal , author-first=David , author-last=Goldberg , author-link=David Goldberg (PARC) , title=What Every Computer Scientist Should Know About Floating-Point Arithmetic , location= Xerox Palo Alto Research Center (PARC), Palo Alto, California, USA , journal= Computing Surveys , date=March 1991 , volume=23 , number=1 , page=7 , publisher= Association for Computing Machinery, Inc. , url=http://perso.ens-lyon.fr/jean-michel.muller/goldberg.pdf , access-date=2016-07-13 , url-status=live , archive-url=https://web.archive.org/web/20160713044143/http://perso.ens-lyon.fr/jean-michel.muller/goldberg.pdf , archive-date=2016-07-13 , quote= ��This term was introduced by Forsythe and Moler 967 and has generally replaced the older term ''mantissa''. ��} (NB. A newer edited version can be found here


{{cite web , title=Floating-Point Formats , at=A Note on Field Designations , author-first=John J. G. , author-last=Savard , date=2018 , orig-year=2005 , work=quadibloc , url=http://www.quadibloc.com/comp/cp0201.htm , access-date=2018-07-16 , url-status=live , archive-url=https://web.archive.org/web/20180703001709/http://www.quadibloc.com/comp/cp0201.htm , archive-date=2018-07-16
{{cite book , title=Design of Arithmetic Units for Digital Computers , author-first=John B. , author-last=Gosling , editor-first=Frank H. , editor-last=Sumner , date=1980 , edition=1 , publisher= The Macmillan Press Ltd , location=Department of Computer Science, University of Manchester, Manchester, UK , isbn=0-333-26397-9 , chapter=6.1 Floating-Point Notation / 6.8.5 Exponent Representation , series=Macmillan Computer Science Series , pages=74, 91, 137–138 , quote= ��In floating-point representation, a number ''x'' is represented by two signed numbers ''m'' and ''e'' such that ''x'' = ''m'' · ''b''^''e'' where ''m'' is the mantissa, ''e'' the exponent and ''b'' the base. ��The mantissa is sometimes termed the characteristic and a version of the exponent also has this title from some authors. It is hoped that the terms here will be unambiguous. �� use a exponentvalue which is shifted by half the binary range of the number. ��This special form is sometimes referred to as a biased exponent, since it is the conventional value plus a constant. Some authors have called it a characteristic, but this term should not be used, since CDC and others use this term for the mantissa. It is also referred to as an ' excess -' representation, where, for example, - is 64 for a 7-bit exponent (2⁷⁻¹ = 64). ��} (NB. Gosling does not mention the term significand at all.)
{{cite book , title=754-2019 - IEEE Standard for Floating-Point Arithmetic , publisher= IEEE , isbn=978-1-5044-5924-2 , doi=10.1109/IEEESTD.2019.8766229 , date=2019
{{cite book , title=The Art of Computer Programming , title-link=The Art of Computer Programming , author-last=Knuth , author-first=Donald E. , author-link=Donald Ervin Knuth , page=214 , volume=2 , isbn=0-201-89684-2 , quote= ��Other names are occasionally used for this purpose, notably 'characteristic' and 'mantissa'; but it is an abuse of terminology to call the fraction part a mantissa, since that term has quite a different meaning in connection with logarithms. Furthermore the English word mantissa means 'a worthless addition.' ��}
{{cite book , title=English Electric KDF9: Very high speed data processing system for Commerce, Industry, Science , type=Product flyer , date=c. 1961 , publisher= English Electric , id=Publication No. DP/103. 096320WP/RP0961 , url=http://www.ourcomputerheritage.org/KDF9_Flier.pdf , access-date=2020-07-27 , url-status=live , archive-url=https://web.archive.org/web/20200727143037/http://www.ourcomputerheritage.org/KDF9_Flier.pdf , archive-date=2020-07-27

Floating point
Computer arithmetic