Graph theoretic approach to feed-through pin assignment

Yao Ping Chen, D. F. Wong

Research output: Contribution to journalConference articlepeer-review


We study in this paper the feed-through pin assignment problem for cell based design that assigns global nets to feed-through cells or implicit feed-through ports. On a single row, for a restricted permutation of global nets, we develop a graph theoretic approach for optimally minimizing the density of the channel above (below) the row subject to the bound on the density of the channel below (above) the row. Based on this technique, an approach for iteratively improving multiple row feed-through pin assignment can be developed. We show that our approach is also applicable to the design style in which there is an over-the-cell feed-through layer.

Original languageEnglish (US)
Pages (from-to)1687-1690
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
StatePublished - Jan 1 1995
Externally publishedYes
EventProceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3) - Seattle, WA, USA
Duration: Apr 30 1995May 3 1995

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this