Generating the group of reversible logic gates

Journal of Physics A: Mathematical and General

Volumn 35, Issue 33, 2002, Pages 7063-7078

  De Vos, Alexis ^a   Raa, Birger ^a   Storme, Leo ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037162812     PISSN: 03054470     EISSN: None     Source Type: Journal    
DOI: 10.1088/0305-4470/35/33/307     Document Type: Article

References (42)

1. Bennett C 1973 Logical reversibility of computation IBM J. Res. Dev. 17 525-32
2. Bennett C and Landauer R 1985 The fundamental physical limits of computation Sci. Am. 253 (July) 38-46
3. Keyes R and Landauer R 1970 Minimal energy dissipation in logic IBM J. Res. Dev. 14 153-7
4. Landauer R 1961 Irreversibility and heat generation in the computational process IBM J. Res. Dev. 5 183-91
5. Stix G 1998 Riding the back of electrons Sci. Am. 279 (September) 20-1
6. Feynman R 1985 Quantum mechanical computers Opt. News 11 11-20
7. Feynman R 1996 Feynman Lectures on Computation ed A Hey and R Allen (Reading, MA: Addison-Wesley)
8. Toffoli T 1981 Bicontinuous extensions of invertible combinatorial functions Math. Syst. Theory 14 13-23
9. Barenco A, Bennett C, Cleve R, Di Vincenzo D, Margolus N, Shor P, Sleator T, Smolin J and Weinfurter H 1995 Elementary gates for quantum computation Phys. Rev. A 52 3457-67
10. Beckman D, Chari A, Devabhaktuni S and Preskill J 1996 Efficient networks for quantum factoring Phys. Rev. A 54 1034-63
11. De Vos A, Desoete B, Janiak F and Nogawski A 2001 Control gates for reversible computers Proc. 11th Int. Workshop on Power and Timing Modeling, Optimization and Simulation (Yverdon, Sept. 2001) 9.2.1-9.2.10
12. Desoete B and De Vos A A reversible carry-look-ahead adder using control gates Integr. VLSI J. in press
13. Nève A and Flandre D 2001 Branch-based logic for high performance carry-select adders in 0.25 μm bulk silicon-on-insulator CMOS technologies Proc. 11th Int. Workshop on Power and Timing Modeling, Optimization and Simulation (Yverdon, Sept. 2001) 8.2.1-8.2.10
14. pn Bol. Soc. Mat. Mex. 9 1-6
15. Kaloujnine L 1948 La structure des p-groupes de Sylow des groupes symétriques finis Ann. Sci. École Normale Supérieure 65 239-76
16. Kaloujnine L 1951 Ob odnom obobshenie Silovskich p-podgrup simmetrizjkisch grup Acta Math. Acad. Sci. Hung. 2 197-221
17. Weir A 1955 The Sylow subgroups of the symmetric groups Proc. Am. Math. Soc. 6 534-41
18. m Math. Nachr. 87 197-212
19. Hall M 1991 The Theory of Groups (Providence, RI: AMS Chelsea) pp 82-3
20. Butler G 1991 Fundamental Algorithms for Permutation Groups (Berlin: Springer) pp 78-87
21. Green D 1986 Modern Logic Design (Workingham: Addison-Wesley) pp 133-64
22. Aschbacher M and Scott L 1985 Maximal subgroups of finite groups J. Algebr. 92 44-80
23. Liebeck M, Praeger C and Saxl J 1987 A classification of the maximal subgroups of the finite alternating and symmetric groups J Algebr. 111 365-83
24. Rayner M and Newman D 1995 On the symmetry of logic J. Phys. A: Math. Gen. 28 5623-31
25. Storme L, De Vos A and Jacobs G 1999 Group theoretical aspects of reversible logic gates J. Universal Comput. Sci. 5 307-21
26. Kerntopf P 2000 On the efficiency of reversible (3,3)-gates Proc. 7th Int. Conf. on Mixed Design of Integrated Circuits and Systems (Gdynia, June 2000) pp 185-90
27. Perkowski M et al 2001 A general decomposition for reversible logic Proc. 2001 Reed-Muller Workshop (Starkville, Aug. 2001) pp 119-38
28. De Vos A 1996 Introduction to r-MOS systems Proc. 4th Workshop on Physics and Computation (Boston, Nov. 1996) pp 92-6
29. De Vos A 1997 Towards reversible digital computers Proc. European Conf. on Circuit Theory and Design (Budapest, Sept. 1997) pp 923-31
30. De Vos A 1999 Reversible computing Prog. Quantum Electron. 23 1-49
31. Zimmermann R and Fichtner W 1997 Low-power logic styles: CMOS versus pass-transistor logic IEEE J. Solid-State Circuits 32 1079-90
32. Younis S and Knight T 1994 Asymptotically zero energy split-level charge recovery logic Proc. IEEE Int. Workshop on Low Power Design (Napa Valley, April 1994) pp 177-82
33. Athas W, Tzartzanis N, Svensson L and Peterson L 1997 A low-power microprocessor based on resonant energy IEEE J. Solid-State Circuits 32 1693-701
34. Lim J, Kim D and Chae S 1999 A 16-bit carry-lookahead adder using reversible energy recovery logic for ultra-low-energy systems IEEE J. Solid-State Circuits 34 898-903
35. Raa B 2001 Reversibele logische poorten met behulp van controlepoorten MSc Thesis Universiteit Gent, Gent
36. Stewart I 1989 Galois Theory (London: Chapman and Hall) p 120
37. Yoeli M and Rosenfeld G 1965 Logical design of ternary switching circuits IEEE Trans. Electron. Comput. 14 19-29
38. Hurst S 1984 Multiple-valued logic - its status and its future IEEE Trans. Comput. 33 1160-79
39. Butler J 1991 Multiple-valued Logic in VLSI (New York: IEEE)
40. Mateo D and Rubio A 1998 Design and implementation of a 5 × 5 trits multiplier in a quasi-adiabatic ternary CMOS logic IEEE J. Solid-State Circuits 33 1111-6
41. Al-Rabadi A and Perkowski M 2001 New classes of multi-valued reversible decompositions for three-dimensional layout Proc. 2001 Reed-Muller Workshop (Starkville, Aug. 2001) pp 185-204
42. Schönert M 1992 GAP Comput. Algebr. Nede. Nieuwsbrief 9 19-28