Fr. 179.00

Practical Problems in VLSI Physical Design Automation

English · Hardback

Shipping usually within 6 to 7 weeks

Description

Read more

Practical Problems in VLSI Physical Design Automation contains problems and solutions related to various well-known algorithms used in VLSI physical design automation. Dr. Lim believes that the best way to learn new algorithms is to walk through a small example by hand. This knowledge will greatly help understand, analyze, and improve some of the well-known algorithms. The author has designed and taught a graduate-level course on physical CAD for VLSI at Georgia Tech. Over the years he has written his homework with such a focus and has maintained typeset version of the solutions.

List of contents

Dedication. List of Figures. List of Tables. Foreword. Preface. Acknowledgments. 1. Clustering. 2. Partitioning. 3. Floorplanning. 4. Placement. 5. Steiner routing. 6. Multi-net routing. References.

About the author

Dr. Sung Kyu Lim received his PhD at UCLA in Los Angeles, USA and he majored in VLSI CAD. He recently received tenure at Georgia Tech. 

Summary

Practical Problems in VLSI Physical Design Automation contains problems and solutions related to various well-known algorithms used in VLSI physical design automation. Dr. Lim believes that the best way to learn new algorithms is to walk through a small example by hand. This knowledge will greatly help understand, analyze, and improve some of the well-known algorithms. The author has designed and taught a graduate-level course on physical CAD for VLSI at Georgia Tech. Over the years he has written his homework with such a focus and has maintained typeset version of the solutions.

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.