Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《CHINESE JOURNAL OF SEMICONDUCTORS》 1997-08
Add to Favorite Get Latest Update

Cross Point Assignment Algorithm Based on Analysis of Net Type

Li Jiang; Hong Xianlong; Qiao Changge and Cai Yici(Department of Computer Science and Technology, Tsinghua University, Beijing 100084)  
Cross Point Assignment (CPA) is a routing process in the routing system between global routing and detailed routing. The aim of this process is to decide the precisephysical position on the boundaries of the global routing cells(GRCs). This paper gives anew heuristic algorithm for the CPA, which bases on the analysis of the net type afterglobal roting and takes into account the effect of the obstacles inside the GRC during theprocess of the CPA. This algorithm translates the CPA for the whole rouiting area into asequence of single column(row) cross point assignment, and does the CPA using the classic linear assignment algorithm.
【Fund】: 国家攻关项目
【CateGory Index】: TN405
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【References】
Chinese Journal Full-text Database 2 Hits
1 Zhang Yiqian,Xie Min,Hong Xianlong and Cai Yici(Department of Computer Science and Technology,Tsinghua University,Beijing 100084,China);Cross Point Assignment Algorithm Under Consideration of Very Long Nets[J];Chinese Journal of Semiconductors;2002-06
2 Yao Hailong,Zhou Qiang,Hong Xianlong and Cai Yici. (Department of Computer Science & Technology,Tsinghua University,Beijing 100084,China);Cross Point Assignment Algorithm with Crosstalk Constraint[J];Chinese Journal of Semiconductors;2004-04
【Co-references】
Chinese Journal Full-text Database 4 Hits
1 Kong Tianming;Hong Xianlong and Qiao Changge(Dept. of Computer Set. & Tech., Tsinghua University, Beijing 100084)Received 22 July 1996, revised manuscript received 18 November 1996;VEAP: Efficient VLSI Placement Algorithm Based on Global Optimization[J];CHINESE JOURNAL OF SEMICONDUCTORS;1997-09
2 Zhou Feng, Tong Jiarong, Tang Pushan(CAD Institute, Electronic Engineering Department, Fudan University, Shanghai\ 200433);Routing Algorithm for FPGA With Time Constraints[J];CHINESE JOURNAL OF SEMICONDUCTORS;1999-09
3 YU Hong,YAO Bo,HONG Xian- long and CAI Yi- ci ( Departmentof Computer Science and Technology,Tsinghua University,Beijing 10 0 0 84,China);ECOP:A Row- Partition Based Incremental Placement Algorithm for Standard Cell Layout Design[J];Chinese Journal of Semiconductors;2001-01
4 Kong Tianming, Hong Xianlong and Qiao Changge(Department of Computer Science and Technology, Tsinghua University, Beijing\ 100084);POTIF: Efficient Power and Timing Driven Placement Algorithm[J];CHINESE JOURNAL OF SEMICONDUCTORS;1998-01
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved