DEGREE PROGRAMS  Associate's Degree (Short Cycle)  Bachelor’s Degree (First Cycle)  Master’s Degree (Second Cycle)

Course Description Course Name : Algorithms in VLSI Design Course Code : CENG-512 Course Type : Optional Level of Course : Second Cycle Year of Study : 1 Course Semester : Spring (16 Weeks) ECTS : 6 Name of Lecturer(s) : Asst.Prof.Dr. MUTLU AVCI Learning Outcomes of the Course : Understands basic concepts of VLSI physical design Comprehends algorithms for pin assignments and layouts. Knows algorithms for routing. Comprehends data structures and algorithms for physical design. Determines appropriate routing and design methods for high performance systems. Mode of Delivery : Face-to-Face Prerequisites and Co-Prerequisites : None Recommended Optional Programme Components : None Aim(s) of Course : To provide comprehensive background in the principles and algorithms of VLSI physical design and introduce basic concepts of VLSI physical design automation. Course Contents : VLSI design cycle, physical design cycle, design styles and packaging styles. Fabrication process for VLSI devices, MOS and TTL transistors, nMOS and CMOS. Design rules, delay and fabrication costs involved in the VLSI process. Data structures and algorithms involved in the physical design. Partitioning algorithms and thier effect to performances. Algorihms for floorplanning and pin assignment. Global routing, simple routing algorithms and integer programming based methods. Single layer and multilayer routing algorithms. Improving layouts. Determining the layout of high performance systems. Language of Instruction : English Work Place : Classroom for graduate students   Course Outline /Schedule (Weekly) Planned Learning Activities Week Subject Student's Preliminary Work Learning Activities and Teaching Methods 1 VLSI design cycle, physical deisgn cycle, design styles and packaging styles Reading corresponding subjects of textbook Lecturing 2 Fabrication process for VLSI devices. Reading corresponding subjects of textbook Lecturing 3 Factors impact on physical design Reading corresponding subjects of textbook Lecturing 4 Data structures involved in physical design Reading corresponding subjects of textbook Lecturing 5 Algorithms involved in physical design. Reading corresponding subjects of textbook Lecturing 6 Graphs used for modelling different problems in VLSI design Reading corresponding subjects of textbook Lecturing 7 Partitioning algorithms Reading corresponding subjects of textbook + Homework Lecturing 8 Midterm Exam Examination 9 Basic algorithms for pin assignment and floorplanning. Reading corresponding subjects of textbook + Homework Lecturing 10 Global routing, simple routing algorithms Reading corresponding subjects of textbook + Hmework Lecturing 11 Integer programming based routing algorithms Reading corresponding subjects of textbook Lecturing 12 Algorithms used for improving layout-1 minimization Reading corresponding subjects of textbook + Homework Lecturing 13 Algorithms used for improving layout-2 over the cell routing Reading corresponding subjects of textbook + Homewrok Lecturing 14 Important topics in determining the layout of high performance systems Reading corresponding subjects of textbook Lecturing 15 Problem hour Repeat of subjects Problem solving 16/17 Final Exam Examination   Required Course Resources Resource Type Resource Name Recommended Course Material(s)  Algorithms for VLSI Physical Design Autıomation, Naveed A. Sherwani, 3rd Editiion. Required Course Material(s)   Assessment Methods and Assessment Criteria Semester/Year Assessments Number Contribution Percentage     Mid-term Exams (Written, Oral, etc.) 1 70     Homeworks/Projects/Others 5 30 Total 100 Rate of Semester/Year Assessments to Success 40   Final Assessments 100 Rate of Final Assessments to Success 60 Total 100   Contribution of the Course to Key Learning Outcomes # Key Learning Outcome Contribution* 1 Reaches wide and deep knowledge through scientific research in the field of computer engineering, evaluates, implements, and comments. 4 2 Describes and uses information hidden in limited or missing data in the field of computer engineering by using scientific methods and integrates it with information from various disciplines. 4 3 Follows new and emerging applications of computer engineering profession, if necessary, examines and learns them 4 4 Develops methods and applies innovative approaches in order to formulate and solve problems in computer engineering. 3 5 Proposes new and/or original ideas and methods in the field of computer engineering in developing innovative solutions for designing systems, components or processes. 4 6 Designs and implements analytical modeling and experimental research and solves the complex situations encountered in this process in the field of Computer Engineering 4 7 works in multi disciplinary teams and takes a leading role and responsibility. 4 8 Learns at least one foreign language at the European Language Portfolio B2 level to communicate orally and written 0 9 Presents his/her research findings systematically and clearly in oral and written forms in national and international meetings. 4 10 Describes social and environmental implications of engineering practice. 0 11 Considers social, scientific and ethical values in collection, interpretation and announcement of data. 4 12 Acquires a comprehensive knowledge about methods and tools of computer engineering and their limitations. 5 * Contribution levels are between 0 (not) and 5 (maximum).   Student Workload - ECTS Works Number Time (Hour) Total Workload (Hour) Course Related Works     Class Time (Exam weeks are excluded) 14 3 42     Out of Class Study (Preliminary Work, Practice) 12 2 24 Assesment Related Works     Homeworks, Projects, Others 5 3 15     Mid-term Exams (Written, Oral, etc.) 1 24 24     Final Exam 1 39 39 Total Workload: 144 Total Workload / 25 (h): 5.76 ECTS Credit: 6