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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yupeng Wan

dblp:327/1706 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · unresolved

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 · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis
0.612022
HIMap: a heuristic and iterative logic synthesis approach · DAC 2022
Electronic design automation › logic synthesis
synthesis flow optimization
0.612022
HIMap: a heuristic and iterative logic synthesis approach · DAC 2022
Electronic design automation › logic synthesis
technology mapping
0.612022
HIMap: a heuristic and iterative logic synthesis approach · DAC 2022

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

iterative local search · 0.6heuristic search · 0.6early stopping · 0.6
YearPublicationVenuePosition
2022 HIMap: a heuristic and iterative logic synthesis approach
abstract
Recently, many models show their superiority in sequence and parameter tuning. However, they usually generate non-deterministic flows and require lots of training data. We thus propose a heuristic and iterative flow, namely HIMap, for deterministic logic synthesis. In which, domain knowledge of the functionality and parameters of synthesis operators and their correlations to netlist PPA is fully utilized to design synthesis templates for various objetives. We also introduce deterministic and effective heuristics to tune the templates with relatively fixed operator combinations and iteratively improve netlist PPA. Two nested iterations with local searching and early stopping can thus generate dynamic sequence for various circuits and reduce runtime. HIMap improves 13 best results of the EPFL combinational benchmarks for delay (5 for area). Especially, for several arithmetic benchmarks, HIMap significantly reduces LUT-6 levels by 11.6 ~ 21.2% and delay after P&R by 5.0 ~ 12.9%.
Xing Li 0023, Lei Chen 0031, Mingxuan Yuan, Hongli Yan, Yupeng Wan
DAC6