SyReC: A hardware description language for the specification and synthesis of reversible circuits

被引:19
作者
Wille, Robert [1 ,2 ]
Schonborn, Eleonora [3 ]
Soeken, Mathias [2 ,3 ]
Drechsler, Rolf [2 ,3 ]
机构
[1] Johannes Kepler Univ Linz, Inst Integrated Circuits, A-4040 Linz, Austria
[2] DFKI GmbH, Cyber Phys Syst, Bibliothekstr 1, D-28359 Bremen, Germany
[3] Univ Bremen, Inst Comp Sci, Bibliothekstr 1, D-28359 Bremen, Germany
关键词
Reversible logic; Hardware description languages; Synthesis; Optimization; LOGIC; LINES;
D O I
10.1016/j.vlsi.2015.10.001
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Although researchers and engineers originally focused on a preponderantly irreversible computing paradigm, alternative models receive more and more attention. Reversible computation is a promising example which has applications in many emerging technologies such as quantum computation or alternative directions for low-power design. Accordingly, the design of reversible circuits has become an intensely studied research area. In particular, the efficient synthesis of complex reversible circuits poses an important and difficult research question. Most of the solutions proposed thus far are based on pure Boolean function representations such as truth tables or decision diagrams. In this paper, we provide a comprehensive introduction to and present extensions for the hardware description language SyReC which allows for the specification and automatic synthesis of reversible circuits. Besides a detailed presentation of the language's concepts and operations, we additionally propose algorithms that optimize the resulting circuits with respect to different objectives. A case study on a RISC CPU as well as a thorough experimental evaluation of both, the synthesis approach and its optimizations, show the applicability and demonstrate the advantage of SyReC compared to other solutions based on Boolean function representations. (C) 2015 Published by Elsevier B.V.
引用
收藏
页码:39 / 53
页数:15
相关论文
共 49 条
[1]  
Abhari Ali, 2012, Scaffold: Quantum programming language
[2]  
Al-Wardi Z., 2015, REVERSIBLE COMPUTATI
[3]  
Axelsen HB, 2011, LECT NOTES COMPUT SC, V6601, P144, DOI 10.1007/978-3-642-19861-8_9
[4]   ELEMENTARY GATES FOR QUANTUM COMPUTATION [J].
BARENCO, A ;
BENNETT, CH ;
CLEVE, R ;
DIVINCENZO, DP ;
MARGOLUS, N ;
SHOR, P ;
SLEATOR, T ;
SMOLIN, JA ;
WEINFURTER, H .
PHYSICAL REVIEW A, 1995, 52 (05) :3457-3467
[5]   LOGICAL REVERSIBILITY OF COMPUTATION [J].
BENNETT, CH .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1973, 17 (06) :525-532
[6]   Experimental verification of Landauer's principle linking information and thermodynamics [J].
Berut, Antoine ;
Arakelyan, Artak ;
Petrosyan, Artyom ;
Ciliberto, Sergio ;
Dillenschneider, Raoul ;
Lutz, Eric .
NATURE, 2012, 483 (7388) :187-U1500
[7]  
Chuang ML, 2007, ASIA S PACIF DES AUT, P420
[8]   A reversible carry-look-ahead adder using control gates [J].
Desoete, B ;
De Vos, A .
INTEGRATION-THE VLSI JOURNAL, 2002, 33 (1-2) :89-104
[9]   RAPID SOLUTION OF PROBLEMS BY QUANTUM COMPUTATION [J].
DEUTSCH, D ;
JOZSA, R .
PROCEEDINGS OF THE ROYAL SOCIETY OF LONDON SERIES A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 1992, 439 (1907) :553-558
[10]  
Fazel K, 2007, IEEE PACIF, P202