| Author | Shrestha, Amarottam |
| Call Number | AIT Thesis no. CS-91-20 |
| Subject(s) | Integrated circuits--Very large scale integration
|
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | Placement is an important aspect of VLSI design. The fact that a number of researchers are attempting to attack this problem from a various points of view further enhance the importance of placement in the overall design of VLSI. In this thesis the self-organizing networks are studied from this perspective. Self-Organization principle is a effective method for combinatorial problem solving in neural network paradigm. This principle is used to design an algorithm to place blocks (circuit modules) with fixed rectangular shape and size. Interconnection information of each block is used as input vector to the algorithm. Neurons in the network are used as output node for block placement. Comparing the input vector, the network selforganizes by placing strongly connected blocks in topologically closer neurons. It is shown that the developed algorithm produced optimal placement for a number of example problems in very reasonable processing time. The performance of the algorithm is studied in different parametric and problem conditions. |
| Year | 1991 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Other Field of Studies (No Department) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Sadananda, R. |
| Examination Committee(s) | Zhao, Ming ;Hall, Michael |
| Scholarship Donor(s) | Government of Japan |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 1991 |