Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation

Recoders for partial compression and rounding.

Abstract : The purpose of this paper is to treat digit set conversions and digit recodings in terms of primitive recoding operations that have elementary implementations.The partial compressions and roundings are each associated with borrow-save or carry-save recodings implementable in one level of logic. Iterative utilization of recoding have application for : i) reducing the range of truncated lower order digits of a redundant binary operand to intervals less than a 2 ulp range (-1, 1) approaching 1 ulp, ii) truncating strings of leading insignificant digits in a redundant binary operand, iii) realizing Booth recoding for radices 2k, k >= 2, by realizing the symmetric minimal redundant digit set for 2k for all k bit substring of a redundant binary operand.
Document type :
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:14:27 AM
Last modification on : Saturday, September 11, 2021 - 3:19:16 AM


Files produced by the author(s)


  • HAL Id : hal-02102108, version 1



Marc Daumas, David W. Matula. Recoders for partial compression and rounding.. [Research Report] LIP RR-1997-01, Laboratoire de l'informatique du parallélisme. 1997, 2+16p. ⟨hal-02102108⟩



Record views


Files downloads