Issue No.02 - February (2011 vol.60)
Peter Kornerup , University of Southern Denmark, Odense
Jean-Michel Muller , CNRS-LIP, Arénaire, Lyon
Adrien Panhaleux , École Normale Supérieure de Lyon, Lyon
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2010.134
During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number representations denoted RN-Codings were introduced, allowing an unbiased rounding-to-nearest to take place by a simple truncation, with the property that problems with double-roundings are avoided. In this paper, we first investigate a particular encoding of the binary representation. This encoding is generalized to any radix and digit set; however, radix complement representations for even values of the radix turn out to be particularly feasible. The encoding is essentially an ordinary radix complement representation with an appended round-bit, but still allowing rounding-to-nearest by truncation, and thus avoiding problems with double-roundings. Conversions from radix complement to these round-to-nearest representations can be performed in constant time, whereas conversion the other way, in general, takes at least logarithmic time. Not only is rounding-to-nearest a constant time operation, but so is also sign inversion, both of which are at best log-time operations on ordinary two's complement representations. Addition and multiplication on such fixed-point representations are first analyzed and defined in such a way that rounding information can be carried along in a meaningful way, at minimal cost. The analysis is carried through for a compact (canonical) encoding using two's complement representation, supplied with a round-bit. Based on the fixed-point encoding, it is shown possible to define floating-point representations, and a sketch of the implementation of an FPU is presented.
Signed-digit, round-to-nearest, constant-time rounding and sign-inversion, floating-point representation, double-rounding.
Peter Kornerup, Jean-Michel Muller, Adrien Panhaleux, "Performing Arithmetic Operations on Round-to-Nearest Representations", IEEE Transactions on Computers, vol.60, no. 2, pp. 282-291, February 2011, doi:10.1109/TC.2010.134