Correspondence on ‘Planar constrained terminals over-the-cell router’

Abstract

A new routing model with constrained terminal structure for over-the-cell channel routing and a graph theoretical algorithm for solving the planar constrained terminals over-the-cell routing problem have recently been published. The routing model with constrained terminal structure assigns the connection constraint between adjacent layers on terminals and makes use of the vacant locations on each layer for over-the-cell routing. Based on the constrained terminal structure, a graph theoretical algorithm is proposed to complete planer routing layer by layer for over-the-cell channel routing. The new routing model and the graph theoretical algorithm are shown to be flawed, and corrections are suggested.