Issue No.02 - February (1972 vol.21)
C. S. Chandersekaran , Department of Computer Science, University of Illinois, Urbana, Ill.; RCA, Computer Systems Division, Riverton, N. J. 08101.
Richard S. Swee , Department of Computer Science, University of Illinois, Urbana, Ill.; Honeywell, Inc., Waltham, Mass. 02154.
Saburo Muroga , Department of Computer Science, University of Illinois, Urbana, Ill. 61801.
Optimal networks consisting of NOR-OR gates (each gate produces the NOR and/or the OR of its inputs) are tabulated for all Boolean functions of three variables. Optimality is defined as minimizing first the number of gates and then the number of interconnections. The optimal networks were synthesized for each Boolean function by using an integer programming synthesis technique.
C. S. Chandersekaran, Richard S. Swee, Saburo Muroga, "Optimal Networks of NOR-OR Gates for Functions of Three Variables", IEEE Transactions on Computers, vol.21, no. 2, pp. 153-160, February 1972, doi:10.1109/TC.1972.5008920