Skip to Main Content
A new algorithm for the synthesis of single-output two-valued combinational logic using decomposition and probability is described. Two probabilistic quantities, the probability of existence of all pertinent decomposition classes, and the probable cost of an N variable function are defined. Results for completely specified functions are derived and tabulated. The extension to incompletely specified functions is discussed. A randomly chosen function is assumed throughout the paper.