A Logic Verification Framework for SFQ and AQFP Superconducting Circuits

被引:3
|
作者
Fayyazi, Arash [1 ]
Munir, Mustafa [1 ]
Gopikanna, Aswin [1 ]
Nazarian, Shahin [1 ]
Pedram, Massoud [1 ]
机构
[1] Univ Southern Calif, Los Angeles, CA 90007 USA
基金
美国国家科学基金会;
关键词
Formal verification; superconducting circuits; ultradeep pipelining;
D O I
10.1109/TASC.2021.3119606
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Traditional logical equivalence checking (LEC), which plays a major role in the entire chip design process, faces challenges of meeting the requirements demanded by the many emerging technologies that are based on logic models different from the standard complementary metal oxide semiconductor (CMOS). In this article, we propose an LEC framework to be employed in the verification process of superconducting electronics (SCE). Our LEC framework is compatible with the existing CMOS technologies and can also check features and capabilities that are unique to SCE. For instance, the performance of nonresistively biased single-flux quantum (SFQ) circuits benefits from ultradeep pipelining, and verification of such circuits requires new models and algorithms. We, therefore, present the multicycle input dependency circuit model which is a novel model representation of design to explicitly capture the dependency of primary outputs of the circuit on sequences of internal signals and inputs. Embedding the proposed circuit model and several structural checking modules, the process of verification can be independent of the underlying technology and signaling. We benchmark the proposed framework on postsynthesis SFQ and 4-phase adiabatic quantum flux parametron netlists. Results show a comparative verification time of SFQ circuit benchmark, including 16-bit integer divider and ISCAS'85 circuits with respect to the ABC tool for similar CMOS circuits.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] SystemVerilog Modeling of SFQ and AQFP Circuits
    Tadros, Ramy N.
    Fayyazi, Arash
    Pedram, Massoud
    Beerel, Peter A.
    IEEE TRANSACTIONS ON APPLIED SUPERCONDUCTIVITY, 2020, 30 (02)
  • [2] Automated Verification and Optimization of SFQ Superconducting Circuits
    Haslam, Andrew M.
    English, Kurt M.
    Derrickson, Alexander
    Mcdonald, John F.
    IEEE ACCESS, 2019, 7 : 22843 - 22855
  • [3] Optimization and Verification of RSFQ and AQFP Logic Circuits Using JoSIM Tools
    Delport, Johannes A.
    Fourie, Coenrad J.
    IEEE TRANSACTIONS ON APPLIED SUPERCONDUCTIVITY, 2023, 33 (05)
  • [4] Circuit Description and Design Flow of Superconducting SFQ Logic Circuits
    Takagi, Kazuyoshi
    Kito, Nobutaka
    Takagi, Naofumi
    IEICE TRANSACTIONS ON ELECTRONICS, 2014, E97C (03) : 149 - 156
  • [5] Design and Verification of SFQ Cell Library for Superconducting LSI Digital Circuits
    Gao, Xiaoping
    Qiao, Qi
    Wang, Mingliang
    Niu, Minghui
    Liu, Huanli
    Maezawa, Masaaki
    Ren, Jie
    Wang, Zhen
    IEEE TRANSACTIONS ON APPLIED SUPERCONDUCTIVITY, 2021, 31 (05)
  • [6] qEC: A Logical Equivalence Checking Framework Targeting SFQ Superconducting Circuits
    Fayyazi, Arash
    Nazarian, Shahin
    Pedram, Massoud
    2019 IEEE INTERNATIONAL SUPERCONDUCTIVE ELECTRONICS CONFERENCE (ISEC), 2019,
  • [7] BOMIG: A Majority Logic Synthesis Framework for AQFP Logic
    Fu, Rongliang
    Huang, Junying
    Wang, Mengmeng
    Nobuyuki, Yoshikawa
    Yu, Bei
    Ho, Tsung-Yi
    Chen, Olivia
    2023 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, DATE, 2023,
  • [8] NAND gate for SFQ logic circuits
    Myoren, H
    Ono, S
    Takada, S
    IEICE TRANSACTIONS ON ELECTRONICS, 2000, E83C (01) : 81 - 84
  • [9] Algebraic and Boolean Optimization Methods for AQFP Superconducting Circuits
    Testa, Eleonora
    Lee, Siang-Yun
    Riener, Heinz
    De Micheli, Giovanni
    2021 26TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC), 2021, : 779 - 785
  • [10] Algebraic and Boolean Methods for SFQ Superconducting Circuits
    Calvino, Alessandro Tempia
    De Micheli, Giovanni
    29TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, ASP-DAC 2024, 2024, : 588 - 593