Xue Hongxi, Zhang Yanan, Deng Hui. An Algorithm E for Determining Essential Prime ImplicantJ. Journal of Computer-Aided Design & Computer Graphics, 1990, 2(4): 1-6.
Citation:
Xue Hongxi, Zhang Yanan, Deng Hui. An Algorithm E for Determining Essential Prime ImplicantJ. Journal of Computer-Aided Design & Computer Graphics, 1990, 2(4): 1-6.
Xue Hongxi, Zhang Yanan, Deng Hui. An Algorithm E for Determining Essential Prime ImplicantJ. Journal of Computer-Aided Design & Computer Graphics, 1990, 2(4): 1-6.
Citation:
Xue Hongxi, Zhang Yanan, Deng Hui. An Algorithm E for Determining Essential Prime ImplicantJ. Journal of Computer-Aided Design & Computer Graphics, 1990, 2(4): 1-6.
An Algorithm E for Determining Essential Prime Implicant
In minimizing a boolean function using the extraction method, the tradi tional steps are: getting the prime cover Z first; and then extracting the essential prime implicant from Z.The algorithm E proposed in this paper is capable of deter mining whether a prime implicant is an essential prime implicant or not without the prime cover Z. The requirements of memory space and CPU time are reduced greatly.
DownLoad: