首页 | 本学科首页   官方微博 | 高级检索  
     

3级"与非"电路设计中卡诺图算法的简化
引用本文:刘波粒,刘彩霞,赵增荣,赵月恩,崔仲平. 3级"与非"电路设计中卡诺图算法的简化[J]. 河北师范大学学报(自然科学版), 2004, 28(2): 155-158
作者姓名:刘波粒  刘彩霞  赵增荣  赵月恩  崔仲平
作者单位:河北师范大学,职业技术学院,河北,石家庄,050031;河北师范大学,物理学院,河北,石家庄,050016;河北省邮电学校,河北,石家庄,050031;张北第1中学,河北,张家口,076450
基金项目:河北省自然科学指导项目课题(Z2001235)
摘    要:
采用卡诺图算法对变量数目较少的逻辑函数进行了简化.研究了3级"与非"电路设计中卡诺图算法的简化,解决了设计中的函数表达式的问题:利用乘积项的合并,减少了第Ⅱ级"与非"门的数目;利用尾因子的选取,减少了第Ⅰ级"与非"门的数目.研究结果表明,方法直接,简化快速,扩展了卡诺图算法的应用.

关 键 词:卡诺图  3级电路  "  与非"  
文章编号:1000-5854(2004)02-0155-04
修稿时间:2002-12-26

Simplification of Karnamgh-map in Three-stage Circuit Design
LIU Bo-li,LIU Cai-xia,ZHAO Zeng-rong,ZHAO Yue-en,CUI Zhong-ping. Simplification of Karnamgh-map in Three-stage Circuit Design[J]. Journal of Hebei Normal University, 2004, 28(2): 155-158
Authors:LIU Bo-li  LIU Cai-xia  ZHAO Zeng-rong  ZHAO Yue-en  CUI Zhong-ping
Affiliation:LIU Bo-li~1,LIU Cai-xia~2,ZHAO Zeng-rong~1,ZHAO Yue-en~3,CUI Zhong-ping~4
Abstract:
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.
Keywords:Karnamgh-map  grade 3 circuit  NAND gate  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号