Multiplication Algorithms for Radix-$2$ RN-Codings and Two's Complement Numbers

Jean-Luc Beuchat 1, 2 Jean-Michel Muller 2
1 ARENAIRE - Computer arithmetic
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : The RN-codings are particular cases of signed-digit representations, for which rounding to the nearest is always identical to truncation. In radix $2$, Booth recoding is an RN-coding. In this paper, we suggest several multiplication algorithms able to handle RN-codings, and we analyze their properties.
Document type :
Reports
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070495
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 8:39:43 PM
Last modification on : Tuesday, May 21, 2019 - 2:07:47 PM

Identifiers

  • HAL Id : inria-00070495, version 1

Collections

Citation

Jean-Luc Beuchat, Jean-Michel Muller. Multiplication Algorithms for Radix-$2$ RN-Codings and Two's Complement Numbers. [Research Report] RR-5511, LIP RR-2005-05, INRIA, LIP. 2005, pp.13. ⟨inria-00070495⟩

Share

Metrics

Record views

173

Files downloads

192