基于自组织特征映射特性的栅阵列排序算法
A SOFM ALGORITHM FOR GATE MATRIX LAYOUT
-
摘要: 本文应用自组织特征映射神经网络的竞争学习和自组织特性,并根据栅阵列排序问题的性质来设定网络的竞争原则,建立了一个栅阵列排序算法.实验证明该算法可以求得十分接近全局最优解下限的布图结果.该算法的时间复杂度为O(np2In p),n为线网数,p为主栅列数.Abstract: Through selecting the network s competition rules by the nature of layout problem, an algorithm based on the competitive learning and self-organization characteristics of Self-Organization Feature Mapping(SOFM) neural network for gate matrix layout is put forward in this paper. Experiments show that the achieved results can be quite approximate to the lower limit of the optimum solutions. The time complexity of this algorithm is O(np2ln p), here n and p are the number of nets and dominant gates, respectively.
-
康泰兆,王灵峰,林昌.栅阵列排序的一个有效算法.南京理工大学学报,1995, 19(2): 109-112.[2]Hong Y, Park K, Kim M. A heuristic algorithm for ordering the columns in one-dimensional logic arrays, IEEE Trans. on CAD, 1989, CAD-8(5): 547-562.[3]Umimder S, Roger Chen CY. tom logic to symbolic layout for gate matrix, IEEE Trans. on CAD, 1992, CAD-11(2): 216-227.[4]Kohonen T, The self-organizing map, Proc. IEEE, 1990, 78(9): 1464-1480. -
计量
- 文章访问数: 2190
- HTML全文浏览量: 130
- PDF下载量: 404
- 被引次数: 0
下载:
