This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Inverter-Minimum Networks
February 1987 (vol. 36 no. 2)
pp. 226-230
K. Nakamura, Control and Computing Laboratory, Kobe University of Mercantile Marine
Let Fm= (f1,...,fm) be a vector of m logical functions. Let Inv (Fm), the inversion complexity of Fm, be the minimum number of inverters required to realize Fm by a feed-forward network using AND gates, OR gates, and inverters.
Index Terms:
positive function, Inversion complexity, maximum inversions, minimum inverters, negative function, negative gate
Citation:
K. Nakamura, "Inverter-Minimum Networks," IEEE Transactions on Computers, vol. 36, no. 2, pp. 226-230, Feb. 1987, doi:10.1109/TC.1987.1676885
Usage of this product signifies your acceptance of the Terms of Use.