Figure 18.2 shows the DAG for the polynomial division algorithm based on our timing function choice s1. The equitemporal planes are the diagonal lines shown as gray lines on the right of the diagram. The associated time index values are shown at the right of the diagram. We note from the figure that the signals corresponding to the coefficients of B and the estimated q output are all pipelined, as indicated by the arrows connecting the nodes. However, the estimated partial results for Q and R are broadcast, as indicated by the diagonal lines without arrows. There are three simple projection vectors such that all of them satisfy Eq. 18.21 for the scheduling function in Eq. 18.17. The three projection vectors will produce three designs:

(18.22) c18e022

(18.23) c18e023

(18.24) c18e024

Figure 18.2 Directed acyclic graph (DAG) for polynomial division algorithm when s1 = [1 −1], n = 9, and m = 5.


The corresponding projection matrices are




Our design space now allows for three configurations for each projection ...

Get Algorithms and Parallel Computing now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.