首页> 外文期刊>Malaysian Journal of Computer Science >Simultaneous Escape Routing using Network Flow Optimization
【24h】

Simultaneous Escape Routing using Network Flow Optimization

机译:使用网络流优化的同时逃生路由

获取原文
           

摘要

With the advancement in technology, the size of electronic components and printed circuit boards (PCB) is becoming small while the pin count of each component is increasing. This has necessitated the use of ball grid array (BGA) type of components where pins are attached under the body of component as a grid. The problem of routing pins from under the body of component to the boundary of the component is known as escape routing. It is often desirable to perform ordered simultaneous escape routing (SER) to facilitate area routing and produce elegant PCB design. The task of SER is non-trivial, given the small size of components and hundreds of pins arranged in random order in each component that needs ordered connectivity. In this paper, first we propose flow models for different inter pin capacities. We then propose linear network flow optimization model that simultaneously solves the net ordering and net escape problem. The model routes maximum possible nets between two components of the PCB, by considering the design rules. Comparative analysis shows that the proposed optimization model performs better than the existing routing algorithms in terms of number of nets routed.
机译:随着技术的进步,电子组件和印刷电路板(PCB)的尺寸越来越小,而每个组件的引脚数却越来越多。这就需要使用球栅阵列(BGA)类型的组件,其中将引脚作为网格连接在组件的主体下。从组件主体下方到组件边界的引脚布线问题称为逃逸布线。通常希望执行有序的同时逃生布线(SER),以促进区域布线并产生精美的PCB设计。鉴于组件的尺寸小以及在需要有序连接的每个组件中以随机顺序排列的数百个引脚,SER的任务并不简单。在本文中,首先我们针对不同的引脚间容量提出了流量模型。然后,我们提出了线性网络流量优化模型,该模型同时解决了网络排序和网络逃逸问题。通过考虑设计规则,该模型在PCB的两个组件之间路由最大可能的网络。比较分析表明,所提出的优化模型在路由网络数量方面比现有路由算法表现更好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号