User Tools

Site Tools


start

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
start [2015/01/10 14:27] peterlianstart [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 bound;+  - 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 based on a given set of design specifications. +  - assess alternative architectures based on a given set of design specifications; 
 +  - 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:3-18:00 at Room 114 of Farquharson Building
start.1420900033.txt.gz · Last modified: 2015/01/10 14:27 by peterlian

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki