Abstract :
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.
Keywords :
Binary divider, binary redundant code, carry propagation, cellular array, combinatorial network, high-speed dividers, parallel adders, parallel counters, parallel dividers, parallel subtractors.; Adders; Binary codes; Cellular networks; Computer networks; Concurrent computing; Counting circuits; Delay; High performance computing; Iterative methods; Binary divider, binary redundant code, carry propagation, cellular array, combinatorial network, high-speed dividers, parallel adders, parallel counters, parallel dividers, parallel subtractors.;
