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

2015 IEEE 26th International Conference on Application-specific Systems, Architectures and Processors (ASAP) Pub Date : 2005-07-23 DOI:10.1109/ASAP.2005.45

Jean-Luc Beuchat, J. Muller

引用次数: 1

Abstract

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.

查看原文本刊更多论文

基数-2 rn -编码的乘法算法和二元补数的乘法算法

RN编码，其中“RN”代表“四舍五入”，是有符号数字表示的特殊情况，四舍五入总是与截断相同。在基数2中，展台编码是一种rn编码。在本文中，我们提出了几种能够处理rn编码的乘法算法，并分析了它们的性质。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2015 IEEE 26th International Conference on Application-specific Systems, Architectures and Processors (ASAP)

自引率

0.00%

发文量