Mutual conversions between generalised arithmetic expansions and free binary decision diagrams

Calculation of generalised arithmetic expansions from free binary decision diagrams of incompletely specified Boolean functions is shown. The way of decomposing generalised arithmetic expansion coefficients in terms of cofactors of Boolean functions is presented. Based on the decomposition a second new algorithm to synthesise quasi-optimal free binary diagrams directly from generalised expansion of Boolean functions is developed