This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Networks of NOR-OR Gates for Functions of Three Variables
February 1972 (vol. 21 no. 2)
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.
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.
Citation:
Charles R. Baugh, 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, Feb. 1972, doi:10.1109/TC.1972.5008920
Usage of this product signifies your acceptance of the Terms of Use.