Issue No.11 - November (1975 vol.24)
B.L. Hulme , Numerical Mathematics Division, Sandia Laboratories
An algorithm for finding the prime implicants of a Boolean function is given. The algorithm is similar to Nelson's algorithm since both involve the operations of complementing, expanding, and simplifying, but the new algorithm includes the additional operation of factoring. The algorithm with factoring is proved, and it is shown that factoring accounts for a dramatic increase in efficiency over Nelson's algorithm. The increased efficiency is illustrated with timing results obtained from several examples that were implemented for both algorithms using the symbolic manipulation systems SETS.
Boolean functions, factoring, prime implicants, symbolic manipulation.
B.L. Hulme, R.B. Worrell, "A Prime Implicant Algorithm with Factoring", IEEE Transactions on Computers, vol.24, no. 11, pp. 1129-1131, November 1975, doi:10.1109/T-C.1975.224146