Multiplication Algorithms for Radix-2 RN-Codings and Two’s Complement Multiplication Algorithms for Radix-2 RN-Codings and Two’s Complement
Jean-Luc Beuchat, Jean‐Michel Muller · 2006
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.