This paper uses an improved re peti tioninclusion algorithm to find the essential prime implicants, to determine t h e minimal cover with the chooser principle, and to process the cyclical function s.

• 针对计算机化简逻辑函数普遍存在操作复杂、存贮容量大、运算速度慢等问题,该文用改进的重复包含算法寻找逻辑函数的质蕴涵,选择极值法求最小覆盖,并对循环函数进行处理。