Determining the minimal number of lines for large reversible circuits

2011 41st IEEE International Symposium on Multiple-Valued Logic

Soeken

Große

et al. 2011

Abstract-Driven by its promising applications, reversible logic received significant attention. As a result, an impressive progress has been made in the development of synthesis approaches, implementation of sequential elements, and hardware description languages. In this paper, these recent achievements are employed in order to design a RISC CPU in reversible logic that can execute software programs written in an assembler language. The respective combinational and sequential components are designed using state-of-the-art design techniques.

Section: A Reversible Circuitsmentioning

confidence: 99%

Designing a RISC CPU in Reversible Logic

2011 41st IEEE International Symposium on Multiple-Valued Logic

Soeken

Große

et al. 2011

“…However, in order to embed an irreversible function into a reversible one, additional circuit lines with constant inputs or don't care outputs are needed [17]. This is illustrated in the following example.…”

Section: Embeddingmentioning

confidence: 99%

A Synthesis Flow for Sequential Reversible Circuits

Soeken

2012 IEEE 42nd International Symposium on Multiple-Valued Logic

Otterstedt

et al. 2012

In this paper, a synthesis flow for sequential reversible circuits is proposed. In particular, a methodology is introduced which transforms a finite state machine into a Boolean function representing the sequential behavior. Having that, any combinational synthesis approach can be exploited in order to perform the actual synthesis. Heuristics ensure that encodings for the states are applied which keep the costs of the resulting circuits low. Experiments show the applicability of the approach.

“…Constant inputs and garbage outputs are not only essential in order to embed irreversible functions into reversible ones (see e.g. [15,16]), but are also heavily applied in synthesis approaches e.g. based on ESOPs (e.g.…”

Section: The Revvis Toolmentioning

confidence: 99%

“…be needed in order to make an irreversible function reversible (see e.g. [15,16]). The circuit from Fig.…”

Section: Introductionmentioning

confidence: 99%

RevVis: Visualization of Structures and Properties in Reversible Circuits

Stoppe

Schönborn

et al. 2014

Reversible Computation

Abstract. The recent interest in reversible computation led to plenty of (automatic) approaches for the design of the corresponding circuits. While this automation is desired in order to provide a proper support for the design of complex functionality, often a manual consideration and human intuition enable improvements or provide new ideas for design solutions. However, this manual interaction requires a good understanding of the structure or the properties of a reversible cascade which, with increasing circuit size, becomes harder to grasp. Visualization techniques that abstract irrelevant details and focus on intuitively displaying important structures or properties provide a solution to this problem and have already successfully been applied in other domains such as design of conventional software, hardware debugging, or Boolean satisfiability. In this work, we introduce RevVis, a graphical interface which visualizes structures and properties of reversible circuits. RevVis collects relevant data of a given reversible cascade and presents it in a simple but intuitive fashion. By this, RevVis unveils information on characteristic structures and properties of reversible circuits that could be utilized for further optimization. A case study demonstrates this by considering circuits obtained from several synthesis approaches.