VLSI Design Automation Algorithms
Get the full GTU study material, English & Gujarati textbook PDFs, syllabus curriculum, and solved previous year question papers.
English Book & Chapters
English Book Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesGTU Previous Year Papers
Papers Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesVLSI Design Automation Algorithms Syllabus — Unit-wise Content
The official GTU curriculum for VLSI Design Automation Algorithms (subject code ME02000171) as prescribed for EAC( · Semester 2 divides the course into 8 units, covering 37 listed topics. The unit-wise breakdown below is read from the GTU syllabus document for this subject code, so you can check what the course actually covers before deciding which papers to attempt.
Download the official syllabus PDF (ME02000171)Unit 1 Introduction
- VLSI Design Process
- Layout Styles
- Difficulties in Physical Design
- Definitions and Notation. 6 12
Unit 2 Circuit Partitioning
- Problem Definition
- Cost Function and Constraints
- Approaches to Partitioning Problem
- Other Approaches and Recent Work
Unit 3 Floor planning
- Problem Definition
- Approaches to Floor planning
- Other Approaches and Recent Work. 6 12
Unit 4 Placement
- Problem Definition
- Cost Functions and Constraints
- Approaches to Placement
- Other Approaches and Recent Work
Unit 5 Grid Routing
- Problem Definition
- Cost Functions and Constraints
- Maze Routing Algorithms
- Line Search Algorithms
- Other Issues
- Other Approaches and Recent Work
Unit 6 Global Routing
- Cost Functions and Constraints
- Routing Regions
- Sequential Global Routing
- Integer Programming
- Global Routing by Simulated Annealing
- Hierarchical Global Routing
- Other Approaches and Recent Work
Unit 7 Channel Routing
- Problem Definition
- Cost Functions and Constraints
- Approaches to Channel Routing
- Other Approaches and Recent Work
Unit 8 Layout Generation
- Layout Generation
- Standard-cell Generation
- Optimization of Gate-matrix Layout
- Programmable Logic Arrays
- Other Approaches and Recent Work