...
首页> 外文期刊>Electronics and Electrical Engineering >Acceleration of Recursive Data Sorting over Tree-based Structures
【24h】

Acceleration of Recursive Data Sorting over Tree-based Structures

机译:基于树结构的递归数据排序的加速

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

The main objective of this paper is to evaluate and improve FPGA-based digital circuits, which implement recursive specifications. Using and taking advantage of application-specific circuits in general and FPGA-based accelerators in particular have a long tradition in data processing and for solving problems with high computational complexity. FPGA enables faster, less time consuming hardware implementation and finds a lot of practical applications in various fields of digital design. For example, in [1] an FPGA device was successfully used to accelerate performance of word recognition system compared to its software counterpart.
机译:本文的主要目的是评估和改进实现递归规范的基于FPGA的数字电路。通常,使用和利用专用电路,尤其是基于FPGA的加速器在数据处理和解决高计算复杂性问题方面有着悠久的传统。 FPGA支持更快,更省时的硬件实现,并在数字设计的各个领域中找到了许多实际应用。例如,在文献[1]中,与软件相比,FPGA器件已成功用于加速单词识别系统的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号