摘要
采用卡诺图算法对变量数目较少的逻辑函数进行了简化.研究了3级"与非"电路设计中卡诺图算法的简化,解决了设计中的函数表达式的问题:利用乘积项的合并,减少了第Ⅱ级"与非"门的数目;利用尾因子的选取,减少了第Ⅰ级"与非"门的数目.研究结果表明,方法直接,简化快速,扩展了卡诺图算法的应用.
When variable quantity lacks,Karnamgh map simplification is used,but it applies to grade 2 circuit design.To make a stude of simplification of Karnaugh map algorithm in grade 3 NAND circuit design and solve the problem of functional expression in designing:Reducimg the numbers of the 2nd grade NAND gate utilizing the combination of product phrases;Reducing the numbers of the lst grade NAND gate utilizing tail factor,the result shows that the method is direct and simplification is rapid.It expands the Karnamgh map algorithm.
出处
《河北师范大学学报（自然科学版）》
CAS
2004年第2期155-158,共4页
Journal of Hebei Normal University：Natural Science
基金
河北省自然科学指导项目课题(Z2001235)
