## In this paper we pursue the graph theoretic approach to the switching function minimization problem which is still important in view of today's technological innovations such as programmable Logic arrays. We use switching functions graphs (SFG) for studying the structure of switching functions an
A graph theoretic approach to feed-through pin assignment
โ Scribed by Y.-P. Chen; D.F. Wong
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 714 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0167-9260
No coin nor oath required. For personal study only.
โฆ Synopsis
We study in this paper the feed-through pin assignment problem for cell-based design that assigns global nets to feedthrough 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.
๐ SIMILAR VOLUMES
A graph theoretic approach is described for the design of multivariable control for large systems as an alternative to geometric methods. An example is given for a distillation column to demonstrate the technique, with a particular reference to aspects of disturbance rejection and the possibilities