Multi-Layer Channel Routing: Complexity and Algorithms
Author(s): R. K. Pal
ISBN: 978-81-7319-280-7
E-ISBN: Publication Year: Reprint 2009
Pages: 418
Binding: Paper Back Dimension: 140mm x 215mm Weight: 470
Textbook
About the book
In-depth study and investigation of channel routing using multiple layers of interconnection
Large number of theorems and examples illustrated
Solutions included to support the feasibility of different routing solutions
Large number of problems for future researchers
Table of Contents
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 Approximate Area Minimization in Channel 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.
Audience
Students of Senior Graduate and Postgraduate courses in Computer Science, Electrical and Electronics Communication Engineering.
