Fundamental Algorithms for Automated Electronic Design

Catalog description

Upon completion of the course, students will know to design and implement the fundamental algorithms for automated electronic design, such as system and circuit design. The discussed core algorithms include greedy algorithms, divide-and-conquer, quicksort, dynamic programming, graph algorithms, and string matching. Analysis of algorithms is also discussed. These algorithms are exemplified for basic electronic design tasks, like circuit partitioning, floorplanning, module placement, signal routing, task scheduling, resource allocation, and technology mapping. The course work involves programming exercises and one course project.