Crosstalk Computing-Based Gate-Level Reconfigurable Circuits

被引:2
|
作者
Macha, Naveen Kumar [1 ]
Repalle, Bhavana Tejaswini [1 ]
Iqbal, Md Arif [2 ]
Rahman, Mostafizur [2 ]
机构
[1] NVIDIA, Santa Clara, CA 95051 USA
[2] Univ Missouri, Dept Comp Sci Elect Engn, Kansas City, MO 64110 USA
关键词
Logic gates; Couplings; Transistors; Metals; Capacitance; Integrated circuit modeling; Crosstalk; Crosstalk (CT) circuits; crosstalk computing; polymorphic circuits; reconfigurable circuits; DESIGN;
D O I
10.1109/TVLSI.2022.3173344
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The functionality of polymorphic circuits can be altered using a control variable. Owing to the multifunctional embodiment in polymorphic circuits, they are helpful to reconfigure circuit behavior from the gate level to the system level, either on the fly or off-line. The polymorphic circuit approaches available in the literature are either based on custom nonlinear circuit designs or special emerging devices, such as ambipolar FET and configurable magnetic devices. While some of these approaches are inefficient in performance, the other approaches involve exotic devices. We have proposed a novel polymorphic circuit design approach based on crosstalk (CT) computing, where we leverage deterministic signal interference between nanometal lines for logic computation and reconfiguration. In this article, we elaborate upon the polymorphic circuit design in CT computing through mathematical formulation, which conveys the rationale to generalize and achieve a wide variety of polymorphic circuits, and then demonstrate a comprehensive list of polymorphic circuit designs. In addition, all circuits are characterized and benchmarked against CMOS circuit implementations to gauge the benefits. Finally, we compare the CT polymorphic circuit approach with other approaches in the literature and highlight its unique features and limitations. The ability to design a wide range of polymorphic logic circuits (basic and complex logics) compact in design and minimal in transistor count is unique to CT computing, which leads to benefits in the circuit power, performance, and area (PPA). Our circuit designs, simulation, and PPA characterization results show that the polymorphic CT circuits provide 3x improvement in transistor count, 2x improvement in switching energy, and 1.5x improvement in speed for polymorphic logic circuits. In the best-case, the transistor count reduction is 5x.
引用
收藏
页码:1073 / 1083
页数:11
相关论文
共 50 条
  • [21] An Equivalence Checking Algorithm Based on Cut-set Match of Gate-level Circuits
    Yue Yuan
    Tian Shuangliang
    PROCEEDINGS 2013 INTERNATIONAL CONFERENCE ON MECHATRONIC SCIENCES, ELECTRIC ENGINEERING AND COMPUTER (MEC), 2013, : 2344 - 2349
  • [22] Impact of subcircuit selection on the efficiency of CGP-based optimization of gate-level circuits
    Kocnova, Jitka
    Vasicek, Zdenek
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION), 2019, : 377 - 378
  • [23] Self-referential verification for gate-level implementations of arithmetic circuits
    Chang, YT
    Cheng, KT
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2004, 23 (07) : 1102 - 1112
  • [24] GATE-LEVEL SIMULATION
    DABREU, MA
    IEEE DESIGN & TEST OF COMPUTERS, 1985, 2 (06): : 63 - 71
  • [25] Self-referential verification of gate-level implementations of arithmetic circuits
    Chang, YT
    Cheng, KT
    39TH DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2002, 2002, : 311 - 316
  • [26] Gate-level modelling and verification of asynchronous circuits using CSPM and FDR
    Josephs, Mark B.
    ASYNC 2007: 13TH IEEE INTERNATIONAL SYMPOSIUM ON ASYNCHRONOUS CIRCUITS AND SYSTEMS, 2007, : 83 - 92
  • [27] Gate-Level Optimization of Polymorphic Circuits Using Cartesian Genetic Programming
    Gajda, Zbysek
    Sekanina, Lukas
    2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, : 1599 - 1604
  • [28] High Performance Gate-level Simulation with GP-GPU Computing
    Bertacco, Valeria
    Chatterjee, Debapriya
    2011 INTERNATIONAL SYMPOSIUM ON VLSI DESIGN, AUTOMATION AND TEST (VLSI-DAT), 2011, : 62 - 64
  • [29] Efficient verification of hazard-freedom in gate-level timed asynchronous circuits
    Nelson, CA
    Myers, CJ
    Yoneda, T
    ICCAD-2003: IEEE/ACM DIGEST OF TECHNICAL PAPERS, 2003, : 424 - 431
  • [30] POSET timing and its application to the synthesis and verification of gate-level timed circuits
    Myers, CJ
    Rokicki, TG
    Meng, THY
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1999, 18 (06) : 769 - 786