Variable ordering for binary decision diagrams

Considers the problem of variable ordering in binary decision diagrams (BDD's). The authors present several heuristics for finding a good variable ordering based on the algebraic structure of the functions. They provide a non-interleaving theorem and an accurate cost formula for the optimal ord...

Full description

Saved in:
Bibliographic Details
Main Authors: Jeong, S.-W., Plessier, B., Hachtel, G.D., Somenzi, F.
Format: Conference Proceeding
Language:English
Subjects:
Binary decision diagrams
Boolean functions
Circuit synthesis
Cost function
Data structures
Logic circuits
Packaging
Search methods
Zinc
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Considers the problem of variable ordering in binary decision diagrams (BDD's). The authors present several heuristics for finding a good variable ordering based on the algebraic structure of the functions. They provide a non-interleaving theorem and an accurate cost formula for the optimal ordering. They treat the output ordering problem when a given circuit has multiple outputs and propose new heuristics for the problem and experimental results which enables a quick comparison of some existing heuristics and the proposed heuristics.< >
DOI:10.1109/EDAC.1992.205974