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.
英
美
- 針對計算機化簡(jiǎn)邏輯函數普遍存在操作復雜、存貯容量大、運算速度慢等問(wèn)題,該文用改進(jìn)的重復包含算法尋找邏輯函數的質(zhì)蘊涵,選擇極值法求最小覆蓋,并對循環(huán)函數進(jìn)行處理。
