Graph theoretic approach to feed-through pin assignment

Yao-Ping Chen, D. F. Wong

Research output: Chapter in book/report/conference proceedingChapterpeer-review

Abstract

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
Title of host publication1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995
PublisherIEEE
Pages1687-1690
Number of pages4
ISBN (Print)0780325702
DOIs
Publication statusPublished - May 1995
Event1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995 - Seattle, United States
Duration: 30 Apr 19953 May 1995
https://ieeexplore.ieee.org/xpl/conhome/3941/proceeding (Link to conference proceedings)

Publication series

NameProceedings of 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995

Conference

Conference1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995
Country/TerritoryUnited States
CitySeattle
Period30/04/953/05/95
Internet address

Scopus Subject Areas

  • Electrical and Electronic Engineering

Cite this