Verification for Field-coupled Nanocomputing Circuits

With the decline of Moore’s Law, several post-CMOS technologies are currently under heavy consideration. Promising candidates can be found in the class of Field-coupled Nanocomputing (FCN) devices as they allow for highest processing performance with tremendously low energy dissipation. With upcoming design automation in this domain, the need for formal verification approaches arises. Unfortunately, FCN circuits come with certain domain-specific properties that render conventional methods for the verification non-applicable. In this paper, we investigate this issue and propose a verification approach for FCN circuits that addresses this problem. For the first time, this provides researchers and engineers with an automatic method that allows them to check whether an obtained FCN circuit design indeed implements the given/desired function. A prototype implementation demonstrates the applicability of the proposed approach.

[1]  Robert K. Brayton,et al.  ABC: An Academic Industrial-Strength Verification Tool , 2010, CAV.

[2]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[3]  Earl E. Swartzlander,et al.  Design of Semiconductor QCA Systems , 2013 .

[4]  Robert Wille,et al.  An Energy-Aware Model for the Logic Synthesis of Quantum-Dot Cellular Automata , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Daniel Brand.  Verification of large synthesized designs , 1993, ICCAD.

[6]  José Augusto Miranda Nacif,et al.  A quantum-dot cellular automata processor design , 2014, 2014 27th Symposium on Integrated Circuits and Systems Design (SBCCI).

[7]  Robert Wille,et al.  Ignore Clocking Constraints: An Alternative Physical Design Methodology for Field-Coupled Nanotechnologies , 2019, 2019 IEEE Computer Society Annual Symposium on VLSI (ISVLSI).

[8]  W. Porod,et al.  Edge-Mode Resonance-Assisted Switching of Nanomagnet Logic Elements , 2015, IEEE Transactions on Magnetics.

[9]  Wolfgang Porod,et al.  Experimental Realization of a Nanomagnet Full Adder Using Slanted-Edge Magnets , 2013, IEEE Transactions on Magnetics.

[10]  Robert Wille,et al.  Synchronization of Clocked Field-Coupled Circuits , 2018, 2018 IEEE 18th International Conference on Nanotechnology (IEEE-NANO).

[11]  Robert Wille,et al.  An exact method for design exploration of quantum-dot cellular automata , 2018, 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[12]  José Augusto Miranda Nacif,et al.  Placement and Routing by Overlapping and Merging QCA Gates , 2018, 2018 IEEE International Symposium on Circuits and Systems (ISCAS).

[13]  Robert A. Wolkow,et al.  Quantum Transport in Gated Dangling-Bond Atomic Wires. , 2017, Nano letters.

[14]  MARCEL WALTER,et al.  A Placement & Routing for Tile-based Field-coupled Nanocomputing Circuits is NP-complete , 2019 .

[15]  Frank Sill,et al.  A Methodology for Standard Cell Design for QCA , 2016, 2016 IEEE International Symposium on Circuits and Systems (ISCAS).

[16]  Robert Wille,et al.  fiction: An Open Source Framework for the Design of Field-coupled Nanocomputing Circuits , 2019, ArXiv.

[17]  Fabrizio Riente,et al.  ToPoliNano: A CAD Tool for Nano Magnetic Logic , 2017, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[18]  Paul Molitor,et al.  Equivalence Checking of Digital Circuits: Fundamentals, Principles, Methods , 2007 .

[19]  Jing Huang,et al.  Tile-based QCA design using majority-like logic primitives , 2005, JETC.

[20]  Tsutomu Sasao,et al.  Logic Synthesis and Verification , 2013 .

[21]  Tsutomu Sasao,et al.  Logic Synthesis and Optimization , 1997 .

[22]  Robert A. Wolkow,et al.  Atomic White-Out: Enabling Atomic Circuitry through Mechanically Induced Bonding of Single Hydrogen Atoms to a Silicon Surface. , 2017, ACS nano.

[23]  Robert Wille,et al.  Scalable design for field-coupled nanocomputing circuits , 2019, ASP-DAC.

[24]  Omar P. Vilela Neto,et al.  USE: A Universal, Scalable, and Efficient Clocking Scheme for QCA , 2016, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[25]  Michael Bedford Taylor,et al.  A Landscape of the New Dark Silicon Design Regime , 2013, IEEE Micro.

[26]  Albert R. Wang,et al.  Logic verification using binary decision diagrams in a logic synthesis environment , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[27]  C. Lent,et al.  Power gain and dissipation in quantum-dot cellular automata , 2002 .

[28]  José Augusto Miranda Nacif,et al.  A Placement and routing algorithm for Quantum-dot Cellular Automata , 2016, 2016 29th Symposium on Integrated Circuits and Systems Design (SBCCI).

[29]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[30]  Robert Wille,et al.  Evaluating the Impact of Interconnections in Quantum-Dot Cellular Automata , 2018, 2018 21st Euromicro Conference on Digital System Design (DSD).

[31]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[32]  Giovanni De Micheli,et al.  The EPFL Combinational Benchmark Suite , 2015 .

[33]  Robert Wille,et al.  SWORD: A SAT like prover using word level information , 2007, VLSI-SoC.

[34]  Michael T. Niemier,et al.  Molecular cellular networks: A non von Neumann architecture for molecular electronics , 2016, 2016 IEEE International Conference on Rebooting Computing (ICRC).

[35]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[36]  Robert Wille,et al.  A Near Zero-Energy Computation Using Quantum-dot Cellular Automata , 2019 .

[37]  Sanjukta Bhanja,et al.  Field-Coupled Nanocomputing: Paradigms, Progress, and Perspectives , 2014 .