We present in this paper a new algorithm for floorplan design using the method of simulated annealing. The major contributions of the paper are: 1. A new representation of floorplans (normalized Polish expressions) which enables us to carry out the neighborhood search effectively. 2. A simultaneous minimization of area and total interconnection length in the final solution.Experimental results indicate that the algorithm performs well in many test problems.

No abstract

No abstract

No abstract

We present in this paper a new approach to the three or four layer channel routing problem. Since two layer channel routing has been well studied, there are several two layer routers which can produce optimal or near optimal solution for almost all the practical problems. We develop a general technique which transforms a two layer routing solution systematically into a three layer routing solution. The solution transformation approach is different from previous approaches for three layer and multi-layer channel routing. Our router performs well in comparison with other three layer channel routers proposed thus far. In particular, it provides a 10-track optimal solution for the famous Deutsch's difficult example, whereas other well-known three layer channel routers required 11 or more tracks. We extend our approach to four layer channel routing. Given any two layer channel routing solution without unrestricted dogleg that uses w tracks, our router can provably obtain a four layer routing solution using no more than w /2 tracks. We also give a new theoretical upper bound d /2 + 2 for arbitrary four layer channel routing problems.