The Community for Technology Leaders
Green Image
Issue No. 12 - December (1969 vol. 18)
ISSN: 0018-9340
pp: 1098-1109
A branch-and-bound algorithm is presented for the synthesis of multioutput, multilevel, cycle-free NAND networks to realize an arbitrary given set of partially or completely specified combinational switching functions. In a programmed version of the algorithm, fan-in, fan-out, and level constraints may be specified. Cost may be specified as a nonnegative integer linear combination of gates and gate inputs. Further constraints and cost criteria are compatible with the algorithm. A first solution is constructed by a sequence of local decisions, and backtracking is executed to find improved solutions and to prove the optimality of the final solution.
Branch-and-bound algorithm, circuit constraints, combinational logic synthesis, decomposition, logic design automation, NAND synthesis.
E.S. Davidson, "An Algorithm for NAND Decomposition Under Network Constraints", IEEE Transactions on Computers, vol. 18, no. , pp. 1098-1109, December 1969, doi:10.1109/T-C.1969.222593
81 ms
(Ver 3.1 (10032016))