A Prime Implicant Algorithm with Factoring

Authors:
B. L. Hulme;R. B. Worrell
Affiliations:
Numerical Mathematics Division, Sandia Laboratories;-
Venue:
IEEE Transactions on Computers
Year:
1975

Citing 4
Cited 2

Efficient Ordering of Set Expressions for Symbolic Expansion

Journal of the ACM (JACM)
A New Algorithm for Generating Prime Implicants

IEEE Transactions on Computers
Clause-Column Table Approach for Generating All the Prime Implicants of Switching Functions

IEEE Transactions on Computers
Comments on " ANew Algorithm for Generating Prime Implicants"

IEEE Transactions on Computers

A New Technique for the Fast Minimization of Switching Functions

IEEE Transactions on Computers
A Method to Simplify a Boolean Function into a Near Minimal Sum-of-Products for Programmable Logic Arrays

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

Abstract

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.