Technology Mapping by Tree Matching
Dynamic programming algorithm
- taken from code generation – Aho and Johnson's TWIG
DAG is viewed as a forest of trees (two options)
- 1. partition into trees (break graph at fanout nodes)
- 2. duplicate logic in common sub-trees
Consider adding inverter pairs along any arc of original DAG