Solutions to Assignment #2

Chapter 2

1. (a) The given DFG is

(3)
d1 d2 d3
(2)
1 D D 2 D 4 (1)

(2)

Computing of iteration bound by Longest Path Matrix (LPM) requires the following steps
I. Building the delay graph Gd from the DFG

d1 → d 2 : 0
d 2 → d1: d 2 → 2 → 3 → 1 → d1 = 7
d 2 → d3: d 2 → d3 = 3
d 3 → d1: d 3 → 4 → 1 → d1 = 3

d1
7
3 0

d3 d2
3

Gd
(1)
II. Build the L matrix
⎡ −1 0 −1⎤
L = ⎢⎢ 7 −1 3 ⎥⎥
(1)

⎢⎣ 3 −1 −1⎥⎦

III. Construct the higher order matrices L(m) recursively

⎡ 7 −1 3 ⎤ ⎡ 6 7 -1 ⎤
L (2)
= ⎢⎢ 6 7 −1⎥⎥ L = ⎢⎢14 6 10 ⎥⎥
(3)

⎢⎣ −1 3 −1⎥⎦ ⎢⎣10 -1 6 ⎥⎦

IV. Calculate the iteration bound T∞

 ⎛7 7 6 6 6⎞
T∞ = max ⎜ , , , , ⎟
⎝2 2 3 3 3⎠
= 3.5
1. (b) Computing of iteration bound by Minimum Cycle Mean (MCM) requires the following steps
I. Create G 'd from Gd
d1
-7
-3 0

d3 d2
-3

G’d
II. Consider d1 as the source node (s) then

⎡0⎤ ⎡∞ ⎤ ⎡ −7 ⎤ ⎡ −6 ⎤
f (0)
= ⎢⎢∞ ⎥⎥ f (1)
= ⎢⎢ 0 ⎥⎥ f (2)
= ⎢⎢ ∞ ⎥⎥ f (3)
= ⎢⎢ −7 ⎥⎥
⎢⎣∞ ⎥⎦ ⎢⎣∞ ⎥⎦ ⎢⎣ −3⎥⎦ ⎢⎣ ∞ ⎥⎦

⎛ f (3) (i ) − f ( m ) (i ) ⎞
III. Calculate max ⎜ ⎟
i∈{1,2,3} & m∈{0,1,2}
⎝ 3− m ⎠
m=0 m=1 m=2
⎛ f (3) (i) − f ( m ) (i) ⎞
⎜ ⎟
⎝ 3− m ⎠
i=1 -2 -∞ 1 1
i=2 -∞ 7 -∞ 7
- -
2 2
i=3 ∞ ∞ ∞ ∞

IV. Calculate the iteration bound T∞

⎛ −7 ⎞
T∞ = − min ⎜ 1, , ∞ ⎟
i∈{1,2,3}
⎝ 2 ⎠
= 3.5

3. (a) The given block diagram is

 1 7
IN OUT

b
a D
D
a
2
8
3 5

c 2D 2D d

4 6

Computing of iteration bound by Longest Path Matrix (LPM) requires the following steps
I. Create the DFG for the feedback loop in the block diagram
(2)

D1
(1)
(1)
2 1

D2
D3

(2)
DFG OF FEEBACK LOOP WITH
3 LEFT DELAY ELEMENTS
A/Q addition and multiplication operations require (1)u.t. and (2) u.t. respectively
II. Building the delay graph Gd from the DFG

D1 → D 2 : D1 → 3 → 2 → 1 → D 2 = 4
D1 → D1: D1 → 3 → 2 → 1 → D1 = 4
D 2 → D3 : 0
D3 → D1: D3 → 4 → 2 → 1 → D1 = 4
D 3 → D 2 : D3 → 4 → 2 → 1 → D 2 = 4
4

D1

4 4

D3 D2
0

Gd
 III. Build the L(1) matrix
⎡ 4 4 −1⎤
L = ⎢⎢ −1 −1 0 ⎥⎥
(1)

⎢⎣ 4 4 −1⎥⎦

IV. Construct the higher order matrices L(m) recursively

⎡8 8 4 ⎤ ⎡12 12 8 ⎤
(2)
L = ⎢⎢ 4 4 −1⎥⎥ L = ⎢⎢ 8 8 4 ⎥⎥
(3)

⎢⎣8 8 4 ⎥⎦ ⎢⎣12 12 8 ⎥⎦

V. Calculate the iteration bound T∞

⎛ 4 8 4 4 12 8 8 ⎞
T∞ = max ⎜ , , , , , , ⎟
⎝ 1 2 2 2 3 3 3⎠
=4
3. (b) Computing of iteration bound by Minimum Cycle Mean (MCM) requires the following steps
I. Create G 'd from Gd
-4

D1

-4 -4

D3 D2
0

-4

G’d
II. Consider D2 as the source node (“s”) then

⎡∞ ⎤ ⎡∞ ⎤ ⎡ −4 ⎤ ⎡ −8⎤
f (0)
= ⎢⎢ 0 ⎥⎥ f (1)
= ⎢⎢∞ ⎥⎥ f (2)
= ⎢⎢ −4⎥⎥ f (3)
= ⎢⎢ −8⎥⎥
⎢⎣ ∞ ⎥⎦ ⎢⎣ 0 ⎥⎦ ⎢⎣ ∞ ⎥⎦ ⎢⎣ −4 ⎥⎦

⎛ f (3) (i ) − f ( m ) (i ) ⎞
III. Calculate max ⎜ ⎟
i∈{1,2,3} & m∈{0,1,2}
⎝ 3− m ⎠
 m=0 m=1 m=2
⎛ f (3) (i) − f ( m ) (i) ⎞
⎜ ⎟
⎝ 3− m ⎠
i=1 -∞ -∞ -4 -4
i=2 −8 -∞ -4 −8
3 3
i=3 -∞ -2 -∞ -2

IV. Calculate the iteration bound T∞

⎛ −8 ⎞
T∞ = − min ⎜ −4, , −2 ⎟
i∈{1,2,3}
⎝ 3 ⎠
=4
4. (a) The given block diagram is
1 8
IN OUT

D1 D

9 10
7
2

D2 D

11 12
3
6

D3 D

4 5

Computing of iteration bound by Longest Path Matrix (LPM) requires the following steps
I. Create the DFG for the feedback loop in the block diagram
(1)

2
(2)

9
(2) D1
D3 D2 D1 (1)
4 1

D1
D2
(2)

3 11

(1)
DFG OF FEEBACK LOOP WITH
3 DELAY ELEMENTS
The nodes are number 1-11. A/Q addition and multiplication operations require (1)u.t. and (2) u.t.
respectively
 II. Creating the delay graph Gd from the DFG

D1 → D 2 : 0
D1 → D1: D1 → 9 → 2 → 1 → D1 = 4
D 2 → D1: D 2 → 11 → 3 → 2 → 1 → D1 = 5
D 2 → D3 : 0
D3 → D1: D3 → 4 → 3 → 2 → 1 → D1 = 5
4

D1

5 0 5

D3 D2
0

Gd

III. Build the L(1) matrix

⎡ 4 0 −1⎤
L = ⎢⎢ 5 −1 0 ⎥⎥
(1)

⎢⎣ 5 −1 −1⎥⎦

IV. Construct the higher order matrices L(m) recursively

⎡8 4 0 ⎤ ⎡12 8 4 ⎤
L(2) = ⎢⎢9 5 −1⎥⎥ L(3) = ⎢⎢13 9 5 ⎥⎥
⎢⎣9 5 −1⎥⎦ ⎢⎣13 9 5 ⎥⎦

V. Calculate the iteration bound T∞

⎛ 4 8 5 12 9 5 ⎞
T∞ = max ⎜ , , , , , ⎟
⎝1 2 2 3 3 3⎠
=4
4. (b) Computing of iteration bound by Minimum Cycle Mean (MCM) requires the following steps

I. Create G 'd from Gd

 -4

D1

-5 0 -5

D3 D2
0

G’d
II. Consider D1 as the source node (“s”) then

⎡0⎤ ⎡ −4 ⎤ ⎡ −8⎤ ⎡ −12⎤

f (0) = ⎢⎢∞ ⎥⎥ f (1) = ⎢⎢ 0 ⎥⎥ f (2) = ⎢⎢ −4⎥⎥ f (3) = ⎢⎢ −8 ⎥⎥
⎢⎣∞ ⎥⎦ ⎢⎣ ∞ ⎥⎦ ⎢⎣ 0 ⎥⎦ ⎢⎣ −4 ⎥⎦

⎛ f (3) (i ) − f ( m ) (i ) ⎞
III. Calculate max ⎜ ⎟
i∈{1,2,3} & m∈{0,1,2}
⎝ 3− m ⎠
m=0 m=1 m=2
⎛ f (3) (i) − f ( m ) (i) ⎞
⎜ ⎟
⎝ 3− m ⎠
i=1 -4 -4 -4 -4
i=2 -∞ -4 -4 -4
i=3 -∞ -∞ -4 -4

IV. Calculate the iteration bound T∞

T∞ = − min ( −4, −4, −4 )
i∈{1,2,3}

=4
6. (a) The given block diagram is

A1 M1 A2 A3 M2 A4
IN

D2 A6 D1
A5
D D

M4 M5
M3

A7 A8
OUT
D3
Computing of iteration bound by Longest Path Matrix (LPM) requires the following steps

I. Create the DFG for the feedback loop in the block diagram

D1

(1) (2) (1) (2) (1)

(1)

A1 M1 A2 A3 M2 A4

D2

D1
A6
(1)
DFG OF FEEBACK LOOP IN THE UPPER PART
WITH 2 DELAY ELEMENTS
A/Q addition and multiplication operations require (1)u.t. and (2) u.t. respectively

II. Creating the delay graph Gd from the DFG

D1 → D1: D1 → A3 → M 2 → A4 → D1 = 4
D1 → D 2 : D1 → A3 → M 2 → A6 → D 2 = 4
D 2 → D1: D 2 → A1 → M 1 → A2 → A3 → M 2 → A4 → D1 = 8
D 2 → D 2 : D 2 → A1 → M 1 → A2 → A3 → M 2 → A6 → D 2 = 8

4
8

4
D1 D2

8
Gd

III. Build the L(1) matrix

⎡4 4⎤
L(1) = ⎢ ⎥
⎣8 8 ⎦

IV. Construct the higher order matrices L(m) recursively

⎡12 12 ⎤
L(2) = ⎢ ⎥
⎣16 16 ⎦
V. Calculate the iteration bound T∞
 ⎛ 4 8 12 16 ⎞
T∞ = max ⎜ , , , ⎟
⎝1 1 2 2 ⎠
=8
6. (b) Computing of iteration bound by Minimum Cycle Mean (MCM) requires the following steps

I. Create G 'd from Gd

-4
-8

-4
D1 D2

-8
G’d
II. Consider D2 as the source node (“s”) then

⎡∞ ⎤ ⎡ −8⎤ ⎡ −16 ⎤
f (0) = ⎢ ⎥ f (1) = ⎢ ⎥ f (2) = ⎢ ⎥
⎣0⎦ ⎣ −8⎦ ⎣ −16 ⎦

⎛ f (2) (i ) − f ( m ) (i) ⎞
III. Calculate max ⎜ ⎟
i∈{1,2} & m∈{0,1}
⎝ 2−m ⎠
m=0 m=1
⎛ f (2) (i) − f ( m ) (i) ⎞
⎜ ⎟
⎝ 2−m ⎠
i=1 -∞ -8 -8
i=2 -8 -8 -8

IV. Calculate the iteration bound T∞

T∞ = − min ( −8, −8 )
i∈{1,2}

=8