
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
A Method to Simplify a Boolean Function into a Near Minimal SumofProducts for Programmable Logic Arrays
November 1978 (vol. 27 no. 11)
pp. 10281039
ASCII Text  x  
Z. Arevalo, J.G. Bredeson, "A Method to Simplify a Boolean Function into a Near Minimal SumofProducts for Programmable Logic Arrays," IEEE Transactions on Computers, vol. 27, no. 11, pp. 10281039, November, 1978.  
BibTex  x  
@article{ 10.1109/TC.1978.1674992, author = {Z. Arevalo and J.G. Bredeson}, title = {A Method to Simplify a Boolean Function into a Near Minimal SumofProducts for Programmable Logic Arrays}, journal ={IEEE Transactions on Computers}, volume = {27}, number = {11}, issn = {00189340}, year = {1978}, pages = {10281039}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1978.1674992}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Method to Simplify a Boolean Function into a Near Minimal SumofProducts for Programmable Logic Arrays IS  11 SN  00189340 SP1028 EP1039 EPD  10281039 A1  Z. Arevalo, A1  J.G. Bredeson, PY  1978 KW  programmable logic array (PLA's) KW  Largescale functions KW  multiple output combinational circuits KW  near minimal sumofproducts VL  27 JA  IEEE Transactions on Computers ER   
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 sumofproducts 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 sumofproducts.
Index Terms:
programmable logic array (PLA's), Largescale functions, multiple output combinational circuits, near minimal sumofproducts
Citation:
Z. Arevalo, J.G. Bredeson, "A Method to Simplify a Boolean Function into a Near Minimal SumofProducts for Programmable Logic Arrays," IEEE Transactions on Computers, vol. 27, no. 11, pp. 10281039, Nov. 1978, doi:10.1109/TC.1978.1674992
Usage of this product signifies your acceptance of the Terms of Use.