mlsanityData to 14 Oct 2026

Revisit Choice Network for Synthesis and Technology Mapping

arXiv 2508.14068 ↗First posted 4 Aug 2025cs.AR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Choice network construction is a critical technique for alleviating structural bias issues in Boolean optimization, equivalence checking, and technology mapping. Previous works on lossless synthesis utilize independent optimization to generate multiple snapshots, and use simulation and SAT solvers to identify functionally equivalent nodes. These nodes are then merged into a subject graph with choice nodes. However, such methods often neglect the quality of these choices, raising the question of whether they truly contribute to effective technology mapping. This paper introduces Cristal, a novel methodology and framework for constructing Boolean choice networks. Specifically, Cristal introduces a new flow of choice network-based synthesis and mapping, including representative logic cone search, structural mutation for generating diverse choice structures via equality saturation, and priority-ranking choice selection along with choice network construction and validation. Through these techniques, Cristal constructs fewer but higher-quality choices. Our experimental results demonstrate that Cristal outperforms the state-of-the-art Boolean choice network construction implemented in ABC in the post-mapping stage, achieving average reductions of 3.85%/8.35% (area/delay) in delay-oriented mode, 0.11%/2.74% in area-oriented mode, and a 63.77% runtime reduction on large-scale cases across a diverse set of combinational circuits from the IWLS 2005, ISCAS'89, and EPFL benchmark suites.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 45 references that are in the map. First posted on arXiv 4 Aug 2025.

Builds on

10 of 45 references.

References · 10

  1. 2023Gamora: Graph Learning based Symbolic Reasoning for Large-Scale Boolean Networkscited by 27
  2. 2024E-Syn: E-Graph Rewriting with Technology-Aware Cost Functions for Logic Synthesiscited by 7
  3. 2023Automating Constraint-Aware Datapath Optimization using E-Graphscited by 5
  4. 2023DAG-aware Synthesis Orchestrationcited by 5
  5. 2022Automatic Datapath Optimization using E-Graphscited by 4
  6. 2024MapTune: Advancing ASIC Technology Mapping via Reinforcement Learning Guided Library Tuningcited by 4
  7. 2023Datapath Verification via Word-Level E-Graph Rewritingcited by 3
  8. 2025BoolE: Exact Symbolic Reasoning via Boolean Equality Saturationcited by 3
  9. 2025E-morphic: Scalable Equality Saturation for Structural Exploration in Logic Synthesiscited by 3
  10. 2025HEC: Equivalence Verification Checking for Code Transformation via Equality Saturationcited by 2

Built on by

Not cited yet.