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 条

[41] ASYNCHRONOUS THRESHOLD NETWORKS
ALON, N
GRAPHS AND COMBINATORICS, 1985, 1 (04) : 305 - 310
[42] ON A METHOD OF DECOMPOSITION OF BOOLEAN FUNCTIONS INTO UNATE FUNCTIONS FOR SYNTHESIS WITH THRESHOLD LOGIC ELEMENTS
SARMA, D
DAS, SR
CHOUDHURY, AK
INTERNATIONAL JOURNAL OF CONTROL, 1966, 4 (04) : 365 - +
[43] A New Decomposition Algorithm for Threshold Synthesis and Generalization of Boolean Functions
Subirats, Jose L.
Jerez, Jose M.
Franco, Leonardo
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2008, 55 (10) : 3188 - 3196
[44] SYNTHESIS OF SYMMETRIC SWITCHING FUNCTIONS USING THRESHOLD LOGIC ELEMENTS
ROY, PKS
IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (03): : 359 - +
[45] MULTIGATE SYNTHESIS OF GENERAL BOOLEAN FUNCTIONS BY THRESHOLD LOGIC ELEMENTS
GHOSH, S
BASU, D
CHOUDHURY, AK
IEEE TRANSACTIONS ON COMPUTERS, 1969, C 18 (05) : 451 - +
[46] Qualitative analysis for recurrent neural networks with linear threshold transfer functions
Tan, KC
Tang, HJ
Zhang, WN
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2005, 52 (05) : 1003 - 1012
[47] Interactive Computation of Type-Threshold Functions in Collocated Gaussian Networks
Wang, Chien-Yi
Jeon, Sang-Woon
Gastpar, Michael
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (09) : 4765 - 4775
[48] Training neural networks with threshold activation functions and constrained integer weights
Plagianakos, VP
Vrahatis, MN
IJCNN 2000: PROCEEDINGS OF THE IEEE-INNS-ENNS INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOL V, 2000, : 161 - 166
[49] REALIZATION OF BOOLEAN FUNCTIONS OF ASYNCHRONOUS NETWORKS USING THRESHOLD ELEMENTS.
Lopin, V.N.
Lopin, N.N.
Soviet automatic control, 1980, 13 (01): : 73 - 76
[50] ITERATIVE REALIZATION OF THRESHOLD FUNCTIONS
WONG, E
IEEE TRANSACTIONS ON INFORMATION THEORY, 1964, 10 (04) : 401 - &

← 1 2 3 4 5 →