NYU-MLDA/ABC-RL

This is work-in-progress (WIP) refactored implementation of "Retreival-guided Reinforcement Learning for Boolean Circuit Minimization" work published in ICLR 2024.

33
/ 100
Emerging

This project helps digital circuit designers and hardware engineers reduce the complexity of boolean circuits. It takes in circuit designs as AIG graphs and outputs optimized circuit recipes, aiming to minimize area, delay, and power consumption. The target user is someone working on hardware optimization and digital design.

No commits in the last 6 months.

Use this if you need to automatically discover highly optimized boolean circuit recipes that outperform traditional synthesis methods like 'resyn2'.

Not ideal if you need a quick solution or lack significant computational resources and storage, as training can take weeks and generate hundreds of gigabytes of data.

digital-design circuit-optimization hardware-synthesis boolean-logic EDA-tools
Stale 6m No Package No Dependents
Maintenance 0 / 25
Adoption 4 / 25
Maturity 16 / 25
Community 13 / 25

How are scores calculated?

Stars

8

Forks

2

Language

Verilog

License

GPL-3.0

Last pushed

May 10, 2024

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/NYU-MLDA/ABC-RL"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.