Identification of Threshold Functions and Synthesis of Threshold Networks

被引：31

作者：

Gowda, Tejaswi ^{[1
]}

Vrudhula, Sarma ^{[1
]}

Kulkarni, Niranjan ^{[1
]}

Berezowski, Krzysztof ^{[2
]}

机构：

[1] Arizona State Univ, Dept Comp Sci & Engn, Tempe, AZ 85281 USA

[2] Wroclaw Univ Technol, Inst Comp Engn Control & Robot, PL-50317 Wroclaw, Poland

来源：

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | 2011年 / 30卷 / 05期

关键词：

Binary decision diagrams; Boolean algebra; Boolean function; logic design; logic optimization; logic synthesis; threshold function; threshold logic;

D O I：

10.1109/TCAD.2010.2100232

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents a new and efficient heuristic procedure for determining whether or not a given Boolean function is a threshold function, when the Boolean function is given in the form of a decision diagram. The decision diagram based method is significantly different from earlier methods that are based on solving linear inequalities in Boolean variables that derived from truth tables. This method's success depends on the ordering of the variables in the binary decision diagram (BDD). An alternative data structure, and one that is more compact than a BDD, called a max literal factor tree (MLFT) is introduced. An MLFT is a particular type of factoring tree and was found to be more efficient than a BDD for identifying threshold functions. The threshold identification procedure is applied to the MCNC benchmark circuits to synthesize threshold gate networks.

引用

页码：665 / 677

页数：13

共 50 条

[31] THRESHOLD AND FAN-IN REDUCTION ALGORITHM FOR THRESHOLD FUNCTIONS
LEFKOVITZ, D
PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1962, 50 (07): : 1709 - +
[32] COMPOSITION OF THRESHOLD FUNCTIONS
KNOEBEL, RA
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1972, 19 (02): : A399 - A400
[33] PROPERTIES OF THRESHOLD FUNCTIONS
WINDER, RO
IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1965, EC14 (02): : 252 - &
[34] A GENERALIZATION OF THRESHOLD FUNCTIONS
AIZENBERG, NN
IVASKIV, YL
POSPELOV, DA
DOKLADY AKADEMII NAUK SSSR, 1971, 196 (06): : 1287 - +
[35] REALIZATION OF A CLASS OF SWITCHING FUNCTIONS BY THRESHOLD-LOGIC NETWORKS
YAU, SS
OSTAPKO, DL
IEEE TRANSACTIONS ON COMPUTERS, 1968, C 17 (04) : 391 - +
[36] Threshold functions, node isolation, and emergent Lacunae in sensor networks
Kunniyur, Srisankar S.
Venkatesh, Santosh S.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) : 5352 - 5372
[37] Synthesis of testable networks based on controlled threshold elements
Tatur, MM
Sadykhov, RK
AUTOMATIC CONTROL AND COMPUTER SCIENCES, 1998, 32 (03) : 35 - 40
[38] Fast and optimal synthesis of binary threshold neural networks
Rhee, F
IEICE TRANSACTIONS ON COMMUNICATIONS, 2002, E85B (08) : 1608 - 1613
[39] THRESHOLD NETWORKS AND GENERALIZATIONS
GOLES, E
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 316 : 42 - 52
[40] PROPERTIES OF THRESHOLD NETWORKS
IMAMIYA, A
NOGUCHI, S
OIZUMI, J
ELECTRONICS & COMMUNICATIONS IN JAPAN, 1972, 55 (11): : 103 - 111

← 1 2 3 4 5 →