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
关键词
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 条
  • [21] Encoding of Multilevel S-Threshold Functions
    Pantovic, Jovanka
    Ghilezan, Silvia
    Zunic, Jovisa
    JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING, 2016, 26 (1-2) : 89 - 108
  • [22] Effective Logic Synthesis for Threshold Logic Circuit Design
    Neutzling, Augusto
    Matos, Jody Maick
    Mishchenko, Alan
    Reis, Andre
    Ribas, Renato P.
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2019, 38 (05) : 926 - 937
  • [23] Minimal Contact Circuits for Symmetric Threshold Functions
    Red'kin, N. P.
    MATHEMATICAL NOTES, 2020, 108 (3-4) : 370 - 380
  • [24] Optimization of Threshold Logic Networks with Node Merging and Wire Replacement
    Chen, Yung-Chih
    Zheng, Li-Cheng
    Wong, Fu-Lian
    ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2019, 24 (06)
  • [25] On teaching sets of k-threshold functions
    Zamaraeva, Elena
    INFORMATION AND COMPUTATION, 2016, 251 : 301 - 313
  • [26] EFFICIENT MONOTONE CIRCUITS FOR THRESHOLD FUNCTIONS - COMMENT
    DUNNE, PE
    INFORMATION PROCESSING LETTERS, 1990, 34 (05) : 221 - 222
  • [27] Minimal Contact Circuits for Symmetric Threshold Functions
    N. P. Red’kin
    Mathematical Notes, 2020, 108 : 370 - 380
  • [28] A new method to identify threshold logic functions
    Mozaffari, Seyed Nima
    Tragoudas, Spyros
    Haniotakis, Themistoklis
    PROCEEDINGS OF THE 2017 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2017, : 934 - 937
  • [29] Asymptotics of the number of 2-threshold functions
    Zamaraeva, Elena
    Zunic, Jovisa
    INFORMATION AND COMPUTATION, 2021, 281
  • [30] Hardware Implementation of Artificial Neural Networks for Arbitrary Boolean Functions with Generalised Threshold Gate Circuits
    Nikodem, Maciej
    ADVANCES IN SOFT COMPUTING - MICAI 2010, PT II, 2010, 6438 : 303 - 314