arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.07490cs.PL
收藏

基于Givens旋转的QR分解算法高效表达高性能空间设计

Productively Expressing High-performance Spatial Designs of Givens Rotation-based QR Decomposition Algorithm

Hongbo Rong

摘要:

QR分解是无线通信中常用的分解方法。在本文中,我们表达了基于Givens旋转的QR分解算法的空间架构使用T2S(时间到空间),一个高生产力的空间规划方法,表达高性能的空间设计。有一些有趣的挑战:循环迭代空间不是矩形的,并且不清楚如何用函数符号(T2S的起点)来表示命令式算法。本文以QR分解为例,阐明了空间规划的一般原理,并对高性能空间规划进行了剖析。这篇论文也可以作为空间编程的教程,适用于那些不是数学家,不是专家程序员,也不是空间架构专家的程序员,但仍然希望直观地识别高性能设计并有效地映射到空间架构。

英文摘要:

QR decomposition is used prevalently in wireless communication. In this paper, we express the Givens-rotation-based QR decomposition algorithm on a spatial architecture using T2S (Temporal To Spatial), a high-productivity spatial programming methodology for expressing high-performance spatial designs. There are interesting challenges: the loop iteration space is not rectangular, and it is not obvious how the imperative algorithm can be expressed in a functional notation, the starting point of T2S. Using QR decomposition as an example, this paper elucidates some general principle, and de-mystifies high-performance spatial programming. The paper also serves as a tutorial of spatial programming for programmers who are not mathematicians, not expert programmers, and not experts on spatial architectures, but still hope to intuitively identify a high-performance design and map to spatial architectures efficiently.

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

↑