Survey on Exact Logic Synthesis Based on Boolean SATisfiability br

被引:0
|
作者
Chu, Zhufei [1 ]
Pan, Hongyang [1 ]
机构
[1] Ningbo Univ, Fac Elect Engn & Comp Sci EECS, Ningbo 315211, Peoples R China
关键词
Logic synthesis; Exact synthesis; Boolean SATisfiability (SAT); Majority logic;
D O I
10.11999/JEIT220391
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Logic synthesis is a critical step in the Electronic Design Automation(EDA). Traditional globalheuristic-based logic synthesis has many challenges as computing power keeps increasing and new computingparadigms emerge. There is a problem with heuristic algorithm in a suboptimal solution. As computing powerimproving, logic optimization is increasingly pursuing exact solutions rather than suboptimal solutions. First,the logic representations and the Boolean SATisfiability(SAT) problem are briefly described. Then, the researchprogress of exact synthesis in area optimization and depth optimization of Boolean logic network at two aspects,exact synthesis algorithm and encoding, are introduced. Finally, the future trends in exact synthesis are discussed
引用
下载
收藏
页码:14 / 23
页数:10
相关论文
共 31 条
  • [1] TOWARDS OPTIMAL LOGIC REPRESENTATIONS FOR IMPLICATION-BASED MEMRISTIVE CIRCUITS
    Chen, Lin
    Chu, Zhufei
    [J]. 2020 CHINA SEMICONDUCTOR TECHNOLOGY INTERNATIONAL CONFERENCE 2020 (CSTIC 2020), 2020,
  • [2] Advanced Functional Decomposition Using Majority and Its Applications
    Chu, Zhufei
    Soeken, Mathias
    Xia, Yinshui
    Wang, Lunyao
    De Micheli, Giovanni
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2020, 39 (08) : 1621 - 1634
  • [3] EEN N, 2007, PRACT SAT TUT APPL S
  • [4] ERNST E A, 2009, THESIS U MICHIGAN
  • [5] Exact Multiple-Control Toffoli Network Synthesis With SAT Techniques
    Grosse, Daniel
    Wille, Robert
    Dueck, Gerhard W.
    Drechsler, Rolf
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2009, 28 (05) : 703 - 715
  • [6] HAASWIJK W J, 2019, SAT BASED EXACT SYNT, DOI [10.5075/epfl-thesis-9404, DOI 10.5075/EPFL-THESIS-9404]
  • [7] HAASWIJK W J, 2016, 25 INT WORKSHOP LOGI
  • [8] SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism
    Haaswijk, Winston
    Soeken, Mathias
    Mishchenko, Alan
    De Micheli, Giovanni
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2020, 39 (04) : 871 - 884
  • [9] SAT Based Exact Synthesis using DAG Topology Families
    Haaswijk, Winston
    Mishchenko, Alan
    Soeken, Mathias
    De Micheli, Giovanni
    [J]. 2018 55TH ACM/ESDA/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2018,
  • [10] Classifying Functions with Exact Synthesis
    Haaswijk, Winston
    Testa, Eleonora
    Soeken, Mathias
    De Micheli, Giovanni
    [J]. 2017 IEEE 47TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2017), 2017, : 272 - 276