Issue No. 04 - April (1977 vol. 26)
S.H. Unger , Department of Electrical Engineering and Computer Science, Columbia University
It is shown how any combinational function that can be described by a flow table?or equivalently?is realizable in iterative form?can be realized in tree form. The propagation delay is then proportional to the logarithm of n, the number of inputs, while the logic complexity is a linear function of n. These results are related to various implementations of high-speed binary adders and a proposed new high-speed adder circuit.
Adders, binary adders, carry lookahead, combinational circuits, conditional sum, flow tables, high speed arithmetic units, iterative circuits, modular circuits, semi-groups, synthesis, tree circuits.
S. Unger, "Tree Realizations of Iterative Circuits," in IEEE Transactions on Computers, vol. 26, no. , pp. 365-383, 1977.