一个VLSI三层布线通孔最少化的启发式算法

Abstract
Figure/Table
References
Related Citation (15)

Download: PDF (1158 KB)
Export: BibTeX | EndNote (RIS)

Abstract In this paper, a heuristic approach for constrained via minimization for VLSI three-layer routing on the basis of segment-crossing graph model is presented. Two types of algorithm-global sense and local sense are combined into the new algorithm. In addition, many physical constraints are taken into consideration. According to the results, this algorithm is verified to be very efficient and encouraging.

Key words： VLSI Constrained via minimization Heuristic Three-layer routing

Received: 06 September 1999

PACS:

TN305.97

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors


	Ma Qi
	Yan Xiaolang

Cite this article:

Ma Qi,Yan Xiaolang. A HEURISTIC ALGORITHM TO THREE-LAYER CONSTRAINED VIA MINIMIZATION[J]. , 2001, 23(10): 1014-1021 .

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y2001/V23/I10/1014