Finding Compact BDDs Using Genetic Programming
by
Ulrich Kühne Nicole Drechsler
BibTeX
@MISC{Drechsler_findingcompact,
author = {Ulrich Kühne Nicole Drechsler},
title = {Finding Compact BDDs Using Genetic Programming},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Binary Decision Diagrams (BDDs) can be used to design multiplexor based circuits. Unfortunately, the most commonly used kind of BDDs – ordered BDDs – has exponential size in the number of variables for many functions. In some cases, more general forms of BDDs are more compact. In constrast to the minimization of OBDDs, which is well understood, there are no heuristics for the construction of compact BDDs up to today. In this paper we show that compact BDDs can be constructed using Genetic Programming. 1
