Abstract: A system and method for synthesizing and verifying a circuit design includes receiving a circuit design. An equivalency metric is determined across a first hierarchy and a second hierarchy from hierarchies of the circuit design. The equivalency metric is based on one or more of a combinational element equivalency and a sequential element equivalency across the first hierarchy and the second hierarchy. An updated circuit design is generated by ungrouping the first hierarchy of the hierarchies into the second hierarchy of the hierarchies based on the equivalency metric.

Abstract: The present disclosure describes systems and methods for adjusting a logic network. The method includes adding, to the logic network, a first redundant node and determining a first adjustment to a first node of the logic network within a transitive fanin of the first redundant node. The method also includes making the first adjustment to the first node based on determining that a first gain based on the first adjustment satisfies a threshold.

Abstract: A logic network for an integrated circuit is synthesized as follows. The logic network is mapped to a network of lookup tables (LUTs). The LUT mapping is based at least in part on estimated areas of the LUTs. The individual LUTs in the network are improved (LUT optimization), for example using various Boolean optimization techniques. The network of improved LUTs is then reduced to a gate-level netlist of standard cells.

Abstract: Techniques and systems for optimizing a logic network are described. Some embodiments automatically identify scenarios where Boolean methods are best driven by truth tables, binary decision diagrams (BDDs) or satisfiability (SAT). Some embodiments use circuit partitioning techniques that are based on hash-tables and topological sorting, and that are capable of grouping nodes with high simplification likelihood and still are able to efficiently scale to large circuits. Some embodiments feature a generalized resubstitution framework based on computing, and implementing, the Boolean difference between two nodes. Some embodiments include enhancements to (i) gradient-based and-inverter-graph (AIG) optimization, (ii) heterogeneous elimination for kerneling, and (iii) revisitation of maximum set of permissible functions (MSPF) computation with BDDs.

Abstract: Techniques and systems for optimizing a logic network are described. Some embodiments automatically identify scenarios where Boolean methods are best driven by truth tables, binary decision diagrams (BDDs) or satisfiability (SAT). Some embodiments use circuit partitioning techniques that are based on hash-tables and topological sorting, and that are capable of grouping nodes with high simplification likelihood and still are able to efficiently scale to large circuits. Some embodiments feature a generalized resubstitution framework based on computing, and implementing, the Boolean difference between two nodes. Some embodiments include enhancements to (i) gradient-based and-inverter-graph (AIG) optimization, (ii) heterogeneous elimination for kerneling, and (iii) revisitation of maximum set of permissible functions (MSPF) computation with BDDs.