VLSI Planarization

CHF 149.20
Auf Lager
SKU
UI31I64IQ48
Stock 1 Verfügbar
Free Shipping Kostenloser Versand
Geliefert zwischen Mi., 08.10.2025 und Do., 09.10.2025

Details

At the beginning we would like to introduce a refinement. The term 'VLSI planarization' means planarization of a circuit of VLSI, Le. the embedding of a VLSI circuit in the plane by different criteria such as the minimum number of connectors, the minimum total length of connectors, the minimum number of over-the-element routes, etc. A connector is designed to connect the broken sections of a net. It can be implemented in different ways depending on the technology. Connectors for a bipolar VLSI are implemented by diffused tun nels, for instance. By over-the-element route we shall mean a connection which intersects the enclosing rectangle of an element (or a cell). The possibility of the construction such connections during circuit planarization is reflected in element models and can be ensured, for example, by the availability of areas within the rectangles where connections may be routed. VLSI planarization is one of the basic stages (others will be discussed below) of the so called topological (in the mathematical sense) approach to VLSI design. This approach does not lie in the direction of the classical approach to automation of VLSI layout design. In the classical approach to computer aided design the placement and routing problems are solved successively. The topological approach, in contrast, allows one to solve both problems at the same time. This is achieved by constructing a planar embedding of a circuit and obtaining the proper VLSI layout on the basis of it.

Klappentext

VLSI planarization is one of the basic stages of the so-called topological approach to VLSI design. This book considers the intense recent development in this field. Although it features an analysis of the problem and the results of different authors are classified and generalized, this volume is mainly based on the investigations conducted by the present authors during the last fifteen years. This included work in the field of design and research in mathematical methods applied to the mentioned approach for computer-aided design, and in the field of designing concrete industrial design systems. The theory and methods discussed here may be applied to printed-circuit boards, hybrid circuits, etc. This work concentrates on `essentially' hypergraph models of electric circuits and their planarization techniques. It is just this aspect of the topological approach to design that has not been adequately investigated before. br/ emAudience:/em This book will be of interest to theoretical and applied mathematicians whose work involves VLSI design, algorithms, graph theory and complexity theory, and EDA tools developers.


Inhalt
1 Discrete Mathematics Fundamentals.- 1.1 Graphs And Hypergraphs.- 1.2 Algorithms And Their Complexity.- 1.3 Algorithms In Graphs.- 1.4 Intractable Problems.- 2 Graph Planarization.- 2.1 Planar Graphs. Graph Planarity Criteria.- 2.2 Graph Planarity Testing Algorithms.- 2.3 Approximation Algorithm for Graph Planarization.- 3 Hypergraph Planarization.- 3.1 The Concept of Planar Hypergraph.- 3.2 Planarity of Different Hypergraph Classes.- 3.3 Hypergraph Nonplanarity Measures. Statement of Hypergraph Planarization Problem.- 3.4 Decomposition Methods of Hypergraph Planarization.- 4 Mathematical Models for VLSI Planarization Problem.- 4.1 Graph versus Hypergraph VLSI Models.- 4.2 VLSI Models with Specified Element Models.- 4.3 Dynamic VLSI Models.- 5 Extracting a Maximum Planar VLSI Part.- 5.1 Extracting a Maximum Planar VLSI Part as a Hypergraph Planarization Problem.- 5.2 Iteration Algorithm for Hypergraph Planarization.- 5.3 Hypergraph Planarization by Konig Representation.- 5.4 Operations of Local Embedding Optimization.- 6 Constructing Nonplanar Connections.- 6.1 Graph Model for Nonplanar Connections.- 6.2 Constructing a Nonplanar Connection as a Steiner Problem in a Weighted Graph.- 6.3 Ordering Nonplanar Connections to be Constructed.- 7 Planarization System Structure.- 7.1 Purpose and Functions of the System.- 7.2 Planarization System Structure. Logic Diagram.- 7.3 Data Organization in Planarization System.- 7.4 Some Aspects of the Practical Use of the Planarization System.- References.

Cart 30 Tage Rückgaberecht
Cart Garantie

Weitere Informationen

  • Allgemeine Informationen
    • GTIN 09789401064217
    • Genre Elektrotechnik
    • Sprache Englisch
    • Lesemotiv Verstehen
    • Anzahl Seiten 196
    • Größe H240mm x B160mm x T11mm
    • Jahr 2012
    • EAN 9789401064217
    • Format Kartonierter Einband
    • ISBN 9401064210
    • Veröffentlichung 13.10.2012
    • Titel VLSI Planarization
    • Autor V. Z. Feinberg , A. G. Levin , E. B. Rabinovich
    • Untertitel Methods, Models, Implementation
    • Gewicht 323g
    • Herausgeber Springer

Bewertungen

Schreiben Sie eine Bewertung
Nur registrierte Benutzer können Bewertungen schreiben. Bitte loggen Sie sich ein oder erstellen Sie ein Konto.