skip to main content
10.1145/3316781.3317801acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
research-article

Disjoint-Support Decomposition and Extraction for Interconnect-Driven Threshold Logic Synthesis

Published: 02 June 2019 Publication History

Abstract

Threshold logic circuits are artificial neural networks with their neuron outputs being binarized, thus amenable for efficient, multiplier-free, hardware implementation of machine learning applications. In the reviving threshold logic synthesis, this work lays the foundations of disjoint-support decomposition and extraction operation of threshold logic functions. They lead to a synthesis procedure for interconnect minimization of threshold logic circuits, an important, but not well addressed, objective in both neural network and nanometer circuit designs. Experimental results show that our method can efficiently and effectively reduce interconnect as well as weight/threshold value over highly optimized circuits, thus suitable for implementation using emerging technologies.

References

[1]
V. Beiu, J. M. Quintana, and M. J. Avedillo. Vlsi implementations of threshold logic-a comprehensive survey. IEEE Tran. on Neural Networks, 14(5):1217--1243, 2003.
[2]
Berkeley Logic Synthesis and Verification Group. ABC: A System for Sequential Synthesis and Verification. https://people.eecs.berkeley.edu/~alanmi/abc/.
[3]
E. P. Blair and C. S. Lent. Quantum-dot cellular automata: An architecture for molecular computing. In Proc. of SISPAD, pages 14--18, 2003.
[4]
Y.-C. Chen, R. Wang, and Y.-P. Chang. Fast synthesis of threshold logic networks with optimization. In Proc. of ASP-DAC, pages 486--491, 2016.
[5]
C.-C. Chi and J.-H. R. Jiang. Logic synthesis of binarized neural networks for efficient circuit implementation. In Proc. of ICCAD, pages 84:1--84:7, 2018.
[6]
M. Courbariaux, I. Hubara, D. Soudry, R. El-Yaniv, and Y. Bengio. Binarized neural networks: Training deep neural networks with weights and activations constrained to +1 or -1. In arXiv e-print:1602.02830, 2016.
[7]
Y. Crama and P. L. Hammer. Boolean Models and Methods in Mathematics, Computer Science, and Engineering. 2010.
[8]
D. Fan, M. Sharad, and K. Roy. Design and synthesis of ultralow energy spin-memristor threshold logic. IEEE Tran. on Nanotechnology, 13(3):574--583, 2014.
[9]
L. Gao, F. Alibart, and D. B. Strukov. Programmable cmos/memristor threshold logic. IEEE Tran. on Nanotechnology, 5(2):115--119, 2013.
[10]
T. Gowda, S. Leshner, S. Vrudhula, and G. Konjevod. Synthesis of threshold logic circuits using tree matching. In Proc. of ECCTD, pages 850--853, 2007.
[11]
P.-Y. Kuo, C.-Y. Wang, and C.-Y. Huang. On rewiring and simplification for canonicity in threshold logic circuits. In Proc. of ICCAD, pages 396--403, 2011.
[12]
C. Lageweg, S. Cotofana, and S. Vassiliadis. A linear threshold gate implementation in single electron technology. In Proceedings IEEE Computer Society Workshop on VLSI 2001. Emerging Technologies for VLSI Systems, pages 93--98, 2001.
[13]
N.-Z. Lee, H.-Y. Kuo, Y.-H. Lai, and J.-H. R. Jiang. Analytic approaches to the collapse operation and equivalence verification of threshold logic circuits. In Proc. of ICCAD, pages 1--8, 2016.
[14]
S.-Y. Lee, N.-Z. Lee, and J.-H. R. Jiang. Canonicalization of threshold logic representation and its applications. In Proc. of ICCAD, pages 85:1--85:8, 2018.
[15]
S. Muroga. Threhsold logic and its applications. 1971.
[16]
A. Neutzling, J. M. Matos, A. I. Reis, R. P. Ribas, and A. Mishchenko. Threshold logic synthesis based on cut pruning. In Proc. of ICCAD, pages 494--499, 2015.
[17]
A. Palaniswamy and S. Tragoudas. Improved threshold logic synthesis using implicant-implicit algorithms. ACM Journal on Emerging Technologies in Computing Systems, 10(3):21:1--21:32, 2014.
[18]
R. L. Rivest. Learning decision lists. Machine Learning, 2(3):229--246, 1987.
[19]
J. Subirats, J. Jerez, and L. Franco. A new decomposition algorithm for threshold synthesis and generalization of boolean functions. IEEE Tran. on Circuits and Systems I: Regular Papers, 55(10):3188--3196, 2008.
[20]
R. Zhang, P. Gupta, L. Zhong, and N. K. Jha. Threshold network synthesis and optimization and its application tonanotechnologies. IEEE Tran.on CAD, 24(1):107--118, 2004.

Cited By

View all
  • (2023)Don’t-Care-Based Logic Optimization for Threshold LogicIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.323656042:9(2980-2993)Online publication date: Sep-2023
  • (2021)1st-Order to 2nd-Order Threshold Logic Gate Transformation with an Enhanced ILP-based Identification MethodProceedings of the 26th Asia and South Pacific Design Automation Conference10.1145/3394885.3431558(469-474)Online publication date: 18-Jan-2021
  • (2021)Constraint Solving for Synthesis and Verification of Threshold Logic CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2020.301544140:5(904-917)Online publication date: May-2021
  • Show More Cited By

Index Terms

  1. Disjoint-Support Decomposition and Extraction for Interconnect-Driven Threshold Logic Synthesis

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      DAC '19: Proceedings of the 56th Annual Design Automation Conference 2019
      June 2019
      1378 pages
      ISBN:9781450367257
      DOI:10.1145/3316781
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      In-Cooperation

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 02 June 2019

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. decomposition
      2. extraction
      3. threshold logic

      Qualifiers

      • Research-article
      • Research
      • Refereed limited

      Conference

      DAC '19
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

      Upcoming Conference

      DAC '25
      62nd ACM/IEEE Design Automation Conference
      June 22 - 26, 2025
      San Francisco , CA , USA

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)9
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 27 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2023)Don’t-Care-Based Logic Optimization for Threshold LogicIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2023.323656042:9(2980-2993)Online publication date: Sep-2023
      • (2021)1st-Order to 2nd-Order Threshold Logic Gate Transformation with an Enhanced ILP-based Identification MethodProceedings of the 26th Asia and South Pacific Design Automation Conference10.1145/3394885.3431558(469-474)Online publication date: 18-Jan-2021
      • (2021)Constraint Solving for Synthesis and Verification of Threshold Logic CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2020.301544140:5(904-917)Online publication date: May-2021
      • (2020)Don’t-Care-Based Node Minimization for Threshold Logic Networks2020 57th ACM/IEEE Design Automation Conference (DAC)10.1109/DAC18072.2020.9218506(1-6)Online publication date: Jul-2020

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media