Combinatorial Algorithms for Integrated Circuit Layout
Thomas Lengauer(Author)
Wiley (Publisher)
1st Edition
Published on 25. July 1990
Book
Hardback
726 pages
978-0-471-92838-6 (ISBN)
Description
The explosive growth of integrated circuitry has created a need for a one-stop reference source that combines practical with theoretical aspects of the subject. This work takes a major step in this direction by offering a unified compilation that will be useful for both practitioners and theoreticians interested in circuit layout. It presents an overview of what are currently the most important combinatorial problems in circuit layout and describes their solutions. Discussions cover algorithms currently used in layout systems, as well as some new algorithmic developments that hold promise of stimulating the improvement of layout systems in the future.
More details
Series
Edition
1. Auflage
Language
English
Place of publication
Chichester
United Kingdom
Publishing group
John Wiley and Sons Ltd
Target group
College/higher education
Professional and scholarly
Illustrations
index
Dimensions
Height: 235 mm
Width: 160 mm
Weight
1260 gr
ISBN-13
978-0-471-92838-6 (9780471928386)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Persons
Content
Optimization Problems. Graph Algorithms. Operations Research and Statistics. COMBINATORIAL LAYOUT PROBLEMS. The Layout Problem. Circuit Partitioning. Placement, Assignment, and Floorplanning. Global Routing and Area Routing. Detailed Routing. Compaction. Bibliography. Author Index. Subject Index.