高级检索

求组合电路无冗余覆盖的立方有序扩展法

A Cubical Order Expansion Algorithm for Finding Irredundant Covering of Combinational Circuits

  • 摘要: 本文提出一种直接求组合电路无冗余覆盖的立方有序扩展算法。算法根据预定要求达到的目标,制订了相应的处理策略,对立方的可扩展组元(变量)排出次序,并按次序逐个对立方的可扩展组元(变量)进行扩展。本算法比以往的对扩展变量任意排序的简单立方扩展法有更优化的运算结果。

     

    Abstract: This paper proposes a cubical order expansion algorithm for directly finding irredundant coverirtg of combinational circuits. According to demands, this algorithm makes up the corresponding processing strategies to order the cubical expanding variables and orderly expands them. It can achieve more optimal calculation results than simple cubical expaasion algorithms out of order.

     

/

返回文章
返回