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

Sascha Richter

dblp:74/11163 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
logic restructuring
0.912025
Logic Restructuring with Preserved Logic Blocks · DAC 2025
Electronic design automation
logic synthesis
0.912025
Logic Restructuring with Preserved Logic Blocks · DAC 2025
Electronic design automation › logic synthesis › logic optimization
technology-independent optimization
0.912025
Logic Restructuring with Preserved Logic Blocks · DAC 2025
Electronic design automation › logic synthesis
technology mapping
0.912025
Logic Restructuring with Preserved Logic Blocks · DAC 2025

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

resubstitution · 0.9AIG · 0.9
YearPublicationVenuePosition
2025 Logic Restructuring with Preserved Logic Blocks
abstract
During technology mapping, complex cells such as adders and multiplexers are often available in the standard cell library, which helps improve the final PPA results. However, technology-independent optimization tends to over-optimize towards the cost metrics measurable with technology-independent representations (e.g., AIG size) by decomposing blocks of logic that could have been mapped into complex cells. Besides, it is also of practical interest to model and preserve some special logic components, such as the enable logic of flops, during optimization. This paper studies “boxing” logic blocks before technology-independent optimization and preserving them during optimization. A wire-based resubstitution is proposed to optimize boxed networks. Experiments with academic and industrial benchmarks show that transparent-boxing, i.e., preserving boxes while utilizing the information on their logic, achieves better results than black-boxing, i.e., completely ignoring the logic in boxes. Specifically, in the technology-independent evaluation, transparentboxing reduces the mapped network size by 4% more than blackboxing; in the full-flow evaluation, transparent-boxing achieves 1.8% more improvement on timing and similar improvements in area, power, and wire length compared to black-boxing.
Siang-Yun Lee, Heinz Riener, Sascha Richter, Ankush Sood
DAC3