A New Model K*TDG and High Level Exploring Algorithm

摘要：

A new model K*TDG is proposed in this paper to solve the problem of complex data flow decomposing and exploring, where k indicates the compactness of the System parameters. In the following, the attributes of K*TDG and its primary operations are discussed, and a decomposing and exploring algorithm is proposed. In order to decrease the algorithm complexity, a group strategy on the degree of polynomials of complex components is shown. Experiment results indicate that using the algorithm and strategy in this paper, keeping the area and delay approximate optimization, the exploring space is decreased greatly.

作者: Guangshun LI Guangsheng MA Junhua WU

作者单位: Harbin Engineering University, China

会议类型: 国际会议

会议名称: 2nd IEEE Conference on Industrial Electronics and Applications(ICIEA 2007)(第二届IEEE工业电子与应用国际会议)

会议地点: 哈尔滨

会议语种:英文

在线出版日期: 2007-05-23（万方平台首次上网日期，不代表论文的发表时间）