Logo image
Implicit Connection Graph Maze Routing for Layout Migration
Thesis

Implicit Connection Graph Maze Routing for Layout Migration

Lin, Ting Chun
Masters, 國立清華大學, 資訊工程學系
2014

Abstract

製程遷徙 隱性連通圖 迷宮繞線 layout Migration Implicit Connection Graph Maze Routing
With advanced Very-Large-Scale Integration (VLSI) technology, migration method is more important in analog circuit or some special custom design. Sometimes two blocks in circuit will be migrated with different scale factor, and result in some connection between two blocks broken. To solve the problem described before, we propose a scanline base break point detection method that can construct the connection between polygons efficient. After compare the connection between non-sizing and sizing, we can obtain all break point what we need to route. To route the break point, an implicit connection graph base maze router is proposed, it can fully use the routing resource and get a small bend solution. As the result, our router use in layout migration method has a DRC clean solution in a real case. ii

Metrics

1 Record Views

Details

Logo image