论含约束项的降维卡诺图

伍瑜

伍瑜. 论含约束项的降维卡诺图[J]. 电子科技大学学报, 2000, 29(3): 286-288.
引用本文: 伍瑜. 论含约束项的降维卡诺图[J]. 电子科技大学学报, 2000, 29(3): 286-288.
Wu Yu. Research on Reduced-dimension Karnaugh Map Including Binding-items[J]. Journal of University of Electronic Science and Technology of China, 2000, 29(3): 286-288.
Citation: Wu Yu. Research on Reduced-dimension Karnaugh Map Including Binding-items[J]. Journal of University of Electronic Science and Technology of China, 2000, 29(3): 286-288.

论含约束项的降维卡诺图

详细信息
    作者简介:

    伍瑜 男 57岁 大学

  • 中图分类号: TP331.2

Research on Reduced-dimension Karnaugh Map Including Binding-items

  • 摘要: 对含约束项的逻辑函数的一般表达式和卡诺图表示法进行了分析和比较,导出含约束项的降维卡诺图。通过实例分析,讨论了其填写与读出的方法,并归纳出含约束项的降维卡诺图填写与读出规则,该规则可简化实用电路。
    Abstract: After comparing the general expression of the logic function including binding-items with that of the Karnaugh Map express method, this paper derives the reduced-dirnension Karnaugh Map including binding-items, and discusses its filling and reading methods. The filling and the reading rules of the reduced-dimension Karnaugh Map including binding-items are also given in this paper.
计量
  • 文章访问数:  4891
  • HTML全文浏览量:  300
  • PDF下载量:  77
  • 被引次数: 0
出版历程
  • 收稿日期:  2000-02-19
  • 刊出日期:  2000-06-14

目录

    /

    返回文章
    返回