摘要：This paper describes a new BDD(Binary Decision Diagram) that use SCOAP value for its path. Based on analysis of BDD and input variables, variable ordering and reducing algorithms for BDD operation that are constructed by circuits description of netlist are proposed. Further, several bench nark circuits are shown to verify the efficient methods.