| Author: | Woo, Ka-chung Andrew |
| Title: | Three dimensional channel routing based on maximal compatible class algorithm |
| Degree: | M.Sc. |
| Year: | 1996 |
| Subject: | Integrated circuits -- Very large scale integration -- Design and construction -- Data processing Computer-aided design Computer algorithms Hong Kong Polytechnic University -- Dissertations |
| Department: | Multi-disciplinary Studies |
| Pages: | x, 90 p. : ill. ; 30 cm |
| Language: | English |
| Abstract: | Channel routing problem is one of the most dificult aspects in VLSI design, extensive studies were devoted on two dimensional channel routing over past two decades. With the advances in VLSI technology, fabrication of 3-dimensional chip becomes possible. It is obvious that the new dimension will further complicate the routing problem, but little research has been done in this area. This project is to work along the brand new heuristic idea of Maximal Compatible Class (MCC) algorithm as applied to 2 dimensional channel routing problem [20], demonstrate its realization, and extrapolate this idea to 3 dimensional (multi-layers) routing application. Direct generalization of MCC idea to 3-D problem was proved to be more efficient than indirect approach of 3-D to 2-D transformation. Both 2-D & 3-D MCC routers are implemented in C on an IBM personal computer and the results for various case studies are presented in this dissertation. |
| Rights: | All rights reserved |
| Access: | restricted access |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b1231321x.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 3.07 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/3421