高级检索

一个基于布尔方程的简化组合逻辑设计的分解方法

A DECOMPOSITION METHOD FOR SIMPLIFYING COMBINATIONAL LOGIC DESIGN BASED ON BOOLEAN EQUATION

  • 摘要: 本文提出的简化组合逻辑设计的布尔方程分解方法,是将F(x1,x2,…,xn)=1的组合逻辑设计转化为F(x1,x2,…,xn)=0的组合逻辑设计问题,然后将F(x1,x2,…,xn)=0转化为与其等价的布尔方程组,对得到的布尔方程组用"异或"逻辑实现,从而获得极为简化的组合逻辑设计.最后我们给出了解布尔方程的程序设计框图.

     

    Abstract: This paper presents a decomposition method realized by solving boolean eguation for somplifying combinational logic design.In this method,it realizes a combinational logic design F(x1x2,…,xn)=1,which is transferred into a combinational logic design F(x1x2,…,xn)=0.Then it eguivalently transfers F(x1x2,…,xn)=0into the boolean equations.By logic EXCLUSIVE OR,it realizes the eguations.Thus,it is achieved that the combinational logic design is extremely simplified design.Finally,it gives the flow chart for solving boolean eguations.

     

/

返回文章
返回