【摘要】 逻辑函数的最佳覆盖 ,一直是逻辑综合领域的关键环节。尤其是大变量逻辑函数最佳覆盖 ,对复杂的逻辑综合更为重要 ,但也更加困难。本文在对逻辑覆盖算法研究的基础上 ,提出了适合大变量逻辑函数最佳覆盖的Beister改进算法。经过大量算题的测试表明 ,改进的列覆盖算法在时间复杂度和选择效果方面均优于Beister算法。更多还原

【Abstract】 Best cover for logic function with big number of input and output variables is more important part than the best cover for logic function in logic synthesis field.In this paper,we research the algorithm of irredundant cover for logic functions,and on the base of studying the column covering algorithm proposed by Beister,and we present an improved column covering algorithm.We also test the programs are all correct with a lot of examples and what’s more,the method of the improved column covering algorithm is much better than the one proposed by Beister both in time complexity and the selecting effect.更多还原