Tapered floating point

In computing, tapered floating point (TFP) is a format similar to floating point, but with variable-sized entries for the significand and exponent instead of the fixed-length entries found in normal floating-point formats. In addition to this, tapered floating-point formats provide a fixed-size pointer entry indicating the number of digits in the exponent entry. The number of digits of the significand entry (including the sign) results from the difference of the fixed total length minus the length of the exponent and pointer entries.[1]

Thus numbers with a small exponent, i.e. whose order of magnitude is close to the one of 1, have a higher relative precision than those with a large exponent.


The tapered floating-point scheme was first proposed by Robert Morris of Bell Laboratories in 1971,[2] and refined with leveling by Masao Iri and Shouichi Matsui of University of Tokyo in 1981,[3][4][1] and by Hozumi Hamada of Hitachi, Ltd.[5][6][7]

Alan Feldstein of Arizona State University and Peter Turner[8] of Clarkson University described a tapered scheme resembling a conventional floating-point system except for the overflow or underflow conditions.[7]

In 2013, John Gustafson proposed the Unum number system, a variant of tapered floating-point arithmetic with an exact bit added to the representation and some interval interpretation to the non-exact values.[9][10]

See alsoEdit


  1. ^ a b Zehendner, Eberhard (Summer 2008). "Rechnerarithmetik: Logarithmische Zahlensysteme" (PDF) (Lecture script) (in German). Friedrich-Schiller-Universität Jena. pp. 15–19. Archived (PDF) from the original on 2018-07-09. Retrieved 2018-07-09. [1]
  2. ^ Morris, Sr., Robert H. (December 1971). "Tapered Floating Point: A New Floating-Point Representation". IEEE Transactions on Computers. IEEE. C-20 (12): 1578–1579. doi:10.1109/T-C.1971.223174. ISSN 0018-9340.
  3. ^ Matsui, Shourichi; Iri, Masao (1981-11-05) [January 1981]. "An Overflow/Underflow-Free Floating-Point Representation of Numbers". Journal of Information Processing. Information Processing Society of Japan (IPSJ). 4 (3): 123–133. ISSN 1882-6652. NAID 110002673298 NCID AA00700121. Retrieved 2018-07-09.{{cite journal}}: CS1 maint: url-status (link) [2]. Also reprinted in: Swartzlander, Jr., Earl E., ed. (1990). Computer Arithmetic. Vol. II. IEEE Computer Society Press. pp. 357–.
  4. ^ Higham, Nicholas John (2002). Accuracy and Stability of Numerical Algorithms (2 ed.). Society for Industrial and Applied Mathematics (SIAM). p. 49. ISBN 978-0-89871-521-7. 0-89871-355-2.
  5. ^ Hamada, Hozumi (June 1983). "URR: Universal representation of real numbers". New Generation Computing. 1 (2): 205–209. doi:10.1007/BF03037427. ISSN 0288-3635. Retrieved 2018-07-09. (NB. The URR representation coincides with Elias delta (δ) coding.)
  6. ^ Hamada, Hozumi (1987-05-18). Irwin, Mary Jane; Stefanelli, Renato (eds.). "A New Real Number Representation and Its Operation". Proceedings of the Eighth Symposium on Computer Arithmetic (ARITH 8). Washington, D.C., USA: IEEE Computer Society Press: 153–157. doi:10.1109/ARITH.1987.6158698. ISBN 0-8186-0774-2. [3]
  7. ^ a b Hayes, Brian (September–October 2009). "The Higher Arithmetic". American Scientist. 97 (5): 364–368. doi:10.1511/2009.80.364. S2CID 121337883. [4]. Also reprinted in: Hayes, Brian (2017). "Chapter 8: Higher Arithmetic". Foolproof, and Other Mathematical Meditations (1 ed.). The MIT Press. pp. 113–126. ISBN 978-0-26203686-3.
  8. ^ Feldstein, Alan; Turner, Peter R. (March–April 2006). "Gradual and tapered overflow and underflow: A functional differential equation and its approximation". Journal of Applied Numerical Mathematics. Amsterdam, Netherlands: International Association for Mathematics and Computers in Simulation (IMACS) / Elsevier Science Publishers B. V. 56 (3–4): 517–532. doi:10.1016/j.apnum.2005.04.018. ISSN 0168-9274. Retrieved 2018-07-09.{{cite journal}}: CS1 maint: url-status (link)
  9. ^ Gustafson, John Leroy (March 2013). "Right-Sizing Precision: Unleashed Computing: The need to right-size precision to save energy, bandwidth, storage, and electrical power" (PDF). Archived (PDF) from the original on 2016-06-06. Retrieved 2016-06-06.
  10. ^ Muller, Jean-Michel (2016-12-12). "Chapter 2.2.6. The Future of Floating Point Arithmetic". Elementary Functions: Algorithms and Implementation (3 ed.). Boston, Massachusetts, USA: Birkhäuser. pp. 29–30. ISBN 978-1-4899-7981-0.

Further readingEdit