A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods

Edwards,; Hurst,

doi:10.1109/tc.1978.1674988

Cited by 56 publications

(23 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Variables x i and x j have non-equivalent (equivalent) symmetry in f(X) iff f 01 = f 10 (f 00 = f 11 ), denoted by NE(x i , x j ) (E(x i , x j )) [7] [8]. These two symmetry types are called classical symmetries.…”

Section: Classical Symmetriesmentioning

confidence: 99%

Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability

Zhang¹,

Mishchenko²,

Chrzanowska-Jeske³

2006

2006 43rd ACM/IEEE Design Automation Conference

View full text Add to dashboard Cite

Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-based method that makes uses of structural analysis, integrated simulation and Boolean satisfiability for fast and scalable detection of classical symmetries of completely-specified Boolean functions. This is in contrast to previous incomplete circuit-based methods and complete BDD-based methods. Experimental results demonstrate that the proposed method works for large Boolean functions, for which BDDs cannot be constructed.

show abstract

Section: Classical Symmetriesmentioning

confidence: 99%

Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability

Zhang¹,

Mishchenko²,

Chrzanowska-Jeske³

2006

2006 43rd ACM/IEEE Design Automation Conference

View full text Add to dashboard Cite

show abstract

“…This notion can be generalized to symmetries under phase assignment, where one of the two exchanged variables can be negated [5]. We term symmetries between variables as first order symmetries.…”

Section: Symmetries In Functional Specificationsmentioning

confidence: 99%

“…Symmetries as functional properties have been studied to improve synthesis quality for a long time [5,6,14]. In this work symmetries establish the key relation between desirable decompositions and the library of primitives which makes such decompositions possible.…”

Section: Introductionmentioning

confidence: 99%

Constructive library-aware synthesis using symmetries

Кравец

Sakallah

2000

Proceedings of the Conference on Design, Automation and Test in Europe

View full text Add to dashboard Cite

show abstract

“…In this paper, we propose a novel approach that tries to unify some of the most effective Boolean matching approaches based on canonical forms, ranging from those based on spectral function analysis [10], defined and developed in the '70s, to the most recent, based on functions representation by means of cofactors [1].…”

Section: Introductionmentioning

confidence: 99%

A Transform-Parametric Approach to Boolean Matching

Agosta

Bruschi

Pelosi

et al. 2009

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

View full text Add to dashboard Cite

Abstract-In this paper, we face the problem of P-equivalence Boolean matching. We outline a formal framework that unifies some of the spectral and canonical form-based approaches to the problem.As a first major contribution, we show how these approaches are particular cases of a single generic algorithm, parametric with respect to a given linear transformation of the input function.As a second major contribution, we identify a linear transformation that can be used to significantly speed up Boolean matching with respect to the state of the art. Experimental results show that, on average, our approach is five times faster than the main competitor on 20-variables input functions, and scales better, allowing to match even larger components.

show abstract

A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods

Cited by 56 publications

References 13 publications

Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability

Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability

Constructive library-aware synthesis using symmetries

A Transform-Parametric Approach to Boolean Matching

Contact Info

Product

Resources

About