A transformation based algorithm for reversible logic synthesis
Cached
Download Links
- [www.cs.york.ac.uk]
- [www.cecs.uci.edu]
- [www.cecs.uci.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | in Design Automation Conf |
| Citations: | 107 - 23 self |
BibTeX
@INPROCEEDINGS{Miller_atransformation,
author = {D. Michael Miller and Dmitri Maslov and Gerhard W. Dueck},
title = {A transformation based algorithm for reversible logic synthesis},
booktitle = {in Design Automation Conf},
year = {},
pages = {318--323}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
A digital combinational logic circuit is reversible if it maps each input pattern to a unique output pattern. Such circuits are of interest in quantum computing, optical computing, nanotechnology and low-power CMOS design. Synthesis ap-proaches are not well developed for reversible circuits even for small numbers of inputs and outputs. In this paper, a transformation based algorithm for the synthesis of such a reversible circuit in terms of n n Tof-foli gates is presented. Initially, a circuit is constructed by a single pass through the specication with minimal look-ahead and no back-tracking. Reduction rules are then ap-plied by simple template matching. The method produces near-optimal results for 3-input circuits and also produces very good results for larger problems.
Keyphrases
reversible logic synthesis reversible circuit synthesis ap-proaches reduction rule low-power cmos design digital combinational logic circuit input pattern good result 3-input circuit simple template matching quantum computing optical computing near-optimal result tof-foli gate small number single pas unique output pattern
