Issue No. 07 - July (1987 vol. 36)
M.D. Ercegovac , Department of Computer Science, University of California
An algorithm to convert redundant number representations into conventional representations is presented. The algorithm is performed concurrently with the digit-by-digit generation of redundant forms by schemes such as SRT division. It has a step delay roughly equivalent to the delay of a carry-save adder and simple implementation. The conversion scheme is applicable in arithmetic algorithms such as nonrestoring division, square root, and on-line operations in which redundantly represented results are generated in a digit-by-digit manner, from most significant to least significant.
2's complement, Conditional sum addition, conversion, most significant digit first algorithms, on-line algorithms, redundant number representation, square-root, SRT division
M. Ercegovac and T. Lang, "On-the-Fly Conversion of Redundant into Conventional Representations," in IEEE Transactions on Computers, vol. 36, no. , pp. 895-897, 1987.