摘要
本文给出求解组合函数相等实现的一种卡诺图分解简化法,该方法能准确快速地得到函数的最小化或接近最小化的相等实现。
A Karnaugh map decomposition simplifying method,by which equational realiza- tions of combinational functions can be found out,is given in this paper.The minimiza- tion or mear minimization equational realizations of combinational functions can ac- crrstely and fast be obtained by using the method.
出处
《淮北煤师院学报(自然科学版)》
1993年第1期29-34,共6页
Journal of Huaibei Teachers College(Natural Sciences Edition)
关键词
布尔代数
逻辑设计
组合函数
Boolean algebra
Equational logic
logic design