The Community for Technology Leaders
RSS Icon
Subscribe
Nov. 11, 1964 to Nov. 13, 1964
pp: 149-155
ABSTRACT
In this paper a method is presented for reducing the number of stages of logic in the realization of an arbitrary Boolean function when an upper bound exists on the fan-in at each gate. A procedure for obtaining the minimum stage realization of the function in sum of products form is first developed. The use of factoring to reduce the number of stages below this minimum is then described.
CITATION
G. L. Hicks, A. J. Bernstein, "On the minimum stage realization of switching functions using logic gates with limited fan-in", FOCS, 1964, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1964, pp. 149-155, doi:10.1109/SWCT.1964.21
8 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool