ROUTING ALGORITHM WITH ±45° ALLOWABLE WIRING

碩士 === 長庚大學 === 半導體科技研究所 === 91 === In this thesis, a new switchbox router applying ±45° in the Burstein's difficult switchbox model is proposed. It reduces one track and uses much more less nets length. Besides, the total number of vias is acceptable. At first, the process is procee...

Full description

Bibliographic Details
Main Authors: Lee Mao-sheng, 李茂昇
Other Authors: Prof. Jau-Yien Lee
Format: Others
Language:zh-TW
Published: 2003
Online Access:http://ndltd.ncl.edu.tw/handle/56573255029442244672
Description
Summary:碩士 === 長庚大學 === 半導體科技研究所 === 91 === In this thesis, a new switchbox router applying ±45° in the Burstein's difficult switchbox model is proposed. It reduces one track and uses much more less nets length. Besides, the total number of vias is acceptable. At first, the process is proceeded by first determining the sweeping direction, and finding the start column and target column based on the congestion of the routing region. And guarding with the routing process we also concern the joining and jogging strategies, and additionally conflicts of nets in our criterions. Finally, ±45° wires routing is applied to the switchbox router and compared all aspects of performance with other famous routers. Clearly, a significant improvement for routing in the Burstein's difficult switchbox problem is achieved.