教師著作
Permanent URI for this collectionhttp://rportal.lib.ntnu.edu.tw/handle/20.500.12235/31276
Browse
6 results
Search Results
Item Neural computation network for global routing(Elsevier, 1991-10-01) Shih, P. H.; Chang, K. E.; Feng, W. S.Global routing is a crucial step in circuit layout. Under the constraint of the relative positions of circuit blocks enforced by placement, the previous global routing develops an effective plan such that the interconnections of nets can be completed efficiently. This problem has been proven to be NP-complete, and most of the currently available algorithms are heuristic. The paper proposes a new previous neural-computation-network architecture based on the Hopfield and Tank model for the previous global-routing problem. This previous network is constructed using two layers of neurons. One layer is used for minimizing the total path length and distributing interconnecting wires evenly between channels. The other layer is used for channel-capacity enforcement. This previous network is proven to be able to converge to a stable state. A set of randomly generated testing examples are used to verify the performance of the approach. A reduction in total path length of about 20% is attained by this previous network.Item A delayed layering three-layer channel routing(Institution of Engineering and Technology, 1990-07-01) Chang, K. E.; Feng, W. S.A new three-layer channel router with 'delayed layering' technique is presented. The delayed layering scheme in the routing can improve the capability of the router to reach comprehensive objectives. This new router not only minimises the tracks used, but also minimises the via usage and maximises the use of preferred routing layers. The delayed layering router consists of two steps: track assignment and layer assignment. The track assignment uses a topological sorting algorithm to determine the horizontal track number of every net. A layerless layout will result from the track assignment. The layer assignment heuristically determines which layers can be used for routing the wire segments in the layerless layout, such that the vias generated are as small as possible. The experiments showed that the solution quality with respect to via usage was better than the previous solutions and the number of tracks used in channel was satisfactory.Item 三層通道佈線的拓樸排序分類演算法(中國工程師學會, 1990-11-01) 張國恩; 賴廷樺; 馮武雄; Chang, K. E.; Lai, T. H.; Feng, W. S.Item 以神經網路處理佈線問題(中國工程師學會, 1991-05-01) 施保旭; 馮武雄; 張國恩; Shih, P. H.; Feng, W. S.; Chang, K. E.在VLSI佈局中，佈線問題是一個很重要的部份，其工作在於將給定的連線要求予以正確的完成。此問題已被證明為 NP －完全性問題。目前所見的方法大多是採用啟發式的演算法。 本論文提出一套植基於 Hopfield and Tank 模型的新型神經網路架構來解決佈線的問題。我們將所有的連線要求一次同時加以考慮。使用神經網路的平行架構來解 NP －完全性問題已被證明為一有效的方法，然而，將此法使用於佈線問題，本文則是首創。這套架構是由兩層的神經元所組成。第一層負責使連線的長度最小，以及分佈最平均。第二層則是負責處理通道滿溢的問題。本文亦證明此網路可以收斂至一個穩定的狀態。我們使用一組隨機產生的資料來加以測試的結果，本網路可以將連線的長度減少 20 ％左右。Item Constrained via minimization for three-layer routing(Elsevier, 1989-07-01) Chang, K. E.; Jyu, H. F.; Feng, W. S.The previous constrained via minimization problem for VLSI previous three-layer routing is the problem of deining which previous layers can be used for previous routing the wire segments in the interconnections of nets so that the number of previous vias is minimized. This problem has been shown to be NP-complete15. In this paper, this problem is first transformed to the contractibility problem of a previous three -colourable graph, then an heuristic algorithm is proposed on the basis of the graph contractability model. From experimental results, the algorithm proves faster and more efficient at generating very good results. For a typical case, the number of previous vias can be reduced by about 30%.Item 有關VLSI佈局層指定的圖形縮減問題(中國工程師學會, 1989-07-01) 張國恩; 鞠鴻飛; 馮武雄; Chang, K. E.; Jyu, H. F.; Feng, W. S.