• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

使用三层力导向自组织映射的带直线模块的超大规模集成电路电路布局。

VLSI circuit placement with rectilinear modules using three-layer force-directed self-organizing maps.

作者信息

Chang R I, Hsiao P Y

机构信息

Inst. of Inf. Sci., Acad. Sinica, Taipei.

出版信息

IEEE Trans Neural Netw. 1997;8(5):1049-64. doi: 10.1109/72.623207.

DOI:10.1109/72.623207
PMID:18255708
Abstract

In this paper, a three-layer force-directed self-organizing map is designed to resolve the circuit placement problem with arbitrarily shaped rectilinear modules. The proposed neural model with an additional hidden layer can easily model a rectilinear module by a set of hidden neurons to correspond the partitioned rectangles. With the collective computing from hidden neurons, these rectilinear modules can correctly interact with each other and finally converge to a good placement result. In this paper, multiple contradictory criteria are accounted simultaneously during the placement process, in which, both the wire length and the module overlap are reduced. The proposed model has been successfully exploited to solve the time consuming rectilinear module placement problem. The placement results of real rectilinear test examples are presented, which demonstrate that the proposed method is better than the simulated annealing approach in the total wire length. The appropriate parameter values which yield good solutions are also investigated.

摘要

本文设计了一种三层力导向自组织映射,以解决具有任意形状直线型模块的电路布局问题。所提出的具有附加隐藏层的神经模型可以通过一组隐藏神经元轻松地对直线型模块进行建模,以对应划分后的矩形。通过隐藏神经元的集体计算,这些直线型模块可以正确地相互作用,并最终收敛到一个良好的布局结果。本文在布局过程中同时考虑了多个相互矛盾的标准,其中线长和模块重叠都得以减少。所提出的模型已成功用于解决耗时的直线型模块布局问题。给出了实际直线型测试实例的布局结果,表明所提出的方法在总线长方面优于模拟退火方法。还研究了能产生良好解决方案的合适参数值。

相似文献

1
VLSI circuit placement with rectilinear modules using three-layer force-directed self-organizing maps.使用三层力导向自组织映射的带直线模块的超大规模集成电路电路布局。
IEEE Trans Neural Netw. 1997;8(5):1049-64. doi: 10.1109/72.623207.
2
Mapping and hierarchical self-organizing neural networks for VLSI placement.
IEEE Trans Neural Netw. 1997;8(2):299-314. doi: 10.1109/72.557668.
3
An evolutionary neural network approach for module orientation problems.一种用于模块定向问题的进化神经网络方法。
IEEE Trans Syst Man Cybern B Cybern. 1998;28(6):849-55. doi: 10.1109/3477.735394.
4
A fast neural-network algorithm for VLSI cell placement.一种用于超大规模集成电路单元布局的快速神经网络算法。
Neural Netw. 1998 Dec;11(9):1671-1684. doi: 10.1016/s0893-6080(98)00089-6.
5
Solving optimization problems by parallel recombinative simulated annealing on a parallel computer-an application to standard cell placement in VLSI design.在并行计算机上通过并行重组模拟退火算法解决优化问题——在超大规模集成电路设计中标准单元布局的应用
IEEE Trans Syst Man Cybern B Cybern. 1998;28(3):454-61. doi: 10.1109/3477.678649.
6
Handwritten digit recognition by adaptive-subspace self-organizing map (ASSOM).基于自适应子空间自组织映射(ASSOM)的手写数字识别。
IEEE Trans Neural Netw. 1999;10(4):939-45. doi: 10.1109/72.774267.
7
Effective Memetic Algorithms for VLSI design = Genetic Algorithms + local search + multi-level clustering.用于超大规模集成电路设计的有效Memetic算法 = 遗传算法 + 局部搜索 + 多级聚类。
Evol Comput. 2004 Fall;12(3):327-53. doi: 10.1162/1063656041774947.
8
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem.包含显式统计信息的Kohonen网络及其在旅行商问题中的应用。
Neural Netw. 1999 Nov;12(9):1273-1284. doi: 10.1016/s0893-6080(99)00063-5.
9
An efficient approach to the travelling salesman problem using self-organizing maps.一种使用自组织映射解决旅行商问题的有效方法。
Int J Neural Syst. 2003 Apr;13(2):59-66. doi: 10.1142/S0129065703001443.
10
Rectangular partition for n-dimensional images with arbitrarily shaped rectilinear objects.用于具有任意形状直线物体的n维图像的矩形划分。
Heliyon. 2024 Aug 8;10(16):e35956. doi: 10.1016/j.heliyon.2024.e35956. eCollection 2024 Aug 30.