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

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.