卡诺图排列方法及在组合逻辑电路竞争冒险中的应用  

The Application of Karnaugh Map in Competitive Adventure of Combinatorial Logical Circuit

作　　者：匡晚成[1] 肖洪祥[1] 

机构地区：[1]桂林工学院电子与计算机系,广西壮族自治区桂林市541004

出　　处：《电子工程师》2007年第6期48-50,共3页Electronic Engineer

基　　金：广西科技攻关项目(桂科攻0330005-12)

摘　　要：卡诺图是组合逻辑电路设计和分析常用和有效的数学工具,既可以化简逻辑函数,也可以分析组合逻辑电路的竞争冒险。对于多输入变量的逻辑函数,要排列其卡诺图则不是易事。格雷码的相邻码之间只有1位不同,这与卡诺图的循环邻接有相同之处,因而可以利用格雷码快速排列多变量卡诺图。首先介绍二进制码转化为格雷码的方法并用C语言编程实现其码制转换,接着叙述用格雷码规律快速排列多变量卡诺图的方法,最后举例说明卡诺图在组合逻辑电路竞争冒险中的应用。Karnaugh map is the most often used and effective tool for the design or analysis of combinatorial logical circuit. It not only simplify logic function but also analyze the race hazard of combinatorial logical circuit. However, it is not easy to array a Karnaugh map of multi-variable. There is only one bit converted from the adjacent code in the gray code array. This is akin to Karnaugh maps of multi-variable. This paper introduces and realizing code transform in C programable language Karnaugh map, so using Gray code may quickly array the method of using binary code to convert Gray code , and it discusses the method of quickly arraying Karnaugh maps of multi-variable in Gray code rules. The application of using Karnaugh map to analyze the race hazard of combinatorial logical circuit is illuminated with an example at last.

关 键 词：组合逻辑电路 格雷码 卡诺图 竞争冒险 

分 类 号：TN791[电子电信—电路与系统]