The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] reversible logic(5hit)

1-5hit
  • New Bounds for Quick Computation of the Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits Open Access

    Takashi HIRAYAMA  Rin SUZUKI  Katsuhisa YAMANAKA  Yasuaki NISHITANI  

     
    PAPER

      Pubricized:
    2024/05/10
      Vol:
    E107-D No:8
      Page(s):
    940-948

    We present a time-efficient lower bound κ on the number of gates in Toffoli-based reversible circuits that represent a given reversible logic function. For the characteristic vector s of a reversible logic function, κ(s) closely approximates σ-lb(s), which is known as a relatively efficient lower bound in respect of evaluation time and tightness. The primary contribution of this paper is that κ enables fast computation while maintaining a tightness of the lower bound, approximately equal to σ-lb. We prove that the discrepancy between κ(s) and σ-lb(s) is at most one only, by providing upper and lower bounds on σ-lb in terms of κ. Subsequently, we show that κ can be calculated more efficiently than σ-lb. An algorithm for κ(s) with a complexity of 𝓞(n) is presented, where n is the dimension of s. Experimental results comparing κ and σ-lb are also given. The results demonstrate that the two lower bounds are equal for most reversible functions, and that the calculation of κ is significantly faster than σ-lb by several orders of magnitude.

  • A Lower Bound on the Gate Count of Toffoli-Based Reversible Logic Circuits

    Takashi HIRAYAMA  Hayato SUGAWARA  Katsuhisa YAMANAKA  Yasuaki NISHITANI  

     
    PAPER-Reversible/Quantum Computing

      Vol:
    E97-D No:9
      Page(s):
    2253-2261

    We present a new lower bound on the number of gates in reversible logic circuits that represent a given reversible logic function, in which the circuits are assumed to consist of general Toffoli gates and have no redundant input/output lines. We make a theoretical comparison of lower bounds, and prove that the proposed bound is better than the previous one. Moreover, experimental results for lower bounds on randomly-generated reversible logic functions and reversible benchmarks are given. The results also demonstrate that the proposed lower bound is better than the former one.

  • Adiabatic Charging Reversible Logic Using a Switched Capacitor Regenerator

    Shunji NAKATA  

     
    PAPER

      Vol:
    E87-C No:11
      Page(s):
    1837-1846

    This report describes a concrete method for realizing adiabatic charging reversible logic. First, we investigate the stabilization properties of a charge recycle regenerator using a switched capacitor circuit by SPICE simulation and an analytical method. In the N-step case, we proved that a step waveform is spontaneously generated. Next, for combinational logic, we propose an adiabatic charging binary decision diagram logic gate (AC-BDD) that uses this regenerator. The AC-BDD uses pass transistor logic based on a BDD, which is suitable for adiabatic logic. 8-bit AC-BDD multipliers were fabricated, and it is clarified that power consumption is reduced to 15% that of the same-rule-designed CMOS at 1 V and 1 MHz. Finally, we propose clocked energy reversible logic (CERL) that maintains the CMOS architecture for CMOS compatibility. CERL can reduce the clocked energy, which is used for charging the clock load capacitance, to 10% that of CMOS by using a power clock from the charge recycle regenerator.

  • Simple Universal Reversible Cellular Automata in Which Reversible Logic Elements Can Be Embedded

    Kenichi MORITA  Tsuyoshi OGIRO  

     
    INVITED PAPER

      Vol:
    E87-D No:3
      Page(s):
    650-656

    A reversible cellular automaton (RCA) is a computing model having a property analogous to physical reversibility. We investigate the problem of finding simple RCAs in which any circuit composed of rotary elements (REs) can be embedded. Since an RE is known to be a universal reversible logic element, such RCAs are also universal in this respect. In this paper, after giving a survey of known results on RE and its implementation in RCAs, we propose a new RCA model in which REs and some signal routing elements can be embedded. The new model has a simpler local transition function (in the sense it is described by fewer rules) than the previous one, though the number of states is the same. In addition, the patterns realizing an RE and signal routing elements are smaller than those of the previous model.

  • Reversible Energy Recovery Logic Circuits and Its 8-Phase Clocked Power Generator for Ultra-Low-Power Applications

    Joonho LIM  Dong-Gyu KIM  Soo-Ik CHAE  

     
    PAPER-Integrated Electronics

      Vol:
    E82-C No:4
      Page(s):
    646-653

    We proposed Reversible Energy Recovery Logic (RERL) using an 8-phase clocking scheme, which is a dual-rail reversible adiabatic logic for ultra-low-energy applications. Because we eliminated non-adiabatic energy loss in RERL by using the concept of reversible logic, RERL has only adiabatic and leakage losses. In this paper we explain its operation and logic design and present its simulation and experimental results. We also present an energy-efficient 8-phase, clocked power generator that uses an off-chip inductor. With simulation results for the full adder, we confirmed that the RERL circuit consumed substantially less energy than other logic circuits at low-speed operation. We evaluated a test chip implemented with a 0.6-µm CMOS technology, which integrated a chain of inverters with a clocked power generator. In the experimental results, the RERL circuit consumed only 4.5% of the dissipated energy of a static CMOS circuit at an optimal operating speed of 40 kHz. In conclusion, RERL is suitable for the applications that do not require high performance but low-energy consumption because its energy consumption can be decreased to the minimum by reducing the operating frequency until adiabatic and leakage losses are equal.