Skip to content

Conversation

@uenoku
Copy link
Member

@uenoku uenoku commented Oct 14, 2025

This implementation is based on a tree-balancing algorithm described in section 3.1 in the paper: "Delay Optimization Using SOP Balancing, ICCAD 2011".

This pass performs maximum AND-cover optimization by collapsing single-fanout and-inverter ops into their users, reducing the depth of And-Inverter Graphs, combined with the lower variadic pass. The pass is integrated into the circt-synth optimization pipeline.

Rebased from #8262.
Co-authored-by: Max Zhou [email protected]

This implementation is based on a tree-balancing algorithm described in
this paper: "https://ieeexplore.ieee.org/abstract/document/6105357".

Rebased from #8262.

Co-authored-by: Max Zhou <[email protected]>
@uenoku
Copy link
Member Author

uenoku commented Oct 14, 2025

This is reviewed in #8262 so I'm going to merge.

@uenoku uenoku merged commit ed501a8 into main Oct 14, 2025
14 checks passed
@uenoku uenoku deleted the dev/hidetou/aig-rebased branch October 14, 2025 09:03
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants