PanPapa
Newbie
Hello,
I am currently attempting to synthesize a circuit to correspond to a minimal And Inverter Graph (AIG).
That is, mapping with 2-input And/Or/Nand/Nor gates and inverters, my objective is to optimize the design to minimize the count of 2-input gates, considering inverters as free elements. This optimization goal differs from the traditional Nand2 cost, as it takes into account the potential improvements achievable by using inverters.
I'm interested in exploring whether Design Compiler can yield superior results compared to ABC in AIG minimization since it is ABC's native cost function for logical optimization. Specifically, I want to assess if Design Compiler can outperform ABC in optimizing the AIG node-count metric.
Could you provide any insights or recommendations on how to achieve this goal effectively?
Thank you for your assistance.
I am currently attempting to synthesize a circuit to correspond to a minimal And Inverter Graph (AIG).
That is, mapping with 2-input And/Or/Nand/Nor gates and inverters, my objective is to optimize the design to minimize the count of 2-input gates, considering inverters as free elements. This optimization goal differs from the traditional Nand2 cost, as it takes into account the potential improvements achievable by using inverters.
I'm interested in exploring whether Design Compiler can yield superior results compared to ABC in AIG minimization since it is ABC's native cost function for logical optimization. Specifically, I want to assess if Design Compiler can outperform ABC in optimizing the AIG node-count metric.
Could you provide any insights or recommendations on how to achieve this goal effectively?
Thank you for your assistance.