A division algorithm in which the quotient-digit selection is performed by rounding the shifted residual in carry-save form is presented. To allow the use of this simple function, the divisor (and dividend) is prescaled to a range close to one. The implementation presented results in a fast iteration because of the use of carry-save forms and suitable recodings. The execution time is calculated, and several convenient values of the radix are selected. Comparison with other high-radix dividers is performed using the same assumption
The speed of SRT-type dividers is mainly determined by the complexity of the quotient-digit selectio...
Digit-recurrence binary dividers are sped up via two complementary methods: keeping the partial rema...
Over-redundant digit sets are defined as those ranging from -s to +s, with s⩾B, B being the radix. T...
A division algorithm in which the quotient-digit selection is performed by rounding the shifted resi...
An extension of the very-high radix division with prescaling and selection by rounding is presented....
An algorithm for square root with prescaling and selection by rounding is developed and combined wit...
An algorithm for square root with prescaling is developed and combined with a similar scheme for div...
We propose a digit-recurrence algorithm for division in real and complex number domains using a vari...
We adapt the radix-r digit-recurrence division algorithm to complex division. By prescaling the oper...
(eng) We adapt the radix-$r$ digit-recurrence division algorithm to complex division. By prescaling ...
High-radix division, developing several quotient bits per clock, is usually limited by the difficult...
We adapt the radix-r digit-recurrence division algorithm to complex division. By prescaling the oper...
The speed of high-radix digit-recurrence dividers and square-root units is mainly determined by the ...
We present a radix-8 divider that uses an over-redundant digit set for the quotient in order to obta...
We describe a hardware-oriented design of a complex division algorithm proposed in.1 This algorithm ...
The speed of SRT-type dividers is mainly determined by the complexity of the quotient-digit selectio...
Digit-recurrence binary dividers are sped up via two complementary methods: keeping the partial rema...
Over-redundant digit sets are defined as those ranging from -s to +s, with s⩾B, B being the radix. T...
A division algorithm in which the quotient-digit selection is performed by rounding the shifted resi...
An extension of the very-high radix division with prescaling and selection by rounding is presented....
An algorithm for square root with prescaling and selection by rounding is developed and combined wit...
An algorithm for square root with prescaling is developed and combined with a similar scheme for div...
We propose a digit-recurrence algorithm for division in real and complex number domains using a vari...
We adapt the radix-r digit-recurrence division algorithm to complex division. By prescaling the oper...
(eng) We adapt the radix-$r$ digit-recurrence division algorithm to complex division. By prescaling ...
High-radix division, developing several quotient bits per clock, is usually limited by the difficult...
We adapt the radix-r digit-recurrence division algorithm to complex division. By prescaling the oper...
The speed of high-radix digit-recurrence dividers and square-root units is mainly determined by the ...
We present a radix-8 divider that uses an over-redundant digit set for the quotient in order to obta...
We describe a hardware-oriented design of a complex division algorithm proposed in.1 This algorithm ...
The speed of SRT-type dividers is mainly determined by the complexity of the quotient-digit selectio...
Digit-recurrence binary dividers are sped up via two complementary methods: keeping the partial rema...
Over-redundant digit sets are defined as those ranging from -s to +s, with s⩾B, B being the radix. T...