Topology as a Design Variable: Joint Architecture-Sizing Optimization for SRAM
Authors: Can Wang, Junhao Ma, Yikai Wang, Shan Shen, Wei W. Xing
Organizations: Nanjing University of Sci.&Tech., Nanjing, China · Institute of Microelectronics of the Chinese Academy of Sciences, Beijing, China · University of Sheffield, Sheffield, United Kingdom
SRAM's power-performance-area-stability trade-off depends on bitcell topology, a discrete architectural choice that interacts non-separably with continuous transistor sizing. However, no open-source SRAM tool treats topology as an optimizable variable. OpenRAM generates SRAM layouts but performs no optimization, while OpenYield supports high-fidelity evaluation but restricts optimization to scalar sizing of a fixed 6T cell. OpenYieldV2 closes this gap through three integrated contributions. First, a fully parameterized compiler generates complete 6T and 10T SRAM macros with peripheral circuits and replica-bitline self-timing, enabling topology comparison under identical simulation conditions. Second, a few-shot TabPFN surrogate learns topology-dependent PPA responses with limited full-macro SPICE samples. Third, a coarse-to-refined multi-objective optimizer combines global exploration of discrete architectural choices with local refinement of continuous transistor sizes. Experiments across varying design conditions reveal a topology decision boundary that shifts with operating constraints rather than following a fixed design rule. Jointly optimizing across this boundary improves hypervolume by up to 17.3% over the strongest single-topology baseline. OpenYieldV2 is open-source to support reproducible SRAM design research.
Figures & tables
Figure 1. The OpenYieldV2 pipeline. The main entry point, main_sram.py , reads YAML configurations and invokes testbenches, which instantiate SRAM circuits from subcircuits and run Xyce simulations. Simulation results support surrogate modeling and optimization.
Figure 2. SRAM macro organization in OpenYieldV2. The bitcell array is surrounded by complete peripheral circuits, generated identically regardless of which bitcell topology is selected.
VDD
Metric
6T Cell
10T Cell
Unit
Mean
Std
Mean
Std
1.0 V
Hold SNM
0.347
0.010
0.351
0.008
V
Read SNM
0.152
0.013
0.171
0.013
V
Write SNM
0.797
0.026
0.878
0.023
V
Read Tswing
0.135
0.008
0.141
0.005
ns
Write TcellQ
0.160
0.013
0.162
0.011
ns
Table 1. SNM and timing comparison for 6T and 10T cells at nominal and near-threshold supply voltages (TT, 25\SIUnitSymbolCelsius ).
Figure 3. Mean and standard deviation of read/write delay across PVT corners for a 6T SRAM with parasitics, from 100 Monte Carlo simulations.
Figure 4. Kendall rank correlation ( τ ) of different surrogates versus the number of training samples.
Target
Macro-WAPE (%) ↓ (Target + Cross-Topology)
Reduction (%) ↑
50+0
50+100
50+200
50+500
10T
10.20±1.61
6.78±0.74
6.08±0.46
5.73±0.15
43.9
6T
9.83±1.37
6.58±0.88
5.37±0.27
4.48±0.37
54.5
Table 2. Cross-topology knowledge reuse in a unified TabPFN surrogate.
Figure 5. Joint search recovers both topologies on a single front.
Figure 6. Topology decision boundaries between 6T and 10T SRAM under different design requirements. The color represents the fraction of 10T solutions in the non-dominated set.
Scen.
Method
HV ↑
IGD ↓
6T/10T (%)
S1
6T-only
0.648 ± 0.011
0.222 ± 0.001
100/0
10T-only
0.358 ± 0.007
0.455 ± 0.003
0/100
Separate-Union (500+500)
0.731 ± 0.018
0.071 ± 0.008
50/50
Joint search
0.739 ± 0.023
0.067 ± 0.017
60.2/39.8
S2
6T-only
0.485 ± 0.039
0.276 ± 0.026
100/0
10T-only
0.366 ± 0.022
0.416 ± 0.013
0/100
Table 3. Joint topology–sizing search versus topology-fixed and equal-split separate-search baselines under representative design scenarios.
Figure 7. Joint topology–sizing optimization comparison with baseline optimizers.
Algorithm
Topology Fixed
Joint Optimization
HV ↑
IGD ↓
HV ↑
IGD ↓
C-TAEA
0.818
0.2104
0.851
0.1093
ParEGO
0.780
0.2000
0.883
0.1058
MACE
0.774
0.1967
0.889
0.1302
GPBO
0.789
0.2207
0.893
0.1264
NSGA-II
0.790
0.1636
0.956
0.0672
Table 4. Performance comparison of baseline algorithms and the proposed coarse-to-refine method under heuristic topology selection and joint topology optimization.
Item
I0
P1
P2
P3
P4
P5
P6
P7
Architecture and bitcell variables
Topology
6T
6T
6T
6T
10T
10T
10T
10T
Array R×C×NA
128×32×64
128×128×16
128×128×16
128×128×16
128×128×16
128×128×16
128×128×16
128×128×16
WPU/WPD
90.0/205.0
87.9/233.0
93.0/225.5
84.3/192.3
79.2/210.3
86.2/231.2
86.8/231.8
75.7/196.7
WPG/WFD
135.2/–
127.5/–
115.8/–
129.6/–
118.0/152.4
148.9/161.2
145.6/160.5
110.1/161.1
Lcell
55.0
55.8
54.1
51.9
51.3
51.4
51.3
57.2
Table 5. Representative designs from the proposed joint 6T/10T topology–sizing search. I0 is the initial 6T reference design, and P1 – P7 are selected joint-search candidates that satisfy the electrical constraints under nominal SPICE evaluation. Transistor dimensions are in nm unless otherwise stated.
This paper proposes a co-optimization framework that jointly optimizes SRAM architecture and transistor sizing using equivalent circuit models. The framework simplifies inactive SRAM cells into equivalent RC loads and static power models, achieving up to 61.4× simulation speedup while maintaining high fidelity (read/write delay error <0.22%, power error <1.68%). A joint search space encompassing architecture parameters and device sizing integrates seven algorithms including SA, PSO, Bayesian Optimization variants, and multi-objective evolutionary algorithms. Based on FreePDK45, ablation experiments confirm complementary gains from architecture selection and transistor sizing. Among all algorithms, MOEA/D achieves the best Figure of Merit (8.2721), yielding 6.2% improvement in SNM, 73.6% reduction in area, and 42.3% reduction in peak power. The framework is publicly available at https://github.com/W1Y1K1/OpenOpt.
Yikai Wang, Yiheng Wu, Can Wang +5
Nanjing University of Science and Technology, Nanjing, 210094, China · Shenzhen University,Shenzhen, 518060, China · Beihang University, Beijing, 100191, China
Transistor topology optimization is a critical step in standard cell design, directly dictating diffusion sharing efficiency and downstream routability. However, identifying optimal topologies remains a persistent bottleneck, as conventional exhaustive search methods become computationally intractable with increasing circuit complexity in advanced nodes. This paper introduces TOPCELL, a novel and scalable framework that reformulates high-dimensional topology exploration as a generative task using Large Language Models (LLMs). We employ Group Relative Policy Optimization (GRPO) to fine-tune the model, aligning its topology optimization strategy with logical (circuit) and spatial (layout) constraints. Experimental results within an industrial flow targeting an advanced 2nm technology node demonstrate that TOPCELL significantly outperforms foundation models in discovering routable, physically-aware topologies. When integrated into a state-of-the-art (SOTA) automation flow for a 7nm library generation task, TOPCELL exhibits robust zero-shot generalization and matches the layout quality of exhaustive solvers while achieving an 85.91x speedup.
Zhan Song, Yu-Tung Liu, Chen Chen +6
University of Maryland College Park, USA · NVIDIA Santa Clara, CA, USA · NVIDIA Austin, TX, USA
Digital Compute-in-Memory (DCiM) accelerates neural networks by reducing data movement. Approximate DCiM can further improve power-performance-area (PPA), but demands accuracy-constrained co-optimization across coupled architecture and transistor-level choices. Building on OpenYield, we introduce Accuracy-Constrained Co-Optimization (ACCO) and present OpenACMv2, an open framework that operationalizes ACCO via two-level optimization: (1) accuracy-constrained architecture search of compressor combinations and SRAM macro parameters, driven by a fast GNN-based surrogate for PPA and error; and (2) variation- and PVT-aware transistor sizing for standard cells and SRAM bitcells using Monte Carlo. By decoupling ACCO into architecture-level exploration and circuit-level sizing, OpenACMv2 integrates classic single- and multi-objective optimizers to deliver strong PPA-accuracy tradeoffs and robust convergence. The workflow is compatible with FreePDK45 and OpenROAD, supporting reproducible evaluation and easy adoption. Experiments show that the proposed two-level ACCO framework achieves most of its accuracy-constrained efficiency gain at Level-1 through architecture exploration, delivering roughly 50%+ PDP reduction, while Level-2 transistor-level optimization provides a further single-digit PDP improvement while preserving accuracy, enabling rapid "what-if" exploration for approximate DCiM. The framework is available on GitHub (https://github.com/ShenShan123/OpenACM).
Yiqi Zhou, Yue Yuan, Yikai Wang +8
Nanjing University of Science and Technology, China · Shenzhen University, China · Beihang University, China +2