The Channel Expansion Problem in Layout Design

摘要

In order to develop an efficient method of routing channels in the layout design process, an algorithm which solves the channel expansion problem is presented. This algorithm guarantees the minimum number of rerouted channels with respect to a single channel in a given placement. In addition, examples are given to illustrate various aspects of the algorithm.