On-the-fly conversion of redundant into conventional representations
IEEE Transactions on Computers
Radix-16 Signed-Digit Division
IEEE Transactions on Computers
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
Simple Radix-4 Division with Operands Scaling
IEEE Transactions on Computers
Design of a Radix 4 Division Unit with Simple Selection Table
IEEE Transactions on Computers
Over-Redundant Digit Sets and the Design of Digit-By-Digit Division Units
IEEE Transactions on Computers
Very-High Radix Division with Prescaling and Selection by Rounding
IEEE Transactions on Computers
Measuring the Accuracy of ROM Reciprocal Tables
IEEE Transactions on Computers
A Fast Radix-4 Division Algorithm and its Architecture
IEEE Transactions on Computers
A Fast Division Algorithm for VLSI
ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Combinational Digit-Set Converters for Hybrid Radix-4 Arithmetic
ICCS '94 Proceedings of the1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors
Application of fast layout synthesis environment to dividers evaluation
ARITH '95 Proceedings of the 12th Symposium on Computer Arithmetic
Svoboda-Tung division with no compensation
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Comparison of the layout synthesis of radix-2 and pseudo-radix-4 dividers
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
A Radix-4 New Svobota-Tung Divider with Constant Timing Complexity for Prescaling
Journal of VLSI Signal Processing Systems
| Hi-index | 14.98 |
This paper presents a general theory for developing new Svoboda-Tung (or simply NST) division algorithms not suffering the drawbacks of the "classical" Svoboda-Tung (or simply ST) method. NST avoids the drawbacks of ST by proper recoding of the two most significant digits of the residual before selecting the most significant digit of this recoded residual as the quotient-digit. NST relies on the divisor being in the range [1, 1 + 驴), where 驴 is a positive fraction depending upon: 1) the radix, 2) the signed-digit set used to represent the residual, and 3) the recoding conditions of the two most significant digits of the residual. If the operands belong to the IEEE-Std range [1, 2), they have to be conveniently prescaled. In that case, NST produces the correct quotient but the final residual is scaled by the same factor as the operands, therefore, NST is not useful in applications where the unscaled residual is necessary. An analysis of NST shows that previously published algorithms can be derived from the general theory proposed in this paper. Moreover, NST reveals a spectrum of new possibilities for the design of alternative division units. For a given radix-b, the number of different algorithms of this kind is b2/4.