|Course title||EDA for Physical Design of Digital Systems
|Course description||This course aims to present the fundamental concepts and algorithms applied in Design Automation (CAD) of VLSI circuits. The scope will include various areas in Physical Design of digital systems, including circuit partitioning, FPGA technology mapping, floorplanning, placement, routing, compaction and interconnect optimization.
|Semester||1 or 2|
|Grade Descriptors||A/A-: EXCELLENT – exceptionally good performance and far exceeding expectation in all or most of the course learning outcomes; demonstration of superior understanding of the subject matter, the ability to analyze problems and apply extensive knowledge, and skillful use of concepts and materials to derive proper solutions.
B+/B/B-: GOOD – good performance in all course learning outcomes and exceeding expectation in some of them; demonstration of good understanding of the subject matter and the ability to use proper concepts and materials to solve most of the problems encountered.
C+/C/C-: FAIR – adequate performance and meeting expectation in all course learning outcomes; demonstration of adequate understanding of the subject matter and the ability to solve simple problems.
D+/D: MARGINAL – performance barely meets the expectation in the essential course learning outcomes; demonstration of partial understanding of the subject matter and the ability to solve simple problems.
F: FAILURE – performance does not meet the expectation in the essential course learning outcomes; demonstration of serious deficiencies and the need to retake the course.
|Learning outcomes||At the end of the course of studies, students will have acquired the ability to understand the concepts, previous research and future trends of:
1. floorplanning and placement
2. circuit partitioning
4. technology mapping
5. interconnect optimization
6. design for manufacturability
(for reference only)
|Essay test or exam ：15%
|Recommended Reading List||1. Algorithms for VLSI Physical Design Automation, 3rd edition. Nareed Sherwani. Kluwer Academic Publishers, 1999.|
|CENGN programme learning outcomes||Course mapping|
|Upon completion of their studies, students will be able to:|
|1. identify, formulate, and solve computer engineering problems (K/S);||TP|
|2. design, implement, test, and evaluate a computer system, component, or algorithm to meet desired needs (K/S);
|3. receive the broad education necessary to understand the impact of computer engineering solutions in a global and societal context (K/V);||T|
|4. communicate effectively (S/V);
|5. succeed in research or industry related to computer engineering (K/S/V);
|6. have solid knowledge in computer engineering, including programming techniques, circuit design, micro-system prototyping, solid state device development, algorithms and theory, etc. (K/S);||TP|
|7. integrate well into and contribute to the local society and the global community related to computer engineering (K/S/V);|
|8. practise high standard of professional ethics (V);|
|9. draw on and integrate knowledge from many related areas (K/S/V);
|Remarks: K = Knowledge outcomes; S = Skills outcomes; V = Values and attitude outcomes; T = Teach; P = Practice; M = Measured|