Reversible Gates and Testability of One Dimensional Arrays of Molecular QCA

Agrawal V (1981) An information theoretic approach to digital fault testing. IEEE Trans Comput 30:582–587

Amlani I, Orlov A, Toth G, Lent C, Bernstein G, Snider G (1999) Digital logic gate using quantum-dot cellular automat. Science 284(5412):289–291, Apr

Antonelli DA, Chen DZ, Dysart TJ, Hu AB, Kahng XS, Kogge PM, Murphy RC, Niemier MT (2004) Quantum-dot cellular automata (qca) circuit partitioning: problem modeling and solutions. In: Proc. Design Automation Conference (DAC), pp 363–368

Bennett C (1973) Logic reversibilty of computation. IBM J Res Develop 17:525–532

Chakraborty A (2005) Synthesis of reversible circuits for testing with universal test set and c-testability of reversible iterative logic arrays. In: Proc. 18th Intl. Conf. VLSI Design

Compano R, Molenkamp L, Paul D (1999) Technology roadmap for nanoelectroincs. European Commission IST programme, Future and Emerging Technologies

Dimitrov V, Jullien G, Walus K (2002) Quantum-dot cellular automata carry-look-ahead adder and barrel shifter. In: IEEE Emerging Telecommunications Technologies Conference, pp 1–4, September

Fredkin E, Toffoli T (1982) Conservative logic. Int J Theor Phys 21:219–253

Frost S, Rodrigues A, Janiszewski A, Rausch R, Kogge P (2002) Memory in motion: a study of storage structures in qca. In: 1st Workshop on Non-Silicon Computation (NSC-1), held in conjunction with 8th Intl. Symp. on High Performance Computer Architecture (HPCA-8)

Hennessy K, Lent C (2001) Clocking of molecular quantum-dot cellular automata. J Vaccum Sci Technol 19(5):1752–1755

Landauer R (1961) Irreversibility and heat generation in the computing process. IBM J Res Develop 5:183–191

Lent CS, Liu M, Lu Y (2007) Bennett clocking of quantum-dot cellular automata and the limits to binary logic scaling. J Comput Electronics 17(16):4240–4251

Ma X, Huang J, Metra C, Lombardi F (2006) Reversible and testable circuits for molecular qca design, Northeastern University, ECE Department, Internal report

Maslov D, Dueck G, Miller D (2004) Synthesis of Fredkin–Toffoli reversible networks. IEEE Transcation VLSI 13(6):765–769

Muroga S (1971) Threshold logic and its applications. Wiley, New York

Nielsen M, Chuang I (2000) Quantum computation and quantum information. Cambridge Univ. Press

Niemier M, Kogge P (1999) Logic-in-wire: using quantum dots to implement a microprocessor. In: International Conference on Electronics, Circuits, and Systems (ICECS ’99) 3:1211–1215

Niemier M, Rodrigues A, Kogge P (2002) A potentially implementable fpga for quantum dot cellular automata. In: 1st Workshop on Non-Silicon Computation (NSC-1), held in conjunction with 8th Intl. Symp. on High Performance Computer Architecture (HPCA-8)

Patel K, Hayes J, Markov I (2004) Fault testing for revers ible circuits. IEEE Trans on CAD 23(8):1220–1230

Reversible logic synthesis benchmarks page, http://www.cs.uvic.ca/∼dmaslov

Tahoori M, Momenzadeh M, Huang J, Lombardi F (2004) Testing of quantum cellular automata. IEEE Trans Nanotechnol 3(4):432–442

Timler J, Lent, CS (2003) Maxwell’s demon and quantum dot cellular automata. J Appl Phys 94(2):1050–1060, Jul

Toffoli T (1980) Reversible computing. MIT laboratory for computer science. Technical Report MIT/LCS/TM-151, Feb

Tougaw P, Lent C (1994) Logical devices implemented using quantum cellular automata. J Appl Phys 75(3):1818–1825

Walus K, Budiman R, Jullien G (2002) Effects of morphological variations of self-assembled nanostructures on quantum-dot cellular automata (qca) circuits. In: Frontiers of integration, an international workshop on integrating nanotechnologies

Walus K, Jullien G, Dimitrov V (2003) Computer arithmetic structures for quantum cellular automata. In: Proc. Asimolar Conference

Walus K, Vetteth A, Jullien G, Dimitrov V (2003) Ram design using quantum-dot cellular automata. In: NanoTechnology Conference, vol 2, pp 160–163

Wang W, Zhang R, Walus K, Jullien GA (2004) A method of majority logic reduction for quantum cellular automata. IEEE Trans Nanotechnol 3(4):443–450