Reduction of the Number of Paths in Binary Decision Diagrams by Linear Transformation of Variables

K. Osnat; I. Levin; Radomir S. Stankovic

Reduction of the Number of Paths in Binary Decision Diagrams by Linear Transformation of Variables

K. Osnat
, I. Levin
, Radomir S. Stankovic

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

The paper deals with the problem of counting and minimizing the number of paths in Binary Decision Diagrams. The suggested approach uses the linear transform of initial variables and is based on a newly introduced weighted autocorrelation function. It is shown that the total number of paths in BDD is the sum of values of a weighted autocorrelation function. The efficiency of the proposed technique is illustrated on a number of benchmarks.

Original language	American English
Title of host publication	The 7th International Workshop on Boolean Problems
State	Published - 2006

Bibliographical note

Place of conference:Germany

Cite this

@inproceedings{acaf430681e74310a0331a9f76d7a9b7,

title = "Reduction of the Number of Paths in Binary Decision Diagrams by Linear Transformation of Variables",

abstract = "The paper deals with the problem of counting and minimizing the number of paths in Binary Decision Diagrams. The suggested approach uses the linear transform of initial variables and is based on a newly introduced weighted autocorrelation function. It is shown that the total number of paths in BDD is the sum of values of a weighted autocorrelation function. The efficiency of the proposed technique is illustrated on a number of benchmarks.",

author = "K. Osnat and I. Levin and Stankovic, \{Radomir S.\}",

note = "Place of conference:Germany",

year = "2006",

language = "American English",

booktitle = "The 7th International Workshop on Boolean Problems",

}

TY - GEN

T1 - Reduction of the Number of Paths in Binary Decision Diagrams by Linear Transformation of Variables

AU - Osnat, K.

AU - Levin, I.

AU - Stankovic, Radomir S.

N1 - Place of conference:Germany

PY - 2006

Y1 - 2006

N2 - The paper deals with the problem of counting and minimizing the number of paths in Binary Decision Diagrams. The suggested approach uses the linear transform of initial variables and is based on a newly introduced weighted autocorrelation function. It is shown that the total number of paths in BDD is the sum of values of a weighted autocorrelation function. The efficiency of the proposed technique is illustrated on a number of benchmarks.

AB - The paper deals with the problem of counting and minimizing the number of paths in Binary Decision Diagrams. The suggested approach uses the linear transform of initial variables and is based on a newly introduced weighted autocorrelation function. It is shown that the total number of paths in BDD is the sum of values of a weighted autocorrelation function. The efficiency of the proposed technique is illustrated on a number of benchmarks.

UR - https://scholar.google.co.il/scholar?q=9.19.1.%09Reduction+of+the+Number+of+Paths+in+Binary+Decision+Diagrams+by+Linear+Transformation+of+Variables+&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - The 7th International Workshop on Boolean Problems

ER -

Reduction of the Number of Paths in Binary Decision Diagrams by Linear Transformation of Variables

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this