Graph theoretic approach to feed-through pin assignment

Yao-Ping Chen; D. F. Wong

doi:10.1109/ISCAS.1995.523736

Graph theoretic approach to feed-through pin assignment

Yao-Ping Chen, D. F. Wong

Office of the Provost

Research output: Chapter in book/report/conference proceeding › Chapter › peer-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 language	English
Title of host publication	1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995
Publisher	IEEE
Pages	1687-1690
Number of pages	4
ISBN (Print)	0780325702
DOIs	https://doi.org/10.1109/ISCAS.1995.523736
Publication status	Published - May 1995
Event	1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995 - Seattle, United States Duration: 30 Apr 1995 → 3 May 1995 https://ieeexplore.ieee.org/xpl/conhome/3941/proceeding (Link to conference proceedings)

Publication series

Name	Proceedings of 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995

Conference

Conference	1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995
Country/Territory	United States
City	Seattle
Period	30/04/95 → 3/05/95
Internet address	https://ieeexplore.ieee.org/xpl/conhome/3941/proceeding (Link to conference proceedings)

Scopus Subject Areas

Electrical and Electronic Engineering

Access to Document

10.1109/ISCAS.1995.523736

Cite this

@inbook{c303babf22004131a8b69a03c41ef67c,

title = "Graph theoretic approach to feed-through pin assignment",

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.",

author = "Yao-Ping Chen and Wong, {D. F.}",

note = "Funding Information: This work was partially supported by the Texas Advanced Research Program under Grant No.003658459. Publisher Copyright: {\textcopyright} 1995 IEEE; 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995 ; Conference date: 30-04-1995 Through 03-05-1995",

year = "1995",

month = may,

doi = "10.1109/ISCAS.1995.523736",

language = "English",

isbn = "0780325702",

series = "Proceedings of 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995",

publisher = "IEEE",

pages = "1687--1690",

booktitle = "1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995",

address = "United States",

url = "https://ieeexplore.ieee.org/xpl/conhome/3941/proceeding",

}

Chen, Y-P & Wong, DF 1995, Graph theoretic approach to feed-through pin assignment. in 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995. Proceedings of 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, IEEE, pp. 1687-1690, 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, Seattle, Washington, United States, 30/04/95. https://doi.org/10.1109/ISCAS.1995.523736

TY - CHAP

T1 - Graph theoretic approach to feed-through pin assignment

AU - Chen, Yao-Ping

AU - Wong, D. F.

PY - 1995/5

Y1 - 1995/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029193380&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.1995.523736

DO - 10.1109/ISCAS.1995.523736

M3 - Chapter

AN - SCOPUS:0029193380

SN - 0780325702

T3 - Proceedings of 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995

SP - 1687

EP - 1690

BT - 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995

PB - IEEE

T2 - 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995

Y2 - 30 April 1995 through 3 May 1995

ER -

Graph theoretic approach to feed-through pin assignment

Abstract

Publication series

Conference

Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this