BDD based synthesis of symmetric functions with full path-delay fault testability

Shi, Jianrong; Fey, Görschwin; Drechsler, Rolf

doi:10.1109/ats.2003.1250825

Cited by 6 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Symmetric and partially symmetric Boolean functions are often exploited in logic synthesis and are widely used in cryptology. The symmetric properties of these functions have been exploited for deriving suitable variable orderings for their representation via Ordered Binary Decision Diagrams (OBDDs) [14], [21].…”

Section: Introductionmentioning

confidence: 99%

Biconditional-BDD Ordering for Autosymmetric Functions

Bernasconi

Ciriani

Trucco

2015

2015 Euromicro Conference on Digital System Design

View full text Add to dashboard Cite

Autosymmetric functions are particular "regular" Boolean functions that are exploited for logic optimization, since it is possible to reduce the number of variables and the number of points of the original autosymmetric function before its synthesis.In this paper we study this regularity in oder to derive a suitable variable ordering for Biconditional Binary Decision Diagrams (BBDDs). BBDDs are a new version of BDD that have EXOR of two variables (instead of a variable) in the nodes. These diagrams are employed for logic synthesis in new technologies such as silicon nanowires and DG-SiNWFETs. We show that it is possible to find a useful variable ordering for these functions and the experimental results validate our approach showing that in the 97% of the cases we get an ordering that gives a number of nodes that is lower or equal to the one obtained with the standard ordering.

show abstract

Section: Introductionmentioning

confidence: 99%

Biconditional-BDD Ordering for Autosymmetric Functions

Bernasconi

Ciriani

Trucco

2015

2015 Euromicro Conference on Digital System Design

View full text Add to dashboard Cite

show abstract

“…For a brief illustration of present interest in symmetric Boolean functions, we will point out few related concepts and the corresponding research results in this Manuscript area. Besides classical applications, as circuit synthesis and formal verification, (for example, [4][5][6][7]. ), a high recent interest in study of symmetric Boolean functions is related to their cryptographic features [8].…”

Section: Introduction and Motivation For Researchmentioning

confidence: 99%