tailieunhanh - High Level Synthesis: from Algorithm to Digital Circuit- P21

High Level Synthesis: from Algorithm to Digital Circuit- P21: This book presents an excellent collection of contributions addressing different aspects of high-level synthesis from both industry and academia. "High-Level Synthesis: from Algorithm to Digital Circuit" should be on each designer's and CAD developer's shelf, as well as on those of project managers who will soon embrace high level design and synthesis for all aspects of digital system design. | 10 User Guided High Level Synthesis 189 Concurrent-ordered transfer graph It is a sequential-ordered transfer graph SD where all the D relations have been resolved. Let Xk the transfers verifying Ti D Xk and Yk the one verifying Tj D Yk. Resolving a Ti D Tj relation means replacing it by either the pseudo relations Xk -DD Tj or the pseudo relations DD SD DD Yk D Ti as shown Fig. . Note that resolving a D adds D relations SD CD and may suppress others D or D. Resolved-ordered transfer graph It is a concurrent-ordered transfer graph in the CD CD which all the D relations have been resolved. Resolving a D means replacing it by either the pseudo relations Ti -DD Tj or Tj -DD Ti. Fig. shows the two possible resolutions of the sequential ordered graph of Fig. . Resolving a relation only adds -DD thus the algorithm does not create new relations to be solved avoiding cycles. So a sequential-ordered transfer graph gives a set of concurrent-ordered transfer graphs and each of those gives a set of resolved-ordered transfer graphs Fig. . The FGS algorithm is optimum at the level of resolved-ordered transfer graphs. It will give the same result for all the transfer lists extracted from the resolved-ordered transfer graph respecting the partial order of D relation. Of course other resolved-ordered transfer graphs can be obtained from the initial sequential-ordered transfer graph. Their schedulings may be better or worse. TO-S T3- DT5 T0 S CD T3 1 T1 T2 T4 T1 T2 T4 T6 sequential-order TO T3CDT5 TO T3-CDT5 T0 T3 TO T3 2 T1 T2 T4 T1 T2 T4 T1 T2 T4 T6 T1 T2 T4 T6 concurrent-order TO T3 -T TO T3 -T5 AV VA I T1 T2 T4 T6 T1 T2 T4 T6 TO -T3 TO---T3 TO T3-. T5 i TO T3- T5 3 T1 T2 T4 T1 T2 T4 a Resolution of and DD relations T1 T2 T4 T6 T1 T2 T4 T6 resloved-order b Sequential ordered concurrent ordered and resolved ordered transfer graphs. SD CD Fig. relations and transfer graph orders 190 I. Auge and F. Petrot Scheduling of an Entire FSM The .