ACM Home Page
Please provide us with feedback. Feedback
Fast synthesis of exact minimal reversible circuits using group theory
Full text PdfPdf (421 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2005 Asia and South Pacific Design Automation Conference table of contents
Shanghai, China
SESSION: Poster session I table of contents
Pages: 1002 - 1005  
Year of Publication: 2005
ISBN:0-7803-8737-6
Authors
Guowu Yang  Portland State University, Portland, OR
Xiaoyu Song  Portland State University, Portland, OR
William N. N. Hung  Portland State University, Portland, OR
Marek A. Perkowski  Portland State University, Portland, OR
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
: Shanghai IC Industry Association
: IEEE SSCS Shanghai Chapter
: IEEE CAS
: IEEE Beijing Section
: Fudan University
: Chinese Institute of Electronics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 22,   Citation Count: 3
Additional Information:

abstract   references   cited by   collaborative colleagues  

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

ABSTRACT

We present fast algorithms to synthesize exact minimal reversible circuits for various types of gates and costs. By reducing reversible logic synthesis problems to group theory problems, we use the powerful algebraic software GAP to solve such problems. Our algorithms are not only able to minimize for arbitrary cost functions of gates, but also orders of magnitude faster than the existing approaches to reversible logic synthesis. In addition, we show that the Peres gate is a better choice than the standard Toffoli gate in libraries of universal reversible gates.


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
T. Toffoli, Reversible computing, Tech. Memo MIT/LCS/TM-151, MIT Lab for Comp. Sci, 1980.
 
2
A. De Vos, B. Raa and L. Storme, "Generating the group of reversible logic gates," Journal of Physics A: Mathematical and General, 35, (2002), pages 7063--7078.
 
3
M. Perkowski, M. Lukac, M. Pivtoraiko, P. Kerntopf, M. Folgheraiter, "A hierarchical approach to computer aided design of quantum circuits," 6th International Symposium on Representations and Methodology of Future Computing Technology, pp. 201--209, Trier, Germany, March 2003.
4
 
5
L. Storme et al, "Group theoretical aspects of reversible logic gates," Journal of Universal Computer Science, 5 (1999), pp. 307--321.
 
6
J. D. Dixon, and B. Mortimer, Permutation Groups, Springer, New York, 1996.
 
7
M. I. Kargapolov, and Ju. I. Merzljakov, Fundamentals of the Theory of Groups, Springer-Verlag, New York, 1979.
 
8
M. Schonert et. al, GAP-Group, Algorithms, and Programming, Lehrstuhl D fur Mathematik, Rheinisch Westfalische Technische Hochschule, Aachen, Germany, fifth, 1995.
 
9
J. A. Smolin, and D. P. DiVincenzo, "Five two-bit quantum gates are sufficient to implement the quantum Fredkin gate," Physical Review A, 53 (1996), pp. 2855--2856.
 
10
G. Yang, W. N. N. Hung, X. Song, and M. Perkowski. "Majority-based reversible logic gate", 6th International Symposium on Representations and Methodology of Future Computing Technology, pp. 191--200, Trier, Germany, March 2003.
 
11
V. V. Shende, A. K. Prasad, I. L. Markov, and J. P. Hayes, "Synthesis of Reversible Logic Circuits", IEEE Trans. on Computer Aided Design of Integrated Circuits and Systems, Vol. 22, No. 6, June 2003, pp. 710--723.
 
12
S. Lee, J.-S. Lee, T. Kim., S.-J. Lee, J. Biamonte, and M. Perkowski, "The Cost of quantum gate Primitives", submitted to MVL Journal, 2004.
 
13
Technical report, Portland State University.

Collaborative Colleagues:
Guowu Yang: colleagues
Xiaoyu Song: colleagues
William N. N. Hung: colleagues
Marek A. Perkowski: colleagues