To appear in: Proceedings of 27th IEEE Symposium on Computer Arithmetic (ARITH 2020).
ISSN/ISBN: Not available at this time. DOI: Not available at this time.
There are no links available at this time.
Abstract: Recently proposed real number systems like POSITS and ELIAS codes make use of tapered accuracy resulting from variable-length coding of exponents and significands. Several quite different interpretations of these number systems have been provided, though most often these rely on some combination of fixed-and variable-length codes for exponent and significand. We provide a new perspective on these number systems that unifies known representations while suggesting new ones. Our framework is based on multibit radix representations that encode the exponent in unary, the leading nonzero digit in a variable-length code, and the remaining digits in fixed-length binary code. We show how POSITS, the various ELIAS codes, and IEEE 754 like representations can be expressed in this framework. Moreover, we show that POSITS and the ELIAS γ and δ codes represent the leading digit using the canonical Huffman code for a probability distribution given by Benford's law, which governs the probability of leading digits. We further show that POSITS correspond to the use of a fixed radix while ELIAS δ and ω codes are based on simple sequences of increasing radix. Our approach provides for an intuitive and uniform framework for representing numbers that reveals a visual mapping between codewords and the binary representation of real numbers obscured by prior frameworks. This new interpretation suggests a generalization of POSITS and other number systems and provides simple rules for designing information-theoretically optimal codes.
Bibtex:
@inproceedings{,
author = {Lindstrom, Peter},
year = {2020},
month = {05},
pages = {},
title = {Variable-Radix Coding of the Reals},
book title = {Proceedings of 27th IEEE Symposium on Computer Arithmetic (ARITH 2020)},
}
Reference Type: Conference Paper
Subject Area(s): Computer Science