Exact toffoli network synthesis of reversible logic using boolean satisfiability

2006 IEEE Dallas/CAS Workshop onDesign, Applications, Integration and Software, DCAS-06

Volumn , Issue , 2006, Pages 51-54

  Große, Daniel ^a   Chen, Xiaobo ^a   Drechsler, Rolf ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; BOOLEAN ALGEBRA; FUNCTION EVALUATION; FUZZY LOGIC; ITERATIVE METHODS; LOGIC GATES; QUANTUM COMPUTERS; SOFTWARE DESIGN;

BOOLEAN SATISFIABILITY (SAT); CASCADE (CO); EXACT SYNTHESIS; EXPERIMENTAL RESULTS; ITERATIVE ALGORITHMS; LOW-POWER DESIGNS; MINIMALITY; NETWORK REPRESENTATIONS; QUANTUM COMPUTING; REVERSIBLE FUNCTIONS; REVERSIBLE LOGICS; SYNTHESIS (OF CHIRAL IONIC LIQUIDS); SYNTHESIS PROBLEMS; TOFFOLI GATES; TOFFOLI NETWORK SYNTHESIS;

BOOLEAN FUNCTIONS;

EID: 34748876694     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCAS.2006.321031     Document Type: Conference Paper

References (12)

1. S. Cook. The complexity of theorem proving procedures. In 3. ACM Symposium on Theory of Computing, pages 151-158, 1971.
2. N. Eén and N. Sörensson. An extensible SAT solver. In SAT 2003, volume 2919 of LNCS, pages 502-518, 2004.
3. E. Goldberg and Y. Novikov. BerkMin: a fast and robust SAT-solver. In Design, Automation and Test in Europe, pages 142-149, 2002.
4. T. Larrabee. Test pattern generation using Boolean satisfiability. IEEE Trans. on CAD, 11:4-15, 1992.
5. J. Marques-Silva and K. Sakallah. GRASP: A search algorithm for prepositional satisfiability. IEEE Trans. on Comp., 48(5):506-521, 1999.
6. D. Maslov, G. W. Dueck, and D. M. Miller. Toffoli network synthesis with templates. IEEE Trans. on CAD of Integrated Circuits and Systems, 24(6):807-817, 2005.
7. D. M. Miller and G. W. Dueck. Spectral techniques for reversible logic synthesis. In 6th International Symposium on Representations and Methodology of Future Computing Technogoly, pages 56-62, 2003.
8. 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.
9. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Design Automation Conf., pages 530-535, 2001.
10. M. A. Nielsen and I. Chuang. Quantum computation and quantum information. Cambridge University Press, 2000.
11. V. Shende, A. Prasad, I. Markov, and J. Hayes. Reversible logic circuit synthesis. In Int'l Conf. on CAD, pages pp. 353-360, 2002.
12. 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.