Sergiyenko А.М., Lepekha V.L., Lesyk T.M. Computational Models for Hardware Implemented Parallel Algorithms //Proceedings of Yubilee International Scientific-Practical Conf. in 50-th Anniversary of the Computer Science Dep-t. -Kiev, 6-8 April 2010. –Kiev: NTUU «KPI». –p.125-127. (In Russian)
Data flow graph (DFG) is a natural model for data flow algorithm representation. A classification of different DFGs is presented. It is shown that pipelined datapaths are designed on the base of mapping synchronous DFG (SDF) or DFG with effective behavior, and quasi static DFG. Uniform SDF has higher complexity of algorithm representation than multirate SDF has. But uniform SDF represented in the multidimensional space can be mapped into the optimized datapath structure formally, and with minimized hardware volume.
The file for this article is provided in the language of the print edition (russian)
You can PREVIEW the materials online (POPUP) by clicking on the image of the file icon, or download to your computer by clicking the link below the icon.