基于自組織特征映射特性的柵陣列排序算法
A SOFM ALGORITHM FOR GATE MATRIX LAYOUT
-
摘要: 本文應(yīng)用自組織特征映射神經(jīng)網(wǎng)絡(luò)的競爭學(xué)習(xí)和自組織特性,并根據(jù)柵陣列排序問題的性質(zhì)來設(shè)定網(wǎng)絡(luò)的競爭原則,建立了一個柵陣列排序算法.實(shí)驗(yàn)證明該算法可以求得十分接近全局最優(yōu)解下限的布圖結(jié)果.該算法的時間復(fù)雜度為O(np2In p),n為線網(wǎng)數(shù),p為主柵列數(shù).
-
關(guān)鍵詞:
- 自組織特征映射; 柵陣列排序; 最優(yōu)化設(shè)計(jì)
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. -
康泰兆,王靈峰,林昌.柵陣列排序的一個有效算法.南京理工大學(xué)學(xué)報(bào),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. -
計(jì)量
- 文章訪問數(shù): 2207
- HTML全文瀏覽量: 135
- PDF下載量: 404
- 被引次數(shù): 0
下載:
