CS338A - Introduction to IC Design Automation (EDA)
(積體電路設計自動化導論)

Spring 2013 (101-2 學期)
Department of Computer Science & Engineering
Yuan Ze University
   

Instructor

Textbook

References

Grading Policy  (subject to change)

Teaching Assistant

Classroom

Timetable  (tentative and subject to change)

Week

 Date Topics Reading Homework　
1 2/25
(Mon.)		 Semester started
開學 - 開始上課		    
2/27
(Wed.)		 Syllabus
HW-1: Description of the homework assignment
Basic Unix/Linux Commands
Writing Makefiles		  
  • HW-1
2 3/06
(Wed.)		 授課教師請假
(至 ISQED-2013 發表論文)		  

 
3 3/13
(Wed.)		 (started at 1:10pm)
Introduction (incl. Cells/Blocks, Standard Cell Library, Cell-Based Design Flow)
Unit-1: Introduction (pp. 1-23) (incl. Logic Synthesis, Physical Synthesis)
Ch04: Fundamentals of Algorithms (incl. Time Complexity and Space Complexity)
Ch12: Global and Detailed Routing (incl. Placement, Routing, Global Routing Concepts, Detailed Routing Concepts, Maze Routing, Lee's Algorithm, A*-Search Routing Algorithm)		 Ch01 - Ch02,
4.2,
12.1 - 12.3
  • Deadline of HW-1 (3/10)
4 3/20
(Wed.)		 (started at 2:10pm)
HW-2: Description of the homework assignment
Unit-1: Introduction (pp. 37-39, 62-76)
[Science-1983] Paper: (incl. Cell-Based Design Flow, DRC, Placement, Routing)
Ch12: Global and Detailed Routing (incl. Hadlock's Algorithm, Soukup's Algorithm)
VLSI_Ch01: nMOS, nMOS Layout, pMOS, pMOS Layout, CMOS Inverter and Its Layout		 12.3
  • HW-2
5 3/27
(Wed.)		 (started at 1:10pm)
VLSI_Ch01: CMOS Inverter and Its Layout, Design Rules, CMOS Logic Gates, Transistor-Level Schematic, Gate-Level Schematic, Layers, Contact, Via
Unit-1: Introduction (pp. 47-61)
Ch04: Fundamentals of Algorithms (incl. Mathematical Programming, LP, ILP, MILP, LP Relaxation, Branch-and-Bound, Cutting-Plane Algorithm, Branch-and-Cut Algorithm, Convex Optimization Problem, Interior-Point Method)
Ch12: Global and Detailed Routing (incl. Line-Search Routing, Mikami-Tabuchi Algorithm, Hightower's Algorithm, Global Routing, Rip-up and Re-routing)
 4.5,
12.3 - 12.4

   

6 4/03
(Wed.)		 放假一天 (春假)
    
7 4/10
(Wed.)		 (started at 1:10pm)
Ch12: Global and Detailed Routing (incl. Global Routing, Net Ordering, Rip-Up and Re-Routing, Connecting Multi-Terminal Nets, Top-Down/Bottom-Up Hierarchical Global Routing, Hybrid Hierarchical Global Routing, Spanning Tree, MST, Steiner Tree, MRST, Hanan's Theorem, Hanan Points, Iterated 1-Steiner Heuristic for MRST, Detailed Routing, Channel Routing Problem, HCG, VCG, Left-Edge Algorithm, Constrained Left-Edge Algorithm)
Ch10: Floorplanning (incl. Floorplanning Basics, Problem Statement, Slicing and Non-slicing Floorplans, Normalized Polish Expression for Slicing Floorplans, SA-Based Floorplanning)
 12.4 - 12.5,
10.1
  • Deadline of HW-2 (4/10)
8 4/17
(Wed.)		 (started at 1:10pm)
Ch10: Floorplanning (incl. Floorplanning Basics, Problem Description, Floorplanning and Placement, Slicing and Non-slicing Floorplans, Normalized Polish Expression for Slicing Floorplans, Simulated Annealing, SA-Based Floorplanning)
Ch04: Fundamentals of Algorithms (incl. Simulated Annealing, Heuristic Algorithms, Approximation Algorithms)
 10.1 - 10.2,
4.4.4

 
9 4/24
(Wed.)		 EDA Course - 期中考

考試時間： 4月24日 (14:10 - 16:00) 請提早十分鐘到達考場
考試地點： 1501A 教室
考試範圍： Ch01, Ch02, Ch04, Ch10 (10.1-10.2), Ch12, [Science-1983] Paper, Unit-1

注意：必須攜帶學生證應考，考試時手機請關機(手機開震動還是會發出震動的聲音)，不得攜帶電子產品、計算機、字典、電子字典、任何書籍、或紙張應考。

注意：完成考試的同學請盡速離開考場，並且勿在考場附近逗留、談話、或大聲喧嘩，影響他人考試者將扣平時分數。

(4/22~4/27 期中考週，本週停課）		    
10 5/01
(Wed.)		 (started at 1:10pm)
HW-4: Description of the homework assignment (incl. Kruskal's Algorithm, Hash Tables, C++ STL unordered_map / unordered_set / unordered_miltimap / unordered_multiset)
Ch04: Fundamentals of Algorithms (incl. Minimum Spanning Tree)
Ch10: Floorplanning (incl. B*-Tree for Compacted Floorplans, CP/LP/ILP/MILP Formulation Techniques)
Extra: Transformation of Constraints
 4.3.7,
10.2 - 10.3
  • HW-3
  • HW-4
11 5/08
(Wed.)		 (started at 1:10pm)
Ch10: Floorplanning (incl. Floorplanning by Mathematical Programming)
HW-5: Description of the homework assignment (Floorplanning via an MILP Solver)
LAB: HW-3: Cell-Based Design Flow Using Commercial EDA Tools (5:00pm - 7:00pm in 1301A)		 10.3
  • HW-5
12 5/15
(Wed.)		 (started at 1:10pm)
Ch10: Floorplanning (incl. Sequence Pair for General Floorplans)
LAB: HW-3: Cell-Based Design Flow Using Commercial EDA Tools (5:00pm - 7:00pm in 1301A)		 10.2
  • Deadline of HW-4 (May 19)
13 5/22
(Wed.)		 (started at 1:10pm)
Ch10: Floorplanning (incl. Soft Modules)
Ch11: Placement (incl. Introduction, Problem Formulations, Partitioning-Based Global Placement, The Fiduccia-Mattheyses Algorithm)
 10.4,
11.1 - 11.3
  • Deadline of HW-4 (May 19)
14 5/29
(Wed.)		 (started at 1:10pm)
Ch11: Placement (incl. The Fiduccia-Mattheyses Algorithm, Placement by Partitioning)
Ch03: Design for Testability (incl. Testability Analysis, SCOAP Testability Analysis)
 11.3,
3.1 - 3.2
  • HW-5 (June 2)
15 6/05
(Wed.)		 (started at 1:10pm)
HW-6/Term Project/Contest: Descriptions - Floorplanning via Simulated Annealing
Ch03: Design for Testability (incl. SCOAP Testability Analysis, Probability-Based Testability Analysis, Scan Design, Muxed-D Scan Design)
 3.2 - 3.3
  • HW-5 (June 2)
16 6/12
(Wed.)		 端午節（放假一天）  

    
17 6/19
(Wed.)		 授課教師請假 (至 NEWCAS-2013 發表論文) (已完成補課)  

   
18 6/26
(Wed.)		 積體電路設計自動化導論 (EDA Course) - 期末考訊息

考試時間: 6月26日 (2:10pm - 4:00pm) 請提早十分鐘到達考場
考試地點: 1501A 教室
考試範圍: 教過的部份 (請見 http://www.itseng.org/YZU/CSE/Courses/2013/Spring/CS338A/)

注意：必須攜帶學生證應考，考試時手機請關機(手機開震動還是會有聲音)，不得隨身攜帶電子產品(例如計算機、電子字典、手機)。可以攜帶書籍、講義、筆記、紙本的字典、或紙張。作弊者期末考成績零分。

注意：完成考試的同學請盡速離開考場，並且勿在考場附近逗留、談話、或大聲喧嘩，影響他人考試者將會被扣平時分數。

(6/24 - 6/29 期末考週，本週停課）		  
  • HW-6/Term Project/Contest - June 30
19 7/03
(Wed.)		 課程結束  

  

 

last update: June 24, 2013