ABSOLUTE MINIMIZATION OF COMPLETELY SPECIFIED SWITCHING-FUNCTIONS

作     者：HONG, SJ MUROGA, S 

作者机构：UNIV ILLINOIS DEPT COMP SCI URBANA IL 61801 USA 

出 版 物：《IEEE TRANSACTIONS ON COMPUTERS》 (IEEE Trans Comput)

年 卷 期：1991年第40卷第1期

页      面：53-65页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：ABSOLUTE MINIMIZATION BASE INCLUSION FUNCTION MINIMUM SUM PRESENCE FUNCTION PROGRAMMABLE LOGIC ARRAY RATIO SET 

摘      要：For the automated design of PLA s with a minimum size, we need computationally efficient procedures that can minimize functions of a large number of variables. For such minimization procedures, excessively long processing time and excessively large memory requirement are major problems to overcome. This paper presents a new absolute minimization procedure for standard PLA s with reduced computation time and memory space. The improvement of the procedure, which is based on the decomposition of ratio sets, is mainly due to the detection of all essential prime implicants during the derivation of inclusion functions and also the merger of two separate procedures previously published by Cutler and Muroga [7] into one efficient procedure.