Papers for

semiconductor foundry optimization teams

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Adaptive transistor sizing finds better designs using shape of solution space

ATLAS: Adaptive TDA-guided Landscape-Aware Transistor Sizing

Abstract: Analog transistor sizing, finding design parameters that simultaneously satisfy multiple performance specifications, is a labor-intensive bottleneck in circuit design. To support analog circuit experts, various automation methods have been proposed, including Bayesian optimization (BO), reinforcement learning (RL), and others. Yet existing methods are oblivious to the topological structure of a feasible design space, which can fragment into disconnected regions due to operating-regime transitions, conflicting specification trade-offs, and nonconvex device physics. This topological blindness causes the optimizer to converge within a single feasible region while missing others that may contain superior designs. To address this limitation, we propose ATLAS. a BO framework utilizing Topological Data Analysis (TDA). At each iteration, a Mapper graph is constructed over a surrogate-predicted feasible region to estimate connected regions, enabling topology-aware exploration from the very first iteration without any observed feasible points. A topological sensitivity score classifies candidates as bridge, frontier, or interior points, injecting a targeted exploration bonus into the acquisition function. Experiments on four analog circuit benchmarks in the GF180 and SKY130 processes demonstrate that \coin finds feasible designs with significantly fewer simulations than baselines, including RL and BO methods. To the best of our knowledge, this is the first work to apply topological data analysis to analog circuit design automation. The official implementation is publicly available on https://github.com/youngmin0oh/atlas.

Wed 7 OctHardware Architecture
The gist
Designing analog circuits is hard because many good solutions exist but are scattered in groups that don’t connect smoothly. The authors created a method called ATLAS that looks at the overall shape and structure of all possible good designs instead of just searching randomly. This helps find better circuit setups faster by jumping between different groups of good designs. They tested ATLAS on real circuit problems and showed it needed fewer tries than older methods to find working designs.
Open → 2610.10985v1