This Article 
 Bibliographic References 
 Add to: 
On-the-Fly Conversion of Redundant into Conventional Representations
July 1987 (vol. 36 no. 7)
pp. 895-897
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.
Index Terms:
2's complement, Conditional sum addition, conversion, most significant digit first algorithms, on-line algorithms, redundant number representation, square-root, SRT division
M.D. Ercegovac, T. Lang, "On-the-Fly Conversion of Redundant into Conventional Representations," IEEE Transactions on Computers, vol. 36, no. 7, pp. 895-897, July 1987, doi:10.1109/TC.1987.1676986
Usage of this product signifies your acceptance of the Terms of Use.