跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1959新增论文
+1550其中 AI 相关
+212已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 03:26 · 全站最近入库:2026-11-17 23:35各信源进度 →

统计口径与数据新鲜度

统计 2026-11-17 04:03 — 2026-11-18 04:03(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 03:26最近发现新增版本:2026-11-17 23:35库内论文最新更新时间:2026-11-17 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

25,786 已收录论文21,491 AI 相关7,725 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 5 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 03:24(北京时间)
新论文 · v1arXiv:2611.20047

CleanRoute: Reconciling DRC Compliance, Post-Layout Performance, and Runtime in Analog Routing

Bingyang Liu, Ziming Wei, Xiaohan Gao, Yang Hsu, David Z. Pan

原文摘要

Automated analog routing remains a long-standing challenge because design-rule checking (DRC) compliance, post-layout performance preservation, and runtime reduction are difficult to achieve together. Existing analog routers have limited coverage of joined-metal design rules, lack control over topology-induced mismatch, and face a trade-off between DRC violations and runtime on uniform routing grids. In this paper, we introduce CleanRoute, an analog router that reconciles these three targets. Hierarchical rule enforcement assigns DRC checks and repairs to stages where the required geometry is complete, covering rules both between separate metal and where metal joins. IR-drop isolation constructs supply trees from current-mirror relationships and device currents to reduce topology-induced mismatch that geometric matching cannot eliminate and voltage drops along high-current paths. A flush-line grid adds net-specific lines aligned with device-metal edges to a coarse routing grid, providing DRC-compliant connections without uniform refinement. Experiments on ten operational transconductance amplifiers (OTAs) in a commercial 40nm process show that CleanRoute produces DRC-clean and functional layouts that pass layout versus schematic (LVS) checking on all benchmarks, with the strongest overall performance preservation and a median routing runtime of 8.82s, whereas the baselines produce no DRC-clean layouts.

cs.AR

新论文 · v1arXiv:2611.11710

CASCoDe: A Closed-Loop Agentic Framework for Analog Sizing and Layout Co-Design

Ziming Wei, Bingyang Liu, David Z. Pan

原文摘要

Expert analog layouts differ from auto-generated ones in density and regularity, not only in legality: experts make a succession of discrete, hierarchical physical decisions and revisit each after extracted electrical results, while most existing automated flows act on a physical search space fixed before the controller runs. We present CASCoDe, a closed-loop LLM agent framework for analog netlist-to-layout design that formalizes those expert decisions as a hierarchical discrete action space-sizing selection, structural floorplan, local layout refinement, routing-attempt selection-on which the agent runs feedback-driven tree search from a circuit netlist to a verified GDS. The agent authors the circuit-specific floorplans and scripts, and an execution layer of interface adaptations over adapted tools make every action land at physical implementation and be judged by DRC, LVS, and extracted-RC simulation. On 20 SKY130 amplifiers spanning single-, two-, and three-stage topologies, CASCoDe is the only flow that delivers a DRC- and LVS-clean routed layout when meeting design specifications for every circuit. It reduces area by 59-85% (mean 71%) against a conventional P&R flow on identical PCells, raises mean device density from 0.39 to 0.74 against APPlace, MAGICAL, ALIGN and ICPI. A layout that beats every baseline in area and legality appears after 11 minutes of agent time on average, and ablations show that the structured action space and the feedback-guided tree search each reduce area and search cost.

cs.AI

新论文 · v1arXiv:2611.09003

FoundaRF: A Physics-Informed Foundation Model Framework for Radio-Frequency Passive Components

Houbo He, Chris Han, Hyunsu Chae, Lei Xia, Qiang Zhou, Lawrence Liu, Sensen Li, David Z. Pan 等 9 位作者

原文摘要

Designing RF/mmWave passive components is a time-consuming process that relies heavily on expert knowledge and iterative EM simulations. Although recent ML surrogate models have shown great promise in accelerating passive design, they remain task-specific and lack generalization. This paper presents FoundaRF, a foundation model framework that unifies passive layout modeling across diverse layout structures and technologies. It combines a self-supervised encoder with adaptive layout processing and physics-aware decoders to enable few-shot transfer. Experiments across four semiconductor technologies show strong generalization to unseen structures, outperforming baselines with up to a 3.3x reduction in prediction error, reducing labeled-data requirements by up to fourfold, and substantially shortening design turnaround. FoundaRF establishes a scalable and data-efficient solution for RF/mmWave passive design automation.

eess.SP · cs.AI

新论文 · v1arXiv:2610.39515

APPlace: Co-Optimizing Device Locations and Access Points for Routing-Aware Analog Placement

Bingyang Liu, Xiaohan Gao, Souradip Poddar, David Z. Pan

原文摘要

Analog layout automation remains challenging in Analog/Mixed-Signal circuit design, because parasitics and mismatches introduced during layout strongly affect circuit performance. Placement is especially critical among the layout stages, as it constrains the routing solution space and the achievable post-layout performance. Existing analytical placement methods optimize device coordinates under center-based wirelength proxies and leave access point (AP) selection to routing. In analog circuits, however, a routing pin is an extended piece of terminal metal rather than a fixed point, and the best AP on it depends on where the other connected devices are placed, so a coordinate-only placement optimizes for connection points that the router will not use. We present APPlace, a routing-aware analog placement framework that co-optimizes device locations and AP selections during global placement, followed by a legalization stage that preserves the structure established by global placement. Experimental results on four real-world analog benchmarks show that APPlace achieves better overall post-layout performance than representative baselines at comparable layout area. Ablation studies further show that removing AP co-optimization causes up to a 13 dB CMRR loss among the OTA benchmarks and a 23% increase in comparator delay.

cs.AR

版本更新 · v2arXiv:2610.33510

DiffRouter: A Differentiable Routing Framework for UltraScale FPGAs

Xiaohan Gao, Zhili Xiong, Yusu Wang, David Z. Pan

原文摘要

Routing has become a major bottleneck in large-scale FPGA design flows, where traditional routers rely on sequential net-by-net processing and rip-up-reroute heuristics. This inherent sequentialism limits parallelism, leads to suboptimal utilization of routing resources, and significantly increases runtime on modern FPGAs. This paper introduces DiffRouter, the first differentiable, gradient-based FPGA routing framework with GPU acceleration. By lifting routing into a continuous optimization space, DiffRouter enables highly concurrent routing and improved global optimality before projecting solutions back onto the discrete fabric. The framework consists of three key stages: (1) Resource-pruned preprocessing, which extracts compact routing variables per net to reduce memory footprint and problem complexity; (2) Differentiable global routing via gradient descent, which formulates routing as a Lagrangian-relaxed optimization that minimizes wirelength while iteratively enforcing connectivity and congestion constraints as relaxed terms; and (3) Postprocessing, which maps the continuous wire distributions to a valid UltraScale routing solution and completes solutions by detailed routing. Experiments on the FPGA 2024 Routing Contest benchmarks show that DiffRouter outperforms state-of-the-art parallel routers, achieving over 5x speedup over RWRoute and 2x over Vivado, and running 18% faster than the state-of-the-art academic FPGA router Potter while delivering competitive critical path wirelength.

cs.AR