start
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| start [2015/02/04 03:27] – 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 fundamental lower bound on the achievable iteration or sampling period; | + | - 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; | ||
start.1423020457.txt.gz · Last modified: 2015/02/04 03:27 by peterlian