Towards a design flow for reversible logic

Towards a Design Flow for Reversible Logic

Volumn , Issue , 2010, Pages 1-184

  Wille, Robert ^a   Drechsler, Rolf ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84891440217     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-90-481-9579-4     Document Type: Book

References (140)

1. S. Abramsky, A structural approach to reversible computation. Theor. Comput. Sci. 347(3), 441-464 (2005)
2. M. F. Ali, S. Safarpour, A. Veneris, M. S. Abadir, R. Drechsler, Post-verification debugging of hierarchical designs, in Int'l Conf. on CAD (2005), pp. 871-876
3. R. Brummayer, A. Biere, Boolector: An efficient SMT solver for bit-vectors and arrays, in Tools and Algorithms for the Construction and Analysis of Systems (2009), pp. 174-177
4. A. Barenco, C. H. Bennett, R. Cleve, D. P. Di Vinchenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, H. Weinfurter, Elementary, Elementary lementary gates for quantum computation. Am. Phys. Soc. 52, 3457-3467 (1995)
5. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. Rossum, S. Schulz, R. Sebastiani, The MathSAT 3 system, in Int. Conf. on Automated Deduction (2005), pp. 315-321
6. A. Biere, A. Cimatti, E. Clarke, Y. Zhu, Symbolic model checking without BDDs, in Tools and Algorithms for the Construction and Analysis of Systems. LNCS, vol. 1579 (Springer, Berlin, 1999), pp. 193-207
7. C. W. Barrett, D. L. Dill, J. R. Levitt, A decision procedure for bit-vector arithmetic, in Design Automation Conf. (1998), pp. 522-527
8. C. H. Bennett, Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525-532 (1973)
9. M. Benedetti, Kizzo: a suite to evaluate and certify QBFs, in Int'l Conf. on Automated Deduction (2005), pp. 369-376
10. J. Bergeron, Writing Testbenches Using Systemverilog (Springer, Berlin, 2006)
11. A. Biere, Resolve and expand, in Theory and Applications of Satisfiability Testing. LNCS, vol. 3542 (Springer, Berlin, 2005), pp. 59-70
12. D. Brand, Verification of large synthesized designs, in Int'l Conf. on CAD (1993), pp. 534-537
13. K. S. Brace, R. L. Rudell, R. E. Bryant, Efficient implementation of a BDD package, in Design Automation Conf. (1990), pp. 40-45
14. R. E. Bryant, Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677-691 (1986)
15. B. Bollig, I. Wegener, Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45(9), 993-1002 (1996)
16. R. Cuykendall, D. R. Andersen, Reversible optical computing circuits. Opt. Lett. 12(7), 542-544 (1987)
17. E. M. Clarke, A. Biere, R. Raimi, Y. Zhu, Bounded model checking using satisfiability solving. Form. Methods Syst. Des. 19(1), 7-34 (2001)
18. S. A. Cuccaro, T. G. Draper, S. A. Kutin, D. P. Moulton, A new quantum ripple-carry addition circuit, in Workshop on Quantum Information Processing (2005)
19. E. M. Clarke, O. Grumberg, D. Peled, Model Checking (MIT Press, Cambridge, 1999)
20. S. A. Cook, The complexity of theorem proving procedures, in Symposium on Theory of Computing (1971), pp. 151-158
21. A. Chakrabarti, S. Sur Kolay, Nearest neighbour based synthesis of quantum boolean circuits. Eng. Lett. 15, 356-361 (2007)
22. R. Drechsler, B. Becker, Binary Decision Diagrams-Theory and Implementation (Kluwer Academic, Dordrecht, 1998)
23. S. Deng, J. Bian, W. Wu, X. Yang, Y. Zhao, EHSAT: An efficient RTL satisfiability solver using an extended DPLL procedure, in Design Automation Conf. (2007), pp. 588-593
24. R. Drechsler, N. Drechsler, W. Günther, Fast exact minimization of BDDs. IEEE Trans. CAD 19(3), 384-389 (2000)
25. R. Drechsler, S. Eggersglüß, G. Fey, A. Glowatz, F. Hapke, J. Schloeffel, D. Tille, On acceleration of SAT-based ATPG for industrial designs. IEEE Trans. CAD 27, 1329-1333 (2008)
26. M. Davis, G. Logeman, D. Loveland, A machine program for theorem proving. Commun. ACM 5, 394-397 (1962)
27. B. Dutertre, L. Moura, A fast linear-arithmetic solver for DPLL (T), in Computer Aided Verification. LNCS, vol. 4114 (Springer, Berlin, 2006), pp. 81-94
28. B. Dutertre, L. Moura, The YICES SMT solver (2006). Available at http://yices. csl. sri.com
29. M. Davis, H. Putnam, A computing procedure for quantification theory. J. ACM 7, 506-521 (1960)
30. R. Drechsler, Advanced Formal Verification (Kluwer Academic, Dordrecht, 2004)
31. S. Disch, C. Scholl, Combinational equivalence checking using incremental SAT solving, output ordering, and resets, in ASP Design Automation Conf. (2007), pp. 938-943
32. B. Desoete, A. De Vos, A reversible carry-look-ahead adder using control gates. Integr. VLSI J. 33(1-2), 89-104 (2002)
33. R. Ebendt, G. Fey, R. Drechsler, Advanced BDD Optimization (Springer, Berlin, 2005)
34. N. Eén, N. Sörensson, An extensible SAT solver, in SAT 2003. LNCS, vol. 2919 (Springer, Berlin, 2004), pp. 502-518
35. A. G. Fowler, S. J. Devitt, L. C. L. Hollenberg, Implementation of Shor's algorithm on a linear nearest neighbour qubit array. Quantum Inf. Comput. 4, 237-245 (2004)
36. G. Fey, S. Safarpour, A. Veneris, R. Drechsler, On the relation between simulationbased and SAT-based diagnosis, in Design, Automation and Test in Europe (2006), pp. 1139-1144
37. E. F. Fredkin, T. Toffoli, Conservative logic. Int. J. Theor. Phys. 21(3/4), 219-253 (1982)
38. S. Frehse, R. Wille, R. Drechsler, Efficient simulation-based debugging of reversible logic, in Int'l Symp. on Multi-Valued Logic (2010), pp. 156-161
39. P. Gupta, A. Agrawal, N. K. Jha, An algorithm for synthesis of reversible logic circuits. IEEE Trans. CAD 25(11), 2317-2330 (2006)
40. D. Große, X. Chen, G. W. Dueck, R. Drechsler, Exact SAT-based Toffoli network synthesis, in ACM Great Lakes Symposium on VLSI (2007), pp. 96-101
41. V. Ganesh, D. L. Dill, A decision procedure for bit-vectors and arrays, in Computer Aided Verification (2007), pp. 519-531
42. T. Grötker, S. Liao, G. Martin, S. Swan, System Design with System C (Kluwer Academic, Dordrecht, 2002)
43. E. Goldberg, Y. Novikov, BerkMin: a fast and robust SAT-solver, in Design, Automation and Test in Europe (2002), pp. 142-149
44. S. Gay, R. Nagarajan, N. Papanikolaou, QMC: A model checker for quantum systems, in Computer Aided Verification (2008), pp. 543-547
45. D. Große, R. Wille, G. W. Dueck, R. Drechsler, Exact synthesis of elementary quantum gate circuits for reversible functions with don't cares, in Int'l Symp.. on Multi-Valued Logic (2008), pp. 214-219
46. D. Große, R. Wille, G. W. Dueck, R. Drechsler, Exact multiple control Toffoli network synthesis with SAT techniques. IEEE Trans. CAD 28(5), 703-715 (2009)
47. D. Große, R. Wille, G. W. Dueck, R. Drechsler, Exact synthesis of elementary quantum gate circuits. J. Mult.-Valued Log. Soft Comput. 15(4), 270-275 (2009)
48. D. W. Hoffmann, T. Kropf, Efficient design error correction of digital circuits, in Int'l Conf. on Comp. Design (2000), pp. 465-472
49. F. S. Hillier, G. J. Lieberman, Introduction to Operations Research (McGraw-Hill, New York, 2005)
50. W. N. N. Hung, X. Song, G. Yang, J. Yang, M. Perkowski, Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans. CAD 25(9), 1652-1663 (2006)
51. K. Iwama, Y. Kambayashi, S. Yamashita, Transformation rules for designing CNOT-based quantum circuits, in Design Automation Conf. (2002), pp. 419-424
52. J. C. Jung, S. Frehse, R. Wille, R. Drechsler, Enhancing debugging of multiple missing control errors in reversible logic, in Great Lakes Symp. VLSI (2010)
53. J. C. Jung, A. Sülflow, R. Wille, R. Drechsler, SWORD v1. 0, Satisfiability Modulo Theories Competition (2009)
54. P. Kerntopf, A new heuristic algorithm for reversible logic synthesis, in Design Automation Conf. (2004), pp. 834-837
55. M. H. A. Khan, Cost reduction in nearest neighbour based synthesis of quantum boolean circuits. Eng. Lett. 16, 1-5 (2008)
56. T. Kropf, Introduction to Formal Hardware Verification (Springer, Berlin, 1999)
57. S. A. Kutin, Shor's algorithm on a nearest-neighbor machine, in Asian Conference on Quantum Information Science (2006). arXiv:quant-ph/0609001v1
58. R. Landauer, Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183 (1961)
59. T. Larrabee, Test pattern generation using Boolean satisfiability. IEEE Trans. CAD 11, 4-15 (1992)
60. C.-C. Lin, K.-C. Chen, S.-C. Chang, M. Marek-Sadowska, K.-T. Cheng, Logic synthesis for engineering change, in Design Automation Conf. (1995), pp. 647-651
61. H. Liaw, C. Lin, On the OBDD-representation of general Boolean functions. IEEE Trans. Comput. 41, 661-664 (1992)
62. R. Lipsett, C. Schaefer, C. Ussery, VHDL: Hardware Description and Design (Kluwer Academic, Dordrecht, 1989)
63. J. P. Marques-Silva, The impact of branching heuristics in propositional satisfiability algorithms, in 9th Portuguese Conference on Artificial Intelligence (EPIA) (1999)
64. D. Maslov, Linear depth stabilizer and quantum fourier transformation circuits with no auxiliary qubits in finite neighbor quantum architectures. Phys. Rev. 76, 052310 (2007)
65. K. L. McMillan, Applying SAT methods in unbounded symbolic model checking, in Computer Aided Verification (2002), pp. 250-264
66. D. Maslov, G. W. Dueck, Improved quantum cost for n-bit Toffoli gates. IEE Electron. Lett. 39, 1790 (2004)
67. D. Maslov, G. W. Dueck, Reversible cascades with minimal garbage. IEEE Trans. CAD 23(11), 1497-1509 (2004)
68. D. Maslov, G. W. Dueck, D. M. Miller, Toffoli network synthesis with templates. IEEE Trans. CAD 24(6), 807-817 (2005)
69. D. Maslov, G. W. Dueck, D. M. Miller, Techniques for the synthesis of reversible Toffoli networks. ACM Trans. Des. Autom. Electron. Syst. 12(4), 42 (2007)
70. D. M. Miller, G. W. Dueck, R. Wille, Synthesising reversible circuits from irreversible specifications using Reed-Muller spectral techniques, in Int'l Workshop on Applications of the Reed-Muller Expansion in Circuit Design (2009), pp. 87-96
71. R. C. Merkle, Reversible electronic logic using switches. Nanotechnology 4, 21-40 (1993)
72. N. D. Mermin, Quantum Computer Science: An Introduction (Cambridge University Press, Cambridge, 2007)
73. M. M. Mano, C. R. Kime, Logic and Computer Design Fundamentals (Pearson Education, Upper Saddle River, 2004)
74. J. P. McGregor, R. B. Lee, Architectural enhancements for fast subword permutations with repetitions in cryptographic applications, in Int'l Conf. on Comp. Design (2001), pp. 453-461
75. D. M. Miller, D. Maslov, G. W. Dueck, A transformation based algorithm for reversible logic synthesis, in Design Automation Conf. (2003), pp. 318-323
76. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: Engineering an efficient SAT solver, in Design Automation Conf. (2001), pp. 530-535
77. G. E. Moore, Cramming more components onto integrated circuits. Electronics 38(8), 114-117 (1965)
78. J. P. Marques-Silva, K. A. Sakallah, GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506-521 (1999)
79. D. M. Miller, M. A. Thornton, QMDD: A decision diagram structure for reversible and quantum circuits, in Int'l Symp. on Multi-Valued Logic (2006), p. 6
80. D. M. Miller, M. A. Thornton, Multiple-Valued Logic: Concepts and Representations (Morgan and Claypool, San Rafael, 2008)
81. D. M. Miller, R. Wille, G. Dueck, Synthesizing reversible circuits for irreversible functions, in EUROMICRO Symp. on Digital System Design (2009), pp. 749-756
82. D. M. Miller, R. Wille, R. Drechsler, Reducing reversible circuit cost by adding lines, in Int'l Symp. on Multi-Valued Logic (2010)
83. D. Maslov, C. Young, G. W. Dueck, D. M. Miller, Quantum circuit simplification using templates, in Design, Automation and Test in Europe (2005), pp. 1208-1213
84. M. Nielsen, I. Chuang, Quantum Computation and Quantum Information (Cambridge Univ. Press, Cambridge, 2000)
85. S. Offermann, R. Wille, G. W. Dueck, R. Drechsler, Synthesizing multiplier in reversible logic, in IEEE Symp. on Design and Diagnostics of Electronic Circuits and Systems (2010), pp. 335-340
86. C. H. Papadimitriou, Computational Complexity (Addison Wesley, Reading, 1993)
87. M. R. Prasad, A. Biere, A. Gupta, A survey of recent advances in SAT-based formal verification. Softw. Tools Technol. Transf. 7(2), 156-173 (2005)
88. M. Perkowski, J. Biamonte, M. Lukac, Test generation and fault localization for quantum circuits, in Int'l Symp. on Multi-Valued Logic (2005), pp. 62-68
89. A. Peres, Reversible logic and quantum computers. Phys. Rev. A 32, 3266-3276 (1985)
90. I. Polian, T. Fiehn, B. Becker, J. P. Hayes, A family of logical fault models for reversible circuits, in Asian Test Symp. (2005), pp. 422-427
91. K. N. Patel, J. P. Hayes, I. L. Markov, Fault testing for reversible circuits. IEEE Trans. CAD 23(8), 1220-1230 (2004)
92. A. De Pierro, C. Hankin, H. Wiklicky, Reversible combinatory logic. Math. Struct. Comput. Sci. 16(4), 621-637 (2006)
93. A. O. Pittenger, An Introduction to Quantum Computing Algorithms (Birkhauser, Basel, 1999)
94. K. Patel, I. Markov, J. Hayes, Optimal synthesis of linear reversible circuits. Quantum Inf. Comput. 8(3-4), 282-294 (2008)
95. M. Ross, M. Oskin, Quantum computing. Commun. ACM 51(7), 12-13 (2008)
96. R. Rudell, Dynamic variable ordering for ordered binary decision diagrams, in Int'l Conf. on CAD (1993), pp. 42-47
97. J. A. Smolin, D. P. Di Vincenzo, Five two-bit quantum gates are sufficient to implement the quantum fredkin gate. Phys. Rev. A 53(4), 2855-2856 (1996)
98. S. Sutherland, S. Davidmann, P. Flake, System Verilog for Design and Modeling (Kluwer Academic, Dordrecht, 2004)
99. A. Sülflow, G. Fey, R. Bloem, R. Drechsler, Using unsatisfiable cores to debug multiple design errors, in Great Lakes Symp. VLSI (2008), pp. 77-82
100. C. E. Shannon, A symbolic analysis of relay and switching circuits. Trans. AIEE 57, 713-723 (1938)
101. P. W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in Foundations of Computer Science (1994), pp. 124-134
102. Z. Shi, R. B. Lee, Bit permutation instructions for accelerating software cryptography, in Int'l Conf. on Application-Specific Systems, Architectures, and Processors (2000), pp. 138-148
103. F. Somenzi, CUDD: Cu Decision Diagram Package Release 2. 3. 1 (University of Colorado at Boulder, Boulder, 2001)
104. V. V. Shende, A. K. Prasad, I. L. Markov, J. P. Hayes, Synthesis of reversible logic circuits. IEEE Trans. CAD 22(6), 710-722 (2003)
105. E. Sentovich, K. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. Stephan, R. Brayton, A. Sangiovanni-Vincentelli, SIS: A system for sequential circuit synthesis. Technical Report, University, University niversity of Berkeley (1992)
106. A. Smith, A. G. Veneris, M. F. Ali, A. Viglas, Fault diagnosis and logic debugging using boolean satisfiability. IEEE Trans. CAD 24(10), 1606-1621 (2005)
107. M. K. Thomson, R. Glück, Optimized reversible binary-coded decimal adders. J. Syst. Archit. 54, 697-706 (2008)
108. Y. Takahashi, N. Kunihiro, A linear-size quantum circuit for addition with no ancillary qubits. Quantum Inf. Comput. 5, 440-448 (2005)
109. T. Toffoli, Reversible computing, in Automata, Languages and Programming, ed. by W. de Bakker, J. van Leeuwen (Springer, Berlin, 1980), p. 632. Technical Memo MIT/LCS/TM-151, MIT Lab. for Comput. Sci.
110. H. Thapliyal, M. B. Srinivas, The need of DNA computing: reversible designs of adders and multipliers using fredkin gate, in SPIE (2005)
111. G. Tseitin, On the complexity of derivation in propositional calculus, in Studies in Constructive Mathematics and Mathematical Logic, Part 2 (Nauka, Leningrad, 1968), pp. 115-125. (Reprinted in: J. Siekmann, G. Wrightson (eds.), Automation of Reasoning, vol. 2, Springer, Berlin, 1983, pp. 466-483)
112. A. Veneris, I. N. Hajj, Design error diagnosis and correction via test vector simulation. IEEE Trans. CAD 18(12), 1803-1816 (1999)
113. G. F. Viamontes, I. L. Markov, J. P. Hayes, Checking equivalence of quantum circuits and states, in Int'l Conf. on CAD (2007), pp. 69-74
114. L. M. K. Vandersypen, M. Steffen, G. Breyta, C. S. Yannoni, M. H. Sherwood, I. L. Chuang, Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance. Nature 414, 883 (2001)
115. R. Wille, R. Drechsler, BDD-based synthesis of reversible logic for large functions, in Design Automation Conf. (2009), pp. 270-275
116. R. Wille, R. Drechsler, Effect of BDD optimization on synthesis of reversible and quantum logic. Electron. Notes Theor. Comput. Sci. 253(6), 57-70 (2010). Proceedings of the Workshop on Reversible Computation (RC 2009)
117. I. Wegener, Branching Programs and Binary Decision Diagrams: Theory and Applications (Society for Industrial and Applied Mathematics, Philadelphia, 2000)
118. R. Wille, G. Fey, D. Große, S. Eggersglüß, R. Drechsler, SWORD: A SAT like prover using word level information, in VLSI of System-on-Chip (2007), pp. 88-93
119. R. Wille, G. Fey, D. Große, S. Eggersglüß, R. Drechsler, SWORD: A SAT like prover using word level information, in VLSI-SoC: Advanced Topics on Systems on a Chip: A Selection of Extended Versions of the Best Papers of the Fourteenth International Conference on Very Large Scale Integration of System on Chip, ed. by R. Reis, V. Mooney, P. Hasler (Springer, Berlin, 2009), pp. 175-192
120. R. Wille, D. Große, Fast exact Toffoli network synthesis of reversible logic, in Int'l Conf. on CAD (2007), pp. 60-64
121. R. Wille, D. Große, G. Dueck, R. Drechsler, Reversible logic synthesis with output permutation, in VLSI Design (2009), pp. 189-194
122. R. Wille, D. Große, S. Frehse, G. W. Dueck, R. Drechsler, Debugging of Toffoli networks, in Design, Automation and Test in Europe (2009), pp. 1284-1289
123. R. Wille, D. Große, F. Haedicke, R. Drechsler, SMT-based stimuli generation in the SystemC verification library, in Forum on Specification and Design Languages (2009)
124. R. Wille, D. Große, D. M. Miller, R. Drechsler, Equivalence checking of reversible circuits, in Int'l Symp. on Multi-Valued Logic (2009), pp. 324-330
125. R. Wille, D. Große, M. Soeken, R. Drechsler, Using higher levels of abstraction for solving optimization problems by Boolean satisfiability, in IEEE Annual Symposium on VLSI (2008), pp. 411-416
126. R. Wille, D. Große, L. Teuber, G. W. Dueck, R. Drechsler, RevLib: an online resource for reversible functions and reversible circuits, in Int'l Symp. on Multi-Valued Logic (2008), pp. 220-225. RevLib is available at http://www.revlib.org
127. J. Whittemore, J. Kim, K. Sakallah, SATIRE: A new incremental satisfiability engine, in Design Automation Conf. (2001), pp. 542-545
128. R. Wille, H. M. Le, G. W. Dueck, D. Große, Quantified synthesis of reversible logic, in Design, Automation and Test in Europe (2008), pp. 1015-1020
129. S. A. Wang, C. Y. Lu, I. M. Tsai, S. Y. Kuo, An XQDD-based verification method for quantum circuits. IEICE Trans. 91-A (2), 584-594 (2008)
130. R. Wille, S. Offermann, R. Drechsler, SyReC: A programming language for synthesis of reversible circuits, in Forum on Specification and Design Languages (2010)
131. R. Wille, A. Sülflow, R. Drechsler, SWORD v0. 2-Module-based SAT Solving, Satisfiability Modulo Theories Competition (2008)
132. R. Wille, M. Saeedi, R. Drechsler, Synthesis of reversible functions beyond gate count and quantum cost, in Int'l Workshop on Logic Synth. (2009), pp. 43-49
133. R. Wille, M. Soeken, R. Drechsler, Reducing the number of lines in reversible circuits, in Design Automation Conf. (2010)
134. S. Yang, Logic synthesis and optimization benchmarks user guide. Technical Report 1/95, Microelectronic Center of North Carolina (1991)
135. T. Yokoyama, R. Glück, A reversible programming language and its invertible self-interpreter, in Symp. on Partial Evaluation and Semantics-based Program Manipulation (2007), pp. 144-153
136. J. Yuan, C. Pixley, A. Aziz, Constraint-based Verification (Springer, Berlin, 2006)
137. G. Yang, X. Song, W. N. N. Hung, M. A. Perkowski, Fast synthesis of exact minimal reversible circuits using group theory, in ASP Design Automation Conf. (2005), pp. 1002-1005
138. J. Yuan, K. Shultz, C. Pixley, H. Miller, A. Aziz, Modeling design constraints and biasing in simulation using BDDs, in Int'l Conf. on CAD (1999), pp. 584-590
139. J. Zhong, J. C. Muzio, Using crosspoint faults in simplifying Toffoli networks, in IEEE North-East Workshop on Circuits and Systems (2006), pp. 129-132
140. J. Zhang, S. Sinha, A. Mishchenko, R. Brayton, M. Chrzanowska-Jeske, Simulation and satisfiability in logic synthesis, in Int'l Workshop on Logic Synth. (2005), pp. 161-168.