By Topic

Complex Data Flow Matching Algorithm Based on TDG

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Guangshun Li ; Harbin Eng. Univ. ; Guangsheng Ma ; Donghai Li

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

Published in:

Computer and Computational Sciences, 2006. IMSCCS '06. First International Multi-Symposiums on  (Volume:2 )

Date of Conference:

20-24 June 2006