Pith. sign in

REVIEW 4 cited by

OpenABC-D: A Large-Scale Dataset For Machine Learning Guided Integrated Circuit Synthesis

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.11292 v1 pith:BGPQ4YGD submitted 2021-10-21 cs.LG cs.AIcs.SYeess.SY

classification cs.LGcs.AIcs.SYeess.SY
keywords synthesisdatasetlogiccircuitlearningopenabc-dproblemathttps
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Logic synthesis is a challenging and widely-researched combinatorial optimization problem during integrated circuit (IC) design. It transforms a high-level description of hardware in a programming language like Verilog into an optimized digital circuit netlist, a network of interconnected Boolean logic gates, that implements the function. Spurred by the success of ML in solving combinatorial and graph problems in other domains, there is growing interest in the design of ML-guided logic synthesis tools. Yet, there are no standard datasets or prototypical learning tasks defined for this problem domain. Here, we describe OpenABC-D,a large-scale, labeled dataset produced by synthesizing open source designs with a leading open-source logic synthesis tool and illustrate its use in developing, evaluating and benchmarking ML-guided logic synthesis. OpenABC-D has intermediate and final outputs in the form of 870,000 And-Inverter-Graphs (AIGs) produced from 1500 synthesis runs plus labels such as the optimized node counts, and de-lay. We define a generic learning problem on this dataset and benchmark existing solutions for it. The codes related to dataset creation and benchmark models are available athttps://github.com/NYU-MLDA/OpenABC.git. The dataset generated is available athttps://archive.nyu.edu/handle/2451/63311

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. OpenLS-DGF: An Adaptive Open-Source Dataset Generation Framework for Machine Learning Tasks in Logic Synthesis

    cs.AI 2024-11 conditional novelty 6.0 of 10

    OpenLS-DGF generates and packages a 966k-circuit multi-task logic synthesis dataset from 46 designs, demonstrated on four ML tasks with high reported accuracy.

  2. ForgeEDA: A Comprehensive Multimodal Dataset for Advancing EDA

    cs.AR 2025-05 conditional novelty 5.0 of 10

    ForgeEDA introduces a large multimodal circuit dataset spanning RTL code, post-mapping netlists, placed netlists, and AIGs, with small benchmark experiments on synthesis tools and AI4EDA models.

  3. ReasoningV: Efficient Verilog Code Generation with Adaptive Hybrid Reasoning Model

    cs.AR 2025-04 conditional novelty 5.0 of 10

    A 7B Verilog generation model with a verified 5K dataset, two-stage training, and an adaptive reasoning router reaches 57.8% pass@1 on VerilogEval-human, 10.4 points over the prior best open-source Verilog-specific model.

  4. Architectural Exploration of Application-Specific Resonant SRAM Compute-in-Memory (rCiM)

    cs.AR 2024-11 reject novelty 4.0 of 10

    The paper presents a design-space exploration tool for resonant SRAM compute-in-memory and claims 80.9% average energy savings, but the detailed results report much smaller and conflicting savings.

Pith tools