ACM Home Page
Please provide us with feedback. Feedback
A new heuristic algorithm for reversible logic synthesis
Full text PdfPdf (284 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 41st annual Design Automation Conference table of contents
San Diego, CA, USA
SESSION: New frontiers in logic synthesis table of contents
Pages: 834 - 837  
Year of Publication: 2004
ISBN:1-58113-828-8
Author
Pawel Kerntopf  Warsaw University of Technology, Warsaw, Poland
Sponsors
ACM: Association for Computing Machinery
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 47,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/996566.996789
What is a DOI?

ABSTRACT

Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small number of inputs and outputs. This paper proposes an approach to reversible logic synthesis using a new complexity measure based on shared binary decision diagrams with complemented edges (instead of truth tables or PPRM forms, as in the previous algorithms). The approach can be used with arbitrary libraries of reversible logic gates and arbitrary cost functions. Experiments show promising results in comparison with the known approaches.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Dueck, G. W., Maslov, D., and Miller, D. M. Transformation-based synthesis of networks of Toffoli/Fredkin gates. In IEEE Canadian Conference on Electrical and Computer Engineering, Montreal, Canada, May 2003.
3
 
4
 
5
Kerntopf, P. Binary decision diagrams based on single and multiple generalized Shannon expansions. In Proc. 6th International Symposium on Representations and Methodology of Future Computing Technology, Trier, Germany, March 2003, 183--190.
 
6
Khlopotine, A., Perkowski, M., and Kerntopf, P. Reversible logic synthesis by gate composition. In Notes of the 11th IEEE/ACM International Workshop on Logic and Synthesis, New Orleans, LA, June 2002, 261--266.
 
7
Maslov, D., and Dueck, G. W. Garbage in reversible design of multiple output functions. In Proc. 6th International Symposium on Representations and Methodology of Future Computing Technology, Trier, Germany, March 2003, 162--170.
 
8
Maslov, D., and Dueck, G. W. Asymptotically optimal regular synthesis of reversible logic networks. In Notes of the 12th IEEE/ACM International Workshop on Logic and Synthesis, Laguna Beach, CA, May 2003, 226--230.
 
9
Maslov, D., and Dueck, G. W. Templates for Toffoli network synthesis. In Notes of the 12th IEEE/ACM International Workshop on Logic and Synthesis, Laguna Beach, CA, June 2003, 320--325.
 
10
 
11
 
12
Miller, D. M., and Dueck, G. W. Spectral techniques for reversible logic synthesis. In Proc. 6th International Symposium on Representations and Methodology of Future Computing Technology, Trier, Germany, March 2003, 56--62.
13
 
14
Mishchenko, A., and Perkowski, M. Logic synthesis of reversible wave cascades. In Notes of the 11th IEEE/ACM International Workshop on Logic and Synthesis, New Orleans, LA, June 2002, 197--202.
 
15
Perkowski, M., Jozwiak, L., Kerntopf, P., Mishchenko, A., Al-Rabadi, A., Coppola, A., Buller, A., Xiaoyu Song, Khan, M. H. A., Yanushkevich, S. N., Shmerko, V. P., and Chrzanowska-Jeske, M. A General Decomposition for Reversible Logic. Proc. 5th International Workshop on Applications of Reed-Muller Expansion in Circuit Design, Starkville, MS, Aug. 2001, 119--138.
 
16
Shende, V. V., Prasad, A. K., Markov, I. L., and Hayes, J. P. Reversible logic circuit synthesis. IEEE Trans. CAD, 22, 6 (June 2003), 710--722.
 
17

CITED BY  12