Thermal Switching Error versus Delay Tradeoffs in Clocked QCA Circuits

S. Bhanja and S. Sarkar, “Thermal Switching Error versus Delay Tradeoffs in Clocked QCA Circuits”, Volume 16, Issue 5, pp. 528 – 541, IEEE Transactions on VLSI Systems, May 2008.

@ARTICLE{4459693,
title={Thermal Switching Error Versus Delay Tradeoffs in Clocked QCA Circuits},
author={Bhanja, S. and Sarkar, S.},
journal={Very Large Scale Integration (VLSI) Systems, IEEE Transactions on},
year={2008},
month={May },
volume={16},
number={5},
pages={528-541},
abstract={The quantum-dot cellular automata (QCA) model offers a novel nano-domain computing architecture by mapping the intended logic onto the lowest energy configuration of a collection of QCA cells, each with two possible ground states. A four-phased clocking scheme has been suggested to keep the computations at the ground state throughout the circuit. This clocking scheme, however, induces latency or delay in the transmission of information from input to output. In this paper, we study the interplay of computing error behavior with delay or latency of computation induced by the clocking scheme. Computing errors in QCA circuits can arise due to the failure of the clocking scheme to switch portions of the circuit to the ground state with change in input. Some of these non-ground states will result in output errors and some will not. The larger the size of each clocking zone, i.e., the greater the number of cells in each zone, the more the probability of computing errors. However, larger clocking zones imply faster propagation of information from input to output, i.e., reduced delay. Current QCA simulators compute just the ground state configuration of a QCA arrangement. In this paper, we offer an efficient method to compute the N-lowest energy modes of a clocked QCA circuit. We model the QCA cell arrangement in each zone using a graph-based probabilistic model, which is then transformed into a Markov tree structure defined over subsets of QCA cells. This tree structure allows us to compute the N-lowest energy configurations in an efficient manner by local message passing. We analyze the complexity of the model and show it to be polynomial in terms of the number of cells, assuming a finite neighborhood of influence for each QCA cell, which is usually the case. The overall low-energy spectrum of multiple clocking zones is constructed by concatenating the low-energy spectra of the individual clocking zones. We demonstrate how the model can be used to study the tradeoff betwee- n switching errors and clocking zones.},
keywords={cellular automata, clocks, quantum computing, quantum dotsMarkov tree structure, clocked quantum-dot cellular automata circuit, delay tradeoff, four-phased clocking, graph-based probabilistic model, information transmission latency, nano-domain computing architecture, quantum-dot cellular automata model, thermal switching error},
doi={10.1109/TVLSI.2007.915448},
ISSN={1063-8210}, }