Complex Data Flow Matching Algorithm Based on TDG

Author

Li, Guangshun ; Ma, Guangsheng ; Li, Donghai

Author_Institution

Harbin Eng. Univ.

Volume

2

fYear

2006

fDate

20-24 June 2006

Firstpage

270

Lastpage

273

Abstract

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

Keywords

circuit complexity; combinational circuits; data flow graphs; formal specification; logic design; logic testing; algorithm complexity; complex components matching; complex data flow matching algorithm; data flow polynomial degree; grouping strategy; term dependent graph; Arithmetic; Circuits; Cost function; Delay; Libraries; Polynomials; Power dissipation; Space exploration; System-on-a-chip; Time to market; Components matching and grouping strategy.; Keywords: Data flow polynomial; modified TDG;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Computational Sciences, 2006. IMSCCS '06. First International Multi-Symposiums on

Conference_Location

Hanzhou, Zhejiang

Print_ISBN

0-7695-2581-4

Type

conf

DOI

10.1109/IMSCCS.2006.201

Filename

4673714