|
|
|||||||||||||||||
Course Catalog 2012-2013
TKT-3517 DSP Implementations, 5 cr |
Additional information
Suitable for postgraduate studies
Person responsible
David Guevorkian, Vladimir Guzma, Olli Vainio, Jarmo Takala
Lessons
| Study type | P1 | P2 | P3 | P4 | Summer | Implementations | Lecture times and places |
|
|
|
|
|
|
|
|
|
Requirements
Written exam and completed compulsory assignment.
Completion parts must belong to the same implementation
Learning outcomes
Student can classify the special features of DSP processors and develop applications with fractional representation. Students can describe a DSP application with data flow graphs and analyze the inherent parallelism of the application.
Content
| Content | Core content | Complementary knowledge | Specialist knowledge |
| 1. | number representations in fixed-point and floating-point processors | finite word length effects, overflow management | |
| 2. | DSP processor architectures | CISC, VLIW, SIMD | |
| 3. | memory architectures, Harvard architecture | parallel memories | |
| 4. | data-flow graph representation, loop and iteration bounds | folding of multirate systems | solving inequalities |
| 5. | pipelining, parallel processing, and combined parallel pipelined processing | low-power optimizations | |
| 6. | critical path, folding, unfolding, retiming | distributed arithmetic | |
| 7. | general-purpose graphics processing units | OpenCL |
Evaluation criteria for the course
Written exam 70%, compulsory assignments 30%
Assessment scale:
Numerical evaluation scale (1-5) will be used on the course
Partial passing:
Study material
| Type | Name | Author | ISBN | URL | Edition, availability, ... | Examination material | Language |
| Book | VLSI Digital Signal Processing Systems: Design and Implementation | K. K. Parhi | 0-471-24186-5 | English | |||
| Lecture slides | Lecture Slides | Jarmo Takala & David Guevorkian | English | ||||
| Lecture slides | English |
Additional information about prerequisites
Basic knowledge on signal processing algorithms is recommended.
Prerequisite relations (Requires logging in to POP)
Correspondence of content
| Course | Corresponds course | Description |
|
|
|
|
|
|
|
More precise information per implementation
| Implementation | Description | Methods of instruction | Implementation |