Performing Arithmetic Operations on Round-to-Nearest Representations

Abstract : 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 un-biased 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 2'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 2'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.
Type de document :
Article dans une revue
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, 60 (2), pp.282-291. 〈10.1109/TC.2010.134〉
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger
Contributeur : Jean-Michel Muller <>
Soumis le : mardi 4 janvier 2011 - 13:28:46
Dernière modification le : jeudi 7 février 2019 - 14:25:01
Document(s) archivé(s) le : mardi 5 avril 2011 - 02:48:26


Fichiers éditeurs autorisés sur une archive ouverte




Peter Kornerup, Jean-Michel Muller, Adrien Panhaleux. Performing Arithmetic Operations on Round-to-Nearest Representations. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2011, 60 (2), pp.282-291. 〈10.1109/TC.2010.134〉. 〈ensl-00548988v2〉



Consultations de la notice


Téléchargements de fichiers