Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ilyas Elkin

dblp:135/2059 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 56% Integrated circuit design · 44%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis
0.512021
PrefixRL: Optimization of Parallel Prefix Circuits using Deep Reinforcement Learning · DAC 2021
Integrated circuit design › digital arithmetic circuits › parallel adder
parallel prefix adder
0.512021
PrefixRL: Optimization of Parallel Prefix Circuits using Deep Reinforcement Learning · DAC 2021
Electronic design automation
design space exploration
0.112021
PrefixRL: Optimization of Parallel Prefix Circuits using Deep Reinforcement Learning · DAC 2021

Methods — techniques the papers use, named apart from their topics

synthesis in the loop · 0.5deep reinforcement learning · 0.5convolutional neural network · 0.5
YearPublicationVenuePosition
2021 PrefixRL: Optimization of Parallel Prefix Circuits using Deep Reinforcement Learning
abstract
In this work, we present a reinforcement learning (RL) based approach to designing parallel prefix circuits such as adders or priority encoders that are fundamental to high-performance digital design. Unlike prior methods, our approach designs solutions tabula rasa purely through learning with synthesis in the loop. We design a grid-based state-action representation and an RL environment for constructing legal prefix circuits. Deep Convolutional RL agents trained on this environment produce prefix adder circuits that Pareto-dominate existing baselines with up to 16.0% and 30.2% lower area for the same delay in the 32b and 64b settings respectively. We observe that agents trained with open-source synthesis tools and cell library can design adder circuits that achieve lower area and delay than commercial tool adders in an industrial cell library.
Rajarshi Roy 0003, Jonathan Raiman, Neel Kant, Ilyas Elkin, Robert Kirby 0001, Michael Y. Siu, Stuart F. Oberman, Saad Godil, Bryan Catanzaro
DAC4