作者: E.S. Davidson
关键词:
摘要: A branch-and-bound algorithm is presented for the synthesis of multioutput, multilevel, cycle-free NAND networks to realize an arbitrary given set partially or completely specified combinational switching functions. In a programmed version algorithm, fan-in, fan-out, and level constraints may be specified. Cost as nonnegative integer linear combination gates gate inputs. Further cost criteria are compatible with algorithm. first solution constructed by sequence local decisions, backtracking executed find improved solutions prove optimality final solution.