Week 1 :Graphical representation of DSP algorithms, signal flow graph (SFG), data flow graph (DFG) and dependence graph (DG), high level transformation, critical path.
Week 2 :Retiming of DFG, critical path minimization by retiming, loop retiming and iteration bound
Week 3 :Cutset retiming, design of pipelined DSP architectures, examples
Week 4 :Parallel realization of DSP algorithms, idea of unfolding, unfolding theorem, loop unfolding
Week 5 :Polyphase decomposition of transfer functions, hardware efficient parallel realization of FIR filters, 2-parallel and 3-parallel filter architectures.
Week 6 :Hardware minimization by folding, folding formula, examples from biquad digital filters,
Week 7 :Delay optimization by folding, lifetime analysis, forward-backward data allocation, examples from digital filters
Week 8 :Pipelining digital filters, look ahead techniques, clustered and scattered look ahead, combining parallel processing with pipelining in digital filters
DOWNLOAD APP
FOLLOW US