This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Method to Simplify a Boolean Function into a Near Minimal Sum-of-Products for Programmable Logic Arrays
November 1978 (vol. 27 no. 11)
pp. 1028-1039
Z. Arevalo, Department of Electronic Engineering, Universidad Distrital
This paper describes an algorithm for minimizing an arbitrary Boolean function. The approach differs from most previous procedures in which first all prime implicants are found and then a minimal set is then determined. This procedure imposes a set of conditions on the selection of the next prime implicant in order to obtain a near minimal sum-of-products realization. Extension to the multiple output and incompletely specified function cases is given. An important characteristic of the proposed procedure is the relatively small amount of computer time spent to solve a problem, as compared to other procedures. The MINI algorithm may give better results for a large number of inputs and outputs if relatively few product terms are needed. This procedure is also well suited to find a solution for programmable logic arrays (PLA's) which internally implement large Boolean functions as a sum-of-products.
Index Terms:
programmable logic array (PLA's), Large-scale functions, multiple output combinational circuits, near minimal sum-of-products
Citation:
Z. Arevalo, J.G. Bredeson, "A Method to Simplify a Boolean Function into a Near Minimal Sum-of-Products for Programmable Logic Arrays," IEEE Transactions on Computers, vol. 27, no. 11, pp. 1028-1039, Nov. 1978, doi:10.1109/TC.1978.1674992
Usage of this product signifies your acceptance of the Terms of Use.