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

逻辑函数的卡诺图化简法
引用本文:陈小芳.逻辑函数的卡诺图化简法[J].计算机时代,2010(8):49-51.
作者姓名:陈小芳
作者单位:安徽亳州广播电视大学,安徽,亳州,236800;亳州旅游学校
摘    要:从卡诺图化简法与公式化简法的比较入手,说明卡诺图化简法的优点及适用范围,阐述了卡诺图的特点、最小项的定义和性质、用卡诺图化简逻辑函数的基本原理以及化简是否达到最简形式的判定标准。然后给出了具体实例来诠释卡诺图化简法并给出其应用的一般步骤。最后总结出卡诺图化简法易出错的几种情况,从而得出用卡诺图化简逻辑函数的一般方法。

关 键 词:卡诺图  最小项  逻辑函数标准化  逻辑相邻

Karnaugh Map Approach for Minimizing Logic Functions
CHEN Xiao-fang.Karnaugh Map Approach for Minimizing Logic Functions[J].Computer Era,2010(8):49-51.
Authors:CHEN Xiao-fang
Affiliation:CNEN Xiao-fang (1. Bozhou Radio & TV University, Bozhou, Anhui 236800, China; 2. Bozhou Tourism School)
Abstract:Beginning with the comparison of Kamaugh map and formula minimizing approaches, the advantages and application scope of Karnaugh map approach are explained, the characteristics of Karnaugh map, definition and properties of minimum terms, basic principle of Karnangh map approach for minimizing logic functions and decision standard for minimization forms of logic functions are expounded. Then specific examples are given to describe Kamaugh map approach and its steps. Finally the several error-prone conditions are summed up, so as to obtain the general method of using Karnaugh map approach for minimizing logic functions.
Keywords:Kamaugh map  minimum terms  logic function standardized  logic adjacency
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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