Multi-layer Channel Routing: Complexity and Algorithms - Softcover

Pal, R.K.

Softcover

ISBN 10: 8173192804 ISBN 13: 9788173192807

Publisher: Narosa Publishing House Private Limited, 2000

Synopsis

This in-depth study and investigation of channel routing using multiple layers of interconnection uses a large number of theorems and examples. Solutions are included to support the feasibility of different routing solutions. A large number of problems are included for future researchers.Table of ContentsForewordPrefaceIntroductionLiterature SurveyResolving Horizontal Constraints in Multi-Layer Channel RoutingA General Framework for Track Assignment in Multi-Layer Channel RoutingComputational Complexity of Area Minimization in Multi-Layer Channel Routing and an Efficient AlgorithmAn Algorithm for Finding a Lower Bound on the Area of RoutingComputational Complexity of Approximate Area Minimization in Channel RoutingComputational Complexity of Wire Length Minimization in Channel RoutingAlgorithms for Minimizing Wire Length in Multi-Layer Channel RoutingSummary, Related Fields of Research and Open ProblemsA. Channel SpecificationsB. Tables for Reduced Wire LengthBibliographySubject Index.

About this title

About the Author

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

Edition details

• Publisher: Narosa Publishing House Private Limited
• Publication date: 2000
• ISBN 10: 8173192804
• ISBN 13: 9788173192807
• Binding: Paperback
• Language: English