MINI - HEURISTIC APPROACH FOR LOGIC MINIMIZATION

被引:124
作者
HONG, SJ
CAIN, RG
OSTAPKO, DL
机构
[1] IBM CORP, SYST DEV DIV LAB, POUGHKEEPSIE, NY 12602 USA
[2] IBM CORP, SYST PROD DIV LAB, POUGHKEEPSIE, NY 12602 USA
关键词
D O I
10.1147/rd.185.0443
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:443 / 458
页数:16
相关论文
共 19 条
[1]   A METHOD FOR FAST APPROXIMATE SOLUTION OF LARGE PRIME IMPLICANT CHARTS [J].
BOWMAN, RM ;
MCVEY, ES .
IEEE TRANSACTIONS ON COMPUTERS, 1970, C 19 (02) :169-&
[2]  
CARROLL CC, 1968, AD680305 AUB U PROJ
[3]   COMPLEMENTATION OF BOOLEAN FUNCTIONS [J].
HONG, SJ ;
OSTAPKO, DL .
IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (09) :1022-&
[4]   MINIMIZATION OF BOOLEAN FUNCTIONS [J].
MCCLUSKEY, EJ .
BELL SYSTEM TECHNICAL JOURNAL, 1956, 35 (06) :1417-1444
[5]  
MICHALSKI RS, 1969, 5TH P INT S INF PROC, V3, P125
[6]  
MICHALSKI RS, 1971, 1971 P INT FED INF P, P158
[7]  
MILLER RE, 1965, SWITCHING THOERY, V1
[9]   PARTITIONED LIST ALGORITHMS FOR PRIME IMPLICANT DETERMINATION FROM CANONICAL FORMS [J].
MORREALE, E .
IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (05) :611-&
[10]   GENERATING TEST EXAMPLES FOR HEURISTIC BOOLEAN MINIMIZATION [J].
OSTAPKO, DL ;
HONG, SJ .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1974, 18 (05) :459-464