The Community for Technology Leaders
Green Image
Issue No. 01 - January (1970 vol. 19)
ISSN: 0018-9340
pp: 80-81
A. S. Farber , IBM Watson Research Ctr., Yorktown Heights, N. Y.; Responsive Data Processing Corporation, Mt, Kisco, N. Y.
E. S. Schlig , IBM Watson Research Ctr., Yorktown Heights, N. Y.
ABSTRACT
The use of published theorems on least times to perform arithmetic operations as aids in optimizing logic circuit designs is discussed. An illustrative example is presented involving the optimum maximum fan-in of circuits in a binary adder.
INDEX TERMS
CITATION

E. S. Schlig and A. S. Farber, "Mathematical ``Lower Bounds'' and the Logic Circuit Designer," in IEEE Transactions on Computers, vol. 19, no. , pp. 80-81, 1970.
doi:10.1109/TC.1970.5008905
85 ms
(Ver 3.3 (11022016))