| 逻辑函数求补算法及其改进 |
| |
| 引用本文： | 邱建林,王波,管致锦,刘维富,顾晖.逻辑函数求补算法及其改进[J].计算机工程与应用,2004,40(18):64-66,228. |
| |
| 作者姓名： | 邱建林 王波 管致锦 刘维富 顾晖 |
| |
| 作者单位： | 南通工学院信息工程系,江苏,南通,226007 |
| |
| 基金项目： | 江苏省自然科学基金(编号:BK2001130)，江苏省高校自然科学基金(编号:03KJB520103)资助 |
| |
| 摘 要： | 逻辑函数求补算法存在的主要问题是时间开销大及需要的存储空间过大。该文在对递归裂变求补算法和基于最小项求补算法进行分析研究的基础上,提出了积项输入、邻项合并、积项输出的无冗余覆盖的逻辑函数求补算法。该求补算法的时间、空间的需求将大大缩小。
|
| 关 键 词： | 逻辑函数 递归裂变 最小项 补集描述 |
| 文章编号： | 1002-8331-(2004)18-0064-03 |
Arithmetic of Complement Set and an Improved Method for Logic Functions |
| |
| Qiu Jianlin Wang Bo,Guan Zhijin Liu Weifu Gu,Hui.Arithmetic of Complement Set and an Improved Method for Logic Functions[J].Computer Engineering and Applications,2004,40(18):64-66,228. |
| |
| Authors: | Qiu Jianlin Wang Bo Guan Zhijin Liu Weifu Gu Hui |
| |
| Abstract: | In arithmetic of complement set for logic functions,the excessively long processing times and excessively large memory space requirement are major problems.This paper analyzes arithmetic of complement set on recursion fis-sion and arithmetic of complement set on minimum,at same time ,it presents a new improved method of complement set for logic functions,this method includes input of products and combination of neighbor products and output of products.It greatly reduces time and space requirement. |
| |
| Keywords: | logic function recursion fission minimum complement set |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
