The program minimizes the channel height of a channel that produces output that is compatible with CLL (Chip Layout Language), and can be merged with C LL statements that place cells from a library on a grid to form plots or to create CIF data to be used in making VLSI chips.
Abstract : The program minimizes the channel height of a channel. The channels must be rectangular. Also, each horizontal channel must intersect every vertical channel and vice versa. Alternate paths can be found for nets in horizontal channels when channel capacity is exceeded. Constraint loops are removed by ordering the way nets are routed or by introducing a 'dogleg'. The program produces output that is compatible with CLL (Chip Layout Language). The output from the program can be merged with CLL statements that place cells from a library on a grid to form plots or to create CIF (Caltech Intermediate Form) data to be used in making VLSI chips. (Author)