arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.08095cs.AR
收藏

Xilinx FPGA通用通用并行矩阵求和算法及灵活的压缩目标

Generic and Universal Parallel Matrix Summation with a Flexible Compression Goal for Xilinx FPGAs

Thomas B. Preußer

摘要:

位矩阵压缩是计算机运算中的一种高度相关的操作。本质上是一个多操作数加法,它是快速乘法和许多高级运算(如乘法-累加、点积计算或FIR滤波器实现)背后的关键运算。压缩器实现一直在不断发展,以提高效率,无论是在一般情况下,还是在具体应用或特定的实现技术的背景下。本文是建立在这一历史,并描述了一个通用的实现Xilinx FPGA的位矩阵压缩器,它不需要一个生成器工具。它有助于面向FPGA的基本并行位计数器的评估指标,系统的分析和部分分解以前提出的计数器和一个完全实现的建设启发式与灵活的压缩目标相匹配的设备的能力。通用实现不知道输入矩阵的纵横比,并且可以用于乘法,就像它可以用于单列人口计数操作一样。

英文摘要:

Bit matrix compression is a highly relevant operation in computer arithmetic. Essentially being a multi-operand addition, it is the key operation behind fast multiplication and many higher-level operations such as multiply-accumulate, the computation of the dot product or the implementation of FIR filters. Compressor implementations have been constantly evolving for greater efficiency both in general and in the context of concrete applications or specific implementation technologies. This paper is building on this history and describes a generic implementation of a bit matrix compressor for Xilinx FPGAs, which does not require a generator tool. It contributes FPGA-oriented metrics for the evaluation of elementary parallel bit counters, a systematic analysis and partial decomposition of previously proposed counters and a fully implemented construction heuristic with a flexible compression target matching the device capabilities. The generic implementation is agnostic of the aspect ratio of the input matrix and can be used for multiplication the same way as it can be for single-column population count operations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑