Microelectronics, Volume. 53, Issue 1, 109(2023)

Research on Equivalence Checking of Combinational Circuits Based on Improved SAT Solver Algorithm

QU Zhan1... LI Kang1, LIU Hongjin2, ZHANG Shaolin2, LI Bin2, ZHOU You2, SHI Jiangyi1 and QI Zhongdong1 |Show fewer author(s)
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • show less

    With the reduction of process nodes and the increase of complexity of integrated circuit scale, the logic equivalence check plays an important role in ensuring the correctness of design functions in the process of integrated circuit design. The logic equivalence checking technology of combinational circuits was studied in this paper. Aiming at the problems of DPLL and CDCL algorithms commonly used in this field, an improved algorithm based on Monte Carlo tree search was proposed to solve the satisfiable problem. Through the experiment on a subset of ISCAS85 test set, it is proved that the algorithm has a certain improvement on CDCL algorithm, and the average running time applied to combinational circuit equivalence check is reduced by about 20%.

    Tools

    Get Citation

    Copy Citation Text

    QU Zhan, LI Kang, LIU Hongjin, ZHANG Shaolin, LI Bin, ZHOU You, SHI Jiangyi, QI Zhongdong. Research on Equivalence Checking of Combinational Circuits Based on Improved SAT Solver Algorithm[J]. Microelectronics, 2023, 53(1): 109

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category:

    Received: Dec. 19, 2021

    Accepted: --

    Published Online: Dec. 15, 2023

    The Author Email:

    DOI:10.13911/j.cnki.1004-3365.210493

    Topics