一种快速逻辑函数的优化方法

A Fast Optimum method of logical functions

针对数字系统设计中计算机优化逻辑函数普遍存在操作复杂、存贮容量大、运算速度慢等问题,本文提出了易于计算机实现的优化方法,即:列表法和十进制表示的多维体运算结合起来求素项,选择极值法求最小覆盖的优化方法,并对循环函数进行处理。这种方法大大减少了存储容量、加快了运算速度,并且增大了程序的应用范围。大量的实验证明了该方法的正确性和易于计算机实现的有效性。因此,本文方法在数字系统EDA中具有广泛的应用前景。

Computer simplification of logic functions has problems such as complicated operation, large memory, low speed, etc. The paper used an improved Q-M tabular and the multidimensional-cube representation method to find the essential prime implicants, to determine the minimal cover with the chooser principle, and to process the cyclical functions. The results show that new algorithm reduced memory, accelerated speed, and increased the application range. This algorithm has a broad application in EDA.