This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Derivation of Minimal Sums for Completely Specified Functions
March 1987 (vol. 36 no. 3)
pp. 277-292
R.B. Cutler, Department of Computer Science, University of Illinois, Urbana, and is currently with AT&T Bell Laboratories
Some new concepts in switching theory are pre sented. One of these is called an "abridged minterm base." We can use an abridged minterm base instead of the minterm expansion in conventional absolute minimization procedures. Since an abridged minterm base almost always has much fewer minterms than are in the minterm expansion, we can derive an abridged minterm base for many functions for which it is impossible to derive the minterm expansion. This paper also introduces the concept of generalized inclusion function Q(f) and its decomposition theorem Q(g)?Q(h) = Q(g V h). The theorem is very useful.
Index Terms:
Tison Method, Abridged minterm base, branch-and-bound method, inclusion function, minimum sum, Petrick function, presence function, programmable logic array, Quine- McCluskey method, switching theory
Citation:
R.B. Cutler, S. Muroga, "Derivation of Minimal Sums for Completely Specified Functions," IEEE Transactions on Computers, vol. 36, no. 3, pp. 277-292, March 1987, doi:10.1109/TC.1987.1676900
Usage of this product signifies your acceptance of the Terms of Use.