DocumentCode :
1117158
Title :
A Prime Implicant Algorithm with Factoring
Author :
Hulme, Bernie L. ; Worrell, Richard B.
Author_Institution :
Numerical Mathematics Division, Sandia Laboratories
Issue :
11
fYear :
1975
Firstpage :
1129
Lastpage :
1131
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.
Keywords :
Boolean functions, factoring, prime implicants, symbolic manipulation.; Boolean functions; Iterative algorithms; Laboratories; Mathematics; Research and development; Safety; Timing; Boolean functions, factoring, prime implicants, symbolic manipulation.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1975.224146
Filename :
1672739
Link To Document :
بازگشت