This action might not be possible to undo. Are you sure you want to continue?

1 (a) From the DFG we get:

⎡0 ⎤ ⎡1⎤ ⎡1 ⎤ ex = ⎢ ⎥, e y = ⎢ ⎥, eh = ⎢ ⎥ ⎣1 ⎦ ⎣1⎦ ⎣0 ⎦

**The two conditions to be satisfied for the scheduling and the projection vector to be permissible are:
**

S T d ≠ 0, S T e ≥ 0,

for all dependence vectors e. Verifying these conditions we get the following for each of the cases: (i) S = [1 0]

T

d = [1

⎡0 ⎤ T 0] ⇒ p = ⎢ ⎥ ⎣1 ⎦ pT e 1 1 0

ex

STe 0

1 1

ey eh

In this case STd =1

All S T e ≥ 0

Thus this case is permissible.

**⎡1 ⎤ T d = [2 − 1] ⇒ p = ⎢ ⎥ ⎣ 2⎦ ⎡2⎤ Since S T d = [1 2] ⎢ ⎥ = 0 , this case is not permissible. ⎣− 1⎦ ⎡0 ⎤ T T (iii) S = [1 1] d = [1 0] ⇒ p = ⎢ ⎥ ⎣1⎦ (ii) S = [1 2]
**

T

ex

pT e 1

1 0

STe 1

2 1

ey eh

(iv) S = [1 − 2] In this case T d = [1 ⎡0 ⎤ T 0] ⇒ p = ⎢ ⎥ ⎣1⎦ ⎡1⎤ ⎡0 ⎤ S T d = [1 − 2] ⎢ ⎥ = 1 ... S T eh = [1 − 2] ⎢ ⎥ =1 ⎣1⎦ ⎣0 ⎦ ⎡0⎤ ⎡1⎤ Since S T e < 0 for e= ⎢ ⎥ and e= ⎢ ⎥ this case is not permissible.......... S = [1 0] T d = [1 h1 D 0] T h0 D ............ (b) The systolic architectures for the permissible designs (i) and (iii) are given below. S T e x = [1 − 2] ⎢ ⎥ = −2 is < 0 ⎣0 ⎦ ⎣1 ⎦ ⎡1⎤ ⎡1⎤ S T e y = [1 − 2] ⎢ ⎥ = −1 is < 0 .Y3Y2Y1Y0 D P0 D P1 D P2 h1 D h2 D Figure1.....X3X2X1X0 ..Y3Y2Y1Y0 2D Figure2... Note that these edges ⎣1 ⎦ ⎣1⎦ cannot be simply reversed to make S T e ≥ 0 since the functionality of the nodes in the dependence graph are unknown and it is not clear if there are precedence constraints along the edges..In this case STd =1 All S T e ≥ 0 Thus this case is permissible. h0 D ..X3X2X1X0 .. h2 D D D P0 D P1 2D P2 2D S = [1 1] T d = [1 0] T .

x0 x1 x2 x3 x4 x5 j w4 w3 w2 w1 y4 y5 y6 w0 i (a) We start by deriving the RIA as follows: H (i. j ) = Y (i − 1.0) X (0. j ) = H (i − 1. j ) = X (i. j ) H (i.1) The scheduling is done by applying the following formulae . j − 1) The reduced graph is given by (1 0) (0. j ) X (i. -1) H Y (0.0) (1.9. j + 1) + X (i. j ) Y (i.

S T = (4 ⎣− 1⎦ ⎡1⎤ 0) ⇒ p = ⎢ ⎥ HUE = 1 / 4 ⎣1⎦ . γ H = γ X = γ Y = 0 ) and choose ST=(4 0) then it will maximize the HUE (hardware utilization time) (b) ⎡1⎤ If d = ⎢ ⎥ .. (i. w0 4D 4D P0 X Figure 3.e. S T = (4 ⎣0 ⎦ pT e 1 -1 0 ⎡0⎤ 0) ⇒ p = ⎢ ⎥ HUE = 1 / 4 ⎣1 ⎦ ex ey eh STe 0 4 4 The systolic architecture for the design is given below. P4 [ 0] T d = [1 0] T (c) ⎡1⎤ If d = ⎢ ⎥ .... S T e + γ y − γ x ≥ Tx ⎣ s 2⎦ From the reduced graph we see that H → H : s1 + γ H − γ H ≥ 0 H → Y : γY − γ H ≥ 0 X → X : s2 + γ X − γ X ≥ 0 X → Y : γY − γ X ≥ 0 Y → Y : s1 − s2 + γ Y − γ Y ≥ 4 If we use linear scheduling. S = 4 w1 4D 4D P1 w2 4D 4D P2 w3 4D 4D P3 w4 4D Y :Y0 Y1 Y2 Y3....⎡ s1⎤ S = ⎢ ⎥ .

Y 4D 4D w4 w3 w2 w1 w0 Y 4D 4D P1 Y 4D 4D P2 Y 4D 4D P3 Y 4D P0 X P4 Figure 4. i j The dependence vectors are given by: ⎡1⎤ ⎡ 2⎤ ⎡0 ⎤ ex = ⎢ ⎥. we can choose S = [1 1] T . e y = ⎢ ⎥.ex ey eh pT e 1 0 1 STe 0 4 4 The systolic architecture for the design is given below. eh = ⎢ ⎥ ⎣0 ⎦ ⎣0 ⎦ ⎣1 ⎦ (a) Since there is a delay on each edge. S = 4 [ 0] T d = [1 − 1] T 10.

2D Y h X D D D D D D Figure 6. 2D Y X h D D 2D 2D 2D 2D D h D h D D h D T T D h D d = [0 1] ⎡1⎤ ⎡1⎤ ⎡− 1⎤ (b) If d = ⎢ ⎥ . S = 1 [ 1] ⎡1⎤ ⎢− 1⎥ ⎣ ⎦ ex ey eh pT e 1 2 -1 STe 1 2 1 The systolic architecture for the design is given below. S = 1 2D 2D D D 2D D D T 2D D D T 2D [ 1] d = [1 1] . S T = (1 1) ⇒ p = ⎢ ⎥ or p = ⎢ ⎥ choosing p= ⎣1⎦ ⎣− 1⎦ ⎣1⎦ Figure 5.S = [1 1] T ⎡1⎤ T d = [0 1] ⇒ p = ⎢ ⎥ HUE= 1/STd =1 ⎣0 ⎦ pT e 1 2 0 STe 1 2 1 ex ey eh The systolic architecture for the design is given below.

15. the weights along the “i” axis.0) (2. eh = ⎢ ⎥ ⎣1 ⎦ ⎣− 1⎦ ⎣0 ⎦ (a) For such a filter the RIA is given by H (i. 1) . j ) Y (i. j − 1) The reduced graph is given as (1 0) (0. e y = ⎢ ⎥. Note that the dependence vectors are given by: ⎡0⎤ ⎡2⎤ ⎡1⎤ ex = ⎢ ⎥. j ) = Y (i − 2. -1) H Y (0. Y(n) is defined by the following equation: y (n) = ax(n) + bx(n − 2) + cx(n − 4) + dx(n − 6) x0 x1 x2 x3 x4 x5 x6 x7 j d c b a i y6 y7 y8 In the given DG the inputs move along the “j” axis. j ) X (i.0) X (0. j ) = X (i. j + 1) + X (i. j ) H (i. j ) = H (i − 1. and the outputs move along the diagonal.

γ H = γ X = γ Y = 0 ). .The scheduling is done by applying the following formulae ⎡ s1⎤ S = ⎢ ⎥ . (i. ⎣ 2⎦ ⎣0 ⎦ ⎣1 ⎦ We choose ST= (1 0) since we need to reduce the number of delays in the systolic architecture. ⎡1⎤ ⎡0 ⎤ (b) If d = ⎢ ⎥ . S T e + γ y − γ x ≥ Tx ⎣ s 2⎦ From the reduced graph we see that H → H : s1 + γ H − γ H ≥ 0 H → Y : γY − γ H ≥ 0 X → X : s2 + γ X − γ X ≥ 0 X → Y : γY − γ X ≥ 0 Y → Y : 2( s1 ) − s2 + γ Y − γ Y ≥ 2 If we use linear scheduling.e. S T = (1 0) ⇒ p = ⎢ ⎥ ⎣0 ⎦ ⎣1 ⎦ (c) Then we have: pT e 1 ex ey eh STe 0 2 1 -1 0 The systolic architecture for the design is given below. some possible solutions are given by: ⎡ 2⎤ ⎡1⎤ ⎡ 2⎤ S = ⎢ ⎥ Or S = ⎢ ⎥ Or S = ⎢ ⎥ .

a D Y X 2D P0 2D b D 2D P1 c D 2D P2 d D P3 Figure 7. S = 1 [ 0] T d = [1 0] T (d) For the above systolic architecture the Hardware Utilization Efficiency is 1 = =1 STd 1 1 Hence the utilization is 100% .

- Acoustic Noise Cancellation
- Transfer certificate template
- Problem 5.18 Solution
- Keshab k parhi Chapter 4 Solution Manual
- Differential Cryptanalysis of DES
- 05235249 Paper
- Keshab k parhi Digital Signal Processing Architecture Chapter 3 solution
- Keshab k parhi Digital Signal Processing Architecture Chapter 5 solution
- Lecture Cache
- introduction to computer architecture
- QtSpim-Tutorial.pdf
- Wang-092011--05302013feature.pdf
- UTSiReport.pdf
- DSPA Solution Manual Chap 5 - kk parhi
- DSPA kk parhi Solution Manual Chap7
- Content
- Schmit
- CMOS SCHMITT TRIGGER
- Repo
- syllabus
- qp2k12
- Taub&Schilling
- Taub&Schilling

Sign up to vote on this title

UsefulNot usefulKeshab k parhi Digital Signal Processing Architecture Chapter 7 solution

Keshab k parhi Digital Signal Processing Architecture Chapter 7 solution

- Razavi Solution Book Design of Analog CMOS Integrated Circuitsby Kirti Susan Varghese
- CMOS Logic Circuit Design, 2002, John P. Uyemuraby jogary1981
- Modern Processor Design Fundamentals of Superscalar Processors 130225191042 Phpapp02by Mohammed Azher Khan
- Solutions to Problems from Essentials of Electronic Testingby Pradeep Chandra

- DSPA Solution Manual Chap 5 - kk parhi
- Keshab k parhi Digital Signal Processing Architecture Chapter 3 solution
- VLSI Digital Signal Processing Systems by Keshab k Parhi
- 04~Chapter 4
- [Keshab K. Parhi] VLSI Digital Signal Processing S(Bookos.org)(1)
- hw2s04sol
- Keshab K Parhi VLSI Digital Signal Processing
- Vlsi Signal Processing
- Verilog Books.pdf
- Winograd algorithm
- Digital Signal Processing _Solution_Proakis
- VLSI DSP Parhi Solutions Ch2.KAVLAS.pdf
- VLSI Digital Signal Processing Systems
- VLSI Signal Processing
- Verilog Model Question Paper
- Baugh Wooley
- Razavi Solution Book Design of Analog CMOS Integrated Circuits
- CMOS Logic Circuit Design, 2002, John P. Uyemura
- Modern Processor Design Fundamentals of Superscalar Processors 130225191042 Phpapp02
- Solutions to Problems from Essentials of Electronic Testing
- solution of verilog hdl by Samir Palnitkar
- Introduction to VLSI Circuits and Systems 2001 Draft - John P Uyemura - Solutions Manual
- Digital Signal Processing by oppenheim home works
- Inequalities & Graphing
- Test 1 - Special Functions
- Worksheet on Slope and Intercept
- Ace Analysis Additional Mathematics SPM - SPM Practice (Form 4, Chapter 1, Pg. 1-4) I
- bab1_mtam
- Matlab MC Quiz
- 10414XII MATH (2)
- DSPA kk parhi Solution Manual Chap7

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.