On-the-fly conversion of redundant into conventional representations
IEEE Transactions on Computers
Faster Modular Multiplication by Operand Scaling
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Svoboda-Tung division with no compensation
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Leading Guard Digits in Finite Precision Redundant Representations
IEEE Transactions on Computers
A Simple Postcorrection for Nonrestoring Division
IEEE Transactions on Computers
Comments on "Higher-Radix Division Using Estimates of the Divisor and Partial Remainder"
IEEE Transactions on Computers
Design of the Arithmetic Units of ILLIAC III: Use of Redundancy and Higher Radix Methods
IEEE Transactions on Computers
A Survey of Some Recent Contributions to Computer Arithmetic
IEEE Transactions on Computers
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
Minimizing the complexity of SRT tables
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 15.00 |
Abstract The nature of a class of division techniques which permit the selection of quotient digits in digital division by the inspection of truncated versions of the divisor and partial remainder is reviewed in detail. Two types of mechanisms, or so-called model divisions, for the selection of quotient digits are introduced. For both types of techniques, analytic tools are suggested for determining the number of bits which must be inspected as a function of the radix and form of representation of quotient digits. The analysis accounts for the representation of the partial remainder in a redundant form such as the one produced by an adder-subtractor which eliminates carry-borrow propagation.