Multi-objective Optimisation of Digital Circuits based on Cell Mapping in an Industrial EDA Flow
Linan Cao, Simon J. Bale, Martin A. Trefzer

TL;DR
This paper presents a fully-automated multi-objective EDA flow that globally optimizes digital circuit design by tuning drive strength mapping, resulting in improved power, performance, and area metrics compared to standard flows.
Contribution
It introduces a novel multi-objective population-based search framework for block-level digital circuit optimization within an industrial EDA flow.
Findings
Significant improvements in power, performance, and area metrics.
Enhanced solutions over standard digital flow.
Effective application to benchmark circuits.
Abstract
Modern electronic design automation (EDA) tools can handle the complexity of state-of-the-art electronic systems by decomposing them into smaller blocks or cells, introducing different levels of abstraction and staged design flows. However, throughout each independent-optimised design step, overhead and inefficiency can accumulate in the resulting overall design. Performing design-specific optimisation from a more global viewpoint requires more time due to the larger search space, but has the potential to provide solutions with improved performance. In this work, a fully-automated, multi-objective (MO) EDA flow is introduced to address this issue. It specifically tunes drive strength mapping, preceding physical implementation, through multi-objective population-based search algorithms. Designs are evaluated with respect to their power, performance and area (PPA). The proposed approach…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Multi-Objective Optimization Algorithms · VLSI and FPGA Design Techniques · Optimal Experimental Design Methods
