On-the-Fly Rounding (Computing Arithmetic)

Authors:
M. D. Ercegovac;T. Lang
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1992

Citing 3
Cited 11

Digit-Pipelined Arnthmetic as Illustrated by the Paste-Up System: A Tutorial

Computer
On-the-fly conversion of redundant into conventional representations

IEEE Transactions on Computers
Fast Multiplication Without Carry-Propagate Addition

IEEE Transactions on Computers

Division Algorithms and Implementations

IEEE Transactions on Computers
A VLSI Algorithm for Computing the Euclidean Norm of a 3D Vector

IEEE Transactions on Computers
On-the-Fly Range Reduction

Journal of VLSI Signal Processing Systems
Very-High Radix Division with Prescaling and Selection by Rounding

IEEE Transactions on Computers
Analysis of the impact of different methods for division/square root computation in the performance of a superscalar microprocessor

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Synthesis and verification
Algorithm and Architecture for Logarithm, Exponential, and Powering Computation

IEEE Transactions on Computers
High-Radix Logarithm with Selection by Rounding: Algorithm and Implementation

Journal of VLSI Signal Processing Systems
Fast decimal floating-point division

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Interactive presentation: Radix 4 SRT division with quotient prediction and operand scaling

Proceedings of the conference on Design, automation and test in Europe
Higher radix and redundancy factor for floating point SRT division

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Design issues and implementations for floating-point divide-add fused

IEEE Transactions on Circuits and Systems II: Express Briefs

Quantified Score

Hi-index	14.99

Visualization

Abstract

In implementations of operations based on digit-recurrence algorithms such as division, left-to-right multiplication and square root, the result is obtained in digit-serial form, from most significant digit to least significant. To reduce the complexity of the result-digit selection and allow the use of redundant addition, the result-digit has values from a signed-digit set. As a consequence, the result has to be converted to conventional representation, which can be done on-the-fly as the digits are produced, without the use of a carry-propagate adder. The authors describe three ways to modify this conversion process so that the result is rounded. The resulting operation is fast because no carry-propagate addition is needed. The schemes described apply also to online arithmetic operations.