Evaluating 'A+B=K' conditions in constant time

Cortadella, Jordi; Llaberi, J.M.

doi:10.1109/iscas.1988.14912

Cited by 7 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This detection can follow a conversion of the 6nal remainder to imdundant, if such a conversion is used for sign detection, or another special circuit can be used [CORT88] …”

Section: Rounding To Nearestmentioning

confidence: 99%

On-the-fly rounding for division and square root

Ercegovac¹,

Lang²

Proceedings of 9th Symposium on Computer Arithmetic

View full text Add to dashboard Cite

In division and square root implementations based on digitrecurrence algorithms the result is obtained in digit-serial form, from most significant digit to least significant. Moreover, to reduce the complexity of the result-digit selection and to allow the use of redundant addition, the resultdigit has values from a signed-digit set. As a consequence, the result has to be converted to conventional representation. This conversion can be done on-the-fly as the digits are produced, without the use of a carry-propagate adder. In this paper we describe how to modify this conversion process so that the result is rounded. The resulting operation is faster than what is done conventionally because no carry-propagate addition is needed. We describe three rounding methods; they differ in the rounding e m r and the hardware and time required.

show abstract

“…This detection can follow a conversion of the 6nal remainder to imdundant, if such a conversion is used for sign detection, or another special circuit can be used [CORT88] …”

Section: Rounding To Nearestmentioning

confidence: 99%