| Author: | Au, Wai-kong |
| Title: | PC based CAD tools for channel routing algorithms |
| Degree: | M.Sc. |
| Year: | 1998 |
| 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: | vii, 78 leaves : ill. ; 30 cm |
| Language: | English |
| Abstract: | In the past decade, the demands for high density integrated circuits ramp up quickly. The density of the chip becomes higher and higher, therefore, layout manually becomes difficult and time consuming. Since hierarchy designs are usually employed, and because of the re-usability, most designs are in block design. Therefore, one of the layout problem is to connect contacts between different blocks, which are usually between two straight boundaries. A channel routing problem therefore occurred. There are a lot of research and studies done on the channel routing problem. The primary aim of those algorithms is to minimize the number of tracks required to connect all the terminals, that more dice can be put into the same wafer. Therefore the cost will be lowered. The optimal solution will be affected by many factors such as possible locations of via, the number of metal layer available, and the maximum number of via allowed etc. |
| Rights: | All rights reserved |
| Access: | restricted access |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b14211580.pdf | For All Users (off-campus access for PolyU Staff & Students only) | 2.17 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/1773