Advanced Search
Volume 19 Issue 6
Nov.  1997
Turn off MathJax
Article Contents
Lin Chang, Kang Taizhao. A SOFM ALGORITHM FOR GATE MATRIX LAYOUT[J]. Journal of Electronics & Information Technology, 1997, 19(6): 843-846.
Citation: Lin Chang, Kang Taizhao. A SOFM ALGORITHM FOR GATE MATRIX LAYOUT[J]. Journal of Electronics & Information Technology, 1997, 19(6): 843-846.

A SOFM ALGORITHM FOR GATE MATRIX LAYOUT

  • Received Date: 1996-06-05
  • Rev Recd Date: 1997-01-20
  • Publish Date: 1997-11-19
  • 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.
  • loading
  • 康泰兆,王灵峰,林昌.栅阵列排序的一个有效算法.南京理工大学学报,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.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (2185) PDF downloads(404) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return