Documente Academic
Documente Profesional
Documente Cultură
Slide 1
Representations of DSP
• Mathematical formulations
Algorithms
• Behavioral description languages
• Applicative language
• Represents a set of equations satisfied by the variables, e.g. Silage
• Perspective language
• Explicitly specify the order of assignment, e.g. C and other HLLs
• Descriptive language
• Represents the structure of a DSP system, e.g. VHDL, Verilog
• Graphical representations
• Block diagrams
• Signal flow graph (SFG)
• Data flow graph (DFG)
• Dependence graph (DG)
VLSI DSP 2019 3-2
Block Diagrams (1)
• Consists of functional blocks connected with directed edges
• Functional block, e.g. Add, Mult
• Unit delay element
• Directed edge representing the data flow between blocks
• Basic blocks
Transposed SFG
mpy
Transpose form
Inter-
iteration
• In (b)
• Loop 1: A→B→A
• Loop 2: A→B→C→A (critical loop)
6 11
T max , 11 u.t.
lL 2 1
• Algorithms to find T∞
• Longest path matrix algorithm
• Minimum cycle mean algorithm
• Negative cycle detection algorithm
X b0 X b1 x(n) D
x(n-1)
+ y(n) X b0 X b1
a
a
• After retiming
Mul 0 1 2 3 4 5 6 7 8
(C) 2004-2006 by Yu Hen Hu
Feed-back Cut Set Retiming
• Consider an IIR digital filter x(2k-1)=x(k)
y(n) = ay(n-1) + x(n) x(2k) = 0
x(n) y(n)
+ x(m) y(m)
+
D
2D
a
a
x(n) y(n)
x(m) y(m) +
+
D
D D
D
a
a
(C)2002-2006 Yu Hen Hu 26
Data Flow Graph
• Node: • Example
• Computation y(n) = a*y(n-1) + b*u(n)
• Associated with a computing time. • The delay of 1 u.t. indicates that to compute y(n+1)
• Direct edge: in the next iteration depends on result y(n) of the
present iteration.
• data path and delay
• Delay labeled with D or positive integer on edges
• Delay: iteration count
(C)2002-2006 Yu Hen Hu 27
DFG
x(n) D D
• Intra-iteration dependency
• A direct edge without any delay
(4) M0 (4) M1 (4) M2
• Inter-iteration dependency
• Direct edge with 1 or more delays y(n)
A0 A1
• Node computing delay labeled with
(2) (2)
parenthesis.
• Critical path: longest path between … • Recursive DFG: contains loops. Must
• Example: critical path delay = 4+2+2 = 8 t.u. have at least one delay element
along any loop. Otherwise, the
algorithm is NON-computable!
(C)2002-2006 Yu Hen Hu 28
Loop bound and Iteration bound
D
(2)
t
(4) (5)
i
iloop A B C
Tloop
d
iloop
i
2D
A B
• T{A-B-A} = (2+4)/2 = 3 t.u.
2D
• T = max{(2+4)/2, (2+4+5)/1}
= max{3, 11} = 11
(C)2002-2006 Yu Hen Hu 29