CMPE229 Syllabus -- Spring 07
Coursework:
- 20% Homeworks
- 30% Midterm Exam
- 30% Presentation of 2-3 papers
- 20% Projects (report and presentation)
Topics:
- Technology Mapping
- Look-up tables
- Ashenhurst decomposition & Roth-Karp decomposition
- Flow-map
- Routability aspects
- Placement
- Simulated Annealing
- Force-directed placement: Conjugate Gradient Method
- Placement for Hierarchical FPGAs
- Delay calculations, slack
- Routing
- Negotiation-based routing
- Global routing; wire type assignment
- Universal switches
- Miscellaneous Issues
- Retiming
- Synthesized optimal placements
- Parallelization of FPGA CAD algorithms
- IO placement
- Interconnect for reconfigurable Multi-FPGA systems
The CMPE229 Web:
Copyright 2007; Department of Computer Engineering,
University of California, Santa Cruz.
Portions of the CMPE229 Web may be reprinted or adapted for academic
nonprofit purposes, providing the source is accurately quoted and duly
credited.
Comments to:
martine@cse.ucsc
.edu
(Last Update:
04/11/07
)