On recoding in arithmetic algorithms

Recoding is the process of transforming between digit sets. It is used to reduce the cost and delay of the implementation of arithmetic algorithms, such as digit-recurrence and parallel algorithms for multiplication, division/square-root, and in compound operations. We present a simple and systematic basis for developing these recodings.

[1]  Homayoon Sam,et al.  A Generalized Multibit Recoding of Two's Complement Binary Numbers and Its Proof with Application in Multiplier Implementations , 1990, IEEE Trans. Computers.

[2]  Earl E. Swartzlander,et al.  Modified Booth algorithm for high radix fixed-point multiplication , 1993, IEEE Trans. Very Large Scale Integr. Syst..

[3]  James E. Robertson,et al.  The Correspondence Between Methods of Digital Division and Multiplier Recoding Procedures , 1970, IEEE Transactions on Computers.

[4]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[5]  M. Ercegovac,et al.  Division and Square Root: Digit-Recurrence Algorithms and Implementations , 1994 .

[6]  A. Avizeinis,et al.  Signed Digit Number Representations for Fast Parallel Arithmetic , 1961 .

[7]  Louis P. Rubinfield.  A Proof of the Modified Booth's Algorithm for Multiplication , 1975, IEEE Transactions on Computers.

[8]  O. L. Macsorley.  High-Speed Arithmetic in Binary Computers , 1961, Proceedings of the IRE.

[9]  Algirdas Avizienis,et al.  Signed-Digit Numbe Representations for Fast Parallel Arithmetic , 1961, IRE Trans. Electron. Comput..

[10]  He Du,et al.  A complex-number multiplier using radix-4 digits , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[11]  James E. Robertson,et al.  The Set Theory of Arithmetic Decomposition , 1990, IEEE Trans. Computers.

[12]  Tomás Lang,et al.  Very-High Radix Division with Prescaling and Selection by Rounding , 1994, IEEE Trans. Computers.

[13]  Peter Kornerup.  Digit-Set Conversions: Generalizations and Application , 1994, IEEE Trans. Computers.

[14]  Stamatis Vassiliadis,et al.  A General Proof for Overlapped Multiple-Bit Scanning Multiplications , 1989, IEEE Trans. Computers.

[15]  Fredrich Adam Rohatsch.  A Study of Transformations Applicable to the Development of Limited Carry-Borrow Propagation Adders , 1967 .

[16]  Israel Koren.  Computer arithmetic algorithms , 1993 .