脉动阵列的自动综合—FP方法

本文将FP代数,重写理论与脉动阵列(Systolic Arrays)的设计结合起来,研究了脉动阵列的形式化设计和自动综合的问题。文章中提出的FP/B并发计算型,不但可表示某一类FP/B递归方程的展开式解,而且可以用来等价地对算法进行重新描述,从而开发了计算的并行性和流水线性,获得一个规整高效的计算结构。文章形式地用FP/B定义了脉动式,并根据FP/B代数,建立了具有终止性和保持正确性的脉动阵列重写系统,它能将用户FP/B程序自动转换为等价的脉动式,再根据FP/B并发计算型及一些函数的几何语义可较为直接地获得一个脉动阵列的硬件描述。文末给出一个例子加以说明。

AUTOMATIC SYNTHESIS OF SYSTOLIC ARRAYS-FP APPROACH

In this paper, an automatic synthesis system FP/B of systolic array is presented, in which FP algebra and rewriting system are essentially used. Some concurrent functional forms are proposed, the expansion solutions of a class of linear recursive equations can be expressed by them directly. Algorithms which can be transformed into them may have efficient and regular computing structures, so parallelism and pipelinability hidden in the original algorithms are well developed. Based on the FP/B algebra we've given the formal defintion of systolic arrays and constructed a sys totolic rewriting system with properties of termitation and correctness.FP/B user programs can be automatically rewriten into equivalent optimized systolic expressions,Which can be directly mapped into VLSI architectures according to the geometric meanings of FP/B functions and concurrent functional forms.Finally,a typical instance is given to show the synthesis process.