A family of four procedures to compute the inverse 1/X of a given binary number X normalized between 0.5 and 1 is described. The quotient is obtained in redundant binary form, i.e., in a base 2 code in which digits can assume any positive or negative integer value. All methods here described can be implemented by combinatorial networks; the dividers realized in this way are very fast because all carry propagations take place at the same time.
No takes yet. Share an insight, caveat, or question.
R. Stefanelli (1972) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: