Issue No.02 - February (1970 vol.19)
A method is presented which uses easily calculated probabilities to determine complete covers of prime implicant charts. Apparently the underlying principle of incomplete branching has not been applied previously to prime implicant charts. This principle differs in that branching is not carried out to complete covers, but only to a specified level, at which point each position is evaluated. All positions are then mimimaxed to the point of branching to choose the best branch. The method is easy to program and requires relatively little computer time to determine the cover. Time savings of up to 98 percent have been realized with an increase in the cost of the cover of less than 2 percent over conventional minimization methods. The method can be applied directly to any prime implicant chart, or can be used as a substitute for complete branching in charts where the application of dominance produces a cyclic chart.
Branching, linear integer programming, prime implicant chart solution, switching function minimization.
R.M. Bowman, E.S. McVey, "A Method for the Fast Approximate Solution of Large Prime Implicant Charts", IEEE Transactions on Computers, vol.19, no. 2, pp. 169-173, February 1970, doi:10.1109/T-C.1970.222888