Solutions to Assignment #2

Chapter 2
1.

(a) The given DFG is

(2)

d1

d2

(3)

d3

3
(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

d3

d2
3
Gd

II. Build the

(1)

matrix

1 0 1
L = 7 1 3
3 1 1
(1)

III. Construct the higher order matrices

(2)

IV.

L(m)

recursively

7 1 3
= 6 7 1
1 3 1

Calculate the iteration bound

6 7 -1
L = 14 6 10
10 -1 6
(3)

(1)

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

d3

d2
-3
Gd

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

III. Calculate

(0)

0
=

(1)

m=1

(3)

6
= 7

Calculate the iteration bound

7
T = min 1, ,
i{1,2,3}
2

= 3.5

3. (a) The given block diagram is

f (3) (i) f ( m ) (i)

3 m

m=2

IV.

7
=
3

f (3) (i ) f ( m ) (i )

i{1,2,3} & m{0,1,2}

3 m

-2
-

i=3

(2)

max

m=0

i=1
i=2

= 0

7
2

1
-

1
-

7
2

IN

OUT

8
3

5
c

2D

2D

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)

3
D1
(1)

(1)

1
D2
D3

4
(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

D3

0
4
Gd

D2

III. Build the

L(1)

matrix

4 4 1
L = 1 1 0
4 4 1
(1)

IV.

Construct the higher order matrices

(2)

V.

L(m)

recursively

8 8 4
= 4 4 1
8 8 4

Calculate the iteration bound

12 12 8
L = 8 8 4
12 12 8
(3)

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
Gd

II. Consider D2 as the source node (s) then

III. Calculate

(0)

= 0

(1)

=
0

(2)

4
= 4

f (3) (i ) f ( m ) (i )

i{1,2,3} & m{0,1,2}

3 m

max

(3)

8
= 8
4

m=0

m=1

i=1
i=2

3
-

i=3
IV.

Calculate the iteration bound

f (3) (i) f ( m ) (i)

3 m

m=2

-
-

-4
-4

-2

-2

-4

T = min 4, , 2
i{1,2,3}
3

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

IN

D1

10

D2

11

OUT

12
6

D3 D
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)

9
D1

(2)

D3 D2 D1

(1)
D1
D2
(2)

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

D3

D2

0
Gd

III. Build the

L(1)

matrix

4 0 1
L = 5 1 0
5 1 1
(1)

IV.

Construct the higher order matrices

L(2)

V.

Calculate the iteration bound

L(m)

recursively

8 4 0
= 9 5 1
9 5 1

12 8 4
L(3) = 13 9 5
13 9 5

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

-5

D3

D2

0
Gd

II. Consider D1 as the source node (s) then

f (0)

III. Calculate

0
=

f (1)

4
= 0

f (3)

12
= 8
4

f (3) (i ) f ( m ) (i )

i{1,2,3} & m{0,1,2}

3 m

max

m=0

i=1
i=2
i=3

m=1

-4
-
-
IV.

f (2)

8
= 4
0

-4
-4

-4
-4
-4

Calculate the iteration bound

T = min ( 4, 4, 4 )

f (3) (i) f ( m ) (i)

3 m

m=2

-4
-4
-4

i{1,2,3}

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

A1

IN

A5

A2

M1

A3

D2

A6

M2

A4

D1
D

M4

M5

M3

A7
D3

A8

OUT

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)

A1

M1

(1)

(2)

(1)

A2

A3

M2

(1)

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

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

D2

 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
Gd

II. Consider D2 as the source node (s) then

f (0) =
0
III. Calculate

8
f (1) =
8

f (2) (i ) f ( m ) (i)

i{1,2} & m{0,1}

2m

max

m=0

Calculate the iteration bound

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

=8

f (2) (i) f ( m ) (i)

2m

m=1

-
-8

i=1
i=2
IV.

16
f (2) =

16

-8
-8

-8
-8