拉格朗日法布线设计

Proceedings 1995 Second New Zealand International Two-Stream Conference on Artificial Neural Networks and Expert Systems Pub Date : 1995-11-20 DOI:10.1109/ANNES.1995.499506

M. Nagamatu, S. Ismail, T. Yanaru

{"title":"拉格朗日法布线设计","authors":"M. Nagamatu, S. Ismail, T. Yanaru","doi":"10.1109/ANNES.1995.499506","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new algorithm which solves the routing problem of LSI layout design as a continuous valued constrained optimization problem. All continuous valued wires change their values simultaneously according to the dynamic equations of Lagrangian method, hence this method is suitable for neurocomputing. We show that this method can solve the small switchbox routing problems with a higher completion rate as compared to the rip-up reroute maze router.","PeriodicalId":123427,"journal":{"name":"Proceedings 1995 Second New Zealand International Two-Stream Conference on Artificial Neural Networks and Expert Systems","volume":"173 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lagrangian method for wire routing of layout design\",\"authors\":\"M. Nagamatu, S. Ismail, T. Yanaru\",\"doi\":\"10.1109/ANNES.1995.499506\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a new algorithm which solves the routing problem of LSI layout design as a continuous valued constrained optimization problem. All continuous valued wires change their values simultaneously according to the dynamic equations of Lagrangian method, hence this method is suitable for neurocomputing. We show that this method can solve the small switchbox routing problems with a higher completion rate as compared to the rip-up reroute maze router.\",\"PeriodicalId\":123427,\"journal\":{\"name\":\"Proceedings 1995 Second New Zealand International Two-Stream Conference on Artificial Neural Networks and Expert Systems\",\"volume\":\"173 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1995 Second New Zealand International Two-Stream Conference on Artificial Neural Networks and Expert Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ANNES.1995.499506\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1995 Second New Zealand International Two-Stream Conference on Artificial Neural Networks and Expert Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANNES.1995.499506","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了一种新的算法，将LSI版图设计中的布线问题作为连续值约束优化问题来解决。根据拉格朗日方法的动力学方程，所有的连续值线同时改变其值，因此该方法适用于神经计算。研究结果表明，与撕裂式重路由迷宫路由器相比，该方法能够以更高的完成率解决小型开关箱路由问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Lagrangian method for wire routing of layout design

In this paper, we propose a new algorithm which solves the routing problem of LSI layout design as a continuous valued constrained optimization problem. All continuous valued wires change their values simultaneously according to the dynamic equations of Lagrangian method, hence this method is suitable for neurocomputing. We show that this method can solve the small switchbox routing problems with a higher completion rate as compared to the rip-up reroute maze router.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 1995 Second New Zealand International Two-Stream Conference on Artificial Neural Networks and Expert Systems

自引率

0.00%

发文量