Complex Data Flow Matching Algorithm Based on TDG

The definition of term dependent graph (TDG) is expanded in this paper, and the connectivity of TDG is discussed. A complex data flow matching (CDFM) algorithm based on TDG is proposed. In order to decrease the algorithm complexity, a grouping strategy on the degree of the polynomial of complex components is proposed. The experiment results indicate that using the algorithm and strategy proposed in this paper, for the circuits whose complex data flow can be decomposed locally, keeping the area and delay approximate optimization, the exploration space is decreased greatly