نتایج جستجو برای: reversible computing
تعداد نتایج: 476730 فیلتر نتایج به سال:
We investigate parallelizable schemes for simulating dynamics of conservative systems admitting a decomposition into weakly coupled subsystems. A new method, related to Reversible Averaging [20], is introduced for constrained and unconstrained dynamics. Stability issues are discussed.
1
The notion of reversible computation is attracting increasing interest becauseof its applications in diverse fields, in particular the study of programmingabstractions for reliable systems. In this paper, we continue the study un-dertaken by Danos and Krivine on reversible CCS by defining a reversiblehigher-order π-calculus, called rhoπ. We prove that reversibility in our cal-<l...
In this paper, we introduce a new method to realize symmetric functions with reversible circuits. In contrast to earlier methods, our solution deploys a simple and regular cascade structure composed of low-cost gates which enables significant reductions with respect to quantum costs. However, the number of garbage outputs increases slightly. To overcome this, we next propose an optimized design...
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on the wires of a reversible circuit. We also show non-trivial lower bounds for the size of a minimum complete test set.
Designing of reversible circuit has become the promising area for researchers. The designing
This work in progress report proposes a new metric for estimating nearest neighbor cost at the reversible circuit level. This is in contrast to existing literature where nearest neighbor constraints are usually considered at the quantum circuit level. In order to define the metric, investigations on a state-of-the-art reversible to quantum mapping scheme have been conducted. From the retrieved ...
we introduce the notion ofstrongly $alpha$-reversible rings which is a strong version of$alpha$-reversible rings, and investigate its properties. we firstgive an example to show that strongly reversible rings need not bestrongly $alpha$-reversible. we next argue about the strong$alpha$-reversibility of some kinds of extensions. a number ofproperties of this version are established. it is shown ...
In the investigation of minimal machinery in reversible computing, we proved that each nondegenerate 2-state 3-symbol reversible logic element is logically universal. So far, a 2-state 4-symbol element called “rotary element” was shown to be logically universal in the framework of reversible logic element with memory. The main result in this paper not only improves the previous result with resp...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید