start
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| start [2015/01/10 14:25] – peterlian | start [2015/02/04 03:27] (current) – peterlian | ||
|---|---|---|---|
| Line 10: | Line 10: | ||
| Upon completion of the course, students should be able to: | Upon completion of the course, students should be able to: | ||
| - | - map a DSP algorithm to a graphical representation and determine its iterative | + | - map a DSP algorithm to a graphical representation and determine its fundamental lower bound on the achievable iteration or sampling period; |
| - use pipelining, retiming, and parallel processing to improve the performance of a DSP implementation; | - use pipelining, retiming, and parallel processing to improve the performance of a DSP implementation; | ||
| - use folding technique to reduce silicon area in a DSP implementation; | - use folding technique to reduce silicon area in a DSP implementation; | ||
| - | - assess alternative architectures | + | - assess alternative architectures |
| + | - implement a DSP algorithm based on an optimized architecture. | ||
| ===== Instructor & Office Hours ===== | ===== Instructor & Office Hours ===== | ||
| Line 30: | Line 30: | ||
| ===== Teaching Assistant ===== | ===== Teaching Assistant ===== | ||
| * Mr. Mingfei Wang, email: mingfei AT cse DOT yorku DOT ca | * Mr. Mingfei Wang, email: mingfei AT cse DOT yorku DOT ca | ||
| - | * Office hour: TBD at LAS 2013 | + | * Office hour: Every Tuesday from 16: |
start.1420899900.txt.gz · Last modified: 2015/01/10 14:25 by peterlian