Searcharxiv⌕ Search

arXiv · 2610.31024

NN-Based Transistor Modeling for Ultra-Fast SPICE Simulation and Standard Cell Library Characterization

Abstract

Neural network (NN)-based transistor models have proven to be a promising solution to accelerate device modeling. Although these models demonstrated remarkable speedup in circuit simulations, they were not rigorously tested in complex tasks within standard EDA tool flows for chip design, which require very high transistor model precision to provide accurate results and converge properly. To investigate their full potential and promise, we develop NN-based transistor models that accurately predict the drain current and various charges for a 3nm nanosheet, and employ the models for a standard cell library characterization. This enables us to evaluate the accuracy and speedup under a very wide range of SPICE simulations, benchmarking our models against an industry-standard implementation. Since standard cell library characterization involves thousands of SPICE simulations, it serves as a great benchmark for transistor model quality and consistency. To further evaluate model accuracy, we also perform analog- and digital-level simulations for various complex circuits. Our experiments reveal that NN-based models are a valid alternative to existing transistor compact models, capable of producing accurate delay and power estimates with a much higher speed and convergence time compared to the conventional Verilog-A-based industry-standard (BSIM-CMG) transistor compact model. Our NNs achieve sub-0.11% and 0.76% errors for delay and total power evaluation on a wide range of circuits, while taking up to 8 times less time during the standard cell library characterization. Additionally, we provide comprehensive information and guidance on NN accuracy, unveiling the relationship between NN size and its effect on circuit simulation precision.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rodion Novkin, Hussam Amrouch. 2026-10-22. NN-Based Transistor Modeling for Ultra-Fast SPICE Simulation and Standard Cell Library Characterization. https://arxiv.org/abs/2610.31024

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Entangled Futures: Quantum Computing's Potential and Challenges in Computer Science

Quantum computing represents a fundamental shift in computation, promising to solve problems currently intractable for classical computers. However, misconceptions persist; quantum computers are not universally faster, nor do they replace classical systems. Current Noisy Intermediate-Scale Quantum (NISQ) devices face significant challenges, including decoherence, high error rates, and limited scalability. Additionally, leveraging quantum systems requires rethinking traditional computing principles, adopting different programming models, and addressing the complexities of integrating quantum and classical workflows, making their practical use in computer science both demanding and non-trivial. This article provides a system-level perspective on quantum computing for computer scientists, software engineers, and IT professionals, examining its current capabilities, key architectural and software challenges, and potential paths toward quantum advantage in real-world applications within hybrid quantum-classical environments.

cs.ET↗

BERS: Locally Optimal Continuous Algorithm for Maritime Weather Routing with Just-in-Time Arrival

Maritime weather routing must optimize route geometry under dynamic wind-wave conditions, obstacle constraints, and fixed-arrival requirements. We present Bézier Evolve and Refine Strategy (BERS), a two-stage framework that combines global evolutionary search (CMA-ES) with local variational refinement (FMS). Routes are parametrized as Bézier curves and evaluated with dense along-path sampling, enabling smooth trajectories while preserving practical feasibility constraints and accounting for mid-segment effects. We evaluate BERS on synthetic benchmarks designed to stress seven operational criteria: continuity, obstacle avoidance, dynamic adaptation, flexible objective design, constant-load feasibility, just-in-time arrival, and local optimality. Across these tests, BERS matches or improves published baselines while maintaining robust convergence under challenging flow fields and land geometries. We then validate the method on real ocean data using hourly ERA5 forcing over 366 daily departures in 2024 for two trans-oceanic corridors (Atlantic and Pacific), with a physics-based model of an 88m cargo vessel with optional rigid wingsails. In real-ocean experiments, route optimization alone reduces mean propulsive energy by 23--59\% versus great-circle baselines of the same propulsion mode. Combined with wind-assisted propulsion, total savings reach up to 75\%. These results show that BERS provides a practical and scalable foundation for just-in-time, energy-efficient weather routing in maritime decarbonization workflows.

cs.ET↗

Local learning with imperfect analog synapses

Analog in-memory computing delivers efficient neural network inference at the edge, but systems deployed in non-stationary environments may need to adapt in situ to locally acquired data. Backpropagation faces two structural obstacles here. Its global error transport lets stochastic write errors compound across layers, and its backward pass demands bidirectional, high-precision peripheral circuitry absent from inference-oriented crossbar arrays. We introduce Channel-wise Spatial Gradient learning (CwSG), a strictly local, forward-only rule that trains each convolutional layer by rewarding spatial variation in its feature maps. In simulations replaying the measured trajectories of 1,189 phase-change memory and 1,268 filamentary memristor devices, CwSG learns with single, unverified, sub-1 V pulses. It matches backpropagation on phase-change memory with 59-fold fewer pulses and outperforms it by 53 percentage points on highly variable filamentary memristors, with 8-bit forward converters and without transposed crossbar reads or network-wide activation storage. Analog training thus becomes a problem of credit assignment, in which algorithmic design rather than hardware compensation alone overcomes severe programming noise.

cs.ET↗