Synthesis of boolean functions in reversible logic

Synthesis Lectures on Digital Circuits and Systems

Volumn 26, Issue , 2010, Pages 79-96

  Wille, Robert ^a   Drechsler, Rolf ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b Department of Computer Architecture ^*

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIAL GROWTH; FAN-OUT; HEURISTIC APPROACH; LOGIC SYNTHESIS; LOW-POWER DESIGN; QUANTUM COMPUTATION; REVERSIBLE CIRCUITS; REVERSIBLE GATES; REVERSIBLE LOGIC; SYNTHESIS METHOD; TRADITIONAL COMPUTERS; TRUTH TABLES;

BINARY DECISION DIAGRAMS; COMPUTATIONAL LINGUISTICS; LOGIC CIRCUITS; LOGIC GATES; QUANTUM COMPUTERS; SYNTHESIS (CHEMICAL);

BOOLEAN FUNCTIONS;

EID: 76249101811     PISSN: 19323166     EISSN: 19323174     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (40)

1. A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVinchenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H.Weinfurter, "Elementary gates for quantum computation," The American Physical Society, 52:3457-3467, 1995. 4.2
2. C. H. Bennett, "Logical reversibility of computation," IBM J. Res. Dev, 17(6):525-532, 1973. 4.1
3. K. Brace, R. Rudell, and R. Bryant, "Efficient implementation of a BDD package," In Design Automation Conf., pages 40-45, 1990. DOI: 10.1145/123186.123222 4.6
4. R. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. on Comp., 35(8):677-691, 1986. DOI: 10.1109/TC.1986.1676819 4.6, 4.6
5. R. Cuykendall and D. R. Andersen, "Reversible optical computing circuits," Optics Letters, 12(7):542-544, 1987. DOI: 10.1364/OL.12.000542 4.1
6. B. Desoete and A. de Vos, "A reversible carry-look-ahead adder using control gates," INTEGRATION, the VLSI Jour., 33(1-2):89-104, 2002.DOI: 10.1016/S0167-9260(02)00051-2 4.1
7. N. Eén and N. Sörensson, "An extensible SAT solver," In SAT 2003, volume 2919 of LNCS, pages 502-518, 2004. DOI: 10.1007/b95238 4.4, 4.4
8. D. Y. Feinstein, M. A. Thornton, and D. M. Miller, "Partially redundant logic detection using symbolic equivalence checking in reversible and irreversible logic circuits," In Design, Automation and Test in Europe, pages 1378-1381, 2008. DOI: 10.1145/1403375.1403707 4.7
9. E. F. Fredkin and T. Toffoli, "Conservative logic," International Journal of Theoretical Physics, 21(3/4):219-253, 1982. DOI: 10.1007/BF01857727 4.2
10. D. Große, R.Wille,G.W.Dueck, and R.Drechsler, "Exact synthesis of elementary quantum gate circuits for reversible functions with don't cares," In Int'l Symp. on Multi-Valued Logic, pages 214-219, 2008. DOI: 10.1109/ISMVL.2008.42 4.4
11. D. Große, R. Wille, G. W. Dueck, and R. Drechsler, "Exact multiple control Toffoli network synthesis with SAT techniques," IEEE Trans. on CAD, 28(5):703-715, 2009. DOI: 10.1109/TCAD.2009.2017215 4.4
12. P. Gupta, A. Agrawal, and N. Jha, "An algorithm for synthesis of reversible logic circuits," IEEE Trans. on CAD, 25(11):2317-2330, 2006. DOI: 10.1109/TCAD.2006.871622 4.5, 4.6
13. W. Hung,X. Song, G.Yang, J.Yang, and M. Perkowski, "Optimal synthesis of multiple output Boolean functions using a set of quantum gates by symbolic reachability analysis," IEEETrans. on CAD, 25(9):1652-1663, 2006. DOI: 10.1109/TCAD.2005.858352 4.4
14. P. Kerntopf, "A new heuristic algorithm for reversible logic synthesis," In Design Automation Conf., pages 834-837, 2004. DOI: 10.1145/996566.996789 4.5, 4.6
15. R. Landauer, "Irreversibility and heat generation in the computing process," IBM J. Res. Dev., 5:183, 1961. 4.1
16. D. Maslov and G.W. Dueck, "Improved quantum cost for n-bit Toffoli gates," IEE ELECTRONICS LETTERS, 39:1790, 2004. DOI: 10.1049/el:20031202 4.2
17. D. Maslov and G. W. Dueck, "Reversible cascades with minimal garbage," IEEE Trans. on CAD, 23(11):1497-1509, 2004. DOI: 10.1109/TCAD.2004.836735 4.3, 4.5, 4.6
18. D. Maslov, G.W.Dueck, and D. M. Miller, "Toffoli network synthesis with templates," IEEE Trans. on CAD, 24(6):807-817, 2005. DOI: 10.1109/TCAD.2005.847911 4.5, 4.5, 4.6, 4.7
19. D. Maslov, C. Young, G. W. Dueck, and D. M. Miller, "Quantum circuit simplification using templates," In Design, Automation and Test in Europe, pages 1208-1213, 2005. DOI: 10.1109/DATE.2005.249 4.2 (Pubitemid 44172174)
20. R. C. Merkle, "Reversible electronic logic using switches," Nanotechnology, 4:21-40, 1993. DOI: 10.1088/0957-4484/4/1/002 4.1
21. D. M. Miller, D. Maslov, and G. W. Dueck, "A transformation based algorithm for reversible logic synthesis," In Design Automation Conf., pages 318-323, 2003. DOI: 10.1145/775832.775915 4.5, 4.5, 4.6
22. D. M. Miller, R. Wille, and G. W. Dueck, "Synthesizing reversible circuits for irreversible functions," In Euromicro Conf. on Digital System Design, pages 749-756, 2009. 4.3
23. M.Nielsen and I. Chuang,Quantum Computation andQuantum Information. Cambridge Univ. Press, 2000. 4.1, 4.2, 4.2
24. K. N. Patel, J. P. Hayes, and I. L. Markov, "Fault testing for reversible circuits," IEEE Trans. on CAD, 23(8):1220-1230, 2004. DOI: 10.1109/TCAD.2004.831576 4.7
25. A. Peres, "Reversible logic and quantum computers," Phys. Rev. A, (32):3266-3276, 1985. DOI: 10.1103/PhysRevA.32.3266 4.2
26. M. Perkowski, J. Biamonte, and M. Lukac, "Test generation and fault localization for quantum circuits," In Int'l Symp. on Multi-Valued Logic, pages 62-68, 2005. DOI: 10.1109/ISMVL.2005.46 4.7
27. I. Polian, T. Fiehn, B. Becker, and J. P. Hayes, "A family of logical fault models for reversible circuits," In Asian Test Symp., pages 422-427, 2005. DOI: 10.1109/ATS.2005.9 4.7
28. M. Saeedi, M. Sedighi, and M. S.Zamani, "A novel synthesis algorithm for reversible circuits," In Int'l Conf. on CAD, pages 65-68, 2007. DOI: 10.1109/ICCAD.2007.4397245 4.5, 4.6
29. V. V. Shende, S. S. Bullock, and I. L. Markov, "Synthesis of quantum-logic circuits," IEEE Trans. on CAD, 25(6):1000-1010, 2006. DOI: 10.1145/1120725.1120847 4.5, 4.6
30. V.V. Shende,A.K. Prasad, I. L. Markov, and J. P. Hayes, "Synthesis of reversible logic circuits," IEEE Trans. on CAD, 22(6):710-722, 2003. DOI: 10.1145/774572.774625 4.4, 4.5, 4.6
31. F. Somenzi, CUDD: CU Decision Diagram Package Release 2.3.1. University of Colorado at Boulder, 2001. 4.6, 4.6
32. T. Toffoli, "Reversible computing," In W. de Bakker and J. van Leeuwen, editors, Automata, Languages and Programming, page 632. Springer, 1980.Technical Memo MIT/LCS/TM-151, MIT Lab. for Comput. Sci. 4.1, 4.2
33. G. F.Viamontes, I. L. Markov, and J. P. Hayes, "Checking equivalence of quantum circuits and states," In Int'l Conf. on CAD, pages 69-74, 2007. DOI: 10.1109/ICCAD.2007.4397246 4.7
34. S.-A. Wang, C.-Y. Lu, I.-M. Tsai, and S.-Y. Kuo, "An XQDD-based verification method for quantum circuits," IEICE Transactions, 91-A(2):584-594, 2008. DOI: 10.1093/ietfec/e91-a.2.584 4.7
35. R.Wille and R. Drechsler, "BDD-based synthesis of reversible logic for large functions," In Design Automation Conf., pages 270-275, 2009. DOI: 10.1145/1629911.1629984 4.6
36. R.Wille, D. Große, G.W. Dueck, and R. Drechsler, "Reversible logic synthesis with output permutation," In VLSI Design, pages 189-194, 2009.DOI: 10.1109/VLSI.Design.2009.40 4.3
37. R.Wille,D.Große,S.Frehse,G.W.Dueck,andR.Drechsler,"Debugging ofToffoli networks," In Design, Automation and Test in Europe, pages 1284-1289, 2009. 4.7
38. R. Wille, D. Große, D. M. Miller, and R. Drechsler, "Equivalence checking of reversible circuits," In Int'l Symp. on Multi-Valued Logic, pages 324-330, 2009. DOI: 10.1109/ISMVL.2009.19 4.7
39. V. V. Zhirnov, R. K. Cavin, J. A. Hutchby, and G. I. Bourianoff, "Limits to binary logic switch scaling - a gedanken model," Proc. of the IEEE, 91(11):1934-1939, 2003. DOI: 10.1109/JPROC.2003.818324 4.1
40. J. Zhong and J. Muzio, "Using crosspoint faults in simplifying toffoli networks," In IEEE North-East Workshop on Circuits and Systems, pages 129-132, 2006. DOI: 10.1109/NEWCAS.2006.250942 4.7