Symmetry Detection And Dynamic Variable

Panda, S.; Somenzi, Fabio; Plessier, B.

doi:10.1109/iccad.1994.629887

Cited by 35 publications

(49 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the simplest heuristics for variable ordering introduced in [17], [21] is to replace adjacent isomorphic (symmetric function) nodes by a single node. The best variable order allows to merge the largest amount of isomorphic nodes.…”

Section: Adjacent Isomorphic Nodes Replacementmentioning

confidence: 99%

Synthesis of Quantum Arrays from Kronecker Functional Lattice Diagrams

Lukáč

Shah

Perkowski

et al. 2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYReversible logic is becoming more and more popular due to the fact that many novel technologies such as quantum computing, low power CMOS circuit design or quantum optical computing are becoming more and more realistic. In quantum computing, reversible computing is the main venue for the realization and design of classical functions and circuits. We present a new approach to synthesis of reversible circuits using Kronecker Functional Lattice Diagrams (KFLD). Unlike many of contemporary algorithms for synthesis of reversible functions that use n × n Toffoli gates, our method synthesizes functions using 3 × 3 Toffoli gates, Feynman gates and NOT gates. This reduces the quantum cost of the designed circuit but adds additional ancilla bits. The resulting circuits are always regular in a 4-neighbor model and all connections are predictable. Consequently resulting circuits can be directly mapped in to a quantum device such as quantum FPGA [14]. This is a significant advantage of our method, as it allows us to design optimum circuits for a given quantum technology.

show abstract

Section: Adjacent Isomorphic Nodes Replacementmentioning

confidence: 99%

Synthesis of Quantum Arrays from Kronecker Functional Lattice Diagrams

Lukáč

Shah

Perkowski

et al. 2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…There are 2 n+1 binary-valued symmetric functions out of 2 2 n functions. There are efficient circuit-based methods and complete BDDbased methods for identifying symmetries of completely and incompletely specified functions [11], [17], [19], [23], [29], [32].…”

Section: Introductionmentioning

confidence: 99%

Use of gray decoding for implementation of symmetric functions

Keren¹,

Левин²,

Stankovic³

2007

2007 IFIP International Conference on Very Large Scale Integration

View full text Add to dashboard Cite

“…Möller et al [12] and Panda el al. [6] detect all symmetries between variables adjacent in the variable order with an algorithm in O(|G|). Rudell's dynamic variable reordering algorithm [15] has also been used to detect symmetries, although the aim is not symmetry detection per se, but ROBDD minimization.…”

mentioning

confidence: 99%

An anytime symmetry detection algorithm for ROBDDs

Kettle

King

2006

Proceedings of the 2006 Conference on Asia South Pacific Design Automation - ASP-DAC '06

View full text Add to dashboard Cite

Abstract-Detecting symmetries is crucial to logic synthesis, technology mapping, detecting function equivalence under unknown input correspondence, and ROBDD minimization. Stateof-the-art is represented by Mishchenko's algorithm. In this paper we present an efficient anytime algorithm for detecting symmetries in Boolean functions represented as ROBDDs, that output pairs of symmetric variables until a prescribed time bound is exceeded. The algorithm is complete in that given sufficient time it is guaranteed to find all symmetric pairs. The complexity of this algorithm is in O(n 4 +n|G|+|G| 3 ) where n is the number of variables and |G| the number of nodes in the ROBDD, and it is thus competitive with Mishchenko's O(|G| 3 ) algorithm in the worst-case since n |G|. However, our algorithm performs significantly better because the anytime approach only requires lightweight data structure support and it offers unique opportunities for optimization.

show abstract

Symmetry Detection And Dynamic Variable

Cited by 35 publications

References 19 publications

Synthesis of Quantum Arrays from Kronecker Functional Lattice Diagrams

Synthesis of Quantum Arrays from Kronecker Functional Lattice Diagrams

Use of gray decoding for implementation of symmetric functions

An anytime symmetry detection algorithm for ROBDDs

Contact Info

Product

Resources

About