loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05)
Multiplication Algorithms for Radix-2 RN-Codings and Two?s Complement Multiplication Algorithms for Radix-2 RN-Codings and Two?s Complement
Samos, Greece
July 23-July 25
ISBN: 0-7695-2407-9
ASCII Text
x 
 
Jean-Luc Beuchat, Jean-Michel Muller, "Multiplication Algorithms for Radix-2 RN-Codings and Two?s Complement Multiplication Algorithms for Radix-2 RN-Codings and Two?s Complement," Application-Specific Systems, Architectures and Processors, IEEE International Conference on, pp. 303-308, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ASAP.2005.45,
author = {Jean-Luc Beuchat and Jean-Michel Muller},
title = {Multiplication Algorithms for Radix-2 RN-Codings and Two?s Complement Multiplication Algorithms for Radix-2 RN-Codings and Two?s Complement},
journal ={Application-Specific Systems, Architectures and Processors, IEEE International Conference on},
volume = {0},
year = {2005},
issn = {1063-6862},
pages = {303-308},
doi = {http://doi.ieeecomputersociety.org/10.1109/ASAP.2005.45},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Application-Specific Systems, Architectures and Processors, IEEE International Conference on
TI - Multiplication Algorithms for Radix-2 RN-Codings and Two?s Complement Multiplication Algorithms for Radix-2 RN-Codings and Two?s Complement
SN - 1063-6862
SP303
EP308
A1 - Jean-Luc Beuchat,
A1 - Jean-Michel Muller,
PY - 2005
KW - null
VL - 0
JA - Application-Specific Systems, Architectures and Processors, IEEE International Conference on
ER -
 
Jean-Luc Beuchat, Projet Ar?enaire, LIP, ENS Lyon
Jean-Michel Muller, Projet Ar?enaire, LIP, ENS Lyon

The RN-codings, where "RN" stands for "Round to Nearest", are particular cases of signed-digit representations, for which rounding to 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.

Citation:
Jean-Luc Beuchat, Jean-Michel Muller, "Multiplication Algorithms for Radix-2 RN-Codings and Two?s Complement Multiplication Algorithms for Radix-2 RN-Codings and Two?s Complement," asap, pp.303-308, 2005 IEEE International Conference on Application-Specific Systems, Architecture Processors (ASAP'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.