Efficient graph-based computation and manipulation of functional decision diagrams

An efficient canonical representation for arbitrary Boolean functions, the functional decision diagrams (FDDs), are presented. FDDs are a graphical representation of the Reed-Muller coefficients as BDDs are a representation of the function table. Some algorithms to manipulate FDDs and generate a functional decision diagram from a BDD are presented. The results are very encouraging and show that FDDs are applicable for new approaches to Reed-Muller logic synthesis.<
>