References that haven't yet been put into BibTeX format. Interesting ISLPED '96 papers. ------------------------------ Tzartzanis & Athas, p. 55 Athas et al., p. 101 De & Meindl, p. 371 Frank, p. 377 Interesting references from [De & Meindl, ISLPED '96] ----------------------------------------------------- R. T. Hinman and M. F. Schlecht, "Power Dissipation Measurements in Recovered Energy Logic," Symposium on VLSI Circuits: Dig. of Tech. Papers, pp. 19-20, Jun 1994 A. Kramer et al., "Adiabatic Computing with 2N-2N2D Logic Family," Symposium on VLSI Circuits: Dig. of Tech. Papers, pp. 25-26, Jun 1994 Y. Moon and D-K Jeong, "Efficient Charge Recovery Logic," Symposium on VLSI Circuits: Dig. of Tech. Papers, pp. 129-130, Jun 1995 V. K. De and J. D. Meindl, "Complementary Adiabatic and Fully Adiabatic MOS Logic Families for Gigascale Integration", ISSCC: Dig. of Tech. Papers, pp. 298-299, Feb 1996 J. B. Burr, "Cryogenic Ultra Low Power CMOS," 1995 Symp. on Low-Power Electronics: Dig. of Tech. Papers, pp. 82-83, Oct 1995 T. Indermaur and M. Horowitz, "Evaluation of Charge Recovery Circuits and Adiabatic Switching for Low Power CMOS Design," 1994 Symp. on Low-Power Electronics: Dig. of Tech. Papers, pp. 102-103, Oct 1994 S. G. Younis and T. F. Knight, Jr., "Non-Dissipative Rail Drivers for Adiabatic Circuits," Proc. 1995 Chapel Hill Conference on VLSI, pp. 404-414, 1995. Interesting refs. from [Frank, ISLPED '96] ------------------------------------------ P. Solomon and D. J. Frank, "The case for reversible computation," Proc. of 1994 Int'l Workshop on Low Power Design (Napa Valley, CA), pp. 93-98. A. Kramer, J. S. Denker, B. Flower, and J. Moroney, "2nd order adiabatic computation with 2N-2P and 2N-2N2P logic circuits," Proc. 1995 Int. Symp. Low Power Design (Dana Point, CA), pp. 191-196. Some Papers we Have ------------------- Boyd G. Watkins. "A Low-Power Multiphase Circuit Technique." IEEE Journal of Solid State Circuits, December 1967 (apparently). Describes what appears to be an adiabatic, asymptotically zero-energy, six-clock-phase circuit technique. This could be considered a seminal work on adiabatic logic. I did not notice the author stating anything about the technique implying logical reversibility. -mpf 9/30/96 Konstantin K. Likharev and Alexander N. Korotkov, "`Single-Electron Parametron': Reversible Computation in a Discrete-State System." Science 273:763-765, 9 Auguest 1996. Paper I saw recently in Science. This guy Likharev also wrote a paper analyzing reversibility using Josephson Junctions back in '82, already in our bib. About that earlier paper, Norm's thesis (p.29) says "Likharev, in [43], describes the use of reversible gates based on thermodynamically reversible Josephson junction devices. He concludes that these devices have sufficiently short relaxation times that switching speeds of 10^-9 seconds can be achieved with a dissipation of 0.01kT." It also shows the dissipation can be less than hbar/t, where t is the switching speed. This newer paper describes a different system in which the dissipation is greater than hbar/t though. Lov K. Grover, "How hard is to [sic] search an unsorted database containing N items? A quantum mechanical algorithm." This dude gave a nice talk at our POC seminar, & we had a nice lunch discussion with him. Main result: Quantum computers can search N items in sqrt(N) time. Bruce S. O. Adams , "A parallel reversible knowledge oriented language system for problem solving through programming." Master's thesis, University of Brunel, UK, September 1996. Among other things, introduces some high-level language constructs with reversible semantics. Interesting Refs seen in Misc. Papers ------------------------------------- W. Zurek, Ann. N.Y. Acad. Sci. 480, 89-97 (1986). Referred to by [Bennett '88, "Notes on the History of Reversible Computation"] as "a concise discussion [of] the relation of irreversibility to quantum measurement." Toffoli, Tommaso. "Computation and Construction Universality of Reversible Cellular Automata." Journal of Computer Systems Science 15:213--231, 1977. Referred to by Norm's thesis as first proof that reversible CA's could be computation universal.