Multi-Layer Channel Routing - R. K. Pal

Multi-Layer Channel Routing

Complexity and Algorithms

(Autor)

Buch | Softcover
418 Seiten
2000
Narosa Publishing House (Verlag)
978-81-7319-280-7 (ISBN)
43,65 inkl. MwSt
  • Keine Verlagsinformationen verfügbar
  • Artikel merken
An analysis of multi-layer channel routing, focusing on complexity and algorithms. It features discussion of resolving horizontal constraints; area minimization in multi-layer routing; absolute approximate area minimization; and complexity of wire length minimization.
This book deals the subject-matter in a clear, detailed and explanatory way with many supporting examples, diagrams and computed results. An in-depth study and investigation has been made into channel routing using multiple layers of interconnection. A large number of theorems are proved and examples illustrated for complete understanding of the course. Hard copy solutions are included in support to the feasibility of different routing solutions in addition to a number of open problems for future researchers. This book is suitable for senior-level graduate or a postgraduate course in computer science and engineering or electronics and electrical communication engineering students, who have a basic idea of data structures, graph theory and perfect graphs, design and analysis of algorithms, and fundamentals of VLSI design, circuits and systems. Researchers and computer scientists who specialize in this field will also find this book to be utmost useful.

Rajat K. Pal.: Department of Computer Sciences and Engineering University of Calcutta, Calcutta, India

Foreword / Preface / Introduction / Literature Survey / Resolving Horizontal Constraints in Multi-Layer Channel Routing / A General Framework for Track Assignment in Multi-Layer Channel Routing / Computational Complexity of Area Minimization in Multi-Layer Channel Routing and an Efficient Algorithm / An Algorithm for Finding a Lower Bound on the Area of Routing / Computational Complexity of Wire Length Minimization in Channel Routing / Algorithms for Minimizing Wire Length in Multi-Layer Channel Routing / Summary, Related Fields of Research and Open Problems / A. Channel Specifications / B. Tables for Reduced Wire Length / Bibliography / Subject Index.

Erscheint lt. Verlag 29.4.2000
Verlagsort New Dehli
Sprache englisch
Maße 160 x 240 mm
Themenwelt Mathematik / Informatik Mathematik Angewandte Mathematik
Technik Elektrotechnik / Energietechnik
ISBN-10 81-7319-280-4 / 8173192804
ISBN-13 978-81-7319-280-7 / 9788173192807
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Berechnung statisch unbestimmter Tragwerke

von Raimond Dallmann

Buch | Hardcover (2022)
Hanser (Verlag)
29,99