English(EN) Provably Optimal HBT Legalization in Seconds: Certified Optima Reveal Where the Headroom Really Lies

新的求解器GEO-Exact实现了可证明最优的HBT合法化

作者 PulseAugur 编辑部 · [1 个来源] · 2026-11-14 05:00

研究人员开发了GEO-Exact，一个用于混合键合终端（HBT）合法化的开源求解器，该求解器能在几秒钟内实现可证明的最优解。该方法显著优于现有的启发式方法，对ViaLegal和BTAssign等常用方法的重建显示，平均偏差仅为0.011%，而BTAssign的偏差最高可达最优解的6.9%。研究还表明，尤其是在更高的利用率下，仍有显著的改进空间，即使是滑动窗口方法也能挽回大量的位移。 AI

影响这项研究引入了一种新颖的、可证明最优的HBT合法化求解器，有望提高3D IC设计的效率。

排序理由该集群包含一篇详细介绍新算法和特定技术问题的基准测试的研究论文。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.AI 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 6 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该集群包含一篇详细介绍新算法和特定技术问题的基准测试的研究论文。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: Standard; On-topic for AI-industry coverage; kept in the public index.
Story freshness: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.AI TIER_1 English(EN) · Kadhir Parani, Manjunath Bezawada, Divya M, Kesana Jathin, Kolli Sarath, Sm Zobaed · 2026-11-14 05:00

秒级可证明最优HBT合法化：认证最优值揭示了真正的增长空间所在

arXiv:2611.14928v1 Announce Type: new Abstract: Hybrid bonding terminal (HBT) legalization assigns every terminal of a face-to-face 3D IC to its own pitch-grid site with minimum total Manhattan displacement. Open3DBench reports that a reinforcement-learning (RL) legalizer reduces…

本文如何被排名

报道来源 [1]

秒级可证明最优HBT合法化：认证最优值揭示了真正的增长空间所在

相关实体

相关话题