A study on the VLSI partitions: the implementation of mincut algorithm / Azharul Hisham Abdul Aziz
The term 'Very Large Scale Integration' (VLSI) reflects the capabiiities to integrated thousands of transistors in a single silicon chip. As we all know in this computerised era, VLSI becoming very important. Speed, complexity and sizing are the 3 main targets when designing a single chip...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
1997
|
| Online Access: | https://ir.uitm.edu.my/id/eprint/101305/1/101305.pdf https://ir.uitm.edu.my/id/eprint/101305/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The term 'Very Large Scale Integration' (VLSI) reflects the capabiiities to integrated thousands of transistors in a single silicon chip. As we all know in this computerised era, VLSI becoming very important. Speed, complexity and sizing are the 3 main targets when designing a single chip using VLSI physical design today. There are several techniques to achieve these targets such as partitioning, placement and floorplanning. Here in my project I only discussed about partitioning because this technique itself has a very wide scope. Here I implement Kernighan-Lin Algonthm and make some improvements to it using size and cut sets weighting. The program is being develop using this algonthm. The evaruation and comparison also been carried out between this method and Fiduccia-Mattheyses method. |
|---|