The Community for Technology Leaders
Green Image
Issue No. 02 - February (1972 vol. 21)
ISSN: 0018-9340
pp: 153-160
Charles R. Baugh , Department of Computer Science, University of Illinois, Urbana, Ill.; Bell Telephone Laboratories, Inc., Holmdel, N. J. 07733.
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.
ABSTRACT
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.
INDEX TERMS
CITATION

C. S. Chandersekaran, S. Muroga, C. R. Baugh and R. S. Swee, "Optimal Networks of NOR-OR Gates for Functions of Three Variables," in IEEE Transactions on Computers, vol. 21, no. , pp. 153-160, 1972.
doi:10.1109/TC.1972.5008920
88 ms
(Ver 3.3 (11022016))