Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/data-structures-and-algorithms-for-simplifying-reversible-circuits-HkGFepqxaX
References (25)
-
A. Barenco, C. Bennett, R. Cleve, D. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. Smolin, H. Weinfurter (1995)
Elementary gates for quantum computation.Physical review. A, Atomic, molecular, and optical physics, 52 5
-
D. Stroobandt, P. Verplaetse, J. Campenhout (1999)
Towards synthetic benchmark circuits for evaluating timing-driven CAD tools -
A. Vos, B. Raa, L. Storme (2002)
Generating the group of reversible logic gatesJournal of Physics A, 35
-
Charles Bennett (1973)
Logical reversibility of computationIbm Journal of Research and Development, 17
-
Abhinav Agrawal, N. Jha (2004)
Synthesis of reversible logicProceedings Design, Automation and Test in Europe Conference and Exhibition, 2
-
T. Cormen, C. Leiserson, R. Rivest, C. Stein (2001)
Introduction to Algorithms, 2nd edition. -
W. McKeeman (1965)
Peephole optimizationCommun. ACM, 8
-
F. MacWilliams, N. Sloane (1977)
The Theory of Error-Correcting Codes -
S. Lloyd (1995)
Quantum-Mechanical ComputersScientific American, 273
-
V. Zhirnov, R. Cavin, J. Hutchby, G. Bourianoff (2003)
Limits to binary logic switch scaling - a gedanken modelProc. IEEE, 91
-
V. Shende, Aditya Prasad, I. Markov, J. Hayes (2003)
Synthesis of reversible logic circuitsIEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 22
-
Lov Grover (1997)
A framework for fast quantum mechanical algorithms -
D. Maslov, G. Dueck, D. Miller (2003)
Simplification of Toffoli networks via templates16th Symposium on Integrated Circuits and Systems Design, 2003. SBCCI 2003. Proceedings.
-
O. Antoine, Berthet
Theory of Error-correcting Codes -
J. McGregor, R. Lee (2001)
Architectural enhancements for fast subword permutations with repetitions in cryptographic applicationsProceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001
-
T. Cormen (2001)
Introduction to algorithms [2nd ed.] -
P. Kerntopf (2004)
A new heuristic algorithm for reversible logic synthesisProceedings. 41st Design Automation Conference, 2004.
-
D. Maslov, G. Dueck, D. Miller (2003)
Fredkin/Toffoli templates for reversible logic synthesisICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486)
-
K. Iwama, Y. Kambayashi, S. Yamashita (2002)
Transformation rules for designing CNOT-based quantum circuitsProceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324)
-
J. Darnauer, W. Dai (1996)
A Method for Generation Random Circuits and Its Application to Routability MeasurementFourth International ACM Symposium on Field-Programmable Gate Arrays
-
J. Darringer, D. Brand, John Gerbi, W. Joyner, L. Trevillyan (1984)
LSS: A system for production logic synthesisIBM J. Res. Dev., 28
-
D. Miller, D. Maslov, G. Dueck (2003)
A transformation based algorithm for reversible logic synthesisProceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)
-
B. Desoete, A. Vos (2002)
A reversible carry-look-ahead adder using control gatesIntegr., 33
-
S. Younis, T. Knight (1994)
Asymptotically Zero Energy Split-Level Charge Recovery Logic -
J. Cong, Michail Romesis, M. Xie (2003)
Optimality, scalability and stability study of partitioning and placement algorithms
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2006 by ACM Inc.
- ISSN
- 1550-4832
- DOI
- 10.1145/1216396.1216399
- Publisher site
- See Article on Publisher Site
Abstract
Reversible logic is motivated by low-power design, quantum circuits, and nanotechnology. We develop a compact representation of small reversible circuits to generate and store optimal circuits for all 40,320 three-input reversible functions, and millions of four-input circuits. This allows implementing a function optimally in constant time for use in the peephole optimization of larger circuits produced by existing techniques, and guarantees that every three-bit subcircuit is optimal. To generate subcircuits, we use a graph-based data structure and algorithms for circuit restructuring. Finally, we demonstrate a suboptimal circuit for which peephole optimization fails.
Journal
ACM Journal on Emerging Technologies in Computing Systems (JETC) – Association for Computing Machinery
Published: Oct 1, 2006