A Novel Transformation-Based Algorithm for Reversible Logic Synthesis

Authors:
Sishuang Wan;Hanwu Chen;Rujin Cao
Affiliations:
School of Computer Science and Engineering, Southeast University, Nanjing, China 210096;School of Computer Science and Engineering, Southeast University, Nanjing, China 210096;School of Computer Science and Engineering, Southeast University, Nanjing, China 210096
Venue:
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
Year:
2009

Citing 10
Cited 0

Reversible logic circuit synthesis

Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
A new heuristic algorithm for reversible logic synthesis

Proceedings of the 41st annual Design Automation Conference
Quantum logic synthesis by symbolic reachability analysis

Proceedings of the 41st annual Design Automation Conference
On the Behavior of Substitution-based Reversible Circuit Synthesis Algorithms: Investigation and Improvement

ISVLSI '07 Proceedings of the IEEE Computer Society Annual Symposium on VLSI
Fast exact Toffoli network synthesis of reversible logic

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
A novel synthesis algorithm for reversible circuits

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Quantified synthesis of reversible logic

Proceedings of the conference on Design, automation and test in Europe
A novel Toffoli network synthesis algorithm for reversible logic

Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Toffoli network synthesis with templates

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
An Algorithm for Synthesis of Reversible Logic Circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. This paper proposes an analogic selection sorting algorithm essentially based on the transformation-based algorithm. It uses an unweighted, undirected graph for the representation of all transformable paths. During the synthesis process, a sequence of transformations are performed to enable all the output patterns to appear in the right place. The whole process can be implemented by a sequence of Toffoli gates. In addition, a simplification algorithm is put forward to further optimize the generated circuit. The experimental results show that this algorithm, compared with other exact methods, can achieve optimal or nearly optimal solutions with less computation time. Furthermore, it is more easily understood and implemented.