首页> 外文会议>International Conference on Field Programmable Logic and Applications >Weighted partitioning of sequential processing chains for dynamically reconfigurable FPGAS
【24h】

Weighted partitioning of sequential processing chains for dynamically reconfigurable FPGAS

机译:顺序处理链的加权划分,可动态重新配置FPGA

获取原文

摘要

Temporal runtime-reconfiguration of FPGAs allows for a resource-efficient sequential execution of signal processing modules. Approaches for partitioning processing chains into modules have been derived in various previous works. We will present a metric for weighted partitioning of pre-defined processing element sequences. The proposed method yields a set of reconfigurable partitions, which are balanced in terms of resources, while jointly have a minimal data throughput. Using this metric, we will formulate a partitioning algorithm with linear complexity and will compare our approach to the state of the art.
机译:FPGA的时间运行时重配置允许资源有效地顺序执行信号处理模块。在先前的各种工作中已经提出了将处理链划分为模块的方法。我们将介绍一种用于预定义处理元素序列的加权分区的度量。所提出的方法产生了一组可重新配置的分区,这些分区在资源方面是平衡的,同时共同具有最小的数据吞吐量。使用此度量,我们将制定具有线性复杂度的分区算法,并将我们的方法与现有技术进行比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号