摘要
互连单元的分配是数据路径综合中的最后的一个重要任务。本文提出了一种简单实用的互连单元的分配算法,经实验证明,该算法能给出优化解,且具有速度快、效率高的特点,应用在高级综合系统中时。
Interconnect unit allocation is the final important task in data path synthesis.In this paper, a simple and compractive interconnect unit allocation algorithm is presented. It has been shown by the experimental results that this algorithm can produce optimal sulutions and has the features of high speed and effictive .It can greatly improve quality of high-level synthesis.
出处
《小型微型计算机系统》
CSCD
北大核心
1997年第6期34-37,共4页
Journal of Chinese Computer Systems
关键词
互连单元
分配算法
微机
数据路径综合
High-level synthesis, Interconnect unit, Allocation algorithm