Fast exact toffoli network synthesis of reversible logic

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2007, Pages 60-64

  Wille, Robert ^a   Große, Daniel ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DESIGN; OPTICAL DATA PROCESSING; QUANTUM COMPUTERS;

BOOLEAN SATISFIABILITY; COMPUTER-AIDED DESIGN; EXACT ALGORITHMS; INTERNATIONAL CONFERENCES; LOW-POWER DESIGNS; OPTICAL COMPUTING; ORDERS-OF-MAGNITUDE; PROBLEM-SPECIFIC KNOWLEDGE; QUANTUM COMPUTING; RESEARCH AREA; REVERSIBLE LOGICS; SYNTHESIS PROCESS; SYNTHESIS TIME; TOFFOLI NETWORK SYNTHESIS;

LOGIC GATES;

EID: 50249129397     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2007.4397244     Document Type: Conference Paper

References (25)

1. M. A. Nielsen and I. Chuang, Quantum computation and quantum information. Cambridge University Press, 2000.
2. T. Toffoli, "Reversible computing," in Automata, Languages and Programming, W. de Bakker and J. van Leeuwen, Eds. Springer, 1980, p. 632, technical Memo MIT/LCS/TM-151, MIT Lab. for Comput. Sci.
3. V. Shende, A. Prasad, I. Markov, and J. Hayes, "Reversible logic circuit synthesis," in Int'l Conf. on CAD, 2002, pp. 353-360.
4. D. M. Miller and G. W. Dueck, "Spectral techniques for reversible logic synthesis," in 6th International Symposium on Representations and Methodology of Future Computing Technology, 2003, pp. 56-62.
5. P. Gupta, A. Agrawal, and N. Jha, "An algorithm for synthesis of reversible logic circuits," IEEE Trans. on CAD of Integrated Circuits and Systems, vol. 25, no. 11, pp. 2317-2330, 2006.
6. D. M. Miller, D. Maslov, and G. W. Dueck, "A transformation based algorithm for reversible logic synthesis," in Design Automation Conf., 2003, pp. 318-323.
7. D. Maslov, G. W. Dueck, and D. M. Miller, "Toffoli network synthesis with templates." IEEE Trans. on CAD of Integrated Circuits and Systems, vol. 24, no. 6, pp. 807-817, 2005.
8. 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." IEEE Trans. on CAD of Integrated Circuits and Systems, vol. 25, no. 9, pp. 1652-1663, 2006.
9. D. Große, X. Chen, G. Dueck, and R. Drechsler, "Exact SAT-based toffoli network synthesis," in Great Lakes Symp. VLSI, 2007, pp. 96-101.
10. M. Davis, G. Logeman, and D. Loveland, "A machine program for theorem proving," Comm. of the ACM, vol. 5, pp. 394-397, 1962.
11. J. Marques-Silva and K. Sakallah, "GRASP: A search algorithm for prepositional satisfiability," IEEE Trans. on Comp., vol. 48, no. 5, pp. 506-521, 1999.
12. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an efficient SAT solver," in Design Automation Conf., 2001, pp. 530-535.
13. N. Eén and N. Sörensson, "An extensible SAT solver," in SAT 2003, ser. LNCS, vol. 2919, 2004, pp. 502-518.
14. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. Rossum, S. Schulz, and R. Sebastiani, "The MathSAT 3 System," in Int. Conf. on Automated Deduction, 2005.
15. B. Dutertre and L. Moura, "The YICES SMT Solver," 2006, available at http://yices.csl.sri.com/.
16. G. Tseitin, "On the complexity of derivation in propositional calculus," in Studies in Constructive Mathematics and Mathematical Logic, Part 2, 1968, pp. 115-125,
17. (Reprinted in: J. Siekmann, G. Wrightson (Ed.), Automation of Reasoning, Vol. 2, Springer, Berlin, 1983, pp. 466-483.).
18. C. Barrett, D. Dill, and J. Levitt, "A decision procedure for bit-vector arithmetic," in Design Automation Conf, 1998, pp. 522-527.
19. J. Marques-Silva, "The impact of branching heuristics in propositional satisfiability algorithms," in 9th Portuguese Conference on Artificial Intelligence (EPIA), 1999.
20. R. Wille, G. Fey, D. Große, S. Eggersglüß, and R. Drechsler, "SWORD: A SAT like Prover Using Word Level Information," in Int'l Conference on Very Large Scale Integration, 2007.
21. S. Ranise and C. Tinelli, "The Satisfiability Modulo Theories Library (SMT-LIB)," www. SMT-LIB. org, 2006.
22. D. Maslov, Reversible Logic Synthesis Benchmarks Page, http://www.cs.uvic.ca/~dmaslov/.
23. A. Peres, "Reversible logic and quantum computers," Phys. Rev. A, no. 32, pp. 3266-3276, 1985.
24. E. F. Fredkin and T. Toffoli, "Conservative logic," International Journal of Theoretical Physics, vol. 21, no. 3/4, pp. 219-253, 1982.
25. D. M. Miller, "Spectral and two-place decomposition techniques in reversible logic," Midwest Symposium on Circuits and Systems, 2002.