On-the-Fly Conversion of Redundant into Conventional Representations
- 1 July 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (7) , 895-897
- https://doi.org/10.1109/tc.1987.1676986
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- Radix 16 SRT dividers with overlapped quotient selection stages: A 225 nanosecond double precision divider for the S-1 Mark IIBPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A division algorithm with prediction of quotient digitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A General Hardware-Oriented Method for Evaluation of Functions and Computations in a Digital ComputerIEEE Transactions on Computers, 1977
- On-Line Algorithms for Division and MultiplicationIEEE Transactions on Computers, 1977
- Higher-Radix Division Using Estimates of the Divisor and Partial RemaindersIEEE Transactions on Computers, 1968
- Minimal Square RootingIEEE Transactions on Electronic Computers, 1965
- Conditional-Sum Addition LogicIEEE Transactions on Electronic Computers, 1960
- A New Class of Digital Division MethodsIRE Transactions on Electronic Computers, 1958