Verification for Field-coupled Nanocomputing Circuits

被引:13
作者
Walter, Marcel [1 ]
Wille, Robert [2 ,3 ]
Torres, Frank Sill [4 ]
Grosse, Daniel [1 ,3 ]
Drechsler, Rolf [1 ,3 ]
机构
[1] Univ Bremen, Grp Comp Architecture, Bremen, Germany
[2] Johannes Kepler Univ Linz, Inst Integrated Circuits, Linz, Austria
[3] DFKI GmbH, Cyber Phys Syst, Bremen, Germany
[4] DLR, Dept Resilience Maritime Syst, Bremerhaven, Germany
来源
PROCEEDINGS OF THE 2020 57TH ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC) | 2020年
关键词
D O I
10.1109/dac18072.2020.9218641
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页数:6
相关论文
共 37 条
[1]  
Amaru L. G., 2015, The epfl combinational benchmark suite
[2]  
Anderson N. G., 2014, Field-coupled Nanocomputing:Paradigms, Progress, and Perspectives, V1st
[3]  
[Anonymous], 1965, Cramming more components onto integrated circuits
[4]   Quantum Transport in Gated Dangling-Bond Atomic Wires [J].
Bohloul, S. ;
Shi, Q. ;
Wolkow, Robert A. ;
Guo, Hong .
NANO LETTERS, 2017, 17 (01) :322-327
[5]  
BRAND D, 1993, 1993 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN - DIGEST OF TECHNICAL PAPERS, P534, DOI 10.1109/ICCAD.1993.580110
[6]  
Brayton R, 2010, LECT NOTES COMPUT SC, V6174, P24, DOI 10.1007/978-3-642-14295-6_5
[7]  
Brglez F., 1985, ISCAS, P685
[8]   USE: A Universal, Scalable, and Efficient Clocking Scheme for QCA [J].
Campos, Caio Araujo T. ;
Marciano, Abner L. ;
Vilela Neto, Omar P. ;
Torres, Frank Sill .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2016, 35 (03) :513-517
[9]   An extensible SAT-solver [J].
Eén, N ;
Sörensson, N .
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 :502-518
[10]  
Fazzion E., 2014, SBCCI