ACM Home Page
Please provide us with feedback. Feedback
A novel Toffoli network synthesis algorithm for reversible logic
Full text PdfPdf (206 KB)
Source
Asia and South Pacific Design Automation Conference archive
Proceedings of the 2009 Asia and South Pacific Design Automation Conference table of contents
Yokohama, Japan
SESSION: Emerging design methodologies and applications table of contents
Pages 739-744  
Year of Publication: 2009
ISBN:978-1-4244-2748-2
Authors
Yexin Zheng  Virginia Tech, Blacksburg, VA
Chao Huang  Virginia Tech, Blacksburg, VA
Sponsors
: IEEE Circuits and Systems Society
SIGDA: ACM Special Interest Group on Design Automation
IEICE ESS : Institute of Electronics, Information and Communication Engineers - Engineering Sciences Society
IPSJ SIGSLDM : Information Processing Society of Japan - SIG System LSI Design Methodology
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 43,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input output correspondence which makes the logic synthesis for reversible functions differs greatly from traditional Boolean functions. Exact synthesis methods can provide optimal solutions in terms of the total number of reversible gates in the synthesis results. Unfortunately, they may suffer from long computation time, due to the fact that the search space is likely to grow exponentially as the circuit size increases. Therefore, in this paper, we propose an efficient synthesis heuristic which provides high quality synthesis results of Toffoli network in more reasonable computation time. We use a weighted, directed graph for reversible function representation and complexity measurement. The proposed algorithm maximally decreases function complexity during synthesis steps. It has the ability to climb out of local minimums and guarantees algorithm convergence. The experimental results show that our algorithm can achieve optimal or very close to optimal solutions with computation time several orders of magnitude less than the exact methods. Compared with other heuristics, our method demonstrates superior performance in terms of reversible gate count as well as computation time.


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
S. G. Younis and T. F. Knight, "Asymptotically zero energy split-level charge recovery logic," in Proc. Wkshp. Low Power Design, 1994, pp. 177--182.
 
2
 
3
R. C. Merkle, "Two types of mechanical reversible logic," Nanotechnology, vol. 4, no. 2, pp. 114--131, 1993.
 
4
R. Landauer, "Irreversibility and heat generation in the computing process," IBM J. Research & Development, vol. 5, no. 3, pp. 183--191, July 1961.
 
5
C. Bennett, "Logical reversibility of computation," IBM J. Research & Development, vol. 17, no. 6, pp. 525--532, Nov. 1973.
 
6
7
8
9
 
10
D. M. Miller and G. W. Dueck, "Spectral techniques for reversible logic synthesis," in Proc. Symp. Representations & Methodology of Future Computing Technologies, Mar. 2003, pp. 56--62.
11
 
12
D. Maslov, G. W. Dueck, and D. M. Miller, "Toffoli network synthesis with templates," IEEE Trans. Computer-Aided Design of Integrated Circuits & Systems, vol. 24, no. 6, pp. 807--817, June 2005.
 
13
P. Gupta, A. Agrawal, and N. K. Jha, "An algorithm for synthesis of reversible logic circuits," IEEE Trans. Computer-Aided Design of Integrated Circuits & Systems, vol. 25, no. 11, pp. 2317--2330, Nov. 2006.
 
14
 
15
T. Toffoli, "Reversible computing," Tech. Rep. MIT/LCS/TM-151, MIT Lab for Computer Science, 1980.
 
16
D. Maslov, Reversible logic synthesis benchmarks webpage, http://www.cs.uvic.ca/~dmaslov/.