Referenced Items are not available for this document.
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
- Page(s):
- 270 - 273
- Print ISBN:
- 0-7695-2581-4
- INSPEC Accession Number:
- 9098066
- Conference Location :
- Hanzhou, Zhejiang
- Digital Object Identifier :
- 10.1109/IMSCCS.2006.201
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
