查詢結果分析
來源資料
相關文獻
- Three-Layer VLSI Channel Routing With Movable Terminals
- Reducing Channel Density by Routing Over the Cells
- Channel Routing Using Neural Networking
- A Topological Sorting Algorithm for Three-Layer Channel Routing
- BEX-VCS訊務管理之設計
- 泛歐式數位行動電話之通道編碼技術
- 網路佈線與應用(2)--高速網路佈線現況
- RJ-45 導線測試器之研製
- 高速無線區域網路系統通道特性與RAKE接收機設計考量
- 數位音訊廣播系統之可調變速率剔除腓特比解碼器的設計
頁籤選單縮合
題 名 | Three-Layer VLSI Channel Routing With Movable Terminals=具有可移動端點的三層VLSI通道佈線 |
---|---|
作 者 | 張國恩; | 書刊名 | 師大學報 |
卷 期 | 36 1991.06[民80.06] |
頁 次 | 頁117-138 |
分類號 | 448.57 |
關鍵詞 | 佈線; 通道; |
語 文 | 英文(English) |
中文摘要 | 本文提出在VLSI晶片上的通道佈線問題,此問題是假定通道上的端點是可被移動的。其中有兩個子問題被考慮,即是最大調齊問題與軌道指定問題。所謂最大調齊問題是重新指定各端點在通道上的位置使得能直拉的佈線能儘量多。而軌道指定問題是將所有的網列連線實際地連接在通道中。本文分別針對此兩子問題各提出啟發式的演算法解之。並以著名的實例測出這些演算法的效益。實驗結果知具有移動端點的通道佈線能夠很可觀地減少通道寬度與穿孔數。 |
英文摘要 | Abstract-A problem of wiring a channel of movable terminals in a VLSI chip is presented. Two subproblems are addressed, namely, maximum alignment and track assignment. Maximum alignment is to reassign terminal positions in the channel in order to maximize the number of nets that can be implemented as straight connections. Track assignment locates physicallythe interconnection of every net to the horizontal track in the channel. The two subproblemsare solved using two heuristic algorithms. Some well-known examples, including Deutsch's difficult example, are used as test cases to study our algorithms. The results show that both channel width and via usage are reduced significantly by using our procedures when comparing tothe routing with fixed terminals. |
本系統中英文摘要資訊取自各篇刊載內容。