This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Examination of the Cost Function for Programmable Logic Arrays
August 1979 (vol. 28 no. 8)
pp. 586-590
T. Kobylarz, Department of Electrical Engineering, University of roleum and Minerals
Cost functions for combinational switching circuits are commonly defined as monotonically increasing functions of the number of gates and the number of inputs. The structure of programmable logic arrays (PLA's) is such that the cost is more aptly only dependent on gate quantity. The consequences of redefining cost for PLA's are studied with respect to covering algorithms. The major benefits are that a multiple output prime implicant (implicate) table can be viewed as a single output table and that minimal covers can be determined much more simply, especially for cyclic tables.
Index Terms:
programmable logic arrays (PLA's), Cost functions, cyclic tables, minimal covers, minimization, multiple output combinational circuits
Citation:
T. Kobylarz, A. Al-Najjar, "An Examination of the Cost Function for Programmable Logic Arrays," IEEE Transactions on Computers, vol. 28, no. 8, pp. 586-590, Aug. 1979, doi:10.1109/TC.1979.1675418
Usage of this product signifies your acceptance of the Terms of Use.