Placement and routing in VLSI design problem using single row routing technique

Abstract

Two major problems are involved in VLSI design, namely, the placement of components and routing between these components. Single row routing problem is a combinatorial optimization problem of signi¯cant importance for the design of com- plex VLSI multi layer printed circuit boards (PCB's). The design involves conductor routing that makes all the necessary wiring and interconnections between the PCB modules, such as pins, vias, and backplanes. In very large systems, the number of interconnections may exceed tens of thousands. Therefore, we have to optimize the wire routing and interconnections and thus determine the e±cient designs. Kernighan- Lin algorithm, traveling salesman problem, simulated annealing algorithm and single row routing problem are used to ¯nd the best design. Included here are some simple examples to ¯nd the results. A simulation program using Microsoft Visual C++ is developed to simulate the single row routing problem using the simulated annealing algorithm.