Multi-layer Channel Routing Complexity and Algorithms

Front Cover
Alpha Science Int'l Ltd., 2000 - Computers - 399 pages
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 fundamentals of VLSI design, this book deals the subject matter with many supporting examples, diagrams and computed results.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Introduction
1
Literature Survey
35
Resolving Horizontal Constraints in MultiLayer
67
A General Framework for Track Assignment
89
Computational Complexity of Area Minimization
149
An Algorithm for Finding a Lower Bound on
207
Computational Complexity of Approximate Area
223
Computational Complexity of Wire Length Mini
241
Algorithms for Minimizing Wire Length in Multi
275
Summary Related Fields of Research and Open
337
A Channel Specifications
349
B Tables for Reduced Wire Length
365
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 376 - BW Kernighan, DG Schweikert, and G. Persky, "An Optimum Channel Routing Algorithm for Polycell Layouts of Integrated Circuits," Design Automation Workshop Proceedings, p.
Page 377 - An Unconstrained Topological Via Minimization Problem for Two-Layer Routing.
Page 379 - ... VLSI Design Techniques, vol. 2, GW Zobrist, Ed., Ablex Publishing Corpn., Norwood, New Jersey, pp. 93-121, 1990. [6] Pal RK, Multi-Layer Channel Routing: Complexity and Algorithms, Narosa Pub. House, New Delhi, 2000. Also published from CRC Press, Boca Raton, USA and Alpha Sc. Int. Ltd., UK, 2000. [7] Pal RK, AK Datta, SP Pal, MM Das and A. Pal, A General Graph Theoretic Framework for MultiLayer Channel Routing, Proc.
Page 372 - S.-C. Fang, W.-S. Feng and S.-L. Lee, "A New Efficient Approach to Multi-Layer Channel Routing Problem,

Bibliographic information