论文信息 - Mutual conversions between generalised arithmetic expansions and free binary decision diagrams

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 decision diagrams directly from generalised arithmetic expansion of Boolean functions is developed.

Chip-Hong Chang | B. J. Falkowski | Chip-Hong Chang | B. Falkowski

[1] Ingo Wegener. The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions , 1994, IEEE Trans. Computers.

[2] Giovanni De Micheli,et al. Synthesis and Optimization of Digital Circuits , 1994 .

[3] Klaus D. Heidtmann,et al. Arithmetic Spectrum Applied to Fault Detection for Combinational Networks , 1991, IEEE Trans. Computers.

[4] Sarma Vrudhula,et al. EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5] Kenneth J. Supowit,et al. Finding the Optimal Variable Ordering for Binary Decision Diagrams , 1990, IEEE Trans. Computers.

[6] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.