摘要：An efficient minimisation method is presented to find the best polarity of fixed polarity canonical or-coincidence (COC) expansions. The method derives one COC fixed polarity expansion from another adjacent polarity expansion. To reduce CPU time, it utilises bitwise operation and Gray code. Furthermore, it counts the number of “0”s in the polarity matrix rather than polarity matrix multiplication. As a result, it makes minimisation for large functions within reasonable time practical. The space complexity of the proposed algorithm is O( M ) and time complexity is O(2 n ( M log M + M )) ( n and M are the number of input variables and the number of on-set COC maxterms).
关键词：Logic synthesis;Optimisation;Canonical Or-Coincidence;Dual form of Reed-Muller;EDA
